./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/parallel-misc-1.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b5237d83 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0e99913-6562-41b4-b07d-5da922a21e23/bin/utaipan-g80aRyZoba/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0e99913-6562-41b4-b07d-5da922a21e23/bin/utaipan-g80aRyZoba/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0e99913-6562-41b4-b07d-5da922a21e23/bin/utaipan-g80aRyZoba/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0e99913-6562-41b4-b07d-5da922a21e23/bin/utaipan-g80aRyZoba/config/TaipanReach.xml -i ../../sv-benchmarks/c/weaver/parallel-misc-1.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0e99913-6562-41b4-b07d-5da922a21e23/bin/utaipan-g80aRyZoba/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0e99913-6562-41b4-b07d-5da922a21e23/bin/utaipan-g80aRyZoba --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c870162e8691a06e8bb6a8083be9eaf3f7ddc94357fb302a6e1fdd1b7aa873f8 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-b5237d8 [2022-11-22 01:48:05,925 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-22 01:48:05,927 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-22 01:48:05,974 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-22 01:48:05,974 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-22 01:48:05,975 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-22 01:48:05,977 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-22 01:48:05,978 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-22 01:48:05,980 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-22 01:48:05,981 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-22 01:48:05,982 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-22 01:48:05,983 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-22 01:48:05,984 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-22 01:48:05,985 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-22 01:48:05,986 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-22 01:48:05,987 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-22 01:48:05,988 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-22 01:48:05,989 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-22 01:48:05,991 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-22 01:48:05,993 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-22 01:48:05,995 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-22 01:48:06,004 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-22 01:48:06,006 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-22 01:48:06,007 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-22 01:48:06,015 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-22 01:48:06,015 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-22 01:48:06,016 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-22 01:48:06,017 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-22 01:48:06,020 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-22 01:48:06,021 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-22 01:48:06,022 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-22 01:48:06,024 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-22 01:48:06,025 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-22 01:48:06,027 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-22 01:48:06,028 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-22 01:48:06,029 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-22 01:48:06,030 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-22 01:48:06,031 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-22 01:48:06,031 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-22 01:48:06,033 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-22 01:48:06,034 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-22 01:48:06,035 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0e99913-6562-41b4-b07d-5da922a21e23/bin/utaipan-g80aRyZoba/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-22 01:48:06,079 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-22 01:48:06,084 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-22 01:48:06,085 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-22 01:48:06,085 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-22 01:48:06,086 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-22 01:48:06,086 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-22 01:48:06,086 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-22 01:48:06,087 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-22 01:48:06,087 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-22 01:48:06,087 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-22 01:48:06,088 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-22 01:48:06,088 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-22 01:48:06,089 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-22 01:48:06,089 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-22 01:48:06,089 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-22 01:48:06,089 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-22 01:48:06,090 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-22 01:48:06,090 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-22 01:48:06,091 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-22 01:48:06,091 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-22 01:48:06,091 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-22 01:48:06,092 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-22 01:48:06,092 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-22 01:48:06,092 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-22 01:48:06,092 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-22 01:48:06,092 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-22 01:48:06,093 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-22 01:48:06,093 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-22 01:48:06,094 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-22 01:48:06,094 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-22 01:48:06,094 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-22 01:48:06,095 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-22 01:48:06,095 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 01:48:06,095 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-22 01:48:06,095 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-22 01:48:06,096 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-22 01:48:06,096 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-22 01:48:06,096 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-22 01:48:06,096 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-22 01:48:06,096 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-22 01:48:06,097 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-22 01:48:06,097 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_e0e99913-6562-41b4-b07d-5da922a21e23/bin/utaipan-g80aRyZoba/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0e99913-6562-41b4-b07d-5da922a21e23/bin/utaipan-g80aRyZoba Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) 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 -> c870162e8691a06e8bb6a8083be9eaf3f7ddc94357fb302a6e1fdd1b7aa873f8 [2022-11-22 01:48:06,350 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-22 01:48:06,371 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-22 01:48:06,373 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-22 01:48:06,374 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-22 01:48:06,375 INFO L275 PluginConnector]: CDTParser initialized [2022-11-22 01:48:06,376 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0e99913-6562-41b4-b07d-5da922a21e23/bin/utaipan-g80aRyZoba/../../sv-benchmarks/c/weaver/parallel-misc-1.wvr.c [2022-11-22 01:48:09,339 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-22 01:48:09,579 INFO L351 CDTParser]: Found 1 translation units. [2022-11-22 01:48:09,580 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0e99913-6562-41b4-b07d-5da922a21e23/sv-benchmarks/c/weaver/parallel-misc-1.wvr.c [2022-11-22 01:48:09,587 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0e99913-6562-41b4-b07d-5da922a21e23/bin/utaipan-g80aRyZoba/data/ead4b72a3/3e25be4e30df42679b1b4f42b4e674de/FLAGfde800b41 [2022-11-22 01:48:09,601 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0e99913-6562-41b4-b07d-5da922a21e23/bin/utaipan-g80aRyZoba/data/ead4b72a3/3e25be4e30df42679b1b4f42b4e674de [2022-11-22 01:48:09,604 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-22 01:48:09,605 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-22 01:48:09,606 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-22 01:48:09,607 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-22 01:48:09,610 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-22 01:48:09,611 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:48:09" (1/1) ... [2022-11-22 01:48:09,612 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@81f1e8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:48:09, skipping insertion in model container [2022-11-22 01:48:09,613 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:48:09" (1/1) ... [2022-11-22 01:48:09,620 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-22 01:48:09,639 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-22 01:48:09,814 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_e0e99913-6562-41b4-b07d-5da922a21e23/sv-benchmarks/c/weaver/parallel-misc-1.wvr.c[2755,2768] [2022-11-22 01:48:09,825 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 01:48:09,835 INFO L203 MainTranslator]: Completed pre-run [2022-11-22 01:48:09,858 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_e0e99913-6562-41b4-b07d-5da922a21e23/sv-benchmarks/c/weaver/parallel-misc-1.wvr.c[2755,2768] [2022-11-22 01:48:09,865 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 01:48:09,887 INFO L208 MainTranslator]: Completed translation [2022-11-22 01:48:09,888 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:48:09 WrapperNode [2022-11-22 01:48:09,888 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-22 01:48:09,890 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-22 01:48:09,890 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-22 01:48:09,890 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-22 01:48:09,897 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:48:09" (1/1) ... [2022-11-22 01:48:09,918 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:48:09" (1/1) ... [2022-11-22 01:48:09,965 INFO L138 Inliner]: procedures = 23, calls = 41, calls flagged for inlining = 17, calls inlined = 31, statements flattened = 277 [2022-11-22 01:48:09,966 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-22 01:48:09,968 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-22 01:48:09,968 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-22 01:48:09,968 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-22 01:48:09,977 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:48:09" (1/1) ... [2022-11-22 01:48:09,978 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:48:09" (1/1) ... [2022-11-22 01:48:09,996 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:48:09" (1/1) ... [2022-11-22 01:48:09,999 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:48:09" (1/1) ... [2022-11-22 01:48:10,008 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:48:09" (1/1) ... [2022-11-22 01:48:10,026 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:48:09" (1/1) ... [2022-11-22 01:48:10,028 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:48:09" (1/1) ... [2022-11-22 01:48:10,029 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:48:09" (1/1) ... [2022-11-22 01:48:10,035 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-22 01:48:10,048 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-22 01:48:10,048 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-22 01:48:10,048 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-22 01:48:10,049 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:48:09" (1/1) ... [2022-11-22 01:48:10,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 01:48:10,073 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0e99913-6562-41b4-b07d-5da922a21e23/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:48:10,093 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0e99913-6562-41b4-b07d-5da922a21e23/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-22 01:48:10,122 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0e99913-6562-41b4-b07d-5da922a21e23/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-22 01:48:10,141 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-22 01:48:10,141 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-22 01:48:10,141 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-22 01:48:10,141 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-22 01:48:10,141 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-22 01:48:10,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-22 01:48:10,142 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-22 01:48:10,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-22 01:48:10,142 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-22 01:48:10,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-22 01:48:10,142 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-22 01:48:10,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-22 01:48:10,143 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-22 01:48:10,144 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-22 01:48:10,288 INFO L235 CfgBuilder]: Building ICFG [2022-11-22 01:48:10,290 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-22 01:48:10,816 INFO L276 CfgBuilder]: Performing block encoding [2022-11-22 01:48:10,829 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-22 01:48:10,829 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-22 01:48:10,832 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:48:10 BoogieIcfgContainer [2022-11-22 01:48:10,832 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-22 01:48:10,835 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-22 01:48:10,835 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-22 01:48:10,839 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-22 01:48:10,839 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 01:48:09" (1/3) ... [2022-11-22 01:48:10,840 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b6084ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:48:10, skipping insertion in model container [2022-11-22 01:48:10,840 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:48:09" (2/3) ... [2022-11-22 01:48:10,840 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b6084ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:48:10, skipping insertion in model container [2022-11-22 01:48:10,841 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:48:10" (3/3) ... [2022-11-22 01:48:10,842 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-misc-1.wvr.c [2022-11-22 01:48:10,851 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-22 01:48:10,862 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-22 01:48:10,875 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-22 01:48:10,875 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-22 01:48:11,153 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-22 01:48:11,258 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-22 01:48:11,278 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 375 places, 396 transitions, 808 flow [2022-11-22 01:48:11,281 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 375 places, 396 transitions, 808 flow [2022-11-22 01:48:11,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 375 places, 396 transitions, 808 flow [2022-11-22 01:48:11,561 INFO L130 PetriNetUnfolder]: 28/394 cut-off events. [2022-11-22 01:48:11,562 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-22 01:48:11,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 403 conditions, 394 events. 28/394 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 923 event pairs, 0 based on Foata normal form. 0/365 useless extension candidates. Maximal degree in co-relation 271. Up to 2 conditions per place. [2022-11-22 01:48:11,598 INFO L119 LiptonReduction]: Number of co-enabled transitions 37700 [2022-11-22 01:48:26,657 INFO L134 LiptonReduction]: Checked pairs total: 31579 [2022-11-22 01:48:26,657 INFO L136 LiptonReduction]: Total number of compositions: 485 [2022-11-22 01:48:26,674 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 24 places, 21 transitions, 58 flow [2022-11-22 01:48:26,703 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 33 states, 32 states have (on average 2.375) internal successors, (76), 32 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:48:26,729 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-22 01:48:26,738 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;@11740757, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-22 01:48:26,738 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-11-22 01:48:26,740 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 32 states have (on average 2.375) internal successors, (76), 32 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:48:26,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-22 01:48:26,747 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:48:26,748 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:48:26,748 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-22 01:48:26,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:48:26,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1578748008, now seen corresponding path program 1 times [2022-11-22 01:48:26,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:48:26,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265919934] [2022-11-22 01:48:26,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:48:26,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:48:27,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:48:27,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:48:27,722 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:48:27,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265919934] [2022-11-22 01:48:27,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265919934] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:48:27,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:48:27,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-22 01:48:27,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922291107] [2022-11-22 01:48:27,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:48:27,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 01:48:27,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:48:27,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 01:48:27,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-22 01:48:27,767 INFO L87 Difference]: Start difference. First operand has 33 states, 32 states have (on average 2.375) internal successors, (76), 32 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:48:27,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:48:27,986 INFO L93 Difference]: Finished difference Result 90 states and 237 transitions. [2022-11-22 01:48:27,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 01:48:27,989 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-22 01:48:27,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:48:28,001 INFO L225 Difference]: With dead ends: 90 [2022-11-22 01:48:28,001 INFO L226 Difference]: Without dead ends: 85 [2022-11-22 01:48:28,003 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-22 01:48:28,008 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 34 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:48:28,010 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 0 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:48:28,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-11-22 01:48:28,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 45. [2022-11-22 01:48:28,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 2.477272727272727) internal successors, (109), 44 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:48:28,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 109 transitions. [2022-11-22 01:48:28,061 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 109 transitions. Word has length 12 [2022-11-22 01:48:28,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:48:28,064 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 109 transitions. [2022-11-22 01:48:28,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:48:28,068 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 109 transitions. [2022-11-22 01:48:28,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-22 01:48:28,069 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:48:28,070 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:48:28,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-22 01:48:28,071 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-22 01:48:28,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:48:28,072 INFO L85 PathProgramCache]: Analyzing trace with hash -588606708, now seen corresponding path program 1 times [2022-11-22 01:48:28,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:48:28,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54543166] [2022-11-22 01:48:28,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:48:28,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:48:28,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:48:28,382 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:48:28,382 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:48:28,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54543166] [2022-11-22 01:48:28,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54543166] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:48:28,383 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:48:28,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 01:48:28,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206793146] [2022-11-22 01:48:28,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:48:28,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 01:48:28,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:48:28,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 01:48:28,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:48:28,386 INFO L87 Difference]: Start difference. First operand 45 states and 109 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:48:28,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:48:28,487 INFO L93 Difference]: Finished difference Result 89 states and 201 transitions. [2022-11-22 01:48:28,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 01:48:28,488 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-22 01:48:28,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:48:28,489 INFO L225 Difference]: With dead ends: 89 [2022-11-22 01:48:28,489 INFO L226 Difference]: Without dead ends: 83 [2022-11-22 01:48:28,490 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-22 01:48:28,491 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 28 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:48:28,492 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 0 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:48:28,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-11-22 01:48:28,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 69. [2022-11-22 01:48:28,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 68 states have (on average 2.485294117647059) internal successors, (169), 68 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:48:28,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 169 transitions. [2022-11-22 01:48:28,501 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 169 transitions. Word has length 13 [2022-11-22 01:48:28,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:48:28,501 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 169 transitions. [2022-11-22 01:48:28,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:48:28,502 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 169 transitions. [2022-11-22 01:48:28,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-22 01:48:28,503 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:48:28,503 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:48:28,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-22 01:48:28,504 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-22 01:48:28,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:48:28,504 INFO L85 PathProgramCache]: Analyzing trace with hash -85527686, now seen corresponding path program 1 times [2022-11-22 01:48:28,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:48:28,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931887943] [2022-11-22 01:48:28,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:48:28,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:48:28,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:48:28,669 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:48:28,669 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:48:28,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931887943] [2022-11-22 01:48:28,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931887943] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:48:28,670 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:48:28,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 01:48:28,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790473992] [2022-11-22 01:48:28,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:48:28,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 01:48:28,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:48:28,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 01:48:28,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:48:28,672 INFO L87 Difference]: Start difference. First operand 69 states and 169 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 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-11-22 01:48:28,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:48:28,746 INFO L93 Difference]: Finished difference Result 53 states and 118 transitions. [2022-11-22 01:48:28,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 01:48:28,746 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 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 14 [2022-11-22 01:48:28,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:48:28,747 INFO L225 Difference]: With dead ends: 53 [2022-11-22 01:48:28,747 INFO L226 Difference]: Without dead ends: 46 [2022-11-22 01:48:28,748 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-22 01:48:28,749 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 19 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:48:28,750 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 0 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:48:28,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-11-22 01:48:28,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-11-22 01:48:28,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 2.4444444444444446) internal successors, (110), 45 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:48:28,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 110 transitions. [2022-11-22 01:48:28,755 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 110 transitions. Word has length 14 [2022-11-22 01:48:28,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:48:28,755 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 110 transitions. [2022-11-22 01:48:28,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 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-11-22 01:48:28,756 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 110 transitions. [2022-11-22 01:48:28,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-22 01:48:28,757 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:48:28,757 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:48:28,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-22 01:48:28,757 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-22 01:48:28,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:48:28,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1631965637, now seen corresponding path program 1 times [2022-11-22 01:48:28,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:48:28,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252229227] [2022-11-22 01:48:28,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:48:28,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:48:28,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:48:28,992 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 01:48:28,992 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:48:28,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252229227] [2022-11-22 01:48:28,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252229227] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:48:28,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1801581921] [2022-11-22 01:48:29,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:48:29,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:48:29,001 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0e99913-6562-41b4-b07d-5da922a21e23/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:48:29,007 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0e99913-6562-41b4-b07d-5da922a21e23/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:48:29,031 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0e99913-6562-41b4-b07d-5da922a21e23/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-22 01:48:29,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:48:29,160 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-22 01:48:29,165 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:48:29,320 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 01:48:29,321 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:48:29,397 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 01:48:29,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1801581921] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-22 01:48:29,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-22 01:48:29,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2022-11-22 01:48:29,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957871849] [2022-11-22 01:48:29,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:48:29,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 01:48:29,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:48:29,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 01:48:29,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-11-22 01:48:29,400 INFO L87 Difference]: Start difference. First operand 46 states and 110 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 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-11-22 01:48:29,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:48:29,475 INFO L93 Difference]: Finished difference Result 44 states and 111 transitions. [2022-11-22 01:48:29,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 01:48:29,476 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 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 14 [2022-11-22 01:48:29,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:48:29,477 INFO L225 Difference]: With dead ends: 44 [2022-11-22 01:48:29,477 INFO L226 Difference]: Without dead ends: 44 [2022-11-22 01:48:29,478 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-22 01:48:29,483 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 30 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:48:29,484 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 0 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:48:29,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-11-22 01:48:29,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 40. [2022-11-22 01:48:29,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 2.4871794871794872) internal successors, (97), 39 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:48:29,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 97 transitions. [2022-11-22 01:48:29,494 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 97 transitions. Word has length 14 [2022-11-22 01:48:29,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:48:29,497 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 97 transitions. [2022-11-22 01:48:29,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 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-11-22 01:48:29,499 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 97 transitions. [2022-11-22 01:48:29,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-22 01:48:29,500 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:48:29,500 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:48:29,514 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0e99913-6562-41b4-b07d-5da922a21e23/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-22 01:48:29,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0e99913-6562-41b4-b07d-5da922a21e23/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:48:29,707 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-22 01:48:29,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:48:29,708 INFO L85 PathProgramCache]: Analyzing trace with hash 32738273, now seen corresponding path program 1 times [2022-11-22 01:48:29,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:48:29,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402704036] [2022-11-22 01:48:29,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:48:29,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:48:29,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:48:30,066 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:48:30,067 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:48:30,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402704036] [2022-11-22 01:48:30,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402704036] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:48:30,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [156982544] [2022-11-22 01:48:30,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:48:30,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:48:30,068 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0e99913-6562-41b4-b07d-5da922a21e23/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:48:30,069 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0e99913-6562-41b4-b07d-5da922a21e23/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:48:30,077 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0e99913-6562-41b4-b07d-5da922a21e23/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-22 01:48:30,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:48:30,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-22 01:48:30,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:48:30,266 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 01:48:30,266 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:48:30,312 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 01:48:30,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [156982544] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-22 01:48:30,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-22 01:48:30,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 4] total 10 [2022-11-22 01:48:30,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78031673] [2022-11-22 01:48:30,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:48:30,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 01:48:30,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:48:30,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 01:48:30,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-11-22 01:48:30,315 INFO L87 Difference]: Start difference. First operand 40 states and 97 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:48:30,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:48:30,388 INFO L93 Difference]: Finished difference Result 52 states and 130 transitions. [2022-11-22 01:48:30,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 01:48:30,388 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-22 01:48:30,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:48:30,389 INFO L225 Difference]: With dead ends: 52 [2022-11-22 01:48:30,389 INFO L226 Difference]: Without dead ends: 52 [2022-11-22 01:48:30,390 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-11-22 01:48:30,390 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 30 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:48:30,391 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 0 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:48:30,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-11-22 01:48:30,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-11-22 01:48:30,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 2.549019607843137) internal successors, (130), 51 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:48:30,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 130 transitions. [2022-11-22 01:48:30,396 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 130 transitions. Word has length 15 [2022-11-22 01:48:30,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:48:30,396 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 130 transitions. [2022-11-22 01:48:30,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:48:30,397 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 130 transitions. [2022-11-22 01:48:30,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-22 01:48:30,397 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:48:30,398 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:48:30,413 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0e99913-6562-41b4-b07d-5da922a21e23/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-22 01:48:30,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0e99913-6562-41b4-b07d-5da922a21e23/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:48:30,614 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-22 01:48:30,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:48:30,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1270268237, now seen corresponding path program 1 times [2022-11-22 01:48:30,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:48:30,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624340135] [2022-11-22 01:48:30,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:48:30,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:48:30,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:48:32,140 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 01:48:32,140 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:48:32,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624340135] [2022-11-22 01:48:32,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624340135] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:48:32,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [847081029] [2022-11-22 01:48:32,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:48:32,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:48:32,141 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0e99913-6562-41b4-b07d-5da922a21e23/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:48:32,142 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0e99913-6562-41b4-b07d-5da922a21e23/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:48:32,148 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0e99913-6562-41b4-b07d-5da922a21e23/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-22 01:48:32,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:48:32,271 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 66 conjunts are in the unsatisfiable core [2022-11-22 01:48:32,275 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:48:32,335 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 01:48:32,397 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 6 treesize of output 5 [2022-11-22 01:48:32,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:48:32,623 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-22 01:48:32,821 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 193 treesize of output 157 [2022-11-22 01:48:32,924 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:48:32,924 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:48:33,450 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~A~0.offset (* c_~j~0 4)))) (and (forall ((v_ArrVal_133 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_133) c_~A~0.base) .cse1))) (or (not (<= 0 (+ c_~bag2~0 .cse0 2147483648))) (<= c_~sum1~0 (+ c_~bag2~0 .cse0 c_~sum2~0)) (not (<= (+ c_~bag2~0 .cse0) 2147483647))))) (forall ((v_ArrVal_133 (Array Int Int))) (let ((.cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_133) c_~A~0.base) .cse1))) (or (not (<= 0 (+ c_~bag2~0 .cse2 2147483648))) (not (<= (+ c_~bag2~0 .cse2) 2147483647)) (<= (+ c_~bag2~0 .cse2 c_~sum2~0) c_~sum1~0)))))) is different from false [2022-11-22 01:48:33,494 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~bag1~0 c_~sum1~0)) (.cse2 (+ c_~A~0.offset (* c_~j~0 4)))) (and (forall ((v_ArrVal_133 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_133) c_~A~0.base) .cse2))) (or (not (<= 0 (+ c_~bag2~0 .cse0 2147483648))) (<= (+ c_~bag2~0 .cse0 c_~sum2~0) .cse1) (not (<= (+ c_~bag2~0 .cse0) 2147483647))))) (forall ((v_ArrVal_133 (Array Int Int))) (let ((.cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_133) c_~A~0.base) .cse2))) (or (not (<= 0 (+ c_~bag2~0 .cse3 2147483648))) (not (<= (+ c_~bag2~0 .cse3) 2147483647)) (<= .cse1 (+ c_~bag2~0 .cse3 c_~sum2~0))))))) is different from false [2022-11-22 01:48:33,534 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_thread1Thread1of1ForFork0_plus_#in~b#1| (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))) |c_thread1Thread1of1ForFork0_plus_#in~a#1|)) (.cse2 (+ c_~A~0.offset (* c_~j~0 4)))) (and (forall ((v_ArrVal_133 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_133) c_~A~0.base) .cse2))) (or (not (<= 0 (+ c_~bag2~0 .cse0 2147483648))) (not (<= (+ c_~bag2~0 .cse0) 2147483647)) (<= .cse1 (+ c_~bag2~0 .cse0 c_~sum2~0))))) (forall ((v_ArrVal_133 (Array Int Int))) (let ((.cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_133) c_~A~0.base) .cse2))) (or (not (<= 0 (+ c_~bag2~0 .cse3 2147483648))) (not (<= (+ c_~bag2~0 .cse3) 2147483647)) (<= (+ c_~bag2~0 .cse3 c_~sum2~0) .cse1)))))) is different from false [2022-11-22 01:48:33,572 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~bag1~0 c_~sum1~0 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))))) (.cse2 (+ c_~A~0.offset (* c_~j~0 4)))) (and (forall ((v_ArrVal_133 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_133) c_~A~0.base) .cse2))) (or (not (<= 0 (+ c_~bag2~0 .cse0 2147483648))) (<= (+ c_~bag2~0 .cse0 c_~sum2~0) .cse1) (not (<= (+ c_~bag2~0 .cse0) 2147483647))))) (forall ((v_ArrVal_133 (Array Int Int))) (let ((.cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_133) c_~A~0.base) .cse2))) (or (not (<= 0 (+ c_~bag2~0 .cse3 2147483648))) (<= .cse1 (+ c_~bag2~0 .cse3 c_~sum2~0)) (not (<= (+ c_~bag2~0 .cse3) 2147483647))))))) is different from false [2022-11-22 01:48:33,655 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_133 (Array Int Int)) (v_ArrVal_132 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_132))) (let ((.cse0 (select (select (store .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_133) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (<= 0 (+ .cse0 2147483648))) (not (<= .cse0 2147483647)) (<= .cse0 (select (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) (forall ((v_ArrVal_133 (Array Int Int)) (v_ArrVal_132 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_132))) (let ((.cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_133) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (<= 0 (+ .cse2 2147483648))) (<= (select (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) .cse2) (not (<= .cse2 2147483647))))))) is different from false [2022-11-22 01:48:33,675 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:48:33,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 63 [2022-11-22 01:48:33,683 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 506 treesize of output 458 [2022-11-22 01:48:33,703 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 317 treesize of output 291 [2022-11-22 01:48:33,711 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 279 treesize of output 267 [2022-11-22 01:48:33,833 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-22 01:48:33,833 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 1 [2022-11-22 01:48:33,854 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-22 01:48:33,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [847081029] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:48:33,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1650113408] [2022-11-22 01:48:33,862 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-22 01:48:33,865 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:48:33,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 24 [2022-11-22 01:48:33,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883620538] [2022-11-22 01:48:33,866 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:48:33,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-22 01:48:33,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:48:33,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-22 01:48:33,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=365, Unknown=5, NotChecked=210, Total=650 [2022-11-22 01:48:33,867 INFO L87 Difference]: Start difference. First operand 52 states and 130 transitions. Second operand has 26 states, 25 states have (on average 1.8) internal successors, (45), 25 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:48:35,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:48:35,105 INFO L93 Difference]: Finished difference Result 107 states and 276 transitions. [2022-11-22 01:48:35,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-22 01:48:35,105 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.8) internal successors, (45), 25 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-22 01:48:35,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:48:35,106 INFO L225 Difference]: With dead ends: 107 [2022-11-22 01:48:35,106 INFO L226 Difference]: Without dead ends: 102 [2022-11-22 01:48:35,107 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 12 SyntacticMatches, 7 SemanticMatches, 33 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=169, Invalid=716, Unknown=5, NotChecked=300, Total=1190 [2022-11-22 01:48:35,108 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 192 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 171 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-22 01:48:35,108 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 0 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 345 Invalid, 0 Unknown, 171 Unchecked, 0.4s Time] [2022-11-22 01:48:35,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-11-22 01:48:35,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 70. [2022-11-22 01:48:35,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 69 states have (on average 2.5217391304347827) internal successors, (174), 69 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:48:35,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 174 transitions. [2022-11-22 01:48:35,114 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 174 transitions. Word has length 16 [2022-11-22 01:48:35,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:48:35,120 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 174 transitions. [2022-11-22 01:48:35,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.8) internal successors, (45), 25 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:48:35,122 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 174 transitions. [2022-11-22 01:48:35,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-22 01:48:35,123 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:48:35,123 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:48:35,134 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0e99913-6562-41b4-b07d-5da922a21e23/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-22 01:48:35,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0e99913-6562-41b4-b07d-5da922a21e23/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-22 01:48:35,329 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-22 01:48:35,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:48:35,330 INFO L85 PathProgramCache]: Analyzing trace with hash 696942173, now seen corresponding path program 2 times [2022-11-22 01:48:35,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:48:35,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195257260] [2022-11-22 01:48:35,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:48:35,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:48:35,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:48:36,839 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:48:36,839 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:48:36,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195257260] [2022-11-22 01:48:36,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195257260] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:48:36,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1260176419] [2022-11-22 01:48:36,840 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-22 01:48:36,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:48:36,840 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0e99913-6562-41b4-b07d-5da922a21e23/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:48:36,841 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0e99913-6562-41b4-b07d-5da922a21e23/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:48:36,871 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0e99913-6562-41b4-b07d-5da922a21e23/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-22 01:48:36,981 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-22 01:48:36,981 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 01:48:36,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 68 conjunts are in the unsatisfiable core [2022-11-22 01:48:36,987 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:48:37,027 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 01:48:37,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-22 01:48:37,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:48:37,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-11-22 01:48:37,468 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 193 treesize of output 157 [2022-11-22 01:48:37,607 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:48:37,607 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:48:37,977 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~bag1~0 c_~sum1~0)) (.cse2 (+ c_~A~0.offset (* c_~j~0 4)))) (and (forall ((v_ArrVal_167 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_167) c_~A~0.base) .cse2))) (or (not (<= 0 (+ c_~bag2~0 .cse0 2147483648))) (<= .cse1 (+ c_~bag2~0 .cse0 c_~sum2~0)) (not (<= (+ c_~bag2~0 .cse0) 2147483647))))) (forall ((v_ArrVal_167 (Array Int Int))) (let ((.cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_167) c_~A~0.base) .cse2))) (or (not (<= 0 (+ c_~bag2~0 .cse3 2147483648))) (<= (+ c_~bag2~0 .cse3 c_~sum2~0) .cse1) (not (<= (+ c_~bag2~0 .cse3) 2147483647))))))) is different from false [2022-11-22 01:48:38,010 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_thread1Thread1of1ForFork0_plus_#in~b#1| (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))) |c_thread1Thread1of1ForFork0_plus_#in~a#1|)) (.cse2 (+ c_~A~0.offset (* c_~j~0 4)))) (and (forall ((v_ArrVal_167 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_167) c_~A~0.base) .cse2))) (or (not (<= 0 (+ c_~bag2~0 .cse0 2147483648))) (<= (+ c_~bag2~0 .cse0 c_~sum2~0) .cse1) (not (<= (+ c_~bag2~0 .cse0) 2147483647))))) (forall ((v_ArrVal_167 (Array Int Int))) (let ((.cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_167) c_~A~0.base) .cse2))) (or (not (<= 0 (+ c_~bag2~0 .cse3 2147483648))) (<= .cse1 (+ c_~bag2~0 .cse3 c_~sum2~0)) (not (<= (+ c_~bag2~0 .cse3) 2147483647))))))) is different from false [2022-11-22 01:48:38,043 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~bag1~0 c_~sum1~0 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))))) (.cse2 (+ c_~A~0.offset (* c_~j~0 4)))) (and (forall ((v_ArrVal_167 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_167) c_~A~0.base) .cse2))) (or (not (<= 0 (+ c_~bag2~0 .cse0 2147483648))) (<= .cse1 (+ c_~bag2~0 .cse0 c_~sum2~0)) (not (<= (+ c_~bag2~0 .cse0) 2147483647))))) (forall ((v_ArrVal_167 (Array Int Int))) (let ((.cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_167) c_~A~0.base) .cse2))) (or (not (<= 0 (+ c_~bag2~0 .cse3 2147483648))) (<= (+ c_~bag2~0 .cse3 c_~sum2~0) .cse1) (not (<= (+ c_~bag2~0 .cse3) 2147483647))))))) is different from false [2022-11-22 01:48:38,112 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_166 (Array Int Int)) (v_ArrVal_167 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_166))) (let ((.cse0 (select (select (store .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_167) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (<= 0 (+ .cse0 2147483648))) (<= .cse0 (select (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (not (<= .cse0 2147483647)))))) (forall ((v_ArrVal_166 (Array Int Int)) (v_ArrVal_167 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_166))) (let ((.cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_167) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (<= 0 (+ .cse2 2147483648))) (<= (select (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) .cse2) (not (<= .cse2 2147483647))))))) is different from false [2022-11-22 01:48:38,131 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:48:38,131 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 99 treesize of output 63 [2022-11-22 01:48:38,143 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 506 treesize of output 458 [2022-11-22 01:48:38,164 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 320 treesize of output 306 [2022-11-22 01:48:38,178 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 306 treesize of output 280 [2022-11-22 01:48:38,295 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-22 01:48:38,295 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 1 [2022-11-22 01:48:38,317 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-22 01:48:38,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1260176419] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:48:38,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1130713035] [2022-11-22 01:48:38,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:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-22 01:48:38,322 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:48:38,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2022-11-22 01:48:38,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447530531] [2022-11-22 01:48:38,322 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:48:38,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-22 01:48:38,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:48:38,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-22 01:48:38,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=393, Unknown=4, NotChecked=172, Total=650 [2022-11-22 01:48:38,325 INFO L87 Difference]: Start difference. First operand 70 states and 174 transitions. Second operand has 26 states, 25 states have (on average 1.68) internal successors, (42), 25 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:48:40,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:48:40,162 INFO L93 Difference]: Finished difference Result 236 states and 632 transitions. [2022-11-22 01:48:40,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-22 01:48:40,163 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.68) internal successors, (42), 25 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-22 01:48:40,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:48:40,166 INFO L225 Difference]: With dead ends: 236 [2022-11-22 01:48:40,167 INFO L226 Difference]: Without dead ends: 226 [2022-11-22 01:48:40,167 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 15 SyntacticMatches, 8 SemanticMatches, 40 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=284, Invalid=1134, Unknown=4, NotChecked=300, Total=1722 [2022-11-22 01:48:40,168 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 352 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 312 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-22 01:48:40,169 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 0 Invalid, 687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 342 Invalid, 0 Unknown, 312 Unchecked, 0.5s Time] [2022-11-22 01:48:40,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2022-11-22 01:48:40,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 72. [2022-11-22 01:48:40,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 71 states have (on average 2.6056338028169015) internal successors, (185), 71 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:48:40,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 185 transitions. [2022-11-22 01:48:40,196 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 185 transitions. Word has length 16 [2022-11-22 01:48:40,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:48:40,196 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 185 transitions. [2022-11-22 01:48:40,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.68) internal successors, (42), 25 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:48:40,197 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 185 transitions. [2022-11-22 01:48:40,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-22 01:48:40,201 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:48:40,201 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:48:40,212 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0e99913-6562-41b4-b07d-5da922a21e23/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-22 01:48:40,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0e99913-6562-41b4-b07d-5da922a21e23/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:48:40,407 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-22 01:48:40,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:48:40,407 INFO L85 PathProgramCache]: Analyzing trace with hash 724647803, now seen corresponding path program 3 times [2022-11-22 01:48:40,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:48:40,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848215470] [2022-11-22 01:48:40,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:48:40,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:48:40,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:48:42,025 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:48:42,025 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:48:42,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848215470] [2022-11-22 01:48:42,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848215470] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:48:42,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1021136680] [2022-11-22 01:48:42,025 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-22 01:48:42,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:48:42,026 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0e99913-6562-41b4-b07d-5da922a21e23/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:48:42,027 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0e99913-6562-41b4-b07d-5da922a21e23/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:48:42,038 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0e99913-6562-41b4-b07d-5da922a21e23/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-22 01:48:42,151 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-22 01:48:42,152 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 01:48:42,155 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 75 conjunts are in the unsatisfiable core [2022-11-22 01:48:42,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:48:42,203 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-11-22 01:48:42,277 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 6 treesize of output 5 [2022-11-22 01:48:42,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:48:42,508 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-22 01:48:42,696 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 187 treesize of output 151 [2022-11-22 01:48:42,869 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:48:42,870 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:48:43,343 WARN L837 $PredicateComparison]: unable to prove that (or (not (< c_~j~0 c_~N~0)) (<= (+ c_~i~0 1) c_~N~0) (let ((.cse1 (+ c_~bag1~0 c_~sum1~0)) (.cse2 (+ c_~A~0.offset (* c_~j~0 4)))) (and (forall ((v_ArrVal_201 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_201) c_~A~0.base) .cse2))) (or (not (<= (+ c_~bag2~0 .cse0) 2147483647)) (<= .cse1 (+ c_~bag2~0 .cse0 c_~sum2~0)) (not (<= 0 (+ c_~bag2~0 .cse0 2147483648)))))) (forall ((v_ArrVal_201 (Array Int Int))) (let ((.cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_201) c_~A~0.base) .cse2))) (or (<= (+ c_~bag2~0 .cse3 c_~sum2~0) .cse1) (not (<= (+ c_~bag2~0 .cse3) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse3 2147483648))))))))) is different from false [2022-11-22 01:48:43,521 WARN L837 $PredicateComparison]: unable to prove that (or (not (< c_~i~0 c_~N~0)) (not (< c_~j~0 c_~N~0)) (< (+ c_~i~0 1) c_~N~0) (let ((.cse1 (+ c_~bag1~0 c_~sum1~0 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))))) (.cse2 (+ c_~A~0.offset (* c_~j~0 4)))) (and (forall ((v_ArrVal_201 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_201) c_~A~0.base) .cse2))) (or (not (<= (+ c_~bag2~0 .cse0) 2147483647)) (<= (+ c_~bag2~0 .cse0 c_~sum2~0) .cse1) (not (<= 0 (+ c_~bag2~0 .cse0 2147483648)))))) (forall ((v_ArrVal_201 (Array Int Int))) (let ((.cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_201) c_~A~0.base) .cse2))) (or (<= .cse1 (+ c_~bag2~0 .cse3 c_~sum2~0)) (not (<= (+ c_~bag2~0 .cse3) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse3 2147483648))))))))) is different from false [2022-11-22 01:48:43,732 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:48:43,733 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 63 [2022-11-22 01:48:43,739 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 238 treesize of output 214 [2022-11-22 01:48:43,749 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 190 [2022-11-22 01:48:43,756 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 190 treesize of output 178 [2022-11-22 01:48:43,964 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-22 01:48:43,965 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 99 treesize of output 1 [2022-11-22 01:48:44,023 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-22 01:48:44,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1021136680] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:48:44,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [181026548] [2022-11-22 01:48:44,024 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-22 01:48:44,025 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:48:44,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2022-11-22 01:48:44,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616846081] [2022-11-22 01:48:44,026 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:48:44,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-22 01:48:44,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:48:44,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-22 01:48:44,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=460, Unknown=11, NotChecked=90, Total=650 [2022-11-22 01:48:44,027 INFO L87 Difference]: Start difference. First operand 72 states and 185 transitions. Second operand has 26 states, 25 states have (on average 1.68) internal successors, (42), 25 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:48:48,467 WARN L837 $PredicateComparison]: unable to prove that (and (or (not (< c_~j~0 c_~N~0)) (<= (+ c_~i~0 1) c_~N~0) (let ((.cse1 (+ c_~bag1~0 c_~sum1~0)) (.cse2 (+ c_~A~0.offset (* c_~j~0 4)))) (and (forall ((v_ArrVal_201 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_201) c_~A~0.base) .cse2))) (or (not (<= (+ c_~bag2~0 .cse0) 2147483647)) (<= .cse1 (+ c_~bag2~0 .cse0 c_~sum2~0)) (not (<= 0 (+ c_~bag2~0 .cse0 2147483648)))))) (forall ((v_ArrVal_201 (Array Int Int))) (let ((.cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_201) c_~A~0.base) .cse2))) (or (<= (+ c_~bag2~0 .cse3 c_~sum2~0) .cse1) (not (<= (+ c_~bag2~0 .cse3) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse3 2147483648))))))))) (= c_~N~0 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 1 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) is different from false [2022-11-22 01:48:49,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:48:49,956 INFO L93 Difference]: Finished difference Result 392 states and 1067 transitions. [2022-11-22 01:48:49,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-11-22 01:48:49,956 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.68) internal successors, (42), 25 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-22 01:48:49,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:48:49,960 INFO L225 Difference]: With dead ends: 392 [2022-11-22 01:48:49,960 INFO L226 Difference]: Without dead ends: 382 [2022-11-22 01:48:49,963 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 13 SyntacticMatches, 6 SemanticMatches, 67 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1211 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=832, Invalid=3445, Unknown=25, NotChecked=390, Total=4692 [2022-11-22 01:48:49,963 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 501 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 674 mSolverCounterSat, 86 mSolverCounterUnsat, 23 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 674 IncrementalHoareTripleChecker+Invalid, 23 IncrementalHoareTripleChecker+Unknown, 216 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-22 01:48:49,964 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [501 Valid, 0 Invalid, 999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 674 Invalid, 23 Unknown, 216 Unchecked, 1.2s Time] [2022-11-22 01:48:49,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2022-11-22 01:48:49,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 94. [2022-11-22 01:48:49,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 93 states have (on average 2.774193548387097) internal successors, (258), 93 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:48:49,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 258 transitions. [2022-11-22 01:48:49,973 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 258 transitions. Word has length 16 [2022-11-22 01:48:49,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:48:49,973 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 258 transitions. [2022-11-22 01:48:49,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.68) internal successors, (42), 25 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:48:49,974 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 258 transitions. [2022-11-22 01:48:49,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-22 01:48:49,975 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:48:49,975 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:48:49,987 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0e99913-6562-41b4-b07d-5da922a21e23/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-22 01:48:50,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0e99913-6562-41b4-b07d-5da922a21e23/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:48:50,181 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-22 01:48:50,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:48:50,181 INFO L85 PathProgramCache]: Analyzing trace with hash -169295787, now seen corresponding path program 4 times [2022-11-22 01:48:50,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:48:50,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189789636] [2022-11-22 01:48:50,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:48:50,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:48:50,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:48:51,430 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:48:51,430 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:48:51,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189789636] [2022-11-22 01:48:51,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189789636] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:48:51,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [749187405] [2022-11-22 01:48:51,430 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-22 01:48:51,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:48:51,431 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0e99913-6562-41b4-b07d-5da922a21e23/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:48:51,435 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0e99913-6562-41b4-b07d-5da922a21e23/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:48:51,455 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0e99913-6562-41b4-b07d-5da922a21e23/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-22 01:48:51,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:48:51,558 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 71 conjunts are in the unsatisfiable core [2022-11-22 01:48:51,561 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:48:51,605 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 01:48:51,655 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 6 treesize of output 5 [2022-11-22 01:48:51,810 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-22 01:48:52,022 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 31 treesize of output 15 [2022-11-22 01:48:52,163 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:48:52,163 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:48:52,946 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 01:48:52,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [749187405] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:48:52,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1079826621] [2022-11-22 01:48:52,948 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-22 01:48:52,949 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:48:52,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 23 [2022-11-22 01:48:52,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445475118] [2022-11-22 01:48:52,950 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:48:52,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-22 01:48:52,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:48:52,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-22 01:48:52,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=468, Unknown=6, NotChecked=0, Total=552 [2022-11-22 01:48:52,952 INFO L87 Difference]: Start difference. First operand 94 states and 258 transitions. Second operand has 24 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 24 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:49:03,236 WARN L233 SmtUtils]: Spent 8.54s on a formula simplification. DAG size of input: 123 DAG size of output: 88 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 01:49:14,042 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (and (or (not (< c_~j~0 c_~N~0)) (< (+ c_~i~0 1) c_~N~0) (let ((.cse2 (+ c_~A~0.offset (* c_~i~0 4))) (.cse3 (+ c_~A~0.offset (* c_~j~0 4)))) (and (forall ((v_ArrVal_235 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_235) c_~A~0.base))) (let ((.cse0 (select .cse1 .cse3))) (or (not (<= (+ .cse0 c_~bag2~0) 2147483647)) (not (<= 0 (+ .cse0 c_~bag2~0 2147483648))) (<= (+ .cse0 c_~bag2~0 c_~sum2~0) (+ (select .cse1 .cse2) |c_thread1Thread1of1ForFork0_plus_#in~b#1| |c_thread1Thread1of1ForFork0_plus_#in~a#1|)))))) (forall ((v_ArrVal_235 (Array Int Int))) (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_235) c_~A~0.base))) (let ((.cse4 (select .cse5 .cse3))) (or (not (<= (+ .cse4 c_~bag2~0) 2147483647)) (not (<= 0 (+ .cse4 c_~bag2~0 2147483648))) (<= (+ (select .cse5 .cse2) |c_thread1Thread1of1ForFork0_plus_#in~b#1| |c_thread1Thread1of1ForFork0_plus_#in~a#1|) (+ .cse4 c_~bag2~0 c_~sum2~0))))))))) (<= 1 c_~N~0) (<= .cse6 |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= c_~sum2~0 2147483647) (= c_~sum1~0 c_~sum2~0) (<= 0 (+ c_~sum2~0 2147483648)) (<= .cse6 |c_ULTIMATE.start_main_~#t2~0#1.base|))) is different from false [2022-11-22 01:49:14,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:49:14,952 INFO L93 Difference]: Finished difference Result 352 states and 920 transitions. [2022-11-22 01:49:14,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-11-22 01:49:14,952 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 24 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-22 01:49:14,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:49:14,955 INFO L225 Difference]: With dead ends: 352 [2022-11-22 01:49:14,955 INFO L226 Difference]: Without dead ends: 343 [2022-11-22 01:49:14,958 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 81 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2066 ImplicationChecksByTransitivity, 21.1s TimeCoverageRelationStatistics Valid=1156, Invalid=5421, Unknown=69, NotChecked=160, Total=6806 [2022-11-22 01:49:14,958 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 458 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 767 mSolverCounterSat, 119 mSolverCounterUnsat, 43 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 458 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 931 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 767 IncrementalHoareTripleChecker+Invalid, 43 IncrementalHoareTripleChecker+Unknown, 2 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-22 01:49:14,959 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [458 Valid, 0 Invalid, 931 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 767 Invalid, 43 Unknown, 2 Unchecked, 1.6s Time] [2022-11-22 01:49:14,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2022-11-22 01:49:14,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 104. [2022-11-22 01:49:14,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 103 states have (on average 2.9223300970873787) internal successors, (301), 103 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:49:14,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 301 transitions. [2022-11-22 01:49:14,969 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 301 transitions. Word has length 16 [2022-11-22 01:49:14,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:49:14,969 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 301 transitions. [2022-11-22 01:49:14,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 24 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:49:14,970 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 301 transitions. [2022-11-22 01:49:14,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-22 01:49:14,971 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:49:14,971 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:49:14,989 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0e99913-6562-41b4-b07d-5da922a21e23/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-22 01:49:15,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0e99913-6562-41b4-b07d-5da922a21e23/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:49:15,190 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-22 01:49:15,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:49:15,190 INFO L85 PathProgramCache]: Analyzing trace with hash -141590157, now seen corresponding path program 5 times [2022-11-22 01:49:15,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:49:15,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084119191] [2022-11-22 01:49:15,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:49:15,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:49:15,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:49:16,608 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:49:16,609 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:49:16,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084119191] [2022-11-22 01:49:16,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084119191] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:49:16,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [957662005] [2022-11-22 01:49:16,609 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-22 01:49:16,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:49:16,610 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0e99913-6562-41b4-b07d-5da922a21e23/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:49:16,611 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0e99913-6562-41b4-b07d-5da922a21e23/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:49:16,618 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0e99913-6562-41b4-b07d-5da922a21e23/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-22 01:49:16,738 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-22 01:49:16,738 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 01:49:16,740 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 68 conjunts are in the unsatisfiable core [2022-11-22 01:49:16,743 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:49:16,791 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 01:49:16,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 6 treesize of output 5 [2022-11-22 01:49:17,009 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-22 01:49:17,208 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 44 treesize of output 20 [2022-11-22 01:49:17,371 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:49:17,371 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:49:18,087 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 01:49:18,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [957662005] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:49:18,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [340480884] [2022-11-22 01:49:18,088 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-22 01:49:18,089 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:49:18,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 23 [2022-11-22 01:49:18,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136356808] [2022-11-22 01:49:18,090 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:49:18,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-22 01:49:18,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:49:18,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-22 01:49:18,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=467, Unknown=9, NotChecked=0, Total=552 [2022-11-22 01:49:18,092 INFO L87 Difference]: Start difference. First operand 104 states and 301 transitions. Second operand has 24 states, 23 states have (on average 1.826086956521739) internal successors, (42), 24 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:49:19,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:49:19,736 INFO L93 Difference]: Finished difference Result 227 states and 651 transitions. [2022-11-22 01:49:19,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-22 01:49:19,736 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 1.826086956521739) internal successors, (42), 24 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-22 01:49:19,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:49:19,738 INFO L225 Difference]: With dead ends: 227 [2022-11-22 01:49:19,739 INFO L226 Difference]: Without dead ends: 217 [2022-11-22 01:49:19,739 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 334 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=271, Invalid=1280, Unknown=9, NotChecked=0, Total=1560 [2022-11-22 01:49:19,740 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 202 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-22 01:49:19,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 0 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-22 01:49:19,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2022-11-22 01:49:19,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 105. [2022-11-22 01:49:19,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 104 states have (on average 2.951923076923077) internal successors, (307), 104 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:49:19,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 307 transitions. [2022-11-22 01:49:19,747 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 307 transitions. Word has length 16 [2022-11-22 01:49:19,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:49:19,747 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 307 transitions. [2022-11-22 01:49:19,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 1.826086956521739) internal successors, (42), 24 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:49:19,748 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 307 transitions. [2022-11-22 01:49:19,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-22 01:49:19,749 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:49:19,749 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:49:19,763 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0e99913-6562-41b4-b07d-5da922a21e23/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-11-22 01:49:19,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0e99913-6562-41b4-b07d-5da922a21e23/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-22 01:49:19,955 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-22 01:49:19,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:49:19,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1548453273, now seen corresponding path program 6 times [2022-11-22 01:49:19,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:49:19,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493915908] [2022-11-22 01:49:19,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:49:19,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:49:20,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:49:21,000 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:49:21,001 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:49:21,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493915908] [2022-11-22 01:49:21,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493915908] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:49:21,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [366243759] [2022-11-22 01:49:21,001 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-22 01:49:21,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:49:21,001 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0e99913-6562-41b4-b07d-5da922a21e23/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:49:21,003 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0e99913-6562-41b4-b07d-5da922a21e23/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:49:21,030 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0e99913-6562-41b4-b07d-5da922a21e23/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-22 01:49:21,133 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-22 01:49:21,133 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 01:49:21,135 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 72 conjunts are in the unsatisfiable core [2022-11-22 01:49:21,139 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:49:21,185 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-11-22 01:49:21,259 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-22 01:49:21,429 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 6 treesize of output 5 [2022-11-22 01:49:21,757 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 31 treesize of output 15 [2022-11-22 01:49:21,880 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:49:21,880 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:49:22,710 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 01:49:22,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [366243759] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:49:22,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2005976451] [2022-11-22 01:49:22,711 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-22 01:49:22,713 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:49:22,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 24 [2022-11-22 01:49:22,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943815155] [2022-11-22 01:49:22,717 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:49:22,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-22 01:49:22,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:49:22,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-22 01:49:22,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=513, Unknown=10, NotChecked=0, Total=600 [2022-11-22 01:49:22,719 INFO L87 Difference]: Start difference. First operand 105 states and 307 transitions. Second operand has 25 states, 24 states have (on average 1.8333333333333333) internal successors, (44), 25 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:49:23,002 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~bag1~0 c_~sum1~0))) (and (<= .cse0 c_~sum2~0) (<= c_~sum2~0 2147483647) (= c_~sum1~0 c_~sum2~0) (or (not (< c_~i~0 c_~N~0)) (not (< c_~j~0 c_~N~0)) (let ((.cse3 (+ c_~A~0.offset (* c_~i~0 4))) (.cse4 (+ c_~A~0.offset (* c_~j~0 4)))) (and (forall ((v_ArrVal_303 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_303) c_~A~0.base))) (let ((.cse1 (select .cse2 .cse4))) (or (<= (+ .cse1 c_~bag2~0 c_~sum2~0) (+ c_~bag1~0 c_~sum1~0 (select .cse2 .cse3))) (not (<= 0 (+ .cse1 c_~bag2~0 2147483648))) (not (<= (+ .cse1 c_~bag2~0) 2147483647)))))) (forall ((v_ArrVal_303 (Array Int Int))) (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_303) c_~A~0.base))) (let ((.cse5 (select .cse6 .cse4))) (or (not (<= 0 (+ .cse5 c_~bag2~0 2147483648))) (< (+ c_~bag1~0 c_~sum1~0 (select .cse6 .cse3)) (+ .cse5 c_~bag2~0 c_~sum2~0 1)) (not (<= (+ .cse5 c_~bag2~0) 2147483647)))))))) (< (+ c_~i~0 1) c_~N~0)) (<= 0 (+ c_~sum2~0 2147483648)) (<= c_~sum2~0 .cse0))) is different from false [2022-11-22 01:49:23,565 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (< c_~i~0 c_~N~0)) (.cse8 (not (< c_~j~0 c_~N~0))) (.cse3 (+ c_~A~0.offset (* c_~i~0 4))) (.cse5 (+ c_~A~0.offset (* c_~j~0 4))) (.cse9 (< (+ c_~i~0 1) c_~N~0))) (and (or (let ((.cse0 (+ c_~bag1~0 c_~sum1~0))) (and (< .cse0 (+ c_~sum2~0 1)) (<= c_~sum2~0 .cse0))) .cse1) (or (and (forall ((v_ArrVal_303 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_303) c_~A~0.base))) (let ((.cse4 (select .cse2 .cse5))) (or (< (+ |c_thread1Thread1of1ForFork0_plus_#in~b#1| (select .cse2 .cse3) |c_thread1Thread1of1ForFork0_plus_#in~a#1|) (+ .cse4 c_~bag2~0 c_~sum2~0 1)) (not (<= 0 (+ .cse4 c_~bag2~0 2147483648))) (not (<= (+ .cse4 c_~bag2~0) 2147483647)))))) (forall ((v_ArrVal_303 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_303) c_~A~0.base))) (let ((.cse6 (select .cse7 .cse5))) (or (<= (+ .cse6 c_~bag2~0 c_~sum2~0) (+ |c_thread1Thread1of1ForFork0_plus_#in~b#1| (select .cse7 .cse3) |c_thread1Thread1of1ForFork0_plus_#in~a#1|)) (not (<= 0 (+ .cse6 c_~bag2~0 2147483648))) (not (<= (+ .cse6 c_~bag2~0) 2147483647))))))) .cse8 .cse9) (or (not .cse1) .cse8 (and (forall ((v_ArrVal_303 (Array Int Int))) (let ((.cse11 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_303) c_~A~0.base))) (let ((.cse10 (select .cse11 .cse5))) (or (<= (+ .cse10 c_~bag2~0 c_~sum2~0) (+ c_~bag1~0 c_~sum1~0 (select .cse11 .cse3))) (not (<= 0 (+ .cse10 c_~bag2~0 2147483648))) (not (<= (+ .cse10 c_~bag2~0) 2147483647)))))) (forall ((v_ArrVal_303 (Array Int Int))) (let ((.cse13 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_303) c_~A~0.base))) (let ((.cse12 (select .cse13 .cse5))) (or (not (<= 0 (+ .cse12 c_~bag2~0 2147483648))) (< (+ c_~bag1~0 c_~sum1~0 (select .cse13 .cse3)) (+ .cse12 c_~bag2~0 c_~sum2~0 1)) (not (<= (+ .cse12 c_~bag2~0) 2147483647))))))) .cse9))) is different from false [2022-11-22 01:49:23,594 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (< c_~i~0 c_~N~0))) (and (or (let ((.cse0 (+ c_~bag1~0 c_~sum1~0))) (and (< .cse0 (+ c_~sum2~0 1)) (<= c_~sum2~0 .cse0))) .cse1) (or (not .cse1) (not (< c_~j~0 c_~N~0)) (let ((.cse4 (+ c_~A~0.offset (* c_~i~0 4))) (.cse5 (+ c_~A~0.offset (* c_~j~0 4)))) (and (forall ((v_ArrVal_303 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_303) c_~A~0.base))) (let ((.cse2 (select .cse3 .cse5))) (or (<= (+ .cse2 c_~bag2~0 c_~sum2~0) (+ c_~bag1~0 c_~sum1~0 (select .cse3 .cse4))) (not (<= 0 (+ .cse2 c_~bag2~0 2147483648))) (not (<= (+ .cse2 c_~bag2~0) 2147483647)))))) (forall ((v_ArrVal_303 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_303) c_~A~0.base))) (let ((.cse6 (select .cse7 .cse5))) (or (not (<= 0 (+ .cse6 c_~bag2~0 2147483648))) (< (+ c_~bag1~0 c_~sum1~0 (select .cse7 .cse4)) (+ .cse6 c_~bag2~0 c_~sum2~0 1)) (not (<= (+ .cse6 c_~bag2~0) 2147483647)))))))) (< (+ c_~i~0 1) c_~N~0)))) is different from false [2022-11-22 01:49:30,698 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (and (= c_~sum1~0 0) (<= 0 (+ c_~bag1~0 2147483648)) (= c_~N~0 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (<= .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= c_~N~0 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (<= c_~sum2~0 2147483647) (<= c_~N~0 1) (= c_~sum1~0 c_~sum2~0) (<= c_~bag1~0 2147483647) (or (not (< c_~i~0 c_~N~0)) (not (< c_~j~0 c_~N~0)) (let ((.cse3 (+ c_~A~0.offset (* c_~i~0 4))) (.cse4 (+ c_~A~0.offset (* c_~j~0 4)))) (and (forall ((v_ArrVal_303 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_303) c_~A~0.base))) (let ((.cse1 (select .cse2 .cse4))) (or (<= (+ .cse1 c_~bag2~0 c_~sum2~0) (+ c_~bag1~0 c_~sum1~0 (select .cse2 .cse3))) (not (<= 0 (+ .cse1 c_~bag2~0 2147483648))) (not (<= (+ .cse1 c_~bag2~0) 2147483647)))))) (forall ((v_ArrVal_303 (Array Int Int))) (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_303) c_~A~0.base))) (let ((.cse5 (select .cse6 .cse4))) (or (not (<= 0 (+ .cse5 c_~bag2~0 2147483648))) (< (+ c_~bag1~0 c_~sum1~0 (select .cse6 .cse3)) (+ .cse5 c_~bag2~0 c_~sum2~0 1)) (not (<= (+ .cse5 c_~bag2~0) 2147483647)))))))) (< (+ c_~i~0 1) c_~N~0)) (< 0 c_~N~0) (<= 0 (+ c_~sum2~0 2147483648)) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base|) (= c_~bag1~0 c_~sum2~0) (<= c_~i~0 1))) is different from false [2022-11-22 01:49:33,290 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (and (= c_~sum1~0 0) (<= 0 (+ c_~bag1~0 2147483648)) (= c_~N~0 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (<= .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= c_~N~0 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (<= c_~N~0 1) (<= c_~bag1~0 2147483647) (or (not (< c_~i~0 c_~N~0)) (not (< c_~j~0 c_~N~0)) (let ((.cse3 (+ c_~A~0.offset (* c_~i~0 4))) (.cse4 (+ c_~A~0.offset (* c_~j~0 4)))) (and (forall ((v_ArrVal_303 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_303) c_~A~0.base))) (let ((.cse1 (select .cse2 .cse4))) (or (<= (+ .cse1 c_~bag2~0 c_~sum2~0) (+ c_~bag1~0 c_~sum1~0 (select .cse2 .cse3))) (not (<= 0 (+ .cse1 c_~bag2~0 2147483648))) (not (<= (+ .cse1 c_~bag2~0) 2147483647)))))) (forall ((v_ArrVal_303 (Array Int Int))) (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_303) c_~A~0.base))) (let ((.cse5 (select .cse6 .cse4))) (or (not (<= 0 (+ .cse5 c_~bag2~0 2147483648))) (< (+ c_~bag1~0 c_~sum1~0 (select .cse6 .cse3)) (+ .cse5 c_~bag2~0 c_~sum2~0 1)) (not (<= (+ .cse5 c_~bag2~0) 2147483647)))))))) (< (+ c_~i~0 1) c_~N~0)) (< 0 c_~N~0) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base|) (= c_~bag1~0 c_~sum2~0) (<= c_~i~0 1))) is different from false [2022-11-22 01:49:34,293 WARN L837 $PredicateComparison]: unable to prove that (and (or (let ((.cse0 (+ c_~bag1~0 c_~sum1~0))) (and (< .cse0 (+ c_~sum2~0 1)) (<= c_~sum2~0 .cse0))) (< c_~i~0 c_~N~0)) (or (let ((.cse2 (+ c_~A~0.offset (* c_~i~0 4))) (.cse4 (+ c_~A~0.offset (* c_~j~0 4)))) (and (forall ((v_ArrVal_303 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_303) c_~A~0.base))) (let ((.cse3 (select .cse1 .cse4))) (or (< (+ |c_thread1Thread1of1ForFork0_plus_#in~b#1| (select .cse1 .cse2) |c_thread1Thread1of1ForFork0_plus_#in~a#1|) (+ .cse3 c_~bag2~0 c_~sum2~0 1)) (not (<= 0 (+ .cse3 c_~bag2~0 2147483648))) (not (<= (+ .cse3 c_~bag2~0) 2147483647)))))) (forall ((v_ArrVal_303 (Array Int Int))) (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_303) c_~A~0.base))) (let ((.cse5 (select .cse6 .cse4))) (or (<= (+ .cse5 c_~bag2~0 c_~sum2~0) (+ |c_thread1Thread1of1ForFork0_plus_#in~b#1| (select .cse6 .cse2) |c_thread1Thread1of1ForFork0_plus_#in~a#1|)) (not (<= 0 (+ .cse5 c_~bag2~0 2147483648))) (not (<= (+ .cse5 c_~bag2~0) 2147483647)))))))) (not (< c_~j~0 c_~N~0)) (< (+ c_~i~0 1) c_~N~0))) is different from false [2022-11-22 01:49:34,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:49:34,896 INFO L93 Difference]: Finished difference Result 327 states and 840 transitions. [2022-11-22 01:49:34,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-11-22 01:49:34,897 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 1.8333333333333333) internal successors, (44), 25 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-22 01:49:34,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:49:34,899 INFO L225 Difference]: With dead ends: 327 [2022-11-22 01:49:34,899 INFO L226 Difference]: Without dead ends: 317 [2022-11-22 01:49:34,900 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 547 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=473, Invalid=2263, Unknown=44, NotChecked=642, Total=3422 [2022-11-22 01:49:34,901 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 214 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 907 mSolverCounterSat, 49 mSolverCounterUnsat, 38 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1076 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 907 IncrementalHoareTripleChecker+Invalid, 38 IncrementalHoareTripleChecker+Unknown, 82 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-22 01:49:34,901 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 0 Invalid, 1076 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 907 Invalid, 38 Unknown, 82 Unchecked, 1.7s Time] [2022-11-22 01:49:34,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2022-11-22 01:49:34,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 122. [2022-11-22 01:49:34,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 121 states have (on average 2.9008264462809916) internal successors, (351), 121 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:49:34,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 351 transitions. [2022-11-22 01:49:34,908 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 351 transitions. Word has length 16 [2022-11-22 01:49:34,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:49:34,908 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 351 transitions. [2022-11-22 01:49:34,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 1.8333333333333333) internal successors, (44), 25 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:49:34,909 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 351 transitions. [2022-11-22 01:49:34,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-22 01:49:34,910 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:49:34,910 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:49:34,923 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0e99913-6562-41b4-b07d-5da922a21e23/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-22 01:49:35,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0e99913-6562-41b4-b07d-5da922a21e23/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-22 01:49:35,119 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-22 01:49:35,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:49:35,120 INFO L85 PathProgramCache]: Analyzing trace with hash 595894339, now seen corresponding path program 7 times [2022-11-22 01:49:35,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:49:35,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468136621] [2022-11-22 01:49:35,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:49:35,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:49:35,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:49:36,787 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:49:36,788 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:49:36,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468136621] [2022-11-22 01:49:36,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468136621] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:49:36,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [577890774] [2022-11-22 01:49:36,788 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-22 01:49:36,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:49:36,788 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0e99913-6562-41b4-b07d-5da922a21e23/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:49:36,789 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0e99913-6562-41b4-b07d-5da922a21e23/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:49:36,795 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0e99913-6562-41b4-b07d-5da922a21e23/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-22 01:49:36,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:49:36,914 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 66 conjunts are in the unsatisfiable core [2022-11-22 01:49:36,917 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:49:36,959 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 01:49:37,010 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 6 treesize of output 5 [2022-11-22 01:49:37,151 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 6 treesize of output 5 [2022-11-22 01:49:37,374 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 31 treesize of output 15 [2022-11-22 01:49:37,491 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:49:37,491 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:49:38,240 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 01:49:38,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [577890774] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:49:38,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2109416552] [2022-11-22 01:49:38,241 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-22 01:49:38,242 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:49:38,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 24 [2022-11-22 01:49:38,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764095430] [2022-11-22 01:49:38,243 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:49:38,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-22 01:49:38,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:49:38,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-22 01:49:38,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=522, Unknown=8, NotChecked=0, Total=600 [2022-11-22 01:49:38,244 INFO L87 Difference]: Start difference. First operand 122 states and 351 transitions. Second operand has 25 states, 24 states have (on average 1.75) internal successors, (42), 25 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:49:40,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:49:40,056 INFO L93 Difference]: Finished difference Result 249 states and 688 transitions. [2022-11-22 01:49:40,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-22 01:49:40,056 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 1.75) internal successors, (42), 25 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-22 01:49:40,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:49:40,059 INFO L225 Difference]: With dead ends: 249 [2022-11-22 01:49:40,059 INFO L226 Difference]: Without dead ends: 240 [2022-11-22 01:49:40,060 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=250, Invalid=1382, Unknown=8, NotChecked=0, Total=1640 [2022-11-22 01:49:40,060 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 179 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-22 01:49:40,061 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 0 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-22 01:49:40,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2022-11-22 01:49:40,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 115. [2022-11-22 01:49:40,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 114 states have (on average 2.912280701754386) internal successors, (332), 114 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:49:40,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 332 transitions. [2022-11-22 01:49:40,067 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 332 transitions. Word has length 16 [2022-11-22 01:49:40,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:49:40,068 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 332 transitions. [2022-11-22 01:49:40,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 1.75) internal successors, (42), 25 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:49:40,068 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 332 transitions. [2022-11-22 01:49:40,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-22 01:49:40,069 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:49:40,069 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:49:40,079 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0e99913-6562-41b4-b07d-5da922a21e23/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-11-22 01:49:40,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0e99913-6562-41b4-b07d-5da922a21e23/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:49:40,276 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-22 01:49:40,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:49:40,276 INFO L85 PathProgramCache]: Analyzing trace with hash -917332789, now seen corresponding path program 1 times [2022-11-22 01:49:40,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:49:40,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233678443] [2022-11-22 01:49:40,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:49:40,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:49:40,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:49:41,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-11-22 01:49:41,966 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:49:41,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233678443] [2022-11-22 01:49:41,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233678443] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:49:41,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [970731850] [2022-11-22 01:49:41,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:49:41,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:49:41,966 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0e99913-6562-41b4-b07d-5da922a21e23/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:49:41,971 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0e99913-6562-41b4-b07d-5da922a21e23/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:49:42,004 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0e99913-6562-41b4-b07d-5da922a21e23/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-22 01:49:42,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:49:42,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 64 conjunts are in the unsatisfiable core [2022-11-22 01:49:42,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:49:42,145 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 01:49:42,202 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 6 treesize of output 5 [2022-11-22 01:49:42,285 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 6 treesize of output 5 [2022-11-22 01:49:42,560 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 56 treesize of output 24 [2022-11-22 01:49:42,665 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:49:42,665 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:49:43,292 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 01:49:43,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [970731850] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:49:43,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [853979791] [2022-11-22 01:49:43,293 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-22 01:49:43,294 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:49:43,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 22 [2022-11-22 01:49:43,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369026151] [2022-11-22 01:49:43,295 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:49:43,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-22 01:49:43,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:49:43,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-22 01:49:43,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=429, Unknown=4, NotChecked=0, Total=506 [2022-11-22 01:49:43,296 INFO L87 Difference]: Start difference. First operand 115 states and 332 transitions. Second operand has 23 states, 22 states have (on average 2.0) internal successors, (44), 23 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:49:44,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:49:44,816 INFO L93 Difference]: Finished difference Result 202 states and 579 transitions. [2022-11-22 01:49:44,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-22 01:49:44,816 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.0) internal successors, (44), 23 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-22 01:49:44,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:49:44,818 INFO L225 Difference]: With dead ends: 202 [2022-11-22 01:49:44,818 INFO L226 Difference]: Without dead ends: 197 [2022-11-22 01:49:44,819 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=228, Invalid=1174, Unknown=4, NotChecked=0, Total=1406 [2022-11-22 01:49:44,820 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 126 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 619 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-22 01:49:44,820 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 0 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 619 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-22 01:49:44,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-11-22 01:49:44,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 123. [2022-11-22 01:49:44,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 122 states have (on average 2.918032786885246) internal successors, (356), 122 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:49:44,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 356 transitions. [2022-11-22 01:49:44,826 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 356 transitions. Word has length 16 [2022-11-22 01:49:44,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:49:44,827 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 356 transitions. [2022-11-22 01:49:44,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.0) internal successors, (44), 23 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:49:44,827 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 356 transitions. [2022-11-22 01:49:44,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-22 01:49:44,828 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:49:44,828 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:49:44,843 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0e99913-6562-41b4-b07d-5da922a21e23/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-22 01:49:45,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0e99913-6562-41b4-b07d-5da922a21e23/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-22 01:49:45,034 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-22 01:49:45,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:49:45,035 INFO L85 PathProgramCache]: Analyzing trace with hash -59052905, now seen corresponding path program 2 times [2022-11-22 01:49:45,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:49:45,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209254170] [2022-11-22 01:49:45,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:49:45,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:49:45,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:49:46,491 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:49:46,491 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:49:46,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209254170] [2022-11-22 01:49:46,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209254170] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:49:46,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [111386124] [2022-11-22 01:49:46,491 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-22 01:49:46,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:49:46,492 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0e99913-6562-41b4-b07d-5da922a21e23/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:49:46,493 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0e99913-6562-41b4-b07d-5da922a21e23/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:49:46,515 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0e99913-6562-41b4-b07d-5da922a21e23/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-22 01:49:46,642 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-22 01:49:46,642 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 01:49:46,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 53 conjunts are in the unsatisfiable core [2022-11-22 01:49:46,646 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:49:46,958 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 46 treesize of output 22 [2022-11-22 01:49:47,097 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 01:49:47,098 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:49:47,371 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:49:47,372 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 314 treesize of output 246 [2022-11-22 01:49:47,555 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 01:49:47,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [111386124] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:49:47,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [663644189] [2022-11-22 01:49:47,556 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-22 01:49:47,558 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:49:47,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 20 [2022-11-22 01:49:47,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552787929] [2022-11-22 01:49:47,558 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:49:47,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-22 01:49:47,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:49:47,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-22 01:49:47,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2022-11-22 01:49:47,559 INFO L87 Difference]: Start difference. First operand 123 states and 356 transitions. Second operand has 21 states, 20 states have (on average 2.2) internal successors, (44), 21 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:49:48,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:49:48,881 INFO L93 Difference]: Finished difference Result 192 states and 568 transitions. [2022-11-22 01:49:48,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-22 01:49:48,882 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.2) internal successors, (44), 21 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-22 01:49:48,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:49:48,883 INFO L225 Difference]: With dead ends: 192 [2022-11-22 01:49:48,883 INFO L226 Difference]: Without dead ends: 187 [2022-11-22 01:49:48,884 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=232, Invalid=824, Unknown=0, NotChecked=0, Total=1056 [2022-11-22 01:49:48,885 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 128 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-22 01:49:48,885 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 0 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-22 01:49:48,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2022-11-22 01:49:48,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 123. [2022-11-22 01:49:48,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 122 states have (on average 2.918032786885246) internal successors, (356), 122 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:49:48,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 356 transitions. [2022-11-22 01:49:48,890 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 356 transitions. Word has length 16 [2022-11-22 01:49:48,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:49:48,891 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 356 transitions. [2022-11-22 01:49:48,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.2) internal successors, (44), 21 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:49:48,891 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 356 transitions. [2022-11-22 01:49:48,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-22 01:49:48,892 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:49:48,892 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:49:48,903 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0e99913-6562-41b4-b07d-5da922a21e23/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-11-22 01:49:49,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0e99913-6562-41b4-b07d-5da922a21e23/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:49:49,098 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-22 01:49:49,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:49:49,099 INFO L85 PathProgramCache]: Analyzing trace with hash -31347275, now seen corresponding path program 3 times [2022-11-22 01:49:49,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:49:49,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627459498] [2022-11-22 01:49:49,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:49:49,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:49:49,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:49:50,078 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 01:49:50,078 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:49:50,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627459498] [2022-11-22 01:49:50,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627459498] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:49:50,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [865633496] [2022-11-22 01:49:50,079 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-22 01:49:50,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:49:50,079 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0e99913-6562-41b4-b07d-5da922a21e23/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:49:50,083 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0e99913-6562-41b4-b07d-5da922a21e23/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:49:50,103 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0e99913-6562-41b4-b07d-5da922a21e23/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-22 01:49:50,214 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-22 01:49:50,214 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 01:49:50,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 68 conjunts are in the unsatisfiable core [2022-11-22 01:49:50,237 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:49:50,287 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-11-22 01:49:50,351 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 6 treesize of output 5 [2022-11-22 01:49:50,440 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 6 treesize of output 5 [2022-11-22 01:49:50,759 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 54 treesize of output 22 [2022-11-22 01:49:50,896 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:49:50,896 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:49:51,608 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 01:49:51,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [865633496] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:49:51,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1797447363] [2022-11-22 01:49:51,609 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-22 01:49:51,610 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:49:51,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 8] total 21 [2022-11-22 01:49:51,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362135922] [2022-11-22 01:49:51,611 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:49:51,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-22 01:49:51,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:49:51,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-22 01:49:51,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=372, Unknown=2, NotChecked=0, Total=462 [2022-11-22 01:49:51,612 INFO L87 Difference]: Start difference. First operand 123 states and 356 transitions. Second operand has 22 states, 21 states have (on average 2.0) internal successors, (42), 22 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:50:02,481 WARN L233 SmtUtils]: Spent 10.23s on a formula simplification. DAG size of input: 83 DAG size of output: 77 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 01:50:15,770 WARN L233 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 68 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 01:50:16,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:50:16,096 INFO L93 Difference]: Finished difference Result 416 states and 1160 transitions. [2022-11-22 01:50:16,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-11-22 01:50:16,097 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.0) internal successors, (42), 22 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-22 01:50:16,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:50:16,100 INFO L225 Difference]: With dead ends: 416 [2022-11-22 01:50:16,100 INFO L226 Difference]: Without dead ends: 406 [2022-11-22 01:50:16,101 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 974 ImplicationChecksByTransitivity, 24.0s TimeCoverageRelationStatistics Valid=616, Invalid=2804, Unknown=2, NotChecked=0, Total=3422 [2022-11-22 01:50:16,101 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 360 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 56 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:50:16,102 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 0 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 565 Invalid, 12 Unknown, 0 Unchecked, 1.1s Time] [2022-11-22 01:50:16,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2022-11-22 01:50:16,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 134. [2022-11-22 01:50:16,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 133 states have (on average 2.969924812030075) internal successors, (395), 133 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:50:16,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 395 transitions. [2022-11-22 01:50:16,110 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 395 transitions. Word has length 16 [2022-11-22 01:50:16,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:50:16,110 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 395 transitions. [2022-11-22 01:50:16,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.0) internal successors, (42), 22 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:50:16,111 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 395 transitions. [2022-11-22 01:50:16,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-22 01:50:16,111 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:50:16,112 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:50:16,124 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0e99913-6562-41b4-b07d-5da922a21e23/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-22 01:50:16,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0e99913-6562-41b4-b07d-5da922a21e23/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-22 01:50:16,324 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-22 01:50:16,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:50:16,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1924748381, now seen corresponding path program 8 times [2022-11-22 01:50:16,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:50:16,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537924928] [2022-11-22 01:50:16,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:50:16,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:50:16,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:50:17,821 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:50:17,821 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:50:17,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537924928] [2022-11-22 01:50:17,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537924928] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:50:17,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [33714837] [2022-11-22 01:50:17,822 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-22 01:50:17,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:50:17,822 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0e99913-6562-41b4-b07d-5da922a21e23/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:50:17,823 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0e99913-6562-41b4-b07d-5da922a21e23/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:50:17,847 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0e99913-6562-41b4-b07d-5da922a21e23/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-22 01:50:17,958 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-22 01:50:17,958 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 01:50:17,961 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 66 conjunts are in the unsatisfiable core [2022-11-22 01:50:17,963 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:50:18,008 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 01:50:18,060 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 6 treesize of output 5 [2022-11-22 01:50:18,135 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 6 treesize of output 5 [2022-11-22 01:50:18,381 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 52 treesize of output 20 [2022-11-22 01:50:18,538 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:50:18,538 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:50:19,183 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 01:50:19,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [33714837] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:50:19,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [744744989] [2022-11-22 01:50:19,184 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-22 01:50:19,185 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:50:19,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 25 [2022-11-22 01:50:19,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683905103] [2022-11-22 01:50:19,186 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:50:19,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-22 01:50:19,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:50:19,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-22 01:50:19,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=553, Unknown=5, NotChecked=0, Total=650 [2022-11-22 01:50:19,188 INFO L87 Difference]: Start difference. First operand 134 states and 395 transitions. Second operand has 26 states, 25 states have (on average 1.76) internal successors, (44), 26 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:50:21,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:50:21,562 INFO L93 Difference]: Finished difference Result 245 states and 721 transitions. [2022-11-22 01:50:21,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-22 01:50:21,563 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.76) internal successors, (44), 26 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-22 01:50:21,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:50:21,566 INFO L225 Difference]: With dead ends: 245 [2022-11-22 01:50:21,566 INFO L226 Difference]: Without dead ends: 240 [2022-11-22 01:50:21,567 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=264, Invalid=1291, Unknown=5, NotChecked=0, Total=1560 [2022-11-22 01:50:21,571 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 136 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 730 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 730 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-22 01:50:21,571 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 0 Invalid, 759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 730 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-22 01:50:21,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2022-11-22 01:50:21,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 135. [2022-11-22 01:50:21,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 134 states have (on average 2.9776119402985075) internal successors, (399), 134 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:50:21,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 399 transitions. [2022-11-22 01:50:21,582 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 399 transitions. Word has length 16 [2022-11-22 01:50:21,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:50:21,583 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 399 transitions. [2022-11-22 01:50:21,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.76) internal successors, (44), 26 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:50:21,583 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 399 transitions. [2022-11-22 01:50:21,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-22 01:50:21,584 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:50:21,588 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:50:21,599 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0e99913-6562-41b4-b07d-5da922a21e23/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-22 01:50:21,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0e99913-6562-41b4-b07d-5da922a21e23/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-22 01:50:21,796 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-22 01:50:21,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:50:21,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1952454011, now seen corresponding path program 9 times [2022-11-22 01:50:21,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:50:21,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291413187] [2022-11-22 01:50:21,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:50:21,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:50:21,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:50:22,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-11-22 01:50:22,932 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:50:22,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291413187] [2022-11-22 01:50:22,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291413187] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:50:22,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [955078472] [2022-11-22 01:50:22,932 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-22 01:50:22,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:50:22,932 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0e99913-6562-41b4-b07d-5da922a21e23/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:50:22,934 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0e99913-6562-41b4-b07d-5da922a21e23/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:50:22,935 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0e99913-6562-41b4-b07d-5da922a21e23/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-22 01:50:23,067 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-22 01:50:23,067 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 01:50:23,070 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 72 conjunts are in the unsatisfiable core [2022-11-22 01:50:23,072 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:50:23,122 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 01:50:23,193 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 6 treesize of output 5 [2022-11-22 01:50:23,285 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 6 treesize of output 5 [2022-11-22 01:50:23,598 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 58 treesize of output 22 [2022-11-22 01:50:23,790 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:50:23,790 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:50:24,600 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 01:50:24,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [955078472] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:50:24,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [363688749] [2022-11-22 01:50:24,602 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-22 01:50:24,604 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:50:24,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 25 [2022-11-22 01:50:24,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975799532] [2022-11-22 01:50:24,604 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:50:24,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-22 01:50:24,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:50:24,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-22 01:50:24,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=554, Unknown=2, NotChecked=0, Total=650 [2022-11-22 01:50:24,607 INFO L87 Difference]: Start difference. First operand 135 states and 399 transitions. Second operand has 26 states, 25 states have (on average 1.76) internal successors, (44), 26 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:50:40,012 WARN L233 SmtUtils]: Spent 14.57s on a formula simplification. DAG size of input: 106 DAG size of output: 101 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 01:50:49,040 WARN L233 SmtUtils]: Spent 8.54s on a formula simplification. DAG size of input: 108 DAG size of output: 103 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 01:50:51,066 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 01:51:11,687 WARN L233 SmtUtils]: Spent 18.69s on a formula simplification. DAG size of input: 113 DAG size of output: 108 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 01:51:22,490 WARN L233 SmtUtils]: Spent 10.53s on a formula simplification. DAG size of input: 105 DAG size of output: 100 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 01:51:33,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:51:33,356 INFO L93 Difference]: Finished difference Result 550 states and 1516 transitions. [2022-11-22 01:51:33,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2022-11-22 01:51:33,357 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.76) internal successors, (44), 26 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-22 01:51:33,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:51:33,360 INFO L225 Difference]: With dead ends: 550 [2022-11-22 01:51:33,360 INFO L226 Difference]: Without dead ends: 532 [2022-11-22 01:51:33,363 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3224 ImplicationChecksByTransitivity, 65.5s TimeCoverageRelationStatistics Valid=1535, Invalid=8165, Unknown=2, NotChecked=0, Total=9702 [2022-11-22 01:51:33,363 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 632 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1067 mSolverCounterSat, 118 mSolverCounterUnsat, 24 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 632 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 1067 IncrementalHoareTripleChecker+Invalid, 24 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:51:33,364 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [632 Valid, 0 Invalid, 1209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 1067 Invalid, 24 Unknown, 0 Unchecked, 4.1s Time] [2022-11-22 01:51:33,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2022-11-22 01:51:33,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 149. [2022-11-22 01:51:33,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 148 states have (on average 3.02027027027027) internal successors, (447), 148 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:51:33,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 447 transitions. [2022-11-22 01:51:33,374 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 447 transitions. Word has length 16 [2022-11-22 01:51:33,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:51:33,374 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 447 transitions. [2022-11-22 01:51:33,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.76) internal successors, (44), 26 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:51:33,375 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 447 transitions. [2022-11-22 01:51:33,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-22 01:51:33,376 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:51:33,376 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:51:33,382 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0e99913-6562-41b4-b07d-5da922a21e23/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-11-22 01:51:33,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0e99913-6562-41b4-b07d-5da922a21e23/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-22 01:51:33,582 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-22 01:51:33,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:51:33,583 INFO L85 PathProgramCache]: Analyzing trace with hash -652469855, now seen corresponding path program 10 times [2022-11-22 01:51:33,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:51:33,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568750300] [2022-11-22 01:51:33,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:51:33,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:51:33,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:51:34,537 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:51:34,537 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:51:34,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568750300] [2022-11-22 01:51:34,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568750300] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:51:34,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [772749411] [2022-11-22 01:51:34,538 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-22 01:51:34,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:51:34,538 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0e99913-6562-41b4-b07d-5da922a21e23/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:51:34,539 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0e99913-6562-41b4-b07d-5da922a21e23/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:51:34,543 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0e99913-6562-41b4-b07d-5da922a21e23/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-22 01:51:34,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:51:34,663 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 71 conjunts are in the unsatisfiable core [2022-11-22 01:51:34,665 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:51:34,711 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 01:51:34,770 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 6 treesize of output 5 [2022-11-22 01:51:34,877 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 6 treesize of output 5 [2022-11-22 01:51:35,243 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 31 treesize of output 15 [2022-11-22 01:51:35,352 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:51:35,352 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:51:36,059 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 01:51:36,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [772749411] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:51:36,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2093418429] [2022-11-22 01:51:36,060 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-22 01:51:36,061 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:51:36,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 24 [2022-11-22 01:51:36,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279276805] [2022-11-22 01:51:36,062 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:51:36,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-22 01:51:36,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:51:36,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-22 01:51:36,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=517, Unknown=4, NotChecked=0, Total=600 [2022-11-22 01:51:36,063 INFO L87 Difference]: Start difference. First operand 149 states and 447 transitions. Second operand has 25 states, 24 states have (on average 1.8333333333333333) internal successors, (44), 25 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:51:47,683 WARN L233 SmtUtils]: Spent 6.47s on a formula simplification. DAG size of input: 120 DAG size of output: 98 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 01:51:55,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:51:55,042 INFO L93 Difference]: Finished difference Result 338 states and 913 transitions. [2022-11-22 01:51:55,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-22 01:51:55,043 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 1.8333333333333333) internal successors, (44), 25 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-22 01:51:55,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:51:55,045 INFO L225 Difference]: With dead ends: 338 [2022-11-22 01:51:55,045 INFO L226 Difference]: Without dead ends: 328 [2022-11-22 01:51:55,046 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 483 ImplicationChecksByTransitivity, 18.6s TimeCoverageRelationStatistics Valid=389, Invalid=2057, Unknown=4, NotChecked=0, Total=2450 [2022-11-22 01:51:55,047 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 251 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 819 mSolverCounterSat, 39 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 819 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-22 01:51:55,047 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 0 Invalid, 861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 819 Invalid, 3 Unknown, 0 Unchecked, 1.2s Time] [2022-11-22 01:51:55,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2022-11-22 01:51:55,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 151. [2022-11-22 01:51:55,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 150 states have (on average 3.04) internal successors, (456), 150 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:51:55,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 456 transitions. [2022-11-22 01:51:55,056 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 456 transitions. Word has length 16 [2022-11-22 01:51:55,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:51:55,056 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 456 transitions. [2022-11-22 01:51:55,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 1.8333333333333333) internal successors, (44), 25 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:51:55,057 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 456 transitions. [2022-11-22 01:51:55,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-22 01:51:55,057 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:51:55,057 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:51:55,065 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0e99913-6562-41b4-b07d-5da922a21e23/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-22 01:51:55,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0e99913-6562-41b4-b07d-5da922a21e23/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-22 01:51:55,265 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-22 01:51:55,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:51:55,265 INFO L85 PathProgramCache]: Analyzing trace with hash 147534721, now seen corresponding path program 11 times [2022-11-22 01:51:55,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:51:55,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245947928] [2022-11-22 01:51:55,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:51:55,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:51:55,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:51:56,262 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:51:56,263 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:51:56,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245947928] [2022-11-22 01:51:56,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245947928] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:51:56,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1377339784] [2022-11-22 01:51:56,263 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-22 01:51:56,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:51:56,263 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0e99913-6562-41b4-b07d-5da922a21e23/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:51:56,264 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0e99913-6562-41b4-b07d-5da922a21e23/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:51:56,267 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0e99913-6562-41b4-b07d-5da922a21e23/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-22 01:51:56,396 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-22 01:51:56,397 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 01:51:56,399 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 66 conjunts are in the unsatisfiable core [2022-11-22 01:51:56,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:51:56,434 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 01:51:56,487 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-22 01:51:56,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 6 treesize of output 5 [2022-11-22 01:51:56,853 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 31 treesize of output 15 [2022-11-22 01:51:56,944 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:51:56,945 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:51:57,500 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 01:51:57,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1377339784] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:51:57,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [445864699] [2022-11-22 01:51:57,500 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-22 01:51:57,502 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:51:57,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 23 [2022-11-22 01:51:57,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603723156] [2022-11-22 01:51:57,502 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:51:57,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-22 01:51:57,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:51:57,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-22 01:51:57,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=475, Unknown=6, NotChecked=0, Total=552 [2022-11-22 01:51:57,504 INFO L87 Difference]: Start difference. First operand 151 states and 456 transitions. Second operand has 24 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 24 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:51:59,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:51:59,029 INFO L93 Difference]: Finished difference Result 302 states and 851 transitions. [2022-11-22 01:51:59,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-22 01:51:59,029 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 24 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-22 01:51:59,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:51:59,031 INFO L225 Difference]: With dead ends: 302 [2022-11-22 01:51:59,031 INFO L226 Difference]: Without dead ends: 292 [2022-11-22 01:51:59,032 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=204, Invalid=1196, Unknown=6, NotChecked=0, Total=1406 [2022-11-22 01:51:59,032 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 224 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-22 01:51:59,033 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 0 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 499 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-22 01:51:59,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2022-11-22 01:51:59,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 151. [2022-11-22 01:51:59,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 150 states have (on average 3.04) internal successors, (456), 150 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:51:59,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 456 transitions. [2022-11-22 01:51:59,039 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 456 transitions. Word has length 16 [2022-11-22 01:51:59,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:51:59,040 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 456 transitions. [2022-11-22 01:51:59,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 24 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:51:59,040 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 456 transitions. [2022-11-22 01:51:59,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-22 01:51:59,041 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:51:59,041 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:51:59,052 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0e99913-6562-41b4-b07d-5da922a21e23/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-22 01:51:59,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0e99913-6562-41b4-b07d-5da922a21e23/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:51:59,247 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-22 01:51:59,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:51:59,247 INFO L85 PathProgramCache]: Analyzing trace with hash -722838731, now seen corresponding path program 12 times [2022-11-22 01:51:59,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:51:59,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167201368] [2022-11-22 01:51:59,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:51:59,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:51:59,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:51:59,450 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 01:51:59,450 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:51:59,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167201368] [2022-11-22 01:51:59,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167201368] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:51:59,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [226236547] [2022-11-22 01:51:59,451 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-22 01:51:59,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:51:59,451 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0e99913-6562-41b4-b07d-5da922a21e23/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:51:59,455 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0e99913-6562-41b4-b07d-5da922a21e23/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:51:59,470 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0e99913-6562-41b4-b07d-5da922a21e23/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-22 01:51:59,597 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-22 01:51:59,597 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 01:51:59,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-22 01:51:59,601 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:51:59,864 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 01:51:59,864 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:52:00,062 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-22 01:52:00,062 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 376 treesize of output 272 [2022-11-22 01:52:00,224 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 01:52:00,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [226236547] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:52:00,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [401222914] [2022-11-22 01:52:00,225 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-22 01:52:00,225 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:52:00,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2022-11-22 01:52:00,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190245906] [2022-11-22 01:52:00,226 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:52:00,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-22 01:52:00,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:52:00,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-22 01:52:00,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2022-11-22 01:52:00,227 INFO L87 Difference]: Start difference. First operand 151 states and 456 transitions. Second operand has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 12 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-11-22 01:52:00,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:52:00,490 INFO L93 Difference]: Finished difference Result 209 states and 552 transitions. [2022-11-22 01:52:00,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-22 01:52:00,490 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 12 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 17 [2022-11-22 01:52:00,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:52:00,491 INFO L225 Difference]: With dead ends: 209 [2022-11-22 01:52:00,492 INFO L226 Difference]: Without dead ends: 199 [2022-11-22 01:52:00,492 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2022-11-22 01:52:00,493 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 120 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 01:52:00,493 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 0 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 01:52:00,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2022-11-22 01:52:00,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 165. [2022-11-22 01:52:00,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 164 states have (on average 2.7378048780487805) internal successors, (449), 164 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:52:00,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 449 transitions. [2022-11-22 01:52:00,504 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 449 transitions. Word has length 17 [2022-11-22 01:52:00,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:52:00,504 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 449 transitions. [2022-11-22 01:52:00,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 12 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-11-22 01:52:00,504 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 449 transitions. [2022-11-22 01:52:00,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-22 01:52:00,505 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:52:00,505 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:52:00,515 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0e99913-6562-41b4-b07d-5da922a21e23/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-11-22 01:52:00,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0e99913-6562-41b4-b07d-5da922a21e23/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:52:00,711 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-22 01:52:00,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:52:00,712 INFO L85 PathProgramCache]: Analyzing trace with hash -710692268, now seen corresponding path program 13 times [2022-11-22 01:52:00,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:52:00,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098621535] [2022-11-22 01:52:00,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:52:00,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:52:00,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:52:00,902 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:52:00,903 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:52:00,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098621535] [2022-11-22 01:52:00,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098621535] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:52:00,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2138440266] [2022-11-22 01:52:00,903 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-22 01:52:00,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:52:00,903 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0e99913-6562-41b4-b07d-5da922a21e23/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:52:00,905 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0e99913-6562-41b4-b07d-5da922a21e23/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:52:00,926 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0e99913-6562-41b4-b07d-5da922a21e23/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-22 01:52:01,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:52:01,034 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-22 01:52:01,036 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:52:01,234 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:52:01,234 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:52:01,382 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 279 treesize of output 215 [2022-11-22 01:52:01,605 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:52:01,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2138440266] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:52:01,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1218558150] [2022-11-22 01:52:01,606 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-22 01:52:01,606 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:52:01,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2022-11-22 01:52:01,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460044923] [2022-11-22 01:52:01,606 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:52:01,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-22 01:52:01,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:52:01,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-22 01:52:01,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2022-11-22 01:52:01,607 INFO L87 Difference]: Start difference. First operand 165 states and 449 transitions. Second operand has 17 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 16 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:52:02,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:52:02,276 INFO L93 Difference]: Finished difference Result 199 states and 510 transitions. [2022-11-22 01:52:02,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-22 01:52:02,279 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 16 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-22 01:52:02,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:52:02,280 INFO L225 Difference]: With dead ends: 199 [2022-11-22 01:52:02,280 INFO L226 Difference]: Without dead ends: 199 [2022-11-22 01:52:02,281 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=294, Invalid=698, Unknown=0, NotChecked=0, Total=992 [2022-11-22 01:52:02,282 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 271 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-22 01:52:02,282 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 0 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-22 01:52:02,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2022-11-22 01:52:02,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 163. [2022-11-22 01:52:02,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 162 states have (on average 2.617283950617284) internal successors, (424), 162 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:52:02,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 424 transitions. [2022-11-22 01:52:02,288 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 424 transitions. Word has length 17 [2022-11-22 01:52:02,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:52:02,289 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 424 transitions. [2022-11-22 01:52:02,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 16 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:52:02,289 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 424 transitions. [2022-11-22 01:52:02,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-22 01:52:02,290 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:52:02,290 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:52:02,303 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0e99913-6562-41b4-b07d-5da922a21e23/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-11-22 01:52:02,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0e99913-6562-41b4-b07d-5da922a21e23/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:52:02,499 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-22 01:52:02,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:52:02,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1411721249, now seen corresponding path program 14 times [2022-11-22 01:52:02,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:52:02,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238936041] [2022-11-22 01:52:02,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:52:02,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:52:02,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:52:02,680 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 01:52:02,680 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:52:02,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238936041] [2022-11-22 01:52:02,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238936041] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:52:02,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [954757446] [2022-11-22 01:52:02,681 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-22 01:52:02,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:52:02,681 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0e99913-6562-41b4-b07d-5da922a21e23/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:52:02,683 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0e99913-6562-41b4-b07d-5da922a21e23/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:52:02,696 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0e99913-6562-41b4-b07d-5da922a21e23/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-22 01:52:02,853 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-22 01:52:02,854 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 01:52:02,856 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-22 01:52:02,857 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:52:02,952 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 01:52:02,952 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:52:03,022 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 01:52:03,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [954757446] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:52:03,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1047719250] [2022-11-22 01:52:03,023 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-22 01:52:03,023 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:52:03,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-11-22 01:52:03,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217392186] [2022-11-22 01:52:03,024 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:52:03,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-22 01:52:03,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:52:03,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-22 01:52:03,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-11-22 01:52:03,025 INFO L87 Difference]: Start difference. First operand 163 states and 424 transitions. Second operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 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-11-22 01:52:03,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:52:03,197 INFO L93 Difference]: Finished difference Result 128 states and 316 transitions. [2022-11-22 01:52:03,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-22 01:52:03,198 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 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 18 [2022-11-22 01:52:03,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:52:03,198 INFO L225 Difference]: With dead ends: 128 [2022-11-22 01:52:03,199 INFO L226 Difference]: Without dead ends: 95 [2022-11-22 01:52:03,199 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2022-11-22 01:52:03,199 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 108 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:52:03,200 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 0 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:52:03,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-11-22 01:52:03,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2022-11-22 01:52:03,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 94 states have (on average 2.617021276595745) internal successors, (246), 94 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:52:03,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 246 transitions. [2022-11-22 01:52:03,203 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 246 transitions. Word has length 18 [2022-11-22 01:52:03,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:52:03,203 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 246 transitions. [2022-11-22 01:52:03,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 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-11-22 01:52:03,204 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 246 transitions. [2022-11-22 01:52:03,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-22 01:52:03,204 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:52:03,204 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:52:03,212 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0e99913-6562-41b4-b07d-5da922a21e23/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-11-22 01:52:03,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0e99913-6562-41b4-b07d-5da922a21e23/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:52:03,412 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-22 01:52:03,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:52:03,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1050595456, now seen corresponding path program 15 times [2022-11-22 01:52:03,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:52:03,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708968110] [2022-11-22 01:52:03,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:52:03,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:52:03,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:52:06,418 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:52:06,418 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:52:06,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708968110] [2022-11-22 01:52:06,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708968110] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:52:06,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1708777036] [2022-11-22 01:52:06,419 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-22 01:52:06,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:52:06,419 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0e99913-6562-41b4-b07d-5da922a21e23/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:52:06,423 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0e99913-6562-41b4-b07d-5da922a21e23/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:52:06,427 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0e99913-6562-41b4-b07d-5da922a21e23/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-22 01:52:06,573 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-22 01:52:06,574 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 01:52:06,576 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 92 conjunts are in the unsatisfiable core [2022-11-22 01:52:06,578 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:52:07,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:52:07,303 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 32 [2022-11-22 01:52:07,680 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:52:07,680 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 251 treesize of output 171 [2022-11-22 01:52:07,918 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:52:07,918 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:52:09,729 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse22 (* c_~j~0 4))) (let ((.cse8 (not (< (+ c_~j~0 1) c_~N~0))) (.cse3 (+ c_~A~0.offset .cse22)) (.cse4 (+ c_~A~0.offset .cse22 4)) (.cse9 (<= (+ c_~j~0 3) c_~N~0))) (and (or (and (forall ((v_ArrVal_700 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_700) c_~A~0.base))) (let ((.cse1 (select .cse2 .cse4)) (.cse0 (select .cse2 .cse3))) (or (not (<= 0 (+ c_~bag2~0 .cse0 2147483648))) (not (<= 0 (+ .cse1 c_~bag2~0 .cse0 2147483648))) (not (<= (+ .cse1 c_~bag2~0 .cse0) 2147483647)) (not (<= (+ c_~bag2~0 .cse0) 2147483647)) (<= c_~sum1~0 (+ .cse1 c_~bag2~0 c_~sum2~0 .cse0)))))) (forall ((v_ArrVal_700 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_700) c_~A~0.base))) (let ((.cse6 (select .cse7 .cse4)) (.cse5 (select .cse7 .cse3))) (or (not (<= 0 (+ c_~bag2~0 .cse5 2147483648))) (not (<= 0 (+ .cse6 c_~bag2~0 .cse5 2147483648))) (not (<= (+ .cse6 c_~bag2~0 .cse5) 2147483647)) (not (<= (+ c_~bag2~0 .cse5) 2147483647)) (<= (+ .cse6 c_~bag2~0 c_~sum2~0 .cse5) c_~sum1~0)))))) .cse8 .cse9) (or (not (<= (+ c_~bag2~0 c_~sum2~0) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648))) (and (or (and (forall ((v_ArrVal_700 (Array Int Int))) (let ((.cse12 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_700) c_~A~0.base))) (let ((.cse11 (select .cse12 .cse4)) (.cse10 (select .cse12 .cse3))) (or (not (<= (+ c_~bag2~0 .cse10) 2147483647)) (<= c_~sum1~0 (+ .cse11 c_~bag2~0 c_~sum2~0 .cse10)) (< c_~bag2~0 (+ .cse11 1)) (not (<= 0 (+ .cse11 .cse10 2147483648))))))) (forall ((v_ArrVal_700 (Array Int Int))) (let ((.cse15 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_700) c_~A~0.base))) (let ((.cse14 (select .cse15 .cse4)) (.cse13 (select .cse15 .cse3))) (or (not (<= (+ c_~bag2~0 .cse13) 2147483647)) (< c_~bag2~0 (+ .cse14 1)) (not (<= 0 (+ .cse14 .cse13 2147483648))) (<= (+ .cse14 c_~bag2~0 c_~sum2~0 .cse13) c_~sum1~0)))))) .cse8 .cse9) (or .cse8 (and (forall ((v_ArrVal_700 (Array Int Int))) (let ((.cse18 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_700) c_~A~0.base))) (let ((.cse17 (select .cse18 .cse4)) (.cse16 (select .cse18 .cse3))) (or (not (<= 0 (+ c_~bag2~0 .cse16 2147483648))) (not (<= (+ c_~bag2~0 .cse16) 2147483647)) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse16) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 .cse16 2147483648))) (<= c_~sum1~0 (+ .cse17 c_~bag2~0 c_~sum2~0 .cse16)) (not (<= 0 (+ .cse17 .cse16 2147483648))) (not (<= (+ .cse17 .cse16) 2147483647)))))) (forall ((v_ArrVal_700 (Array Int Int))) (let ((.cse21 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_700) c_~A~0.base))) (let ((.cse20 (select .cse21 .cse4)) (.cse19 (select .cse21 .cse3))) (or (not (<= 0 (+ c_~bag2~0 .cse19 2147483648))) (not (<= (+ c_~bag2~0 .cse19) 2147483647)) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse19) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 .cse19 2147483648))) (not (<= 0 (+ .cse20 .cse19 2147483648))) (<= (+ .cse20 c_~bag2~0 c_~sum2~0 .cse19) c_~sum1~0) (not (<= (+ .cse20 .cse19) 2147483647))))))) .cse9)))))) is different from false [2022-11-22 01:52:10,497 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse23 (* c_~j~0 4))) (let ((.cse9 (not (< (+ c_~j~0 1) c_~N~0))) (.cse2 (+ |c_thread1Thread1of1ForFork0_plus_#in~b#1| (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))) |c_thread1Thread1of1ForFork0_plus_#in~a#1|)) (.cse4 (+ c_~A~0.offset .cse23)) (.cse5 (+ c_~A~0.offset .cse23 4)) (.cse10 (<= (+ c_~j~0 3) c_~N~0))) (and (or (and (forall ((v_ArrVal_700 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_700) c_~A~0.base))) (let ((.cse1 (select .cse3 .cse5)) (.cse0 (select .cse3 .cse4))) (or (not (<= 0 (+ c_~bag2~0 .cse0 2147483648))) (not (<= 0 (+ .cse1 c_~bag2~0 .cse0 2147483648))) (<= (+ .cse1 c_~bag2~0 c_~sum2~0 .cse0) .cse2) (not (<= (+ .cse1 c_~bag2~0 .cse0) 2147483647)) (not (<= (+ c_~bag2~0 .cse0) 2147483647)))))) (forall ((v_ArrVal_700 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_700) c_~A~0.base))) (let ((.cse7 (select .cse8 .cse5)) (.cse6 (select .cse8 .cse4))) (or (not (<= 0 (+ c_~bag2~0 .cse6 2147483648))) (not (<= 0 (+ .cse7 c_~bag2~0 .cse6 2147483648))) (not (<= (+ .cse7 c_~bag2~0 .cse6) 2147483647)) (not (<= (+ c_~bag2~0 .cse6) 2147483647)) (<= .cse2 (+ .cse7 c_~bag2~0 c_~sum2~0 .cse6))))))) .cse9 .cse10) (or (not (<= (+ c_~bag2~0 c_~sum2~0) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648))) (and (or (and (forall ((v_ArrVal_700 (Array Int Int))) (let ((.cse13 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_700) c_~A~0.base))) (let ((.cse12 (select .cse13 .cse5)) (.cse11 (select .cse13 .cse4))) (or (not (<= 0 (+ c_~bag2~0 .cse11 2147483648))) (<= (+ .cse12 c_~bag2~0 c_~sum2~0 .cse11) .cse2) (not (<= (+ c_~bag2~0 .cse11) 2147483647)) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse11) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 .cse11 2147483648))) (not (<= 0 (+ .cse12 .cse11 2147483648))) (not (<= (+ .cse12 .cse11) 2147483647)))))) (forall ((v_ArrVal_700 (Array Int Int))) (let ((.cse16 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_700) c_~A~0.base))) (let ((.cse15 (select .cse16 .cse5)) (.cse14 (select .cse16 .cse4))) (or (not (<= 0 (+ c_~bag2~0 .cse14 2147483648))) (not (<= (+ c_~bag2~0 .cse14) 2147483647)) (<= .cse2 (+ .cse15 c_~bag2~0 c_~sum2~0 .cse14)) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse14) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 .cse14 2147483648))) (not (<= 0 (+ .cse15 .cse14 2147483648))) (not (<= (+ .cse15 .cse14) 2147483647))))))) .cse9 .cse10) (or .cse9 (and (forall ((v_ArrVal_700 (Array Int Int))) (let ((.cse19 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_700) c_~A~0.base))) (let ((.cse17 (select .cse19 .cse5)) (.cse18 (select .cse19 .cse4))) (or (<= (+ .cse17 c_~bag2~0 c_~sum2~0 .cse18) .cse2) (not (<= (+ c_~bag2~0 .cse18) 2147483647)) (< c_~bag2~0 (+ .cse17 1)) (not (<= 0 (+ .cse17 .cse18 2147483648))))))) (forall ((v_ArrVal_700 (Array Int Int))) (let ((.cse22 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_700) c_~A~0.base))) (let ((.cse21 (select .cse22 .cse5)) (.cse20 (select .cse22 .cse4))) (or (not (<= (+ c_~bag2~0 .cse20) 2147483647)) (<= .cse2 (+ .cse21 c_~bag2~0 c_~sum2~0 .cse20)) (< c_~bag2~0 (+ .cse21 1)) (not (<= 0 (+ .cse21 .cse20 2147483648)))))))) .cse10)))))) is different from false [2022-11-22 01:52:10,737 WARN L837 $PredicateComparison]: unable to prove that (or (not (< c_~i~0 c_~N~0)) (let ((.cse23 (* c_~j~0 4))) (let ((.cse2 (+ c_~bag1~0 c_~sum1~0 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))))) (.cse4 (+ c_~A~0.offset .cse23)) (.cse5 (+ c_~A~0.offset .cse23 4)) (.cse9 (not (< (+ c_~j~0 1) c_~N~0))) (.cse10 (<= (+ c_~j~0 3) c_~N~0))) (and (or (and (forall ((v_ArrVal_700 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_700) c_~A~0.base))) (let ((.cse1 (select .cse3 .cse5)) (.cse0 (select .cse3 .cse4))) (or (not (<= 0 (+ c_~bag2~0 .cse0 2147483648))) (not (<= 0 (+ .cse1 c_~bag2~0 .cse0 2147483648))) (not (<= (+ .cse1 c_~bag2~0 .cse0) 2147483647)) (not (<= (+ c_~bag2~0 .cse0) 2147483647)) (<= (+ .cse1 c_~bag2~0 c_~sum2~0 .cse0) .cse2))))) (forall ((v_ArrVal_700 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_700) c_~A~0.base))) (let ((.cse7 (select .cse8 .cse5)) (.cse6 (select .cse8 .cse4))) (or (not (<= 0 (+ c_~bag2~0 .cse6 2147483648))) (not (<= 0 (+ .cse7 c_~bag2~0 .cse6 2147483648))) (not (<= (+ .cse7 c_~bag2~0 .cse6) 2147483647)) (not (<= (+ c_~bag2~0 .cse6) 2147483647)) (<= .cse2 (+ .cse7 c_~bag2~0 c_~sum2~0 .cse6))))))) .cse9 .cse10) (or (not (<= (+ c_~bag2~0 c_~sum2~0) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648))) (and (or (and (forall ((v_ArrVal_700 (Array Int Int))) (let ((.cse13 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_700) c_~A~0.base))) (let ((.cse12 (select .cse13 .cse5)) (.cse11 (select .cse13 .cse4))) (or (not (<= (+ c_~bag2~0 .cse11) 2147483647)) (<= .cse2 (+ .cse12 c_~bag2~0 c_~sum2~0 .cse11)) (< c_~bag2~0 (+ .cse12 1)) (not (<= 0 (+ .cse12 .cse11 2147483648))))))) (forall ((v_ArrVal_700 (Array Int Int))) (let ((.cse16 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_700) c_~A~0.base))) (let ((.cse15 (select .cse16 .cse5)) (.cse14 (select .cse16 .cse4))) (or (not (<= (+ c_~bag2~0 .cse14) 2147483647)) (<= (+ .cse15 c_~bag2~0 c_~sum2~0 .cse14) .cse2) (< c_~bag2~0 (+ .cse15 1)) (not (<= 0 (+ .cse15 .cse14 2147483648)))))))) .cse9 .cse10) (or (and (forall ((v_ArrVal_700 (Array Int Int))) (let ((.cse19 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_700) c_~A~0.base))) (let ((.cse18 (select .cse19 .cse5)) (.cse17 (select .cse19 .cse4))) (or (not (<= 0 (+ c_~bag2~0 .cse17 2147483648))) (not (<= (+ c_~bag2~0 .cse17) 2147483647)) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse17) 2147483647)) (<= (+ .cse18 c_~bag2~0 c_~sum2~0 .cse17) .cse2) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 .cse17 2147483648))) (not (<= 0 (+ .cse18 .cse17 2147483648))) (not (<= (+ .cse18 .cse17) 2147483647)))))) (forall ((v_ArrVal_700 (Array Int Int))) (let ((.cse22 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_700) c_~A~0.base))) (let ((.cse21 (select .cse22 .cse5)) (.cse20 (select .cse22 .cse4))) (or (not (<= 0 (+ c_~bag2~0 .cse20 2147483648))) (not (<= (+ c_~bag2~0 .cse20) 2147483647)) (<= .cse2 (+ .cse21 c_~bag2~0 c_~sum2~0 .cse20)) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse20) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 .cse20 2147483648))) (not (<= 0 (+ .cse21 .cse20 2147483648))) (not (<= (+ .cse21 .cse20) 2147483647))))))) .cse9 .cse10))))))) is different from false [2022-11-22 01:52:10,864 INFO L321 Elim1Store]: treesize reduction 14, result has 73.6 percent of original size [2022-11-22 01:52:10,865 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 221 treesize of output 174 [2022-11-22 01:52:10,896 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:52:10,896 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 110 treesize of output 71 [2022-11-22 01:52:11,060 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:52:11,081 INFO L321 Elim1Store]: treesize reduction 44, result has 17.0 percent of original size [2022-11-22 01:52:11,082 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 98 treesize of output 38 [2022-11-22 01:52:11,104 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:52:11,113 INFO L321 Elim1Store]: treesize reduction 52, result has 1.9 percent of original size [2022-11-22 01:52:11,113 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 153 treesize of output 1 [2022-11-22 01:52:11,118 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:52:11,127 INFO L321 Elim1Store]: treesize reduction 52, result has 1.9 percent of original size [2022-11-22 01:52:11,128 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 153 treesize of output 1 [2022-11-22 01:52:11,199 INFO L321 Elim1Store]: treesize reduction 14, result has 73.6 percent of original size [2022-11-22 01:52:11,199 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 280 treesize of output 217 [2022-11-22 01:52:11,215 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:52:11,215 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 163 treesize of output 112 [2022-11-22 01:52:11,582 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:52:11,605 INFO L321 Elim1Store]: treesize reduction 44, result has 17.0 percent of original size [2022-11-22 01:52:11,605 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 124 treesize of output 48 [2022-11-22 01:52:12,071 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-22 01:52:12,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1708777036] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:52:12,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1951591227] [2022-11-22 01:52:12,072 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-22 01:52:12,072 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:52:12,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 37 [2022-11-22 01:52:12,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002469797] [2022-11-22 01:52:12,073 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:52:12,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-11-22 01:52:12,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:52:12,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-11-22 01:52:12,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=1100, Unknown=5, NotChecked=210, Total=1482 [2022-11-22 01:52:12,074 INFO L87 Difference]: Start difference. First operand 95 states and 246 transitions. Second operand has 39 states, 38 states have (on average 1.5) internal successors, (57), 38 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:52:21,534 WARN L233 SmtUtils]: Spent 6.97s on a formula simplification. DAG size of input: 132 DAG size of output: 125 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 01:52:31,325 WARN L233 SmtUtils]: Spent 7.00s on a formula simplification. DAG size of input: 128 DAG size of output: 121 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 01:52:46,354 WARN L233 SmtUtils]: Spent 5.26s on a formula simplification. DAG size of input: 166 DAG size of output: 166 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 01:52:54,569 WARN L233 SmtUtils]: Spent 7.71s on a formula simplification. DAG size of input: 154 DAG size of output: 147 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 01:53:10,884 WARN L233 SmtUtils]: Spent 5.21s on a formula simplification. DAG size of input: 170 DAG size of output: 170 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 01:53:19,293 WARN L233 SmtUtils]: Spent 7.95s on a formula simplification. DAG size of input: 150 DAG size of output: 143 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 01:53:28,803 WARN L233 SmtUtils]: Spent 7.00s on a formula simplification. DAG size of input: 124 DAG size of output: 117 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 01:53:35,900 WARN L233 SmtUtils]: Spent 6.82s on a formula simplification. DAG size of input: 117 DAG size of output: 110 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 01:53:44,081 WARN L233 SmtUtils]: Spent 7.92s on a formula simplification. DAG size of input: 174 DAG size of output: 167 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 01:53:53,734 WARN L233 SmtUtils]: Spent 5.17s on a formula simplification. DAG size of input: 159 DAG size of output: 159 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 01:54:06,454 WARN L233 SmtUtils]: Spent 5.15s on a formula simplification. DAG size of input: 146 DAG size of output: 146 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 01:54:23,016 WARN L233 SmtUtils]: Spent 6.83s on a formula simplification. DAG size of input: 124 DAG size of output: 117 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 01:54:30,976 WARN L233 SmtUtils]: Spent 7.77s on a formula simplification. DAG size of input: 167 DAG size of output: 160 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 01:54:58,700 WARN L233 SmtUtils]: Spent 5.26s on a formula simplification. DAG size of input: 171 DAG size of output: 171 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 01:55:10,389 WARN L233 SmtUtils]: Spent 5.41s on a formula simplification. DAG size of input: 142 DAG size of output: 142 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 01:55:41,117 WARN L233 SmtUtils]: Spent 5.80s on a formula simplification. DAG size of input: 188 DAG size of output: 188 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 01:55:45,465 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 01:55:56,419 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 01:56:02,694 WARN L233 SmtUtils]: Spent 5.24s on a formula simplification. DAG size of input: 173 DAG size of output: 173 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 01:56:26,613 WARN L233 SmtUtils]: Spent 12.56s on a formula simplification. DAG size of input: 181 DAG size of output: 181 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 01:56:34,567 WARN L233 SmtUtils]: Spent 5.96s on a formula simplification. DAG size of input: 184 DAG size of output: 184 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 01:56:41,180 WARN L233 SmtUtils]: Spent 6.04s on a formula simplification. DAG size of input: 197 DAG size of output: 197 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 01:56:46,853 WARN L233 SmtUtils]: Spent 5.37s on a formula simplification. DAG size of input: 172 DAG size of output: 172 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 01:56:52,299 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 01:57:20,903 WARN L233 SmtUtils]: Spent 14.73s on a formula simplification. DAG size of input: 190 DAG size of output: 190 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 01:57:33,823 WARN L233 SmtUtils]: Spent 6.80s on a formula simplification. DAG size of input: 193 DAG size of output: 193 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 01:57:39,503 WARN L233 SmtUtils]: Spent 5.21s on a formula simplification. DAG size of input: 168 DAG size of output: 168 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 01:57:52,691 WARN L233 SmtUtils]: Spent 8.03s on a formula simplification. DAG size of input: 178 DAG size of output: 171 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 01:58:12,860 WARN L233 SmtUtils]: Spent 7.95s on a formula simplification. DAG size of input: 180 DAG size of output: 173 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 01:58:34,731 WARN L233 SmtUtils]: Spent 5.07s on a formula simplification. DAG size of input: 153 DAG size of output: 153 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 01:58:52,828 WARN L233 SmtUtils]: Spent 5.60s on a formula simplification. DAG size of input: 149 DAG size of output: 149 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 01:59:02,569 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 01:59:04,774 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 01:59:04,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:59:04,851 INFO L93 Difference]: Finished difference Result 1351 states and 3609 transitions. [2022-11-22 01:59:04,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 213 states. [2022-11-22 01:59:04,852 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 1.5) internal successors, (57), 38 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-22 01:59:04,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:59:04,857 INFO L225 Difference]: With dead ends: 1351 [2022-11-22 01:59:04,857 INFO L226 Difference]: Without dead ends: 1286 [2022-11-22 01:59:04,869 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 14 SyntacticMatches, 11 SemanticMatches, 244 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 25595 ImplicationChecksByTransitivity, 395.3s TimeCoverageRelationStatistics Valid=9274, Invalid=49380, Unknown=164, NotChecked=1452, Total=60270 [2022-11-22 01:59:04,869 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 1512 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3043 mSolverCounterSat, 507 mSolverCounterUnsat, 49 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1512 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 507 IncrementalHoareTripleChecker+Valid, 3043 IncrementalHoareTripleChecker+Invalid, 49 IncrementalHoareTripleChecker+Unknown, 494 IncrementalHoareTripleChecker+Unchecked, 19.3s IncrementalHoareTripleChecker+Time [2022-11-22 01:59:04,870 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1512 Valid, 0 Invalid, 4093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [507 Valid, 3043 Invalid, 49 Unknown, 494 Unchecked, 19.3s Time] [2022-11-22 01:59:04,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1286 states. [2022-11-22 01:59:04,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1286 to 244. [2022-11-22 01:59:04,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 243 states have (on average 2.753086419753086) internal successors, (669), 243 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:59:04,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 669 transitions. [2022-11-22 01:59:04,887 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 669 transitions. Word has length 20 [2022-11-22 01:59:04,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:59:04,888 INFO L495 AbstractCegarLoop]: Abstraction has 244 states and 669 transitions. [2022-11-22 01:59:04,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 1.5) internal successors, (57), 38 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:59:04,888 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 669 transitions. [2022-11-22 01:59:04,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-22 01:59:04,889 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:59:04,889 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:59:04,896 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0e99913-6562-41b4-b07d-5da922a21e23/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-11-22 01:59:05,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0e99913-6562-41b4-b07d-5da922a21e23/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:59:05,095 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-22 01:59:05,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:59:05,096 INFO L85 PathProgramCache]: Analyzing trace with hash 64350748, now seen corresponding path program 16 times [2022-11-22 01:59:05,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:59:05,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800422070] [2022-11-22 01:59:05,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:59:05,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:59:05,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:59:08,168 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:59:08,168 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:59:08,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800422070] [2022-11-22 01:59:08,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800422070] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:59:08,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2102034551] [2022-11-22 01:59:08,169 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-22 01:59:08,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:59:08,169 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0e99913-6562-41b4-b07d-5da922a21e23/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:59:08,170 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0e99913-6562-41b4-b07d-5da922a21e23/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:59:08,173 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0e99913-6562-41b4-b07d-5da922a21e23/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-11-22 01:59:08,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:59:08,313 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 89 conjunts are in the unsatisfiable core [2022-11-22 01:59:08,315 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:59:08,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:59:09,000 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 34 [2022-11-22 01:59:09,497 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:59:09,497 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 251 treesize of output 171 [2022-11-22 01:59:09,742 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:59:09,742 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:59:13,878 INFO L321 Elim1Store]: treesize reduction 14, result has 73.6 percent of original size [2022-11-22 01:59:13,879 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 282 treesize of output 219 [2022-11-22 01:59:13,891 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:59:13,892 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 164 treesize of output 113 [2022-11-22 01:59:14,021 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:59:14,046 INFO L321 Elim1Store]: treesize reduction 44, result has 17.0 percent of original size [2022-11-22 01:59:14,046 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 124 treesize of output 48 [2022-11-22 01:59:14,076 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:59:14,085 INFO L321 Elim1Store]: treesize reduction 52, result has 1.9 percent of original size [2022-11-22 01:59:14,085 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 153 treesize of output 1 [2022-11-22 01:59:14,089 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:59:14,097 INFO L321 Elim1Store]: treesize reduction 52, result has 1.9 percent of original size [2022-11-22 01:59:14,098 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 154 treesize of output 1 [2022-11-22 01:59:14,107 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:59:14,114 INFO L321 Elim1Store]: treesize reduction 52, result has 1.9 percent of original size [2022-11-22 01:59:14,115 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 98 treesize of output 1 [2022-11-22 01:59:14,119 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:59:14,126 INFO L321 Elim1Store]: treesize reduction 52, result has 1.9 percent of original size [2022-11-22 01:59:14,127 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 99 treesize of output 1 [2022-11-22 01:59:14,656 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:59:14,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2102034551] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:59:14,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1497823862] [2022-11-22 01:59:14,657 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-22 01:59:14,658 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:59:14,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 38 [2022-11-22 01:59:14,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042682650] [2022-11-22 01:59:14,659 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:59:14,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-11-22 01:59:14,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:59:14,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-11-22 01:59:14,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=1349, Unknown=4, NotChecked=0, Total=1560 [2022-11-22 01:59:14,660 INFO L87 Difference]: Start difference. First operand 244 states and 669 transitions. Second operand has 40 states, 39 states have (on average 1.4871794871794872) internal successors, (58), 39 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:59:33,766 WARN L233 SmtUtils]: Spent 8.89s on a formula simplification. DAG size of input: 165 DAG size of output: 145 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 02:00:10,347 WARN L233 SmtUtils]: Spent 10.60s on a formula simplification. DAG size of input: 133 DAG size of output: 109 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 02:00:16,883 WARN L233 SmtUtils]: Spent 6.38s on a formula simplification. DAG size of input: 148 DAG size of output: 104 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 02:00:17,343 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse57 (* c_~j~0 4))) (let ((.cse0 (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse1 (not (<= (+ c_~bag2~0 c_~sum2~0) 2147483647))) (.cse2 (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648)))) (.cse13 (not (< (+ c_~j~0 1) c_~N~0))) (.cse14 (< (+ 2 c_~j~0) c_~N~0)) (.cse36 (+ c_~bag1~0 c_~sum1~0 1)) (.cse32 (+ c_~bag1~0 c_~sum1~0)) (.cse7 (+ c_~A~0.offset .cse57)) (.cse28 (select |c_#memory_int| c_~A~0.base)) (.cse8 (+ c_~A~0.offset .cse57 4)) (.cse29 (< c_~i~0 c_~N~0))) (and (or (not (= c_~sum2~0 0)) (and (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= c_~N~0 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (or (< (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) (* |c_ULTIMATE.start_create_fresh_int_array_~size#1| 4)) (and (<= 2 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| 2))) .cse0)) (or (< (+ c_~i~0 1) c_~N~0) (let ((.cse27 (select .cse28 (+ c_~A~0.offset (* c_~i~0 4))))) (let ((.cse11 (+ c_~bag1~0 c_~sum1~0 .cse27)) (.cse5 (+ c_~bag1~0 c_~sum1~0 .cse27 1))) (and (or .cse1 .cse2 (and (or (and (forall ((v_ArrVal_735 (Array Int Int))) (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_735) c_~A~0.base))) (let ((.cse3 (select .cse6 .cse8)) (.cse4 (select .cse6 .cse7))) (or (not (<= 0 (+ .cse3 .cse4 2147483648))) (not (<= (+ c_~bag2~0 .cse4 c_~sum2~0) 2147483647)) (not (<= (+ c_~bag2~0 .cse4) 2147483647)) (not (<= (+ .cse3 .cse4) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse4 2147483648))) (< (+ c_~bag2~0 .cse3 .cse4 c_~sum2~0) .cse5) (not (<= 0 (+ c_~bag2~0 .cse4 c_~sum2~0 2147483648))))))) (forall ((v_ArrVal_735 (Array Int Int))) (let ((.cse12 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_735) c_~A~0.base))) (let ((.cse9 (select .cse12 .cse8)) (.cse10 (select .cse12 .cse7))) (or (not (<= 0 (+ .cse9 .cse10 2147483648))) (not (<= (+ c_~bag2~0 .cse10 c_~sum2~0) 2147483647)) (not (<= (+ c_~bag2~0 .cse10) 2147483647)) (not (<= (+ .cse9 .cse10) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse10 2147483648))) (not (<= 0 (+ c_~bag2~0 .cse10 c_~sum2~0 2147483648))) (<= .cse11 (+ c_~bag2~0 .cse9 .cse10 c_~sum2~0))))))) .cse13 .cse14) (or .cse13 .cse14 (and (forall ((v_ArrVal_735 (Array Int Int))) (let ((.cse17 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_735) c_~A~0.base))) (let ((.cse15 (select .cse17 .cse8)) (.cse16 (select .cse17 .cse7))) (or (not (<= 0 (+ .cse15 .cse16 2147483648))) (< c_~bag2~0 (+ .cse15 1)) (not (<= (+ c_~bag2~0 .cse16) 2147483647)) (<= .cse11 (+ c_~bag2~0 .cse15 .cse16 c_~sum2~0)))))) (forall ((v_ArrVal_735 (Array Int Int))) (let ((.cse20 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_735) c_~A~0.base))) (let ((.cse18 (select .cse20 .cse8)) (.cse19 (select .cse20 .cse7))) (or (not (<= 0 (+ .cse18 .cse19 2147483648))) (< c_~bag2~0 (+ .cse18 1)) (not (<= (+ c_~bag2~0 .cse19) 2147483647)) (< (+ c_~bag2~0 .cse18 .cse19 c_~sum2~0) .cse5))))))))) (or (and (forall ((v_ArrVal_735 (Array Int Int))) (let ((.cse23 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_735) c_~A~0.base))) (let ((.cse22 (select .cse23 .cse8)) (.cse21 (select .cse23 .cse7))) (or (not (<= (+ c_~bag2~0 .cse21) 2147483647)) (not (<= (+ c_~bag2~0 .cse22 .cse21) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse21 2147483648))) (not (<= 0 (+ c_~bag2~0 .cse22 .cse21 2147483648))) (<= .cse11 (+ c_~bag2~0 .cse22 .cse21 c_~sum2~0)))))) (forall ((v_ArrVal_735 (Array Int Int))) (let ((.cse26 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_735) c_~A~0.base))) (let ((.cse25 (select .cse26 .cse8)) (.cse24 (select .cse26 .cse7))) (or (not (<= (+ c_~bag2~0 .cse24) 2147483647)) (not (<= (+ c_~bag2~0 .cse25 .cse24) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse24 2147483648))) (< (+ c_~bag2~0 .cse25 .cse24 c_~sum2~0) .cse5) (not (<= 0 (+ c_~bag2~0 .cse25 .cse24 2147483648)))))))) .cse13 .cse14))))) (or .cse29 (and (or (and (or (and (forall ((v_ArrVal_735 (Array Int Int))) (let ((.cse33 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_735) c_~A~0.base))) (let ((.cse30 (select .cse33 .cse8)) (.cse31 (select .cse33 .cse7))) (or (not (<= 0 (+ .cse30 .cse31 2147483648))) (< c_~bag2~0 (+ .cse30 1)) (<= .cse32 (+ c_~bag2~0 .cse30 .cse31 c_~sum2~0)) (not (<= (+ c_~bag2~0 .cse31) 2147483647)))))) (forall ((v_ArrVal_735 (Array Int Int))) (let ((.cse37 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_735) c_~A~0.base))) (let ((.cse34 (select .cse37 .cse8)) (.cse35 (select .cse37 .cse7))) (or (not (<= 0 (+ .cse34 .cse35 2147483648))) (< (+ c_~bag2~0 .cse34 .cse35 c_~sum2~0) .cse36) (< c_~bag2~0 (+ .cse34 1)) (not (<= (+ c_~bag2~0 .cse35) 2147483647))))))) .cse13 .cse14) (or (and (forall ((v_ArrVal_735 (Array Int Int))) (let ((.cse40 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_735) c_~A~0.base))) (let ((.cse38 (select .cse40 .cse8)) (.cse39 (select .cse40 .cse7))) (or (not (<= 0 (+ .cse38 .cse39 2147483648))) (< (+ c_~bag2~0 .cse38 .cse39 c_~sum2~0) .cse36) (not (<= (+ c_~bag2~0 .cse39 c_~sum2~0) 2147483647)) (not (<= (+ c_~bag2~0 .cse39) 2147483647)) (not (<= (+ .cse38 .cse39) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse39 2147483648))) (not (<= 0 (+ c_~bag2~0 .cse39 c_~sum2~0 2147483648))))))) (forall ((v_ArrVal_735 (Array Int Int))) (let ((.cse43 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_735) c_~A~0.base))) (let ((.cse41 (select .cse43 .cse8)) (.cse42 (select .cse43 .cse7))) (or (not (<= 0 (+ .cse41 .cse42 2147483648))) (not (<= (+ c_~bag2~0 .cse42 c_~sum2~0) 2147483647)) (<= .cse32 (+ c_~bag2~0 .cse41 .cse42 c_~sum2~0)) (not (<= (+ c_~bag2~0 .cse42) 2147483647)) (not (<= (+ .cse41 .cse42) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse42 2147483648))) (not (<= 0 (+ c_~bag2~0 .cse42 c_~sum2~0 2147483648)))))))) .cse13 .cse14)) .cse1 .cse2) (or (and (forall ((v_ArrVal_735 (Array Int Int))) (let ((.cse46 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_735) c_~A~0.base))) (let ((.cse44 (select .cse46 .cse8)) (.cse45 (select .cse46 .cse7))) (or (< (+ c_~bag2~0 .cse44 .cse45 c_~sum2~0) .cse36) (not (<= (+ c_~bag2~0 .cse45) 2147483647)) (not (<= (+ c_~bag2~0 .cse44 .cse45) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse45 2147483648))) (not (<= 0 (+ c_~bag2~0 .cse44 .cse45 2147483648))))))) (forall ((v_ArrVal_735 (Array Int Int))) (let ((.cse49 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_735) c_~A~0.base))) (let ((.cse47 (select .cse49 .cse8)) (.cse48 (select .cse49 .cse7))) (or (<= .cse32 (+ c_~bag2~0 .cse47 .cse48 c_~sum2~0)) (not (<= (+ c_~bag2~0 .cse48) 2147483647)) (not (<= (+ c_~bag2~0 .cse47 .cse48) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse48 2147483648))) (not (<= 0 (+ c_~bag2~0 .cse47 .cse48 2147483648)))))))) .cse13 .cse14))) (<= 2 c_~N~0) .cse0 (or (let ((.cse53 (select .cse28 .cse8)) (.cse55 (select .cse28 .cse7))) (let ((.cse50 (not (<= (+ c_~bag2~0 .cse55) 2147483647))) (.cse51 (not (<= 0 (+ c_~bag2~0 .cse55 2147483648)))) (.cse54 (let ((.cse56 (+ c_~bag2~0 .cse55 .cse53 c_~sum2~0))) (and (< .cse56 .cse36) (<= .cse32 .cse56))))) (and (or .cse50 .cse1 .cse2 .cse51 (let ((.cse52 (not (<= 0 (+ .cse55 .cse53 2147483648))))) (and (or .cse52 .cse13 (< c_~bag2~0 (+ .cse53 1)) .cse54 .cse14) (or (not (<= (+ c_~bag2~0 .cse55 c_~sum2~0) 2147483647)) .cse52 (not (<= 0 (+ c_~bag2~0 .cse55 c_~sum2~0 2147483648))) .cse13 (not (<= (+ .cse55 .cse53) 2147483647)) .cse54 .cse14)))) (or .cse50 (not (<= (+ c_~bag2~0 .cse55 .cse53) 2147483647)) .cse51 .cse13 (not (<= 0 (+ c_~bag2~0 .cse55 .cse53 2147483648))) .cse54 .cse14)))) .cse29) (<= (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_main_~#t2~0#1.base|) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))))) is different from false [2022-11-22 02:00:17,635 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse79 (* c_~j~0 4)) (.cse1 (+ c_~bag2~0 c_~sum2~0)) (.cse78 (select |c_#memory_int| c_~A~0.base))) (let ((.cse29 (select .cse78 (+ c_~A~0.offset (* c_~i~0 4)))) (.cse2 (< (+ c_~i~0 1) c_~N~0)) (.cse0 (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse3 (not (<= .cse1 2147483647))) (.cse4 (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648)))) (.cse15 (not (< (+ c_~j~0 1) c_~N~0))) (.cse16 (< (+ 2 c_~j~0) c_~N~0)) (.cse37 (+ c_~bag1~0 c_~sum1~0 1)) (.cse33 (+ c_~bag1~0 c_~sum1~0)) (.cse9 (+ c_~A~0.offset .cse79)) (.cse10 (+ c_~A~0.offset .cse79 4)) (.cse30 (< c_~i~0 c_~N~0))) (and (or (not (= c_~sum2~0 0)) (and (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= c_~N~0 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (or (< (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) (* |c_ULTIMATE.start_create_fresh_int_array_~size#1| 4)) (and (<= 2 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| 2))) .cse0)) (or (< c_~j~0 c_~N~0) (and (< .cse1 (+ c_~sum1~0 1)) (<= c_~sum1~0 .cse1))) (or .cse2 (let ((.cse13 (+ c_~bag1~0 c_~sum1~0 .cse29)) (.cse7 (+ c_~bag1~0 c_~sum1~0 .cse29 1))) (and (or .cse3 .cse4 (and (or (and (forall ((v_ArrVal_735 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_735) c_~A~0.base))) (let ((.cse5 (select .cse8 .cse10)) (.cse6 (select .cse8 .cse9))) (or (not (<= 0 (+ .cse5 .cse6 2147483648))) (not (<= (+ c_~bag2~0 .cse6 c_~sum2~0) 2147483647)) (not (<= (+ c_~bag2~0 .cse6) 2147483647)) (not (<= (+ .cse5 .cse6) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse6 2147483648))) (< (+ c_~bag2~0 .cse5 .cse6 c_~sum2~0) .cse7) (not (<= 0 (+ c_~bag2~0 .cse6 c_~sum2~0 2147483648))))))) (forall ((v_ArrVal_735 (Array Int Int))) (let ((.cse14 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_735) c_~A~0.base))) (let ((.cse11 (select .cse14 .cse10)) (.cse12 (select .cse14 .cse9))) (or (not (<= 0 (+ .cse11 .cse12 2147483648))) (not (<= (+ c_~bag2~0 .cse12 c_~sum2~0) 2147483647)) (not (<= (+ c_~bag2~0 .cse12) 2147483647)) (not (<= (+ .cse11 .cse12) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse12 2147483648))) (not (<= 0 (+ c_~bag2~0 .cse12 c_~sum2~0 2147483648))) (<= .cse13 (+ c_~bag2~0 .cse11 .cse12 c_~sum2~0))))))) .cse15 .cse16) (or .cse15 .cse16 (and (forall ((v_ArrVal_735 (Array Int Int))) (let ((.cse19 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_735) c_~A~0.base))) (let ((.cse17 (select .cse19 .cse10)) (.cse18 (select .cse19 .cse9))) (or (not (<= 0 (+ .cse17 .cse18 2147483648))) (< c_~bag2~0 (+ .cse17 1)) (not (<= (+ c_~bag2~0 .cse18) 2147483647)) (<= .cse13 (+ c_~bag2~0 .cse17 .cse18 c_~sum2~0)))))) (forall ((v_ArrVal_735 (Array Int Int))) (let ((.cse22 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_735) c_~A~0.base))) (let ((.cse20 (select .cse22 .cse10)) (.cse21 (select .cse22 .cse9))) (or (not (<= 0 (+ .cse20 .cse21 2147483648))) (< c_~bag2~0 (+ .cse20 1)) (not (<= (+ c_~bag2~0 .cse21) 2147483647)) (< (+ c_~bag2~0 .cse20 .cse21 c_~sum2~0) .cse7))))))))) (or (and (forall ((v_ArrVal_735 (Array Int Int))) (let ((.cse25 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_735) c_~A~0.base))) (let ((.cse24 (select .cse25 .cse10)) (.cse23 (select .cse25 .cse9))) (or (not (<= (+ c_~bag2~0 .cse23) 2147483647)) (not (<= (+ c_~bag2~0 .cse24 .cse23) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse23 2147483648))) (not (<= 0 (+ c_~bag2~0 .cse24 .cse23 2147483648))) (<= .cse13 (+ c_~bag2~0 .cse24 .cse23 c_~sum2~0)))))) (forall ((v_ArrVal_735 (Array Int Int))) (let ((.cse28 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_735) c_~A~0.base))) (let ((.cse27 (select .cse28 .cse10)) (.cse26 (select .cse28 .cse9))) (or (not (<= (+ c_~bag2~0 .cse26) 2147483647)) (not (<= (+ c_~bag2~0 .cse27 .cse26) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse26 2147483648))) (< (+ c_~bag2~0 .cse27 .cse26 c_~sum2~0) .cse7) (not (<= 0 (+ c_~bag2~0 .cse27 .cse26 2147483648)))))))) .cse15 .cse16)))) (or .cse30 (and (or (and (or (and (forall ((v_ArrVal_735 (Array Int Int))) (let ((.cse34 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_735) c_~A~0.base))) (let ((.cse31 (select .cse34 .cse10)) (.cse32 (select .cse34 .cse9))) (or (not (<= 0 (+ .cse31 .cse32 2147483648))) (< c_~bag2~0 (+ .cse31 1)) (<= .cse33 (+ c_~bag2~0 .cse31 .cse32 c_~sum2~0)) (not (<= (+ c_~bag2~0 .cse32) 2147483647)))))) (forall ((v_ArrVal_735 (Array Int Int))) (let ((.cse38 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_735) c_~A~0.base))) (let ((.cse35 (select .cse38 .cse10)) (.cse36 (select .cse38 .cse9))) (or (not (<= 0 (+ .cse35 .cse36 2147483648))) (< (+ c_~bag2~0 .cse35 .cse36 c_~sum2~0) .cse37) (< c_~bag2~0 (+ .cse35 1)) (not (<= (+ c_~bag2~0 .cse36) 2147483647))))))) .cse15 .cse16) (or (and (forall ((v_ArrVal_735 (Array Int Int))) (let ((.cse41 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_735) c_~A~0.base))) (let ((.cse39 (select .cse41 .cse10)) (.cse40 (select .cse41 .cse9))) (or (not (<= 0 (+ .cse39 .cse40 2147483648))) (< (+ c_~bag2~0 .cse39 .cse40 c_~sum2~0) .cse37) (not (<= (+ c_~bag2~0 .cse40 c_~sum2~0) 2147483647)) (not (<= (+ c_~bag2~0 .cse40) 2147483647)) (not (<= (+ .cse39 .cse40) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse40 2147483648))) (not (<= 0 (+ c_~bag2~0 .cse40 c_~sum2~0 2147483648))))))) (forall ((v_ArrVal_735 (Array Int Int))) (let ((.cse44 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_735) c_~A~0.base))) (let ((.cse42 (select .cse44 .cse10)) (.cse43 (select .cse44 .cse9))) (or (not (<= 0 (+ .cse42 .cse43 2147483648))) (not (<= (+ c_~bag2~0 .cse43 c_~sum2~0) 2147483647)) (<= .cse33 (+ c_~bag2~0 .cse42 .cse43 c_~sum2~0)) (not (<= (+ c_~bag2~0 .cse43) 2147483647)) (not (<= (+ .cse42 .cse43) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse43 2147483648))) (not (<= 0 (+ c_~bag2~0 .cse43 c_~sum2~0 2147483648)))))))) .cse15 .cse16)) .cse3 .cse4) (or (and (forall ((v_ArrVal_735 (Array Int Int))) (let ((.cse47 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_735) c_~A~0.base))) (let ((.cse45 (select .cse47 .cse10)) (.cse46 (select .cse47 .cse9))) (or (< (+ c_~bag2~0 .cse45 .cse46 c_~sum2~0) .cse37) (not (<= (+ c_~bag2~0 .cse46) 2147483647)) (not (<= (+ c_~bag2~0 .cse45 .cse46) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse46 2147483648))) (not (<= 0 (+ c_~bag2~0 .cse45 .cse46 2147483648))))))) (forall ((v_ArrVal_735 (Array Int Int))) (let ((.cse50 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_735) c_~A~0.base))) (let ((.cse48 (select .cse50 .cse10)) (.cse49 (select .cse50 .cse9))) (or (<= .cse33 (+ c_~bag2~0 .cse48 .cse49 c_~sum2~0)) (not (<= (+ c_~bag2~0 .cse49) 2147483647)) (not (<= (+ c_~bag2~0 .cse48 .cse49) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse49 2147483648))) (not (<= 0 (+ c_~bag2~0 .cse48 .cse49 2147483648)))))))) .cse15 .cse16))) (<= c_~sum1~0 2147483647) (<= 2 c_~N~0) (= c_~sum1~0 c_~sum2~0) (or (let ((.cse57 (+ |c_thread1Thread1of1ForFork0_plus_#in~b#1| .cse29 |c_thread1Thread1of1ForFork0_plus_#in~a#1| 1)) (.cse53 (+ |c_thread1Thread1of1ForFork0_plus_#in~b#1| .cse29 |c_thread1Thread1of1ForFork0_plus_#in~a#1|))) (and (or (and (forall ((v_ArrVal_735 (Array Int Int))) (let ((.cse54 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_735) c_~A~0.base))) (let ((.cse52 (select .cse54 .cse10)) (.cse51 (select .cse54 .cse9))) (or (not (<= (+ c_~bag2~0 .cse51) 2147483647)) (not (<= (+ c_~bag2~0 .cse52 .cse51) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse51 2147483648))) (<= .cse53 (+ c_~bag2~0 .cse52 .cse51 c_~sum2~0)) (not (<= 0 (+ c_~bag2~0 .cse52 .cse51 2147483648))))))) (forall ((v_ArrVal_735 (Array Int Int))) (let ((.cse58 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_735) c_~A~0.base))) (let ((.cse55 (select .cse58 .cse10)) (.cse56 (select .cse58 .cse9))) (or (< (+ c_~bag2~0 .cse55 .cse56 c_~sum2~0) .cse57) (not (<= (+ c_~bag2~0 .cse56) 2147483647)) (not (<= (+ c_~bag2~0 .cse55 .cse56) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse56 2147483648))) (not (<= 0 (+ c_~bag2~0 .cse55 .cse56 2147483648)))))))) .cse15 .cse16) (or (and (or (and (forall ((v_ArrVal_735 (Array Int Int))) (let ((.cse61 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_735) c_~A~0.base))) (let ((.cse59 (select .cse61 .cse10)) (.cse60 (select .cse61 .cse9))) (or (not (<= 0 (+ .cse59 .cse60 2147483648))) (not (<= (+ c_~bag2~0 .cse60 c_~sum2~0) 2147483647)) (< (+ c_~bag2~0 .cse59 .cse60 c_~sum2~0) .cse57) (not (<= (+ c_~bag2~0 .cse60) 2147483647)) (not (<= (+ .cse59 .cse60) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse60 2147483648))) (not (<= 0 (+ c_~bag2~0 .cse60 c_~sum2~0 2147483648))))))) (forall ((v_ArrVal_735 (Array Int Int))) (let ((.cse64 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_735) c_~A~0.base))) (let ((.cse62 (select .cse64 .cse10)) (.cse63 (select .cse64 .cse9))) (or (not (<= 0 (+ .cse62 .cse63 2147483648))) (not (<= (+ c_~bag2~0 .cse63 c_~sum2~0) 2147483647)) (not (<= (+ c_~bag2~0 .cse63) 2147483647)) (not (<= (+ .cse62 .cse63) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse63 2147483648))) (<= .cse53 (+ c_~bag2~0 .cse62 .cse63 c_~sum2~0)) (not (<= 0 (+ c_~bag2~0 .cse63 c_~sum2~0 2147483648)))))))) .cse15 .cse16) (or (and (forall ((v_ArrVal_735 (Array Int Int))) (let ((.cse67 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_735) c_~A~0.base))) (let ((.cse65 (select .cse67 .cse10)) (.cse66 (select .cse67 .cse9))) (or (not (<= 0 (+ .cse65 .cse66 2147483648))) (< c_~bag2~0 (+ .cse65 1)) (< (+ c_~bag2~0 .cse65 .cse66 c_~sum2~0) .cse57) (not (<= (+ c_~bag2~0 .cse66) 2147483647)))))) (forall ((v_ArrVal_735 (Array Int Int))) (let ((.cse70 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_735) c_~A~0.base))) (let ((.cse68 (select .cse70 .cse10)) (.cse69 (select .cse70 .cse9))) (or (not (<= 0 (+ .cse68 .cse69 2147483648))) (< c_~bag2~0 (+ .cse68 1)) (not (<= (+ c_~bag2~0 .cse69) 2147483647)) (<= .cse53 (+ c_~bag2~0 .cse68 .cse69 c_~sum2~0))))))) .cse15 .cse16)) .cse3 .cse4))) .cse2) (<= 0 (+ c_~sum1~0 2147483648)) .cse0 (or (let ((.cse74 (select .cse78 .cse10)) (.cse76 (select .cse78 .cse9))) (let ((.cse71 (not (<= (+ c_~bag2~0 .cse76) 2147483647))) (.cse72 (not (<= 0 (+ c_~bag2~0 .cse76 2147483648)))) (.cse75 (let ((.cse77 (+ c_~bag2~0 .cse76 .cse74 c_~sum2~0))) (and (< .cse77 .cse37) (<= .cse33 .cse77))))) (and (or .cse71 .cse3 .cse4 .cse72 (let ((.cse73 (not (<= 0 (+ .cse76 .cse74 2147483648))))) (and (or .cse73 .cse15 (< c_~bag2~0 (+ .cse74 1)) .cse75 .cse16) (or (not (<= (+ c_~bag2~0 .cse76 c_~sum2~0) 2147483647)) .cse73 (not (<= 0 (+ c_~bag2~0 .cse76 c_~sum2~0 2147483648))) .cse15 (not (<= (+ .cse76 .cse74) 2147483647)) .cse75 .cse16)))) (or .cse71 (not (<= (+ c_~bag2~0 .cse76 .cse74) 2147483647)) .cse72 .cse15 (not (<= 0 (+ c_~bag2~0 .cse76 .cse74 2147483648))) .cse75 .cse16)))) .cse30) (<= (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_main_~#t2~0#1.base|) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))))) is different from false [2022-11-22 02:00:32,399 WARN L233 SmtUtils]: Spent 10.96s on a formula simplification. DAG size of input: 180 DAG size of output: 118 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 02:00:35,614 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (or (not (= c_~sum2~0 0)) (and (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= c_~N~0 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (or (< (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) (* |c_ULTIMATE.start_create_fresh_int_array_~size#1| 4)) (and (<= 2 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| 2))) .cse0)) (or (< c_~i~0 c_~N~0) (let ((.cse25 (* c_~j~0 4))) (let ((.cse9 (+ c_~bag1~0 c_~sum1~0 1)) (.cse3 (+ c_~bag1~0 c_~sum1~0)) (.cse5 (+ c_~A~0.offset .cse25)) (.cse6 (+ c_~A~0.offset .cse25 4)) (.cse11 (not (< (+ c_~j~0 1) c_~N~0))) (.cse12 (< (+ 2 c_~j~0) c_~N~0))) (and (or (and (or (and (forall ((v_ArrVal_735 (Array Int Int))) (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_735) c_~A~0.base))) (let ((.cse1 (select .cse4 .cse6)) (.cse2 (select .cse4 .cse5))) (or (not (<= 0 (+ .cse1 .cse2 2147483648))) (< c_~bag2~0 (+ .cse1 1)) (<= .cse3 (+ c_~bag2~0 .cse1 .cse2 c_~sum2~0)) (not (<= (+ c_~bag2~0 .cse2) 2147483647)))))) (forall ((v_ArrVal_735 (Array Int Int))) (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_735) c_~A~0.base))) (let ((.cse7 (select .cse10 .cse6)) (.cse8 (select .cse10 .cse5))) (or (not (<= 0 (+ .cse7 .cse8 2147483648))) (< (+ c_~bag2~0 .cse7 .cse8 c_~sum2~0) .cse9) (< c_~bag2~0 (+ .cse7 1)) (not (<= (+ c_~bag2~0 .cse8) 2147483647))))))) .cse11 .cse12) (or (and (forall ((v_ArrVal_735 (Array Int Int))) (let ((.cse15 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_735) c_~A~0.base))) (let ((.cse13 (select .cse15 .cse6)) (.cse14 (select .cse15 .cse5))) (or (not (<= 0 (+ .cse13 .cse14 2147483648))) (< (+ c_~bag2~0 .cse13 .cse14 c_~sum2~0) .cse9) (not (<= (+ c_~bag2~0 .cse14 c_~sum2~0) 2147483647)) (not (<= (+ c_~bag2~0 .cse14) 2147483647)) (not (<= (+ .cse13 .cse14) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse14 2147483648))) (not (<= 0 (+ c_~bag2~0 .cse14 c_~sum2~0 2147483648))))))) (forall ((v_ArrVal_735 (Array Int Int))) (let ((.cse18 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_735) c_~A~0.base))) (let ((.cse16 (select .cse18 .cse6)) (.cse17 (select .cse18 .cse5))) (or (not (<= 0 (+ .cse16 .cse17 2147483648))) (not (<= (+ c_~bag2~0 .cse17 c_~sum2~0) 2147483647)) (<= .cse3 (+ c_~bag2~0 .cse16 .cse17 c_~sum2~0)) (not (<= (+ c_~bag2~0 .cse17) 2147483647)) (not (<= (+ .cse16 .cse17) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse17 2147483648))) (not (<= 0 (+ c_~bag2~0 .cse17 c_~sum2~0 2147483648)))))))) .cse11 .cse12)) (not (<= (+ c_~bag2~0 c_~sum2~0) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648)))) (or (and (forall ((v_ArrVal_735 (Array Int Int))) (let ((.cse21 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_735) c_~A~0.base))) (let ((.cse19 (select .cse21 .cse6)) (.cse20 (select .cse21 .cse5))) (or (< (+ c_~bag2~0 .cse19 .cse20 c_~sum2~0) .cse9) (not (<= (+ c_~bag2~0 .cse20) 2147483647)) (not (<= (+ c_~bag2~0 .cse19 .cse20) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse20 2147483648))) (not (<= 0 (+ c_~bag2~0 .cse19 .cse20 2147483648))))))) (forall ((v_ArrVal_735 (Array Int Int))) (let ((.cse24 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_735) c_~A~0.base))) (let ((.cse22 (select .cse24 .cse6)) (.cse23 (select .cse24 .cse5))) (or (<= .cse3 (+ c_~bag2~0 .cse22 .cse23 c_~sum2~0)) (not (<= (+ c_~bag2~0 .cse23) 2147483647)) (not (<= (+ c_~bag2~0 .cse22 .cse23) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse23 2147483648))) (not (<= 0 (+ c_~bag2~0 .cse22 .cse23 2147483648)))))))) .cse11 .cse12))))) (<= 2 c_~N~0) .cse0 (<= (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_main_~#t2~0#1.base|) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) is different from false [2022-11-22 02:00:35,651 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~bag2~0 c_~sum2~0)) (.cse0 (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (or (not (= c_~sum2~0 0)) (and (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= c_~N~0 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (or (< (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) (* |c_ULTIMATE.start_create_fresh_int_array_~size#1| 4)) (and (<= 2 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| 2))) .cse0)) (or (< c_~j~0 c_~N~0) (and (< .cse1 (+ c_~sum1~0 1)) (<= c_~sum1~0 .cse1))) (or (< c_~i~0 c_~N~0) (let ((.cse26 (* c_~j~0 4))) (let ((.cse10 (+ c_~bag1~0 c_~sum1~0 1)) (.cse4 (+ c_~bag1~0 c_~sum1~0)) (.cse6 (+ c_~A~0.offset .cse26)) (.cse7 (+ c_~A~0.offset .cse26 4)) (.cse12 (not (< (+ c_~j~0 1) c_~N~0))) (.cse13 (< (+ 2 c_~j~0) c_~N~0))) (and (or (and (or (and (forall ((v_ArrVal_735 (Array Int Int))) (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_735) c_~A~0.base))) (let ((.cse2 (select .cse5 .cse7)) (.cse3 (select .cse5 .cse6))) (or (not (<= 0 (+ .cse2 .cse3 2147483648))) (< c_~bag2~0 (+ .cse2 1)) (<= .cse4 (+ c_~bag2~0 .cse2 .cse3 c_~sum2~0)) (not (<= (+ c_~bag2~0 .cse3) 2147483647)))))) (forall ((v_ArrVal_735 (Array Int Int))) (let ((.cse11 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_735) c_~A~0.base))) (let ((.cse8 (select .cse11 .cse7)) (.cse9 (select .cse11 .cse6))) (or (not (<= 0 (+ .cse8 .cse9 2147483648))) (< (+ c_~bag2~0 .cse8 .cse9 c_~sum2~0) .cse10) (< c_~bag2~0 (+ .cse8 1)) (not (<= (+ c_~bag2~0 .cse9) 2147483647))))))) .cse12 .cse13) (or (and (forall ((v_ArrVal_735 (Array Int Int))) (let ((.cse16 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_735) c_~A~0.base))) (let ((.cse14 (select .cse16 .cse7)) (.cse15 (select .cse16 .cse6))) (or (not (<= 0 (+ .cse14 .cse15 2147483648))) (< (+ c_~bag2~0 .cse14 .cse15 c_~sum2~0) .cse10) (not (<= (+ c_~bag2~0 .cse15 c_~sum2~0) 2147483647)) (not (<= (+ c_~bag2~0 .cse15) 2147483647)) (not (<= (+ .cse14 .cse15) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse15 2147483648))) (not (<= 0 (+ c_~bag2~0 .cse15 c_~sum2~0 2147483648))))))) (forall ((v_ArrVal_735 (Array Int Int))) (let ((.cse19 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_735) c_~A~0.base))) (let ((.cse17 (select .cse19 .cse7)) (.cse18 (select .cse19 .cse6))) (or (not (<= 0 (+ .cse17 .cse18 2147483648))) (not (<= (+ c_~bag2~0 .cse18 c_~sum2~0) 2147483647)) (<= .cse4 (+ c_~bag2~0 .cse17 .cse18 c_~sum2~0)) (not (<= (+ c_~bag2~0 .cse18) 2147483647)) (not (<= (+ .cse17 .cse18) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse18 2147483648))) (not (<= 0 (+ c_~bag2~0 .cse18 c_~sum2~0 2147483648)))))))) .cse12 .cse13)) (not (<= .cse1 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648)))) (or (and (forall ((v_ArrVal_735 (Array Int Int))) (let ((.cse22 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_735) c_~A~0.base))) (let ((.cse20 (select .cse22 .cse7)) (.cse21 (select .cse22 .cse6))) (or (< (+ c_~bag2~0 .cse20 .cse21 c_~sum2~0) .cse10) (not (<= (+ c_~bag2~0 .cse21) 2147483647)) (not (<= (+ c_~bag2~0 .cse20 .cse21) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse21 2147483648))) (not (<= 0 (+ c_~bag2~0 .cse20 .cse21 2147483648))))))) (forall ((v_ArrVal_735 (Array Int Int))) (let ((.cse25 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_735) c_~A~0.base))) (let ((.cse23 (select .cse25 .cse7)) (.cse24 (select .cse25 .cse6))) (or (<= .cse4 (+ c_~bag2~0 .cse23 .cse24 c_~sum2~0)) (not (<= (+ c_~bag2~0 .cse24) 2147483647)) (not (<= (+ c_~bag2~0 .cse23 .cse24) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse24 2147483648))) (not (<= 0 (+ c_~bag2~0 .cse23 .cse24 2147483648)))))))) .cse12 .cse13))))) (<= c_~sum1~0 2147483647) (<= 2 c_~N~0) (= c_~sum1~0 c_~sum2~0) (<= 0 (+ c_~sum1~0 2147483648)) .cse0 (<= (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_main_~#t2~0#1.base|) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) is different from false [2022-11-22 02:00:55,918 WARN L233 SmtUtils]: Spent 11.71s on a formula simplification. DAG size of input: 178 DAG size of output: 134 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 02:01:07,052 WARN L233 SmtUtils]: Spent 10.63s on a formula simplification. DAG size of input: 150 DAG size of output: 114 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 02:01:15,451 WARN L233 SmtUtils]: Spent 7.77s on a formula simplification. DAG size of input: 227 DAG size of output: 223 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 02:01:25,749 WARN L233 SmtUtils]: Spent 9.20s on a formula simplification. DAG size of input: 175 DAG size of output: 155 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 02:01:41,559 WARN L233 SmtUtils]: Spent 14.60s on a formula simplification. DAG size of input: 174 DAG size of output: 113 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 02:01:50,677 WARN L233 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 208 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 02:01:56,598 WARN L233 SmtUtils]: Spent 5.35s on a formula simplification that was a NOOP. DAG size: 180 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 02:02:12,767 WARN L233 SmtUtils]: Spent 8.45s on a formula simplification. DAG size of input: 115 DAG size of output: 97 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 02:02:30,856 WARN L233 SmtUtils]: Spent 10.71s on a formula simplification. DAG size of input: 161 DAG size of output: 103 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)