./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/popl20-more-max-array.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a 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_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/config/TaipanReach.xml -i ../../sv-benchmarks/c/weaver/popl20-more-max-array.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI --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 a87860dbf851812846995aa918799e2b576306268e8c461660702f868d3b2804 --- 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-5e519f3 [2022-11-03 03:34:34,054 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 03:34:34,058 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 03:34:34,108 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 03:34:34,109 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 03:34:34,110 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 03:34:34,111 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 03:34:34,113 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 03:34:34,115 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 03:34:34,116 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 03:34:34,117 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 03:34:34,118 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 03:34:34,118 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 03:34:34,120 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 03:34:34,121 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 03:34:34,122 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 03:34:34,123 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 03:34:34,124 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 03:34:34,126 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 03:34:34,132 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 03:34:34,134 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 03:34:34,139 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 03:34:34,141 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 03:34:34,148 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 03:34:34,152 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 03:34:34,153 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 03:34:34,153 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 03:34:34,154 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 03:34:34,159 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 03:34:34,161 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 03:34:34,161 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 03:34:34,162 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 03:34:34,163 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 03:34:34,164 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 03:34:34,166 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 03:34:34,167 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 03:34:34,168 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 03:34:34,169 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 03:34:34,169 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 03:34:34,170 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 03:34:34,171 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 03:34:34,175 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-03 03:34:34,217 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 03:34:34,217 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 03:34:34,218 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 03:34:34,218 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 03:34:34,219 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 03:34:34,220 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 03:34:34,220 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 03:34:34,220 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 03:34:34,220 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 03:34:34,221 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 03:34:34,222 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 03:34:34,223 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 03:34:34,223 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 03:34:34,223 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 03:34:34,223 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 03:34:34,224 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 03:34:34,224 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 03:34:34,224 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 03:34:34,225 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 03:34:34,225 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 03:34:34,225 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 03:34:34,226 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 03:34:34,226 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 03:34:34,226 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 03:34:34,226 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 03:34:34,227 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 03:34:34,227 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 03:34:34,228 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 03:34:34,228 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 03:34:34,228 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 03:34:34,228 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 03:34:34,229 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 03:34:34,229 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 03:34:34,229 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 03:34:34,229 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 03:34:34,230 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 03:34:34,230 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 03:34:34,230 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 03:34:34,230 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 03:34:34,231 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 03:34:34,231 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 03:34:34,231 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_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/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_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI 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 -> a87860dbf851812846995aa918799e2b576306268e8c461660702f868d3b2804 [2022-11-03 03:34:34,511 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 03:34:34,534 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 03:34:34,537 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 03:34:34,539 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 03:34:34,539 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 03:34:34,541 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/weaver/popl20-more-max-array.wvr.c [2022-11-03 03:34:34,607 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/data/01a780e3d/2f1c594f684a436cb7c4452f98e989e5/FLAGf3c6bca51 [2022-11-03 03:34:35,038 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 03:34:35,038 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/sv-benchmarks/c/weaver/popl20-more-max-array.wvr.c [2022-11-03 03:34:35,047 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/data/01a780e3d/2f1c594f684a436cb7c4452f98e989e5/FLAGf3c6bca51 [2022-11-03 03:34:35,399 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/data/01a780e3d/2f1c594f684a436cb7c4452f98e989e5 [2022-11-03 03:34:35,404 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 03:34:35,407 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 03:34:35,411 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 03:34:35,411 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 03:34:35,418 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 03:34:35,419 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 03:34:35" (1/1) ... [2022-11-03 03:34:35,420 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73a5f425 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:34:35, skipping insertion in model container [2022-11-03 03:34:35,420 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 03:34:35" (1/1) ... [2022-11-03 03:34:35,428 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 03:34:35,467 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 03:34:35,721 WARN L230 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_364e6386-f3ef-419d-b3aa-e08fca26a5ab/sv-benchmarks/c/weaver/popl20-more-max-array.wvr.c[2553,2566] [2022-11-03 03:34:35,742 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 03:34:35,751 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 03:34:35,772 WARN L230 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_364e6386-f3ef-419d-b3aa-e08fca26a5ab/sv-benchmarks/c/weaver/popl20-more-max-array.wvr.c[2553,2566] [2022-11-03 03:34:35,776 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 03:34:35,790 INFO L208 MainTranslator]: Completed translation [2022-11-03 03:34:35,790 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:34:35 WrapperNode [2022-11-03 03:34:35,791 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 03:34:35,792 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 03:34:35,792 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 03:34:35,792 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 03:34:35,800 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:34:35" (1/1) ... [2022-11-03 03:34:35,809 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:34:35" (1/1) ... [2022-11-03 03:34:35,831 INFO L138 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 101 [2022-11-03 03:34:35,834 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 03:34:35,835 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 03:34:35,835 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 03:34:35,835 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 03:34:35,845 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:34:35" (1/1) ... [2022-11-03 03:34:35,845 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:34:35" (1/1) ... [2022-11-03 03:34:35,862 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:34:35" (1/1) ... [2022-11-03 03:34:35,863 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:34:35" (1/1) ... [2022-11-03 03:34:35,882 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:34:35" (1/1) ... [2022-11-03 03:34:35,886 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:34:35" (1/1) ... [2022-11-03 03:34:35,887 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:34:35" (1/1) ... [2022-11-03 03:34:35,896 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:34:35" (1/1) ... [2022-11-03 03:34:35,899 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 03:34:35,900 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 03:34:35,900 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 03:34:35,900 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 03:34:35,906 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:34:35" (1/1) ... [2022-11-03 03:34:35,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 03:34:35,924 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:34:35,944 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 03:34:35,957 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 03:34:35,989 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 03:34:35,989 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-03 03:34:35,989 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-03 03:34:35,989 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-03 03:34:35,989 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-03 03:34:35,989 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-03 03:34:35,990 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-03 03:34:35,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-03 03:34:35,990 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-03 03:34:35,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-03 03:34:35,990 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-03 03:34:35,990 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-03 03:34:35,991 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-03 03:34:35,991 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 03:34:35,991 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 03:34:35,991 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-03 03:34:35,992 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-03 03:34:35,994 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-03 03:34:36,096 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 03:34:36,098 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 03:34:36,571 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 03:34:36,641 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 03:34:36,641 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-03 03:34:36,644 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 03:34:36 BoogieIcfgContainer [2022-11-03 03:34:36,644 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 03:34:36,652 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 03:34:36,652 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 03:34:36,656 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 03:34:36,656 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 03:34:35" (1/3) ... [2022-11-03 03:34:36,657 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ba22fe0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 03:34:36, skipping insertion in model container [2022-11-03 03:34:36,657 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:34:35" (2/3) ... [2022-11-03 03:34:36,658 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ba22fe0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 03:34:36, skipping insertion in model container [2022-11-03 03:34:36,658 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 03:34:36" (3/3) ... [2022-11-03 03:34:36,659 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-max-array.wvr.c [2022-11-03 03:34:36,669 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-03 03:34:36,681 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 03:34:36,681 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-03 03:34:36,681 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-03 03:34:36,752 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-03 03:34:36,790 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-03 03:34:36,806 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 153 transitions, 330 flow [2022-11-03 03:34:36,809 INFO L112 LiptonReduction]: Starting Lipton reduction on Petri net that has 151 places, 153 transitions, 330 flow [2022-11-03 03:34:36,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 151 places, 153 transitions, 330 flow [2022-11-03 03:34:36,885 INFO L130 PetriNetUnfolder]: 12/150 cut-off events. [2022-11-03 03:34:36,885 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-03 03:34:36,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 163 conditions, 150 events. 12/150 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 93 event pairs, 0 based on Foata normal form. 0/137 useless extension candidates. Maximal degree in co-relation 112. Up to 2 conditions per place. [2022-11-03 03:34:36,892 INFO L118 LiptonReduction]: Number of co-enabled transitions 1320 [2022-11-03 03:34:43,540 INFO L133 LiptonReduction]: Checked pairs total: 1507 [2022-11-03 03:34:43,540 INFO L135 LiptonReduction]: Total number of compositions: 148 [2022-11-03 03:34:43,548 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 34 places, 28 transitions, 80 flow [2022-11-03 03:34:43,592 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 107 states, 106 states have (on average 3.0849056603773586) internal successors, (327), 106 states have internal predecessors, (327), 0 states have call successors, (0), 0 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-03 03:34:43,631 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 03:34:43,640 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;@67c39765, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 03:34:43,642 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-11-03 03:34:43,645 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 106 states have (on average 3.0849056603773586) internal successors, (327), 106 states have internal predecessors, (327), 0 states have call successors, (0), 0 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-03 03:34:43,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-03 03:34:43,658 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:34:43,659 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:34:43,660 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-03 03:34:43,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:34:43,668 INFO L85 PathProgramCache]: Analyzing trace with hash 369386519, now seen corresponding path program 1 times [2022-11-03 03:34:43,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:34:43,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63927205] [2022-11-03 03:34:43,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:34:43,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:34:43,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:34:44,344 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-03 03:34:44,344 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:34:44,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63927205] [2022-11-03 03:34:44,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63927205] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:34:44,346 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:34:44,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 03:34:44,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252939181] [2022-11-03 03:34:44,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:34:44,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:34:44,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:34:44,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:34:44,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:34:44,384 INFO L87 Difference]: Start difference. First operand has 107 states, 106 states have (on average 3.0849056603773586) internal successors, (327), 106 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:34:44,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:34:44,490 INFO L93 Difference]: Finished difference Result 108 states and 328 transitions. [2022-11-03 03:34:44,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:34:44,493 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-03 03:34:44,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:34:44,508 INFO L225 Difference]: With dead ends: 108 [2022-11-03 03:34:44,508 INFO L226 Difference]: Without dead ends: 108 [2022-11-03 03:34:44,509 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:34:44,513 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:34:44,517 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:34:44,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-11-03 03:34:44,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2022-11-03 03:34:44,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 107 states have (on average 3.0654205607476634) internal successors, (328), 107 states have internal predecessors, (328), 0 states have call successors, (0), 0 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-03 03:34:44,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 328 transitions. [2022-11-03 03:34:44,566 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 328 transitions. Word has length 20 [2022-11-03 03:34:44,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:34:44,567 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 328 transitions. [2022-11-03 03:34:44,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:34:44,567 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 328 transitions. [2022-11-03 03:34:44,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-03 03:34:44,569 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:34:44,569 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:34:44,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-03 03:34:44,570 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-03 03:34:44,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:34:44,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1359216226, now seen corresponding path program 1 times [2022-11-03 03:34:44,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:34:44,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076924311] [2022-11-03 03:34:44,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:34:44,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:34:44,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:34:44,879 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:34:44,879 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:34:44,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076924311] [2022-11-03 03:34:44,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076924311] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:34:44,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [443689135] [2022-11-03 03:34:44,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:34:44,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:34:44,888 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:34:44,895 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:34:44,901 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-03 03:34:45,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:34:45,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-03 03:34:45,009 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:34:45,169 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:34:45,169 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:34:45,253 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-03 03:34:45,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [443689135] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-03 03:34:45,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-03 03:34:45,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 13 [2022-11-03 03:34:45,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775498197] [2022-11-03 03:34:45,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:34:45,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-03 03:34:45,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:34:45,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-03 03:34:45,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2022-11-03 03:34:45,257 INFO L87 Difference]: Start difference. First operand 108 states and 328 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:34:45,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:34:45,521 INFO L93 Difference]: Finished difference Result 134 states and 413 transitions. [2022-11-03 03:34:45,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 03:34:45,522 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-03 03:34:45,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:34:45,524 INFO L225 Difference]: With dead ends: 134 [2022-11-03 03:34:45,524 INFO L226 Difference]: Without dead ends: 134 [2022-11-03 03:34:45,524 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 32 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2022-11-03 03:34:45,526 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 63 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 03:34:45,526 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 11 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 03:34:45,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-11-03 03:34:45,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2022-11-03 03:34:45,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 133 states have (on average 3.1052631578947367) internal successors, (413), 133 states have internal predecessors, (413), 0 states have call successors, (0), 0 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-03 03:34:45,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 413 transitions. [2022-11-03 03:34:45,542 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 413 transitions. Word has length 21 [2022-11-03 03:34:45,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:34:45,543 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 413 transitions. [2022-11-03 03:34:45,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:34:45,544 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 413 transitions. [2022-11-03 03:34:45,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-03 03:34:45,545 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:34:45,545 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:34:45,582 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-03 03:34:45,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:34:45,771 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-03 03:34:45,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:34:45,771 INFO L85 PathProgramCache]: Analyzing trace with hash 499136190, now seen corresponding path program 1 times [2022-11-03 03:34:45,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:34:45,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184039026] [2022-11-03 03:34:45,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:34:45,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:34:45,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:34:45,932 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-03 03:34:45,932 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:34:45,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184039026] [2022-11-03 03:34:45,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184039026] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:34:45,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [744366084] [2022-11-03 03:34:45,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:34:45,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:34:45,935 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:34:45,939 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:34:45,961 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-03 03:34:46,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:34:46,052 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-03 03:34:46,054 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:34:46,148 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-03 03:34:46,149 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:34:46,214 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-03 03:34:46,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [744366084] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-03 03:34:46,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-03 03:34:46,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2022-11-03 03:34:46,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532498669] [2022-11-03 03:34:46,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:34:46,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 03:34:46,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:34:46,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 03:34:46,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-03 03:34:46,219 INFO L87 Difference]: Start difference. First operand 134 states and 413 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:34:46,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:34:46,323 INFO L93 Difference]: Finished difference Result 166 states and 519 transitions. [2022-11-03 03:34:46,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 03:34:46,323 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-03 03:34:46,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:34:46,330 INFO L225 Difference]: With dead ends: 166 [2022-11-03 03:34:46,330 INFO L226 Difference]: Without dead ends: 166 [2022-11-03 03:34:46,330 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-11-03 03:34:46,334 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 44 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:34:46,341 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 7 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:34:46,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-11-03 03:34:46,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2022-11-03 03:34:46,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 165 states have (on average 3.1454545454545455) internal successors, (519), 165 states have internal predecessors, (519), 0 states have call successors, (0), 0 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-03 03:34:46,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 519 transitions. [2022-11-03 03:34:46,374 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 519 transitions. Word has length 22 [2022-11-03 03:34:46,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:34:46,375 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 519 transitions. [2022-11-03 03:34:46,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:34:46,376 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 519 transitions. [2022-11-03 03:34:46,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-03 03:34:46,380 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:34:46,381 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:34:46,421 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-03 03:34:46,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:34:46,607 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-03 03:34:46,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:34:46,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1917425969, now seen corresponding path program 1 times [2022-11-03 03:34:46,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:34:46,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149997753] [2022-11-03 03:34:46,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:34:46,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:34:46,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:34:47,697 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-03 03:34:47,697 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:34:47,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149997753] [2022-11-03 03:34:47,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149997753] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:34:47,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1837778558] [2022-11-03 03:34:47,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:34:47,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:34:47,698 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:34:47,700 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:34:47,718 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-03 03:34:47,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:34:47,813 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-03 03:34:47,816 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:34:48,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:34:48,266 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 35 treesize of output 33 [2022-11-03 03:34:48,442 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:34:48,445 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:34:48,445 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 66 treesize of output 39 [2022-11-03 03:34:48,582 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-03 03:34:48,582 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:34:48,778 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~A~0.offset (* 4 c_~M~0)))) (and (forall ((v_ArrVal_153 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_153) c_~A~0.base) .cse1))) (or (not (< c_~max2~0 .cse0)) (= c_~max1~0 .cse0)))) (or (= c_~max1~0 c_~max2~0) (forall ((v_ArrVal_153 (Array Int Int))) (< c_~max2~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_153) c_~A~0.base) .cse1)))))) is different from false [2022-11-03 03:34:48,828 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:34:48,830 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 143 treesize of output 107 [2022-11-03 03:34:48,840 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 72 treesize of output 60 [2022-11-03 03:34:48,851 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 60 treesize of output 54 [2022-11-03 03:34:49,223 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-03 03:34:49,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1837778558] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:34:49,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1922327021] [2022-11-03 03:34:49,232 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-03 03:34:49,235 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:34:49,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 26 [2022-11-03 03:34:49,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319319986] [2022-11-03 03:34:49,235 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:34:49,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-03 03:34:49,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:34:49,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-03 03:34:49,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=595, Unknown=1, NotChecked=50, Total=756 [2022-11-03 03:34:49,237 INFO L87 Difference]: Start difference. First operand 166 states and 519 transitions. Second operand has 28 states, 27 states have (on average 2.259259259259259) internal successors, (61), 27 states have internal predecessors, (61), 0 states have call successors, (0), 0 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-03 03:34:51,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:34:51,419 INFO L93 Difference]: Finished difference Result 420 states and 1260 transitions. [2022-11-03 03:34:51,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-03 03:34:51,419 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.259259259259259) internal successors, (61), 27 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-03 03:34:51,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:34:51,429 INFO L225 Difference]: With dead ends: 420 [2022-11-03 03:34:51,429 INFO L226 Difference]: Without dead ends: 406 [2022-11-03 03:34:51,434 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=279, Invalid=1364, Unknown=1, NotChecked=78, Total=1722 [2022-11-03 03:34:51,435 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 220 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 1238 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 1360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 102 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:34:51,437 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 110 Invalid, 1360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1238 Invalid, 0 Unknown, 102 Unchecked, 1.1s Time] [2022-11-03 03:34:51,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2022-11-03 03:34:51,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 288. [2022-11-03 03:34:51,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 287 states have (on average 3.1707317073170733) internal successors, (910), 287 states have internal predecessors, (910), 0 states have call successors, (0), 0 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-03 03:34:51,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 910 transitions. [2022-11-03 03:34:51,471 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 910 transitions. Word has length 23 [2022-11-03 03:34:51,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:34:51,472 INFO L495 AbstractCegarLoop]: Abstraction has 288 states and 910 transitions. [2022-11-03 03:34:51,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.259259259259259) internal successors, (61), 27 states have internal predecessors, (61), 0 states have call successors, (0), 0 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-03 03:34:51,472 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 910 transitions. [2022-11-03 03:34:51,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-03 03:34:51,474 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:34:51,475 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:34:51,504 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-03 03:34:51,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:34:51,687 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-03 03:34:51,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:34:51,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1376108675, now seen corresponding path program 2 times [2022-11-03 03:34:51,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:34:51,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450892362] [2022-11-03 03:34:51,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:34:51,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:34:51,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:34:52,460 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-03 03:34:52,461 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:34:52,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450892362] [2022-11-03 03:34:52,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450892362] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:34:52,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [42281139] [2022-11-03 03:34:52,461 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 03:34:52,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:34:52,462 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:34:52,463 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:34:52,490 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-03 03:34:52,584 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-03 03:34:52,584 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:34:52,586 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 34 conjunts are in the unsatisfiable core [2022-11-03 03:34:52,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:34:53,069 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:34:53,069 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 79 treesize of output 81 [2022-11-03 03:34:53,500 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-03 03:34:53,500 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:34:53,619 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:34:53,620 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 87 treesize of output 51 [2022-11-03 03:34:53,996 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-03 03:34:53,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [42281139] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:34:53,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1758167050] [2022-11-03 03:34:53,998 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java: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-03 03:34:54,003 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:34:54,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 27 [2022-11-03 03:34:54,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619589665] [2022-11-03 03:34:54,003 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:34:54,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-03 03:34:54,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:34:54,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-03 03:34:54,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=645, Unknown=0, NotChecked=0, Total=812 [2022-11-03 03:34:54,005 INFO L87 Difference]: Start difference. First operand 288 states and 910 transitions. Second operand has 29 states, 28 states have (on average 2.107142857142857) internal successors, (59), 28 states have internal predecessors, (59), 0 states have call successors, (0), 0 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-03 03:34:56,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:34:56,233 INFO L93 Difference]: Finished difference Result 523 states and 1599 transitions. [2022-11-03 03:34:56,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-03 03:34:56,234 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.107142857142857) internal successors, (59), 28 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-03 03:34:56,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:34:56,237 INFO L225 Difference]: With dead ends: 523 [2022-11-03 03:34:56,237 INFO L226 Difference]: Without dead ends: 502 [2022-11-03 03:34:56,238 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 587 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=592, Invalid=1858, Unknown=0, NotChecked=0, Total=2450 [2022-11-03 03:34:56,239 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 211 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 1045 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 1240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1045 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 172 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-03 03:34:56,239 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 110 Invalid, 1240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1045 Invalid, 0 Unknown, 172 Unchecked, 0.9s Time] [2022-11-03 03:34:56,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2022-11-03 03:34:56,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 302. [2022-11-03 03:34:56,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 301 states have (on average 3.176079734219269) internal successors, (956), 301 states have internal predecessors, (956), 0 states have call successors, (0), 0 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-03 03:34:56,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 956 transitions. [2022-11-03 03:34:56,256 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 956 transitions. Word has length 23 [2022-11-03 03:34:56,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:34:56,257 INFO L495 AbstractCegarLoop]: Abstraction has 302 states and 956 transitions. [2022-11-03 03:34:56,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.107142857142857) internal successors, (59), 28 states have internal predecessors, (59), 0 states have call successors, (0), 0 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-03 03:34:56,257 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 956 transitions. [2022-11-03 03:34:56,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-03 03:34:56,258 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:34:56,259 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:34:56,299 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-11-03 03:34:56,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:34:56,467 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-03 03:34:56,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:34:56,467 INFO L85 PathProgramCache]: Analyzing trace with hash -848756201, now seen corresponding path program 3 times [2022-11-03 03:34:56,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:34:56,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022578759] [2022-11-03 03:34:56,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:34:56,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:34:56,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:34:57,189 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-03 03:34:57,189 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:34:57,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022578759] [2022-11-03 03:34:57,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022578759] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:34:57,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1274387555] [2022-11-03 03:34:57,189 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 03:34:57,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:34:57,190 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:34:57,191 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:34:57,210 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-03 03:34:57,307 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 03:34:57,308 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:34:57,309 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-03 03:34:57,312 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:34:57,751 INFO L356 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2022-11-03 03:34:57,752 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 79 treesize of output 69 [2022-11-03 03:34:57,937 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-03 03:34:57,937 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:34:58,092 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:34:58,093 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 87 treesize of output 51 [2022-11-03 03:34:58,298 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-03 03:34:58,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1274387555] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:34:58,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1346378667] [2022-11-03 03:34:58,299 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-03 03:34:58,299 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:34:58,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 7] total 23 [2022-11-03 03:34:58,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336908024] [2022-11-03 03:34:58,300 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:34:58,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-03 03:34:58,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:34:58,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-03 03:34:58,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=510, Unknown=0, NotChecked=0, Total=600 [2022-11-03 03:34:58,301 INFO L87 Difference]: Start difference. First operand 302 states and 956 transitions. Second operand has 25 states, 24 states have (on average 2.5416666666666665) internal successors, (61), 24 states have internal predecessors, (61), 0 states have call successors, (0), 0 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-03 03:35:00,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:35:00,927 INFO L93 Difference]: Finished difference Result 744 states and 2204 transitions. [2022-11-03 03:35:00,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-11-03 03:35:00,930 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.5416666666666665) internal successors, (61), 24 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-03 03:35:00,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:35:00,935 INFO L225 Difference]: With dead ends: 744 [2022-11-03 03:35:00,935 INFO L226 Difference]: Without dead ends: 716 [2022-11-03 03:35:00,936 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 781 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=450, Invalid=2630, Unknown=0, NotChecked=0, Total=3080 [2022-11-03 03:35:00,937 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 249 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 1106 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 1338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 212 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-03 03:35:00,937 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 102 Invalid, 1338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1106 Invalid, 0 Unknown, 212 Unchecked, 0.9s Time] [2022-11-03 03:35:00,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2022-11-03 03:35:00,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 362. [2022-11-03 03:35:00,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 361 states have (on average 3.335180055401662) internal successors, (1204), 361 states have internal predecessors, (1204), 0 states have call successors, (0), 0 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-03 03:35:00,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 1204 transitions. [2022-11-03 03:35:00,960 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 1204 transitions. Word has length 23 [2022-11-03 03:35:00,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:35:00,960 INFO L495 AbstractCegarLoop]: Abstraction has 362 states and 1204 transitions. [2022-11-03 03:35:00,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.5416666666666665) internal successors, (61), 24 states have internal predecessors, (61), 0 states have call successors, (0), 0 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-03 03:35:00,964 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 1204 transitions. [2022-11-03 03:35:00,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-03 03:35:00,966 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:35:00,966 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:35:01,001 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-03 03:35:01,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-03 03:35:01,191 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-03 03:35:01,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:35:01,191 INFO L85 PathProgramCache]: Analyzing trace with hash -788363353, now seen corresponding path program 4 times [2022-11-03 03:35:01,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:35:01,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864058693] [2022-11-03 03:35:01,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:35:01,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:35:01,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:35:02,101 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-03 03:35:02,101 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:35:02,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864058693] [2022-11-03 03:35:02,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864058693] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:35:02,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1319286218] [2022-11-03 03:35:02,101 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 03:35:02,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:35:02,102 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:35:02,103 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:35:02,122 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-03 03:35:02,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:35:02,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-03 03:35:02,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:35:02,275 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:35:02,352 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:35:02,404 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:35:02,588 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:35:02,759 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:35:02,760 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 72 treesize of output 46 [2022-11-03 03:35:02,998 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-03 03:35:02,998 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:35:03,787 WARN L833 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_290 (Array Int Int)) (~M~0 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_290) c_~A~0.base))) (or (< c_~max2~0 (select .cse0 (+ c_~A~0.offset (* ~M~0 4)))) (< c_~max1~0 (select .cse0 c_~A~0.offset)) (< (+ ~M~0 1) c_~N~0) (< c_thread2Thread1of1ForFork0_~i~1 ~M~0)))) (= c_~max1~0 c_~max2~0)) (forall ((~M~0 Int)) (or (forall ((v_ArrVal_290 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_290) c_~A~0.base))) (let ((.cse2 (select .cse1 (+ c_~A~0.offset (* ~M~0 4))))) (or (< c_~max1~0 (select .cse1 c_~A~0.offset)) (= .cse2 c_~max1~0) (not (< c_~max2~0 .cse2)))))) (< (+ ~M~0 1) c_~N~0) (< c_thread2Thread1of1ForFork0_~i~1 ~M~0))) (forall ((~M~0 Int)) (or (forall ((v_ArrVal_290 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_290) c_~A~0.base))) (let ((.cse4 (select .cse3 c_~A~0.offset))) (or (< c_~max2~0 (select .cse3 (+ c_~A~0.offset (* ~M~0 4)))) (= .cse4 c_~max2~0) (not (< c_~max1~0 .cse4)))))) (< (+ ~M~0 1) c_~N~0) (< c_thread2Thread1of1ForFork0_~i~1 ~M~0))) (forall ((~M~0 Int)) (or (forall ((v_ArrVal_290 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_290) c_~A~0.base))) (let ((.cse6 (select .cse7 c_~A~0.offset)) (.cse5 (select .cse7 (+ c_~A~0.offset (* ~M~0 4))))) (or (= .cse5 .cse6) (not (< c_~max1~0 .cse6)) (not (< c_~max2~0 .cse5)))))) (< (+ ~M~0 1) c_~N~0) (< c_thread2Thread1of1ForFork0_~i~1 ~M~0)))) is different from false [2022-11-03 03:35:03,906 WARN L833 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_290 (Array Int Int)) (~M~0 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_290) c_~A~0.base))) (or (< c_~max2~0 (select .cse0 (+ c_~A~0.offset (* ~M~0 4)))) (< 0 ~M~0) (< c_~max1~0 (select .cse0 c_~A~0.offset)) (< (+ ~M~0 1) c_~N~0)))) (= c_~max1~0 c_~max2~0)) (forall ((v_ArrVal_290 (Array Int Int)) (~M~0 Int)) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_290) c_~A~0.base))) (let ((.cse2 (select .cse3 c_~A~0.offset)) (.cse1 (select .cse3 (+ c_~A~0.offset (* ~M~0 4))))) (or (= .cse1 .cse2) (not (< c_~max1~0 .cse2)) (< 0 ~M~0) (not (< c_~max2~0 .cse1)) (< (+ ~M~0 1) c_~N~0))))) (forall ((v_ArrVal_290 (Array Int Int)) (~M~0 Int)) (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_290) c_~A~0.base))) (let ((.cse5 (select .cse4 c_~A~0.offset))) (or (< c_~max2~0 (select .cse4 (+ c_~A~0.offset (* ~M~0 4)))) (= .cse5 c_~max2~0) (not (< c_~max1~0 .cse5)) (< 0 ~M~0) (< (+ ~M~0 1) c_~N~0))))) (forall ((v_ArrVal_290 (Array Int Int)) (~M~0 Int)) (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_290) c_~A~0.base))) (let ((.cse7 (select .cse6 (+ c_~A~0.offset (* ~M~0 4))))) (or (< 0 ~M~0) (< c_~max1~0 (select .cse6 c_~A~0.offset)) (= .cse7 c_~max1~0) (not (< c_~max2~0 .cse7)) (< (+ ~M~0 1) c_~N~0)))))) is different from false [2022-11-03 03:35:04,079 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_290 (Array Int Int)) (~M~0 Int) (v_ArrVal_289 (Array Int Int))) (let ((.cse1 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_289) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_290) c_~A~0.base))) (let ((.cse0 (select .cse1 (+ c_~A~0.offset (* ~M~0 4))))) (or (< 0 ~M~0) (not (< c_~max2~0 .cse0)) (= c_~max1~0 .cse0) (< c_~max1~0 (select .cse1 c_~A~0.offset)) (< (+ ~M~0 1) c_~N~0))))) (forall ((v_ArrVal_290 (Array Int Int)) (~M~0 Int) (v_ArrVal_289 (Array Int Int))) (let ((.cse4 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_289) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_290) c_~A~0.base))) (let ((.cse3 (select .cse4 (+ c_~A~0.offset (* ~M~0 4)))) (.cse2 (select .cse4 c_~A~0.offset))) (or (not (< c_~max1~0 .cse2)) (< 0 ~M~0) (not (< c_~max2~0 .cse3)) (= .cse3 .cse2) (< (+ ~M~0 1) c_~N~0))))) (forall ((v_ArrVal_290 (Array Int Int)) (~M~0 Int) (v_ArrVal_289 (Array Int Int))) (let ((.cse6 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_289) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_290) c_~A~0.base))) (let ((.cse5 (select .cse6 c_~A~0.offset))) (or (= c_~max2~0 .cse5) (not (< c_~max1~0 .cse5)) (< 0 ~M~0) (< c_~max2~0 (select .cse6 (+ c_~A~0.offset (* ~M~0 4)))) (< (+ ~M~0 1) c_~N~0))))) (or (forall ((v_ArrVal_290 (Array Int Int)) (~M~0 Int) (v_ArrVal_289 (Array Int Int))) (let ((.cse7 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_289) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_290) c_~A~0.base))) (or (< 0 ~M~0) (< c_~max2~0 (select .cse7 (+ c_~A~0.offset (* ~M~0 4)))) (< c_~max1~0 (select .cse7 c_~A~0.offset)) (< (+ ~M~0 1) c_~N~0)))) (= c_~max1~0 c_~max2~0))) is different from false [2022-11-03 03:35:04,481 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:35:04,482 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 61 treesize of output 49 [2022-11-03 03:35:04,497 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:35:04,497 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 531 treesize of output 517 [2022-11-03 03:35:04,521 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:35:04,521 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 261 treesize of output 255 [2022-11-03 03:35:04,541 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:35:04,541 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 491 treesize of output 469 [2022-11-03 03:35:04,571 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:35:04,572 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 459 treesize of output 405 [2022-11-03 03:35:05,764 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:35:05,764 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 120 treesize of output 84 [2022-11-03 03:35:05,782 INFO L356 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2022-11-03 03:35:05,783 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 898 treesize of output 855 [2022-11-03 03:35:05,804 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-03 03:35:05,805 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 850 treesize of output 722 [2022-11-03 03:35:05,822 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:35:05,823 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 616 treesize of output 552 [2022-11-03 03:35:05,844 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-03 03:35:05,845 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 658 treesize of output 626 [2022-11-03 03:35:06,393 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-03 03:35:06,393 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 94 treesize of output 1 [2022-11-03 03:35:06,404 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-03 03:35:06,404 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 90 treesize of output 1 [2022-11-03 03:35:06,461 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-03 03:35:06,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1319286218] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:35:06,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [422561914] [2022-11-03 03:35:06,463 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-03 03:35:06,463 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:35:06,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 32 [2022-11-03 03:35:06,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073143686] [2022-11-03 03:35:06,464 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:35:06,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-03 03:35:06,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:35:06,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-03 03:35:06,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=764, Unknown=7, NotChecked=180, Total=1122 [2022-11-03 03:35:06,466 INFO L87 Difference]: Start difference. First operand 362 states and 1204 transitions. Second operand has 34 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 33 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:35:09,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:35:09,213 INFO L93 Difference]: Finished difference Result 496 states and 1607 transitions. [2022-11-03 03:35:09,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-03 03:35:09,214 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 33 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-03 03:35:09,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:35:09,218 INFO L225 Difference]: With dead ends: 496 [2022-11-03 03:35:09,218 INFO L226 Difference]: Without dead ends: 482 [2022-11-03 03:35:09,219 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 23 SyntacticMatches, 8 SemanticMatches, 52 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 592 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=557, Invalid=1998, Unknown=7, NotChecked=300, Total=2862 [2022-11-03 03:35:09,220 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 256 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 774 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 1296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 504 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-03 03:35:09,220 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 100 Invalid, 1296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 774 Invalid, 0 Unknown, 504 Unchecked, 0.7s Time] [2022-11-03 03:35:09,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2022-11-03 03:35:09,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 362. [2022-11-03 03:35:09,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 361 states have (on average 3.335180055401662) internal successors, (1204), 361 states have internal predecessors, (1204), 0 states have call successors, (0), 0 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-03 03:35:09,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 1204 transitions. [2022-11-03 03:35:09,235 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 1204 transitions. Word has length 23 [2022-11-03 03:35:09,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:35:09,235 INFO L495 AbstractCegarLoop]: Abstraction has 362 states and 1204 transitions. [2022-11-03 03:35:09,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 33 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:35:09,236 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 1204 transitions. [2022-11-03 03:35:09,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-03 03:35:09,237 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:35:09,237 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:35:09,272 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-11-03 03:35:09,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-03 03:35:09,463 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-03 03:35:09,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:35:09,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1626911887, now seen corresponding path program 5 times [2022-11-03 03:35:09,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:35:09,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686218798] [2022-11-03 03:35:09,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:35:09,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:35:09,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:35:10,099 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-03 03:35:10,099 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:35:10,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686218798] [2022-11-03 03:35:10,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686218798] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:35:10,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [813993465] [2022-11-03 03:35:10,100 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 03:35:10,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:35:10,100 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:35:10,101 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:35:10,130 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-03 03:35:10,240 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-03 03:35:10,240 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:35:10,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 30 conjunts are in the unsatisfiable core [2022-11-03 03:35:10,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:35:10,619 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:35:10,619 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 79 treesize of output 81 [2022-11-03 03:35:11,015 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-03 03:35:11,016 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:35:11,165 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:35:11,165 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 75 treesize of output 49 [2022-11-03 03:35:11,435 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:35:11,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [813993465] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:35:11,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [32804452] [2022-11-03 03:35:11,436 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-03 03:35:11,436 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:35:11,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 25 [2022-11-03 03:35:11,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468662623] [2022-11-03 03:35:11,437 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:35:11,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-03 03:35:11,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:35:11,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-03 03:35:11,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=572, Unknown=0, NotChecked=0, Total=702 [2022-11-03 03:35:11,438 INFO L87 Difference]: Start difference. First operand 362 states and 1204 transitions. Second operand has 27 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 26 states have internal predecessors, (55), 0 states have call successors, (0), 0 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-03 03:35:12,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:35:12,734 INFO L93 Difference]: Finished difference Result 535 states and 1684 transitions. [2022-11-03 03:35:12,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-03 03:35:12,735 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 26 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-03 03:35:12,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:35:12,738 INFO L225 Difference]: With dead ends: 535 [2022-11-03 03:35:12,738 INFO L226 Difference]: Without dead ends: 528 [2022-11-03 03:35:12,739 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 362 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=256, Invalid=1076, Unknown=0, NotChecked=0, Total=1332 [2022-11-03 03:35:12,739 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 140 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 790 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 104 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-03 03:35:12,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 80 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 790 Invalid, 0 Unknown, 104 Unchecked, 0.6s Time] [2022-11-03 03:35:12,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2022-11-03 03:35:12,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 368. [2022-11-03 03:35:12,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 367 states have (on average 3.326975476839237) internal successors, (1221), 367 states have internal predecessors, (1221), 0 states have call successors, (0), 0 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-03 03:35:12,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 1221 transitions. [2022-11-03 03:35:12,755 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 1221 transitions. Word has length 23 [2022-11-03 03:35:12,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:35:12,756 INFO L495 AbstractCegarLoop]: Abstraction has 368 states and 1221 transitions. [2022-11-03 03:35:12,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 26 states have internal predecessors, (55), 0 states have call successors, (0), 0 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-03 03:35:12,756 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 1221 transitions. [2022-11-03 03:35:12,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-03 03:35:12,758 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:35:12,758 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:35:12,791 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-03 03:35:12,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:35:12,983 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-03 03:35:12,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:35:12,983 INFO L85 PathProgramCache]: Analyzing trace with hash -2140702935, now seen corresponding path program 6 times [2022-11-03 03:35:12,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:35:12,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049576873] [2022-11-03 03:35:12,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:35:12,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:35:13,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:35:13,957 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-03 03:35:13,957 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:35:13,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049576873] [2022-11-03 03:35:13,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049576873] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:35:13,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [359022428] [2022-11-03 03:35:13,958 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 03:35:13,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:35:13,958 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:35:13,959 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:35:13,978 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-03 03:35:14,069 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 03:35:14,069 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:35:14,071 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 28 conjunts are in the unsatisfiable core [2022-11-03 03:35:14,073 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:35:14,557 INFO L356 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2022-11-03 03:35:14,558 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 79 treesize of output 69 [2022-11-03 03:35:14,725 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-03 03:35:14,725 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:35:14,949 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:35:14,950 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 75 treesize of output 49 [2022-11-03 03:35:15,115 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-03 03:35:15,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [359022428] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:35:15,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1994682032] [2022-11-03 03:35:15,116 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-03 03:35:15,117 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:35:15,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 7] total 27 [2022-11-03 03:35:15,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882214787] [2022-11-03 03:35:15,118 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:35:15,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-03 03:35:15,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:35:15,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-03 03:35:15,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=694, Unknown=0, NotChecked=0, Total=812 [2022-11-03 03:35:15,119 INFO L87 Difference]: Start difference. First operand 368 states and 1221 transitions. Second operand has 29 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 28 states have internal predecessors, (61), 0 states have call successors, (0), 0 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-03 03:35:16,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:35:16,964 INFO L93 Difference]: Finished difference Result 583 states and 1796 transitions. [2022-11-03 03:35:16,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-03 03:35:16,964 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 28 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-03 03:35:16,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:35:16,968 INFO L225 Difference]: With dead ends: 583 [2022-11-03 03:35:16,968 INFO L226 Difference]: Without dead ends: 576 [2022-11-03 03:35:16,969 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 432 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=306, Invalid=1586, Unknown=0, NotChecked=0, Total=1892 [2022-11-03 03:35:16,970 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 126 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 877 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 1202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 877 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 310 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-03 03:35:16,970 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 110 Invalid, 1202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 877 Invalid, 0 Unknown, 310 Unchecked, 0.7s Time] [2022-11-03 03:35:16,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2022-11-03 03:35:16,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 368. [2022-11-03 03:35:16,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 367 states have (on average 3.326975476839237) internal successors, (1221), 367 states have internal predecessors, (1221), 0 states have call successors, (0), 0 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-03 03:35:16,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 1221 transitions. [2022-11-03 03:35:16,996 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 1221 transitions. Word has length 23 [2022-11-03 03:35:16,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:35:16,996 INFO L495 AbstractCegarLoop]: Abstraction has 368 states and 1221 transitions. [2022-11-03 03:35:16,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 28 states have internal predecessors, (61), 0 states have call successors, (0), 0 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-03 03:35:16,997 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 1221 transitions. [2022-11-03 03:35:16,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-03 03:35:16,998 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:35:16,999 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:35:17,032 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-03 03:35:17,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:35:17,219 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-03 03:35:17,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:35:17,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1507462417, now seen corresponding path program 7 times [2022-11-03 03:35:17,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:35:17,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079532574] [2022-11-03 03:35:17,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:35:17,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:35:17,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:35:17,802 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-03 03:35:17,802 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:35:17,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079532574] [2022-11-03 03:35:17,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079532574] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:35:17,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [576710050] [2022-11-03 03:35:17,803 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 03:35:17,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:35:17,803 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:35:17,804 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:35:17,826 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-03 03:35:17,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:35:17,923 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-03 03:35:17,925 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:35:18,235 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 55 treesize of output 31 [2022-11-03 03:35:18,325 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-03 03:35:18,325 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:35:18,438 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:35:18,438 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 75 treesize of output 49 [2022-11-03 03:35:18,620 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-03 03:35:18,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [576710050] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:35:18,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [262414847] [2022-11-03 03:35:18,622 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-03 03:35:18,623 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:35:18,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 19 [2022-11-03 03:35:18,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272657303] [2022-11-03 03:35:18,623 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:35:18,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-03 03:35:18,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:35:18,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-03 03:35:18,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2022-11-03 03:35:18,626 INFO L87 Difference]: Start difference. First operand 368 states and 1221 transitions. Second operand has 21 states, 20 states have (on average 3.0) internal successors, (60), 20 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:35:19,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:35:19,272 INFO L93 Difference]: Finished difference Result 511 states and 1666 transitions. [2022-11-03 03:35:19,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-03 03:35:19,272 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.0) internal successors, (60), 20 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-03 03:35:19,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:35:19,275 INFO L225 Difference]: With dead ends: 511 [2022-11-03 03:35:19,276 INFO L226 Difference]: Without dead ends: 504 [2022-11-03 03:35:19,276 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=127, Invalid=523, Unknown=0, NotChecked=0, Total=650 [2022-11-03 03:35:19,277 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 113 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 03:35:19,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 75 Invalid, 535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-03 03:35:19,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2022-11-03 03:35:19,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 384. [2022-11-03 03:35:19,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 383 states have (on average 3.3550913838120104) internal successors, (1285), 383 states have internal predecessors, (1285), 0 states have call successors, (0), 0 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-03 03:35:19,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1285 transitions. [2022-11-03 03:35:19,293 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1285 transitions. Word has length 23 [2022-11-03 03:35:19,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:35:19,294 INFO L495 AbstractCegarLoop]: Abstraction has 384 states and 1285 transitions. [2022-11-03 03:35:19,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.0) internal successors, (60), 20 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:35:19,294 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1285 transitions. [2022-11-03 03:35:19,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-03 03:35:19,296 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:35:19,296 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:35:19,323 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-03 03:35:19,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-03 03:35:19,503 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-03 03:35:19,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:35:19,503 INFO L85 PathProgramCache]: Analyzing trace with hash 723499871, now seen corresponding path program 8 times [2022-11-03 03:35:19,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:35:19,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097768084] [2022-11-03 03:35:19,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:35:19,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:35:19,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:35:20,173 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-03 03:35:20,173 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:35:20,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097768084] [2022-11-03 03:35:20,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097768084] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:35:20,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1721555428] [2022-11-03 03:35:20,174 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 03:35:20,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:35:20,174 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:35:20,175 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:35:20,205 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-03 03:35:20,308 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-03 03:35:20,308 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:35:20,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-03 03:35:20,312 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:35:20,617 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 55 treesize of output 31 [2022-11-03 03:35:20,705 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-03 03:35:20,705 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:35:20,789 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:35:20,790 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 87 treesize of output 51 [2022-11-03 03:35:21,012 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-03 03:35:21,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1721555428] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:35:21,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1877817565] [2022-11-03 03:35:21,013 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-03 03:35:21,015 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:35:21,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 20 [2022-11-03 03:35:21,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734319027] [2022-11-03 03:35:21,016 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:35:21,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-03 03:35:21,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:35:21,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-03 03:35:21,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2022-11-03 03:35:21,018 INFO L87 Difference]: Start difference. First operand 384 states and 1285 transitions. Second operand has 22 states, 21 states have (on average 2.9047619047619047) internal successors, (61), 21 states have internal predecessors, (61), 0 states have call successors, (0), 0 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-03 03:35:21,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:35:21,941 INFO L93 Difference]: Finished difference Result 576 states and 1831 transitions. [2022-11-03 03:35:21,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-03 03:35:21,941 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.9047619047619047) internal successors, (61), 21 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-03 03:35:21,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:35:21,945 INFO L225 Difference]: With dead ends: 576 [2022-11-03 03:35:21,946 INFO L226 Difference]: Without dead ends: 562 [2022-11-03 03:35:21,946 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=181, Invalid=631, Unknown=0, NotChecked=0, Total=812 [2022-11-03 03:35:21,947 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 145 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 03:35:21,947 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 82 Invalid, 610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 591 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-03 03:35:21,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2022-11-03 03:35:21,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 392. [2022-11-03 03:35:21,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 391 states have (on average 3.340153452685422) internal successors, (1306), 391 states have internal predecessors, (1306), 0 states have call successors, (0), 0 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-03 03:35:21,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1306 transitions. [2022-11-03 03:35:21,964 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1306 transitions. Word has length 23 [2022-11-03 03:35:21,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:35:21,964 INFO L495 AbstractCegarLoop]: Abstraction has 392 states and 1306 transitions. [2022-11-03 03:35:21,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.9047619047619047) internal successors, (61), 21 states have internal predecessors, (61), 0 states have call successors, (0), 0 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-03 03:35:21,965 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1306 transitions. [2022-11-03 03:35:21,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-03 03:35:21,966 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:35:21,967 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:35:22,002 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-03 03:35:22,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-03 03:35:22,195 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-03 03:35:22,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:35:22,195 INFO L85 PathProgramCache]: Analyzing trace with hash 783892719, now seen corresponding path program 9 times [2022-11-03 03:35:22,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:35:22,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309107335] [2022-11-03 03:35:22,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:35:22,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:35:22,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:35:22,795 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-03 03:35:22,796 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:35:22,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309107335] [2022-11-03 03:35:22,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309107335] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:35:22,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1597339190] [2022-11-03 03:35:22,796 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 03:35:22,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:35:22,797 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:35:22,798 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:35:22,799 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-03 03:35:22,907 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 03:35:22,908 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:35:22,909 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-03 03:35:22,911 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:35:23,121 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:35:23,122 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 72 treesize of output 46 [2022-11-03 03:35:23,352 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-03 03:35:23,352 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:35:23,485 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:35:23,485 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 87 treesize of output 51 [2022-11-03 03:35:23,666 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-03 03:35:23,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1597339190] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:35:23,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [795575560] [2022-11-03 03:35:23,671 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-03 03:35:23,672 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:35:23,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 7] total 23 [2022-11-03 03:35:23,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105847041] [2022-11-03 03:35:23,673 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:35:23,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-03 03:35:23,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:35:23,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-03 03:35:23,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=487, Unknown=0, NotChecked=0, Total=600 [2022-11-03 03:35:23,675 INFO L87 Difference]: Start difference. First operand 392 states and 1306 transitions. Second operand has 25 states, 24 states have (on average 2.5) internal successors, (60), 24 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:35:24,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:35:24,792 INFO L93 Difference]: Finished difference Result 505 states and 1572 transitions. [2022-11-03 03:35:24,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-03 03:35:24,793 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.5) internal successors, (60), 24 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-03 03:35:24,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:35:24,795 INFO L225 Difference]: With dead ends: 505 [2022-11-03 03:35:24,795 INFO L226 Difference]: Without dead ends: 484 [2022-11-03 03:35:24,796 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=243, Invalid=1017, Unknown=0, NotChecked=0, Total=1260 [2022-11-03 03:35:24,797 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 120 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 767 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 03:35:24,797 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 52 Invalid, 783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 767 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-03 03:35:24,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2022-11-03 03:35:24,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 400. [2022-11-03 03:35:24,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 399 states have (on average 3.3283208020050123) internal successors, (1328), 399 states have internal predecessors, (1328), 0 states have call successors, (0), 0 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-03 03:35:24,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 1328 transitions. [2022-11-03 03:35:24,813 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 1328 transitions. Word has length 23 [2022-11-03 03:35:24,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:35:24,813 INFO L495 AbstractCegarLoop]: Abstraction has 400 states and 1328 transitions. [2022-11-03 03:35:24,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.5) internal successors, (60), 24 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:35:24,814 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 1328 transitions. [2022-11-03 03:35:24,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-03 03:35:24,815 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:35:24,816 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:35:24,856 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-03 03:35:25,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:35:25,035 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-03 03:35:25,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:35:25,035 INFO L85 PathProgramCache]: Analyzing trace with hash -40446721, now seen corresponding path program 10 times [2022-11-03 03:35:25,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:35:25,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361880622] [2022-11-03 03:35:25,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:35:25,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:35:25,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:35:25,771 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-03 03:35:25,771 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:35:25,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361880622] [2022-11-03 03:35:25,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361880622] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:35:25,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1586976017] [2022-11-03 03:35:25,772 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 03:35:25,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:35:25,773 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:35:25,774 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:35:25,802 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-03 03:35:25,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:35:25,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-03 03:35:25,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:35:26,208 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:35:26,211 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:35:26,211 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 66 treesize of output 39 [2022-11-03 03:35:26,315 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-03 03:35:26,315 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:35:26,397 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:35:26,398 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 87 treesize of output 51 [2022-11-03 03:35:26,625 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-03 03:35:26,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1586976017] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:35:26,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1834991444] [2022-11-03 03:35:26,628 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-03 03:35:26,629 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:35:26,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 23 [2022-11-03 03:35:26,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193892522] [2022-11-03 03:35:26,630 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:35:26,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-03 03:35:26,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:35:26,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-03 03:35:26,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=490, Unknown=0, NotChecked=0, Total=600 [2022-11-03 03:35:26,633 INFO L87 Difference]: Start difference. First operand 400 states and 1328 transitions. Second operand has 25 states, 24 states have (on average 2.5416666666666665) internal successors, (61), 24 states have internal predecessors, (61), 0 states have call successors, (0), 0 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-03 03:35:27,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:35:27,833 INFO L93 Difference]: Finished difference Result 560 states and 1791 transitions. [2022-11-03 03:35:27,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-03 03:35:27,833 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.5416666666666665) internal successors, (61), 24 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-03 03:35:27,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:35:27,838 INFO L225 Difference]: With dead ends: 560 [2022-11-03 03:35:27,838 INFO L226 Difference]: Without dead ends: 546 [2022-11-03 03:35:27,839 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=313, Invalid=1169, Unknown=0, NotChecked=0, Total=1482 [2022-11-03 03:35:27,839 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 146 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 644 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 03:35:27,840 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 77 Invalid, 658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 644 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-03 03:35:27,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2022-11-03 03:35:27,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 412. [2022-11-03 03:35:27,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 411 states have (on average 3.343065693430657) internal successors, (1374), 411 states have internal predecessors, (1374), 0 states have call successors, (0), 0 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-03 03:35:27,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 1374 transitions. [2022-11-03 03:35:27,857 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 1374 transitions. Word has length 23 [2022-11-03 03:35:27,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:35:27,858 INFO L495 AbstractCegarLoop]: Abstraction has 412 states and 1374 transitions. [2022-11-03 03:35:27,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.5416666666666665) internal successors, (61), 24 states have internal predecessors, (61), 0 states have call successors, (0), 0 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-03 03:35:27,858 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 1374 transitions. [2022-11-03 03:35:27,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-03 03:35:27,860 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:35:27,860 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:35:27,900 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-03 03:35:28,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-03 03:35:28,075 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-03 03:35:28,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:35:28,075 INFO L85 PathProgramCache]: Analyzing trace with hash -542418673, now seen corresponding path program 11 times [2022-11-03 03:35:28,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:35:28,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236212605] [2022-11-03 03:35:28,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:35:28,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:35:28,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:35:28,930 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-03 03:35:28,931 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:35:28,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236212605] [2022-11-03 03:35:28,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236212605] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:35:28,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [650155171] [2022-11-03 03:35:28,931 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 03:35:28,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:35:28,931 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:35:28,935 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:35:28,950 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-03 03:35:29,064 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-03 03:35:29,064 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:35:29,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-03 03:35:29,068 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:35:29,145 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:35:29,191 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:35:29,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:35:29,387 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 35 treesize of output 33 [2022-11-03 03:35:29,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:35:29,614 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 35 treesize of output 33 [2022-11-03 03:35:29,775 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:35:29,776 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 66 treesize of output 46 [2022-11-03 03:35:30,028 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:35:30,028 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:35:30,266 WARN L833 $PredicateComparison]: unable to prove that (and (or (= c_~max1~0 c_~max2~0) (forall ((v_ArrVal_603 (Array Int Int)) (~M~0 Int)) (or (< c_~max2~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_603) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (< (+ ~M~0 1) c_~N~0) (< c_thread2Thread1of1ForFork0_~i~1 ~M~0)))) (forall ((~M~0 Int)) (or (forall ((v_ArrVal_603 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_603) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< c_~max2~0 .cse0)) (= .cse0 c_~max1~0)))) (< (+ ~M~0 1) c_~N~0) (< c_thread2Thread1of1ForFork0_~i~1 ~M~0)))) is different from false [2022-11-03 03:35:30,309 WARN L833 $PredicateComparison]: unable to prove that (and (or (= c_~max1~0 c_~max2~0) (forall ((v_ArrVal_603 (Array Int Int)) (~M~0 Int)) (or (< 0 ~M~0) (< c_~max2~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_603) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (< (+ ~M~0 1) c_~N~0)))) (forall ((v_ArrVal_603 (Array Int Int)) (~M~0 Int)) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_603) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (< 0 ~M~0) (not (< c_~max2~0 .cse0)) (= .cse0 c_~max1~0) (< (+ ~M~0 1) c_~N~0))))) is different from false [2022-11-03 03:35:30,363 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_603 (Array Int Int)) (v_ArrVal_602 (Array Int Int)) (~M~0 Int)) (let ((.cse0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_602) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_603) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< c_~max2~0 .cse0)) (< 0 ~M~0) (= c_~max1~0 .cse0) (< (+ ~M~0 1) c_~N~0)))) (or (= c_~max1~0 c_~max2~0) (forall ((v_ArrVal_603 (Array Int Int)) (v_ArrVal_602 (Array Int Int)) (~M~0 Int)) (or (< 0 ~M~0) (< c_~max2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_602) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_603) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (< (+ ~M~0 1) c_~N~0))))) is different from false [2022-11-03 03:35:30,966 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_601 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_601))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (< c_~max1~0 .cse0)) (forall ((v_ArrVal_603 (Array Int Int)) (v_ArrVal_602 (Array Int Int)) (~M~0 Int)) (let ((.cse1 (select (select (store (store .cse2 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_602) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_603) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (< 0 ~M~0) (= .cse0 .cse1) (not (< c_~max2~0 .cse1)) (< (+ ~M~0 1) c_~N~0)))))))) (forall ((v_ArrVal_601 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_601))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (= .cse3 c_~max2~0) (not (< c_~max1~0 .cse3)) (forall ((v_ArrVal_603 (Array Int Int)) (v_ArrVal_602 (Array Int Int)) (~M~0 Int)) (or (< 0 ~M~0) (< c_~max2~0 (select (select (store (store .cse4 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_602) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_603) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (< (+ ~M~0 1) c_~N~0))))))) (or (= c_~max1~0 c_~max2~0) (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_602 (Array Int Int)) (~M~0 Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_601))) (or (< c_~max1~0 (select (select .cse5 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (< 0 ~M~0) (< c_~max2~0 (select (select (store (store .cse5 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_602) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_603) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (< (+ ~M~0 1) c_~N~0))))) (forall ((v_ArrVal_601 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_601))) (or (< c_~max1~0 (select (select .cse6 |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_603 (Array Int Int)) (v_ArrVal_602 (Array Int Int)) (~M~0 Int)) (let ((.cse7 (select (select (store (store .cse6 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_602) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_603) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (< 0 ~M~0) (= c_~max1~0 .cse7) (not (< c_~max2~0 .cse7)) (< (+ ~M~0 1) c_~N~0)))))))) is different from false [2022-11-03 03:35:31,011 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:35:31,012 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 108 treesize of output 72 [2022-11-03 03:35:31,026 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:35:31,027 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1040 treesize of output 934 [2022-11-03 03:35:31,041 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 904 treesize of output 832 [2022-11-03 03:35:31,055 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 832 treesize of output 688 [2022-11-03 03:35:31,075 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:35:31,076 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 708 treesize of output 648 [2022-11-03 03:35:32,354 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:35:32,356 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 88 treesize of output 64 [2022-11-03 03:35:32,360 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:35:32,361 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:35:32,369 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 03:35:32,370 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 67 [2022-11-03 03:35:32,381 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 03:35:32,382 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 37 [2022-11-03 03:35:32,416 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:35:32,418 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 78 treesize of output 54 [2022-11-03 03:35:32,422 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:35:32,425 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:35:32,433 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 03:35:32,433 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 75 treesize of output 63 [2022-11-03 03:35:32,447 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 03:35:32,448 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 43 treesize of output 37 [2022-11-03 03:35:32,485 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:35:32,485 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 55 treesize of output 43 [2022-11-03 03:35:32,493 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:35:32,494 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:35:32,507 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 03:35:32,507 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 51 treesize of output 43 [2022-11-03 03:35:32,527 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 03:35:32,527 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 19 [2022-11-03 03:35:32,598 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-03 03:35:32,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [650155171] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:35:32,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1797545790] [2022-11-03 03:35:32,599 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-03 03:35:32,600 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:35:32,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 33 [2022-11-03 03:35:32,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32141970] [2022-11-03 03:35:32,601 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:35:32,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-03 03:35:32,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:35:32,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-03 03:35:32,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=802, Unknown=9, NotChecked=244, Total=1190 [2022-11-03 03:35:32,602 INFO L87 Difference]: Start difference. First operand 412 states and 1374 transitions. Second operand has 35 states, 34 states have (on average 1.7647058823529411) internal successors, (60), 34 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:35:34,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:35:34,286 INFO L93 Difference]: Finished difference Result 739 states and 2373 transitions. [2022-11-03 03:35:34,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-03 03:35:34,287 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.7647058823529411) internal successors, (60), 34 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-03 03:35:34,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:35:34,289 INFO L225 Difference]: With dead ends: 739 [2022-11-03 03:35:34,289 INFO L226 Difference]: Without dead ends: 732 [2022-11-03 03:35:34,290 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 25 SyntacticMatches, 5 SemanticMatches, 45 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 554 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=288, Invalid=1525, Unknown=9, NotChecked=340, Total=2162 [2022-11-03 03:35:34,290 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 310 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 880 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 1627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 709 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-03 03:35:34,291 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 86 Invalid, 1627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 880 Invalid, 0 Unknown, 709 Unchecked, 0.7s Time] [2022-11-03 03:35:34,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2022-11-03 03:35:34,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 450. [2022-11-03 03:35:34,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 449 states have (on average 3.3697104677060135) internal successors, (1513), 449 states have internal predecessors, (1513), 0 states have call successors, (0), 0 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-03 03:35:34,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 1513 transitions. [2022-11-03 03:35:34,311 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 1513 transitions. Word has length 23 [2022-11-03 03:35:34,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:35:34,311 INFO L495 AbstractCegarLoop]: Abstraction has 450 states and 1513 transitions. [2022-11-03 03:35:34,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.7647058823529411) internal successors, (60), 34 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:35:34,311 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 1513 transitions. [2022-11-03 03:35:34,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-03 03:35:34,313 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:35:34,313 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:35:34,353 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-11-03 03:35:34,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-03 03:35:34,527 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-03 03:35:34,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:35:34,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1758176189, now seen corresponding path program 12 times [2022-11-03 03:35:34,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:35:34,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28136092] [2022-11-03 03:35:34,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:35:34,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:35:34,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:35:35,385 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-03 03:35:35,385 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:35:35,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28136092] [2022-11-03 03:35:35,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28136092] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:35:35,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1499004783] [2022-11-03 03:35:35,386 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 03:35:35,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:35:35,386 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:35:35,387 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:35:35,391 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-03 03:35:35,501 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 03:35:35,502 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:35:35,503 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 39 conjunts are in the unsatisfiable core [2022-11-03 03:35:35,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:35:35,552 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:35:35,597 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:35:35,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:35:35,723 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 35 treesize of output 33 [2022-11-03 03:35:35,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:35:35,851 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 35 treesize of output 33 [2022-11-03 03:35:35,981 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:35:35,981 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 69 treesize of output 43 [2022-11-03 03:35:36,277 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-03 03:35:36,278 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:35:36,526 WARN L833 $PredicateComparison]: unable to prove that (and (or (forall ((~M~0 Int) (v_ArrVal_652 (Array Int Int))) (or (< c_~max2~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_652) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (< (+ ~M~0 1) c_~N~0) (< c_thread2Thread1of1ForFork0_~i~1 ~M~0))) (= c_~max1~0 c_~max2~0)) (forall ((~M~0 Int) (v_ArrVal_652 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_652) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (= .cse0 c_~max1~0) (not (< c_~max2~0 .cse0)) (< (+ ~M~0 1) c_~N~0) (< c_thread2Thread1of1ForFork0_~i~1 ~M~0))))) is different from false [2022-11-03 03:35:36,557 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((~M~0 Int) (v_ArrVal_652 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_652) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (= .cse0 c_~max1~0) (< 0 ~M~0) (not (< c_~max2~0 .cse0)) (< (+ ~M~0 1) c_~N~0)))) (or (= c_~max1~0 c_~max2~0) (forall ((~M~0 Int) (v_ArrVal_652 (Array Int Int))) (or (< 0 ~M~0) (< c_~max2~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_652) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (< (+ ~M~0 1) c_~N~0))))) is different from false [2022-11-03 03:35:36,616 WARN L833 $PredicateComparison]: unable to prove that (and (or (forall ((~M~0 Int) (v_ArrVal_652 (Array Int Int)) (v_ArrVal_651 (Array Int Int))) (or (< 0 ~M~0) (< c_~max2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_651) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_652) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (< (+ ~M~0 1) c_~N~0))) (= c_~max1~0 c_~max2~0)) (forall ((~M~0 Int) (v_ArrVal_652 (Array Int Int)) (v_ArrVal_651 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_651) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_652) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (< 0 ~M~0) (= c_~max1~0 .cse0) (not (< c_~max2~0 .cse0)) (< (+ ~M~0 1) c_~N~0))))) is different from false [2022-11-03 03:35:37,284 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_650 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_650))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (forall ((~M~0 Int) (v_ArrVal_652 (Array Int Int)) (v_ArrVal_651 (Array Int Int))) (let ((.cse1 (select (select (store (store .cse2 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_651) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_652) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (= .cse0 .cse1) (< 0 ~M~0) (< ~M~0 0) (not (< c_~max2~0 .cse1))))) (not (< c_~max1~0 .cse0)))))) (forall ((v_ArrVal_650 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_650))) (or (< c_~max1~0 (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|)) (forall ((~M~0 Int) (v_ArrVal_652 (Array Int Int)) (v_ArrVal_651 (Array Int Int))) (let ((.cse4 (select (select (store (store .cse3 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_651) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_652) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (= c_~max1~0 .cse4) (< 0 ~M~0) (< ~M~0 0) (not (< c_~max2~0 .cse4)))))))) (forall ((v_ArrVal_650 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_650))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (< c_~max1~0 .cse5)) (forall ((~M~0 Int) (v_ArrVal_652 (Array Int Int)) (v_ArrVal_651 (Array Int Int))) (or (< 0 ~M~0) (< ~M~0 0) (< c_~max2~0 (select (select (store (store .cse6 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_651) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_652) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) (= c_~max2~0 .cse5))))) (or (forall ((~M~0 Int) (v_ArrVal_650 (Array Int Int)) (v_ArrVal_652 (Array Int Int)) (v_ArrVal_651 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_650))) (or (< 0 ~M~0) (< ~M~0 0) (< c_~max2~0 (select (select (store (store .cse7 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_651) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_652) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (< c_~max1~0 (select (select .cse7 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) (= c_~max1~0 c_~max2~0))) is different from false [2022-11-03 03:35:37,330 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:35:37,330 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 78 treesize of output 54 [2022-11-03 03:35:37,341 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 03:35:37,342 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 343 treesize of output 323 [2022-11-03 03:35:37,356 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 141 treesize of output 117 [2022-11-03 03:35:37,364 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 258 treesize of output 210 [2022-11-03 03:35:37,377 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 03:35:37,377 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 239 treesize of output 227 [2022-11-03 03:35:37,551 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:35:37,552 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 43 [2022-11-03 03:35:37,556 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:35:37,557 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:35:37,565 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 03:35:37,565 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 43 [2022-11-03 03:35:37,575 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 03:35:37,575 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 19 [2022-11-03 03:35:37,591 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-03 03:35:37,591 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 1 [2022-11-03 03:35:37,600 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-03 03:35:37,600 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 108 treesize of output 1 [2022-11-03 03:35:37,650 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-03 03:35:37,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1499004783] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:35:37,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [113333817] [2022-11-03 03:35:37,652 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-03 03:35:37,653 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:35:37,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 33 [2022-11-03 03:35:37,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60954788] [2022-11-03 03:35:37,653 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:35:37,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-03 03:35:37,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:35:37,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-03 03:35:37,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=786, Unknown=5, NotChecked=244, Total=1190 [2022-11-03 03:35:37,655 INFO L87 Difference]: Start difference. First operand 450 states and 1513 transitions. Second operand has 35 states, 34 states have (on average 1.7647058823529411) internal successors, (60), 34 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:35:39,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:35:39,814 INFO L93 Difference]: Finished difference Result 791 states and 2551 transitions. [2022-11-03 03:35:39,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-03 03:35:39,815 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.7647058823529411) internal successors, (60), 34 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-03 03:35:39,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:35:39,819 INFO L225 Difference]: With dead ends: 791 [2022-11-03 03:35:39,819 INFO L226 Difference]: Without dead ends: 784 [2022-11-03 03:35:39,820 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 22 SyntacticMatches, 4 SemanticMatches, 45 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=302, Invalid=1515, Unknown=5, NotChecked=340, Total=2162 [2022-11-03 03:35:39,821 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 219 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 1355 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 2029 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 651 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-03 03:35:39,821 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 96 Invalid, 2029 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1355 Invalid, 0 Unknown, 651 Unchecked, 1.0s Time] [2022-11-03 03:35:39,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2022-11-03 03:35:39,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 466. [2022-11-03 03:35:39,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 465 states have (on average 3.4301075268817205) internal successors, (1595), 465 states have internal predecessors, (1595), 0 states have call successors, (0), 0 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-03 03:35:39,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 1595 transitions. [2022-11-03 03:35:39,841 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 1595 transitions. Word has length 23 [2022-11-03 03:35:39,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:35:39,841 INFO L495 AbstractCegarLoop]: Abstraction has 466 states and 1595 transitions. [2022-11-03 03:35:39,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.7647058823529411) internal successors, (60), 34 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:35:39,842 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 1595 transitions. [2022-11-03 03:35:39,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-03 03:35:39,843 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:35:39,843 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:35:39,882 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-11-03 03:35:40,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:35:40,059 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-03 03:35:40,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:35:40,060 INFO L85 PathProgramCache]: Analyzing trace with hash 149861007, now seen corresponding path program 13 times [2022-11-03 03:35:40,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:35:40,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899165763] [2022-11-03 03:35:40,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:35:40,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:35:40,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:35:40,731 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-03 03:35:40,731 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:35:40,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899165763] [2022-11-03 03:35:40,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899165763] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:35:40,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1793576468] [2022-11-03 03:35:40,732 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 03:35:40,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:35:40,732 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:35:40,734 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:35:40,738 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-03 03:35:40,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:35:40,847 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-03 03:35:40,849 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:35:40,898 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:35:40,953 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:35:41,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:35:41,123 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 35 treesize of output 33 [2022-11-03 03:35:41,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:35:41,229 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 35 treesize of output 33 [2022-11-03 03:35:41,308 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:35:41,309 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 64 treesize of output 44 [2022-11-03 03:35:41,604 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-03 03:35:41,604 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:35:41,801 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_701 (Array Int Int)) (~M~0 Int)) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_701) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< ~M~0 c_~N~0)) (not (< c_~max2~0 .cse0)) (= .cse0 c_~max1~0) (< (+ ~M~0 1) c_~N~0)))) (or (forall ((v_ArrVal_701 (Array Int Int)) (~M~0 Int)) (or (< c_~max2~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_701) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (not (< ~M~0 c_~N~0)) (< (+ ~M~0 1) c_~N~0))) (= c_~max1~0 c_~max2~0))) is different from false [2022-11-03 03:35:41,882 WARN L833 $PredicateComparison]: unable to prove that (and (or (= c_~max1~0 c_~max2~0) (forall ((v_ArrVal_700 (Array Int Int)) (v_ArrVal_701 (Array Int Int)) (~M~0 Int)) (or (not (< ~M~0 c_~N~0)) (< c_~max2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_700) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_701) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (< (+ ~M~0 1) c_~N~0)))) (forall ((v_ArrVal_700 (Array Int Int)) (v_ArrVal_701 (Array Int Int)) (~M~0 Int)) (let ((.cse0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_700) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_701) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< ~M~0 c_~N~0)) (not (< c_~max2~0 .cse0)) (= .cse0 c_~max1~0) (< (+ ~M~0 1) c_~N~0))))) is different from false [2022-11-03 03:35:41,965 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4))))) (let ((.cse0 (< c_~max1~0 .cse3)) (.cse1 (forall ((v_ArrVal_700 (Array Int Int)) (v_ArrVal_701 (Array Int Int)) (~M~0 Int)) (or (not (< ~M~0 c_~N~0)) (< c_~max2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_700) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_701) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (< (+ ~M~0 1) c_~N~0))))) (and (or .cse0 (and (or (= c_~max1~0 c_~max2~0) .cse1) (forall ((v_ArrVal_700 (Array Int Int)) (v_ArrVal_701 (Array Int Int)) (~M~0 Int)) (let ((.cse2 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_700) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_701) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< ~M~0 c_~N~0)) (not (< c_~max2~0 .cse2)) (= .cse2 c_~max1~0) (< (+ ~M~0 1) c_~N~0)))))) (or (not .cse0) (and (or (= .cse3 c_~max2~0) .cse1) (forall ((v_ArrVal_700 (Array Int Int)) (v_ArrVal_701 (Array Int Int)) (~M~0 Int)) (let ((.cse4 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_700) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_701) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (= .cse4 .cse3) (not (< ~M~0 c_~N~0)) (not (< c_~max2~0 .cse4)) (< (+ ~M~0 1) c_~N~0))))))))) is different from false [2022-11-03 03:35:46,577 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:35:46,578 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 108 treesize of output 72 [2022-11-03 03:35:46,595 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:35:46,596 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2076 treesize of output 1858 [2022-11-03 03:35:46,620 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1828 treesize of output 1684 [2022-11-03 03:35:46,643 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1684 treesize of output 1396 [2022-11-03 03:35:46,676 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:35:46,676 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1416 treesize of output 1288 [2022-11-03 03:35:51,126 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:35:51,126 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 43 [2022-11-03 03:35:51,131 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:35:51,131 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:35:51,140 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 03:35:51,140 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 43 [2022-11-03 03:35:51,154 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 03:35:51,154 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 19 [2022-11-03 03:35:51,169 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-03 03:35:51,170 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 1 [2022-11-03 03:35:51,179 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-03 03:35:51,180 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 1 [2022-11-03 03:35:51,216 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-03 03:35:51,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1793576468] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:35:51,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1602465045] [2022-11-03 03:35:51,218 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-03 03:35:51,219 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:35:51,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 25 [2022-11-03 03:35:51,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100067054] [2022-11-03 03:35:51,220 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:35:51,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-03 03:35:51,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:35:51,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-03 03:35:51,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=444, Unknown=5, NotChecked=138, Total=702 [2022-11-03 03:35:51,221 INFO L87 Difference]: Start difference. First operand 466 states and 1595 transitions. Second operand has 27 states, 26 states have (on average 2.230769230769231) internal successors, (58), 26 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-03 03:35:52,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:35:52,118 INFO L93 Difference]: Finished difference Result 669 states and 2191 transitions. [2022-11-03 03:35:52,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-03 03:35:52,119 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.230769230769231) internal successors, (58), 26 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) Word has length 23 [2022-11-03 03:35:52,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:35:52,123 INFO L225 Difference]: With dead ends: 669 [2022-11-03 03:35:52,123 INFO L226 Difference]: Without dead ends: 662 [2022-11-03 03:35:52,124 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 27 SyntacticMatches, 6 SemanticMatches, 29 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=159, Invalid=604, Unknown=5, NotChecked=162, Total=930 [2022-11-03 03:35:52,124 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 177 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 370 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 03:35:52,125 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 86 Invalid, 784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 392 Invalid, 0 Unknown, 370 Unchecked, 0.4s Time] [2022-11-03 03:35:52,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2022-11-03 03:35:52,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 454. [2022-11-03 03:35:52,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 453 states have (on average 3.3796909492273732) internal successors, (1531), 453 states have internal predecessors, (1531), 0 states have call successors, (0), 0 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-03 03:35:52,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 1531 transitions. [2022-11-03 03:35:52,143 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 1531 transitions. Word has length 23 [2022-11-03 03:35:52,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:35:52,143 INFO L495 AbstractCegarLoop]: Abstraction has 454 states and 1531 transitions. [2022-11-03 03:35:52,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.230769230769231) internal successors, (58), 26 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-03 03:35:52,144 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 1531 transitions. [2022-11-03 03:35:52,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-03 03:35:52,146 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:35:52,146 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:35:52,187 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-03 03:35:52,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-03 03:35:52,362 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-03 03:35:52,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:35:52,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1558851780, now seen corresponding path program 14 times [2022-11-03 03:35:52,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:35:52,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779289207] [2022-11-03 03:35:52,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:35:52,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:35:52,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:35:52,523 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 03:35:52,524 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:35:52,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779289207] [2022-11-03 03:35:52,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779289207] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:35:52,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1385962016] [2022-11-03 03:35:52,524 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 03:35:52,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:35:52,525 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:35:52,527 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:35:52,550 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-03 03:35:52,704 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-03 03:35:52,704 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:35:52,706 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-03 03:35:52,707 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:35:52,819 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 03:35:52,819 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:35:52,920 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-03 03:35:52,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1385962016] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:35:52,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [320858714] [2022-11-03 03:35:52,921 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-03 03:35:52,921 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:35:52,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-11-03 03:35:52,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137238604] [2022-11-03 03:35:52,922 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:35:52,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-03 03:35:52,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:35:52,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-03 03:35:52,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2022-11-03 03:35:52,924 INFO L87 Difference]: Start difference. First operand 454 states and 1531 transitions. Second operand has 19 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 18 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-03 03:35:53,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:35:53,327 INFO L93 Difference]: Finished difference Result 740 states and 2385 transitions. [2022-11-03 03:35:53,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-03 03:35:53,328 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 18 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 24 [2022-11-03 03:35:53,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:35:53,332 INFO L225 Difference]: With dead ends: 740 [2022-11-03 03:35:53,332 INFO L226 Difference]: Without dead ends: 740 [2022-11-03 03:35:53,332 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 34 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=154, Invalid=398, Unknown=0, NotChecked=0, Total=552 [2022-11-03 03:35:53,333 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 212 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 03:35:53,333 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 57 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 03:35:53,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2022-11-03 03:35:53,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 472. [2022-11-03 03:35:53,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 471 states have (on average 3.386411889596603) internal successors, (1595), 471 states have internal predecessors, (1595), 0 states have call successors, (0), 0 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-03 03:35:53,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 1595 transitions. [2022-11-03 03:35:53,351 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 1595 transitions. Word has length 24 [2022-11-03 03:35:53,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:35:53,352 INFO L495 AbstractCegarLoop]: Abstraction has 472 states and 1595 transitions. [2022-11-03 03:35:53,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 18 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-03 03:35:53,352 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 1595 transitions. [2022-11-03 03:35:53,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-03 03:35:53,354 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:35:53,354 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:35:53,364 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-11-03 03:35:53,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-03 03:35:53,559 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-03 03:35:53,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:35:53,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1816969074, now seen corresponding path program 15 times [2022-11-03 03:35:53,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:35:53,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756740902] [2022-11-03 03:35:53,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:35:53,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:35:53,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:35:53,736 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:35:53,736 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:35:53,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756740902] [2022-11-03 03:35:53,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756740902] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:35:53,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [709432774] [2022-11-03 03:35:53,737 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 03:35:53,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:35:53,737 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:35:53,738 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:35:53,758 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-03 03:35:53,863 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 03:35:53,863 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:35:53,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-03 03:35:53,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:35:54,012 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-03 03:35:54,013 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:35:54,123 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-03 03:35:54,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [709432774] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:35:54,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [539563450] [2022-11-03 03:35:54,124 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-03 03:35:54,125 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:35:54,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 20 [2022-11-03 03:35:54,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677684778] [2022-11-03 03:35:54,126 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:35:54,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-03 03:35:54,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:35:54,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-03 03:35:54,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2022-11-03 03:35:54,127 INFO L87 Difference]: Start difference. First operand 472 states and 1595 transitions. Second operand has 21 states, 21 states have (on average 2.2857142857142856) internal successors, (48), 20 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:35:54,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:35:54,780 INFO L93 Difference]: Finished difference Result 804 states and 2578 transitions. [2022-11-03 03:35:54,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-03 03:35:54,780 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.2857142857142856) internal successors, (48), 20 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-03 03:35:54,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:35:54,786 INFO L225 Difference]: With dead ends: 804 [2022-11-03 03:35:54,787 INFO L226 Difference]: Without dead ends: 804 [2022-11-03 03:35:54,787 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=272, Invalid=658, Unknown=0, NotChecked=0, Total=930 [2022-11-03 03:35:54,787 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 206 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 03:35:54,788 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 58 Invalid, 504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-03 03:35:54,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2022-11-03 03:35:54,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 454. [2022-11-03 03:35:54,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 453 states have (on average 3.4083885209713025) internal successors, (1544), 453 states have internal predecessors, (1544), 0 states have call successors, (0), 0 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-03 03:35:54,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 1544 transitions. [2022-11-03 03:35:54,806 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 1544 transitions. Word has length 24 [2022-11-03 03:35:54,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:35:54,806 INFO L495 AbstractCegarLoop]: Abstraction has 454 states and 1544 transitions. [2022-11-03 03:35:54,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.2857142857142856) internal successors, (48), 20 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:35:54,807 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 1544 transitions. [2022-11-03 03:35:54,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-03 03:35:54,809 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:35:54,809 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:35:54,849 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-03 03:35:55,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-03 03:35:55,023 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-03 03:35:55,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:35:55,023 INFO L85 PathProgramCache]: Analyzing trace with hash 208653892, now seen corresponding path program 16 times [2022-11-03 03:35:55,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:35:55,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745366136] [2022-11-03 03:35:55,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:35:55,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:35:55,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:35:55,244 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:35:55,244 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:35:55,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745366136] [2022-11-03 03:35:55,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745366136] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:35:55,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [866259294] [2022-11-03 03:35:55,244 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 03:35:55,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:35:55,245 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:35:55,247 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:35:55,268 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-03 03:35:55,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:35:55,378 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-03 03:35:55,380 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:35:55,512 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-03 03:35:55,513 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:35:55,638 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-03 03:35:55,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [866259294] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:35:55,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [262968825] [2022-11-03 03:35:55,639 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-03 03:35:55,640 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:35:55,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 21 [2022-11-03 03:35:55,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438151009] [2022-11-03 03:35:55,641 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:35:55,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-03 03:35:55,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:35:55,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-03 03:35:55,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=368, Unknown=0, NotChecked=0, Total=462 [2022-11-03 03:35:55,642 INFO L87 Difference]: Start difference. First operand 454 states and 1544 transitions. Second operand has 22 states, 22 states have (on average 2.227272727272727) internal successors, (49), 21 states have internal predecessors, (49), 0 states have call successors, (0), 0 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-03 03:35:56,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:35:56,083 INFO L93 Difference]: Finished difference Result 728 states and 2353 transitions. [2022-11-03 03:35:56,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-03 03:35:56,084 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.227272727272727) internal successors, (49), 21 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-03 03:35:56,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:35:56,088 INFO L225 Difference]: With dead ends: 728 [2022-11-03 03:35:56,088 INFO L226 Difference]: Without dead ends: 728 [2022-11-03 03:35:56,088 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=190, Invalid=566, Unknown=0, NotChecked=0, Total=756 [2022-11-03 03:35:56,088 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 223 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 03:35:56,089 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 48 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 03:35:56,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2022-11-03 03:35:56,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 456. [2022-11-03 03:35:56,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 455 states have (on average 3.389010989010989) internal successors, (1542), 455 states have internal predecessors, (1542), 0 states have call successors, (0), 0 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-03 03:35:56,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 1542 transitions. [2022-11-03 03:35:56,107 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 1542 transitions. Word has length 24 [2022-11-03 03:35:56,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:35:56,107 INFO L495 AbstractCegarLoop]: Abstraction has 456 states and 1542 transitions. [2022-11-03 03:35:56,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.227272727272727) internal successors, (49), 21 states have internal predecessors, (49), 0 states have call successors, (0), 0 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-03 03:35:56,108 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 1542 transitions. [2022-11-03 03:35:56,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-03 03:35:56,109 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:35:56,110 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:35:56,146 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-11-03 03:35:56,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:35:56,329 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-03 03:35:56,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:35:56,329 INFO L85 PathProgramCache]: Analyzing trace with hash -109065004, now seen corresponding path program 17 times [2022-11-03 03:35:56,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:35:56,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787375564] [2022-11-03 03:35:56,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:35:56,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:35:56,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:35:56,500 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:35:56,500 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:35:56,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787375564] [2022-11-03 03:35:56,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787375564] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:35:56,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [725648102] [2022-11-03 03:35:56,500 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 03:35:56,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:35:56,500 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:35:56,501 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:35:56,503 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-03 03:35:56,648 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-03 03:35:56,648 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:35:56,650 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-03 03:35:56,651 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:35:56,736 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 03:35:56,736 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:35:56,828 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-03 03:35:56,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [725648102] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:35:56,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1354196138] [2022-11-03 03:35:56,829 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-03 03:35:56,830 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:35:56,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 17 [2022-11-03 03:35:56,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258996537] [2022-11-03 03:35:56,830 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:35:56,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-03 03:35:56,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:35:56,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-03 03:35:56,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2022-11-03 03:35:56,831 INFO L87 Difference]: Start difference. First operand 456 states and 1542 transitions. Second operand has 18 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 17 states have internal predecessors, (50), 0 states have call successors, (0), 0 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-03 03:35:57,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:35:57,615 INFO L93 Difference]: Finished difference Result 744 states and 2431 transitions. [2022-11-03 03:35:57,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-03 03:35:57,615 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 17 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-03 03:35:57,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:35:57,619 INFO L225 Difference]: With dead ends: 744 [2022-11-03 03:35:57,620 INFO L226 Difference]: Without dead ends: 744 [2022-11-03 03:35:57,620 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=325, Invalid=731, Unknown=0, NotChecked=0, Total=1056 [2022-11-03 03:35:57,620 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 161 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 654 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 03:35:57,621 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 66 Invalid, 680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 654 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-03 03:35:57,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2022-11-03 03:35:57,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 498. [2022-11-03 03:35:57,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 497 states have (on average 3.408450704225352) internal successors, (1694), 497 states have internal predecessors, (1694), 0 states have call successors, (0), 0 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-03 03:35:57,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 1694 transitions. [2022-11-03 03:35:57,638 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 1694 transitions. Word has length 24 [2022-11-03 03:35:57,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:35:57,638 INFO L495 AbstractCegarLoop]: Abstraction has 498 states and 1694 transitions. [2022-11-03 03:35:57,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 17 states have internal predecessors, (50), 0 states have call successors, (0), 0 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-03 03:35:57,639 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 1694 transitions. [2022-11-03 03:35:57,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-03 03:35:57,640 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:35:57,640 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:35:57,651 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-11-03 03:35:57,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:35:57,852 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-03 03:35:57,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:35:57,852 INFO L85 PathProgramCache]: Analyzing trace with hash 478558430, now seen corresponding path program 18 times [2022-11-03 03:35:57,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:35:57,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817839049] [2022-11-03 03:35:57,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:35:57,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:35:57,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:35:57,961 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-03 03:35:57,961 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:35:57,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817839049] [2022-11-03 03:35:57,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817839049] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:35:57,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1227119043] [2022-11-03 03:35:57,962 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 03:35:57,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:35:57,963 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:35:57,964 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:35:57,990 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-03 03:35:58,092 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 03:35:58,092 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:35:58,093 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-03 03:35:58,094 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:35:58,198 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-03 03:35:58,198 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:35:58,278 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-03 03:35:58,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1227119043] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:35:58,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1308174173] [2022-11-03 03:35:58,279 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-03 03:35:58,279 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:35:58,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 9] total 19 [2022-11-03 03:35:58,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24871531] [2022-11-03 03:35:58,280 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:35:58,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-03 03:35:58,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:35:58,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-03 03:35:58,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2022-11-03 03:35:58,281 INFO L87 Difference]: Start difference. First operand 498 states and 1694 transitions. Second operand has 19 states, 19 states have (on average 2.526315789473684) internal successors, (48), 19 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:35:59,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:35:59,206 INFO L93 Difference]: Finished difference Result 754 states and 2299 transitions. [2022-11-03 03:35:59,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-03 03:35:59,206 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.526315789473684) internal successors, (48), 19 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-03 03:35:59,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:35:59,211 INFO L225 Difference]: With dead ends: 754 [2022-11-03 03:35:59,211 INFO L226 Difference]: Without dead ends: 746 [2022-11-03 03:35:59,212 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=260, Invalid=1000, Unknown=0, NotChecked=0, Total=1260 [2022-11-03 03:35:59,212 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 265 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 1048 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 1078 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1048 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-03 03:35:59,213 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 66 Invalid, 1078 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1048 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-03 03:35:59,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2022-11-03 03:35:59,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 464. [2022-11-03 03:35:59,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 463 states have (on average 3.239740820734341) internal successors, (1500), 463 states have internal predecessors, (1500), 0 states have call successors, (0), 0 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-03 03:35:59,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 1500 transitions. [2022-11-03 03:35:59,229 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 1500 transitions. Word has length 24 [2022-11-03 03:35:59,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:35:59,229 INFO L495 AbstractCegarLoop]: Abstraction has 464 states and 1500 transitions. [2022-11-03 03:35:59,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.526315789473684) internal successors, (48), 19 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:35:59,230 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 1500 transitions. [2022-11-03 03:35:59,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-03 03:35:59,232 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:35:59,232 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:35:59,271 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-11-03 03:35:59,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-11-03 03:35:59,447 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-03 03:35:59,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:35:59,447 INFO L85 PathProgramCache]: Analyzing trace with hash 2002443249, now seen corresponding path program 19 times [2022-11-03 03:35:59,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:35:59,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383817474] [2022-11-03 03:35:59,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:35:59,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:35:59,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:35:59,587 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-03 03:35:59,587 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:35:59,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383817474] [2022-11-03 03:35:59,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383817474] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:35:59,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [782050708] [2022-11-03 03:35:59,588 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 03:35:59,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:35:59,588 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:35:59,591 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:35:59,614 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-11-03 03:35:59,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:35:59,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-03 03:35:59,727 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:35:59,861 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-03 03:35:59,861 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:35:59,937 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-03 03:35:59,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [782050708] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:35:59,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [132491876] [2022-11-03 03:35:59,938 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-03 03:35:59,939 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:35:59,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2022-11-03 03:35:59,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780014045] [2022-11-03 03:35:59,939 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:35:59,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-03 03:35:59,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:35:59,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-03 03:35:59,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-11-03 03:35:59,940 INFO L87 Difference]: Start difference. First operand 464 states and 1500 transitions. Second operand has 14 states, 14 states have (on average 3.0) internal successors, (42), 13 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-03 03:36:00,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:36:00,178 INFO L93 Difference]: Finished difference Result 526 states and 1570 transitions. [2022-11-03 03:36:00,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 03:36:00,179 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0) internal successors, (42), 13 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 24 [2022-11-03 03:36:00,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:36:00,182 INFO L225 Difference]: With dead ends: 526 [2022-11-03 03:36:00,183 INFO L226 Difference]: Without dead ends: 482 [2022-11-03 03:36:00,183 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2022-11-03 03:36:00,184 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 108 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 03:36:00,184 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 37 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 03:36:00,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2022-11-03 03:36:00,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 466. [2022-11-03 03:36:00,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 465 states have (on average 3.0688172043010753) internal successors, (1427), 465 states have internal predecessors, (1427), 0 states have call successors, (0), 0 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-03 03:36:00,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 1427 transitions. [2022-11-03 03:36:00,197 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 1427 transitions. Word has length 24 [2022-11-03 03:36:00,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:36:00,198 INFO L495 AbstractCegarLoop]: Abstraction has 466 states and 1427 transitions. [2022-11-03 03:36:00,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0) internal successors, (42), 13 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-03 03:36:00,198 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 1427 transitions. [2022-11-03 03:36:00,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-03 03:36:00,200 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:36:00,200 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:36:00,238 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-11-03 03:36:00,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-11-03 03:36:00,419 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-03 03:36:00,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:36:00,419 INFO L85 PathProgramCache]: Analyzing trace with hash 43275662, now seen corresponding path program 1 times [2022-11-03 03:36:00,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:36:00,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852790104] [2022-11-03 03:36:00,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:36:00,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:36:00,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:36:00,540 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:36:00,541 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:36:00,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852790104] [2022-11-03 03:36:00,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852790104] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:36:00,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [827225782] [2022-11-03 03:36:00,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:36:00,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:36:00,542 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:36:00,543 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:36:00,569 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-11-03 03:36:00,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:36:00,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-03 03:36:00,692 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:36:00,799 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:36:00,799 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:36:00,889 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:36:00,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [827225782] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:36:00,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1478190699] [2022-11-03 03:36:00,890 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java: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-03 03:36:00,891 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:36:00,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2022-11-03 03:36:00,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406162273] [2022-11-03 03:36:00,891 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:36:00,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-03 03:36:00,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:36:00,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-03 03:36:00,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2022-11-03 03:36:00,892 INFO L87 Difference]: Start difference. First operand 466 states and 1427 transitions. Second operand has 16 states, 16 states have (on average 2.6875) internal successors, (43), 15 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-03 03:36:01,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:36:01,286 INFO L93 Difference]: Finished difference Result 496 states and 1478 transitions. [2022-11-03 03:36:01,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-03 03:36:01,286 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.6875) internal successors, (43), 15 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 24 [2022-11-03 03:36:01,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:36:01,290 INFO L225 Difference]: With dead ends: 496 [2022-11-03 03:36:01,290 INFO L226 Difference]: Without dead ends: 460 [2022-11-03 03:36:01,290 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=145, Invalid=361, Unknown=0, NotChecked=0, Total=506 [2022-11-03 03:36:01,291 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 133 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 03:36:01,291 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 69 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 03:36:01,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2022-11-03 03:36:01,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 444. [2022-11-03 03:36:01,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 443 states have (on average 3.0632054176072234) internal successors, (1357), 443 states have internal predecessors, (1357), 0 states have call successors, (0), 0 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-03 03:36:01,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 1357 transitions. [2022-11-03 03:36:01,302 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 1357 transitions. Word has length 24 [2022-11-03 03:36:01,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:36:01,302 INFO L495 AbstractCegarLoop]: Abstraction has 444 states and 1357 transitions. [2022-11-03 03:36:01,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.6875) internal successors, (43), 15 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-03 03:36:01,303 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 1357 transitions. [2022-11-03 03:36:01,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-03 03:36:01,304 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:36:01,304 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:36:01,343 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-11-03 03:36:01,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:36:01,519 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-03 03:36:01,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:36:01,519 INFO L85 PathProgramCache]: Analyzing trace with hash 547255124, now seen corresponding path program 2 times [2022-11-03 03:36:01,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:36:01,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076315514] [2022-11-03 03:36:01,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:36:01,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:36:01,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:36:01,656 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:36:01,657 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:36:01,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076315514] [2022-11-03 03:36:01,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076315514] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:36:01,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [910486636] [2022-11-03 03:36:01,657 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 03:36:01,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:36:01,658 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:36:01,659 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:36:01,660 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-11-03 03:36:01,798 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-03 03:36:01,798 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:36:01,799 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-03 03:36:01,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:36:01,918 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:36:01,919 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:36:02,001 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:36:02,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [910486636] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:36:02,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1140817609] [2022-11-03 03:36:02,002 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-03 03:36:02,004 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:36:02,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2022-11-03 03:36:02,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120020898] [2022-11-03 03:36:02,004 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:36:02,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-03 03:36:02,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:36:02,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-03 03:36:02,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2022-11-03 03:36:02,006 INFO L87 Difference]: Start difference. First operand 444 states and 1357 transitions. Second operand has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 16 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-03 03:36:02,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:36:02,573 INFO L93 Difference]: Finished difference Result 620 states and 1785 transitions. [2022-11-03 03:36:02,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-03 03:36:02,573 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 16 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-03 03:36:02,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:36:02,576 INFO L225 Difference]: With dead ends: 620 [2022-11-03 03:36:02,576 INFO L226 Difference]: Without dead ends: 606 [2022-11-03 03:36:02,576 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=208, Invalid=494, Unknown=0, NotChecked=0, Total=702 [2022-11-03 03:36:02,577 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 175 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 606 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 03:36:02,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 77 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 606 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-03 03:36:02,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2022-11-03 03:36:02,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 454. [2022-11-03 03:36:02,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 453 states have (on average 3.0441501103752757) internal successors, (1379), 453 states have internal predecessors, (1379), 0 states have call successors, (0), 0 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-03 03:36:02,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 1379 transitions. [2022-11-03 03:36:02,591 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 1379 transitions. Word has length 24 [2022-11-03 03:36:02,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:36:02,591 INFO L495 AbstractCegarLoop]: Abstraction has 454 states and 1379 transitions. [2022-11-03 03:36:02,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 16 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-03 03:36:02,591 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 1379 transitions. [2022-11-03 03:36:02,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-03 03:36:02,593 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:36:02,593 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:36:02,625 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-11-03 03:36:02,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-11-03 03:36:02,803 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-03 03:36:02,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:36:02,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1278615886, now seen corresponding path program 3 times [2022-11-03 03:36:02,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:36:02,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346131862] [2022-11-03 03:36:02,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:36:02,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:36:02,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:36:02,943 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:36:02,944 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:36:02,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346131862] [2022-11-03 03:36:02,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346131862] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:36:02,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1335272589] [2022-11-03 03:36:02,944 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 03:36:02,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:36:02,945 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:36:02,946 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:36:02,959 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-11-03 03:36:03,086 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 03:36:03,087 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:36:03,088 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-03 03:36:03,089 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:36:03,207 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 03:36:03,208 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:36:03,316 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 03:36:03,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1335272589] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:36:03,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1845769253] [2022-11-03 03:36:03,316 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-03 03:36:03,317 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:36:03,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 19 [2022-11-03 03:36:03,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681238680] [2022-11-03 03:36:03,317 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:36:03,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-03 03:36:03,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:36:03,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-03 03:36:03,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2022-11-03 03:36:03,318 INFO L87 Difference]: Start difference. First operand 454 states and 1379 transitions. Second operand has 19 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 19 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:36:05,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:36:05,698 INFO L93 Difference]: Finished difference Result 1306 states and 3688 transitions. [2022-11-03 03:36:05,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-11-03 03:36:05,699 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 19 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-03 03:36:05,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:36:05,704 INFO L225 Difference]: With dead ends: 1306 [2022-11-03 03:36:05,705 INFO L226 Difference]: Without dead ends: 1196 [2022-11-03 03:36:05,707 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1332 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1042, Invalid=3788, Unknown=0, NotChecked=0, Total=4830 [2022-11-03 03:36:05,708 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 305 mSDsluCounter, 789 mSDsCounter, 0 mSdLazyCounter, 1632 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 1698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 1632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:36:05,708 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 55 Invalid, 1698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 1632 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-03 03:36:05,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2022-11-03 03:36:05,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 490. [2022-11-03 03:36:05,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 489 states have (on average 3.259713701431493) internal successors, (1594), 489 states have internal predecessors, (1594), 0 states have call successors, (0), 0 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-03 03:36:05,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 1594 transitions. [2022-11-03 03:36:05,737 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 1594 transitions. Word has length 24 [2022-11-03 03:36:05,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:36:05,737 INFO L495 AbstractCegarLoop]: Abstraction has 490 states and 1594 transitions. [2022-11-03 03:36:05,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 19 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:36:05,738 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 1594 transitions. [2022-11-03 03:36:05,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-03 03:36:05,739 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:36:05,740 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:36:05,776 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-11-03 03:36:05,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-11-03 03:36:05,963 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-03 03:36:05,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:36:05,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1700109824, now seen corresponding path program 4 times [2022-11-03 03:36:05,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:36:05,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244457240] [2022-11-03 03:36:05,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:36:05,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:36:05,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:36:06,082 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:36:06,082 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:36:06,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244457240] [2022-11-03 03:36:06,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244457240] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:36:06,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1096783196] [2022-11-03 03:36:06,083 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 03:36:06,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:36:06,083 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:36:06,084 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:36:06,085 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-11-03 03:36:06,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:36:06,218 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-03 03:36:06,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:36:06,304 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:36:06,305 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:36:06,391 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:36:06,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1096783196] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:36:06,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1658204990] [2022-11-03 03:36:06,391 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-03 03:36:06,392 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:36:06,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2022-11-03 03:36:06,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882928771] [2022-11-03 03:36:06,393 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:36:06,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-03 03:36:06,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:36:06,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-03 03:36:06,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2022-11-03 03:36:06,394 INFO L87 Difference]: Start difference. First operand 490 states and 1594 transitions. Second operand has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 16 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:36:06,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:36:06,823 INFO L93 Difference]: Finished difference Result 576 states and 1784 transitions. [2022-11-03 03:36:06,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-03 03:36:06,823 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 16 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-03 03:36:06,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:36:06,827 INFO L225 Difference]: With dead ends: 576 [2022-11-03 03:36:06,827 INFO L226 Difference]: Without dead ends: 562 [2022-11-03 03:36:06,828 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=165, Invalid=387, Unknown=0, NotChecked=0, Total=552 [2022-11-03 03:36:06,829 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 148 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 03:36:06,829 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 70 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 03:36:06,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2022-11-03 03:36:06,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 476. [2022-11-03 03:36:06,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 476 states, 475 states have (on average 3.258947368421053) internal successors, (1548), 475 states have internal predecessors, (1548), 0 states have call successors, (0), 0 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-03 03:36:06,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 1548 transitions. [2022-11-03 03:36:06,855 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 1548 transitions. Word has length 24 [2022-11-03 03:36:06,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:36:06,856 INFO L495 AbstractCegarLoop]: Abstraction has 476 states and 1548 transitions. [2022-11-03 03:36:06,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 16 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:36:06,856 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 1548 transitions. [2022-11-03 03:36:06,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-03 03:36:06,858 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:36:06,858 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:36:06,894 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-11-03 03:36:07,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:36:07,071 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-03 03:36:07,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:36:07,071 INFO L85 PathProgramCache]: Analyzing trace with hash -968749062, now seen corresponding path program 5 times [2022-11-03 03:36:07,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:36:07,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250972375] [2022-11-03 03:36:07,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:36:07,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:36:07,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:36:07,204 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:36:07,204 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:36:07,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250972375] [2022-11-03 03:36:07,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250972375] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:36:07,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1613192426] [2022-11-03 03:36:07,205 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 03:36:07,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:36:07,205 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:36:07,207 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:36:07,230 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-11-03 03:36:07,407 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-03 03:36:07,407 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:36:07,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-03 03:36:07,410 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:36:07,498 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:36:07,498 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:36:07,594 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:36:07,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1613192426] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:36:07,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1339463784] [2022-11-03 03:36:07,595 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-03 03:36:07,596 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:36:07,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2022-11-03 03:36:07,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230101063] [2022-11-03 03:36:07,597 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:36:07,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-03 03:36:07,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:36:07,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-03 03:36:07,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2022-11-03 03:36:07,599 INFO L87 Difference]: Start difference. First operand 476 states and 1548 transitions. Second operand has 18 states, 18 states have (on average 2.111111111111111) internal successors, (38), 17 states have internal predecessors, (38), 0 states have call successors, (0), 0 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-03 03:36:08,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:36:08,057 INFO L93 Difference]: Finished difference Result 512 states and 1607 transitions. [2022-11-03 03:36:08,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-03 03:36:08,058 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.111111111111111) internal successors, (38), 17 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-03 03:36:08,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:36:08,061 INFO L225 Difference]: With dead ends: 512 [2022-11-03 03:36:08,061 INFO L226 Difference]: Without dead ends: 482 [2022-11-03 03:36:08,062 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=211, Invalid=545, Unknown=0, NotChecked=0, Total=756 [2022-11-03 03:36:08,062 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 187 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 03:36:08,063 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 50 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 03:36:08,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2022-11-03 03:36:08,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 466. [2022-11-03 03:36:08,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 465 states have (on average 3.260215053763441) internal successors, (1516), 465 states have internal predecessors, (1516), 0 states have call successors, (0), 0 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-03 03:36:08,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 1516 transitions. [2022-11-03 03:36:08,076 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 1516 transitions. Word has length 24 [2022-11-03 03:36:08,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:36:08,077 INFO L495 AbstractCegarLoop]: Abstraction has 466 states and 1516 transitions. [2022-11-03 03:36:08,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.111111111111111) internal successors, (38), 17 states have internal predecessors, (38), 0 states have call successors, (0), 0 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-03 03:36:08,077 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 1516 transitions. [2022-11-03 03:36:08,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-03 03:36:08,079 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:36:08,079 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:36:08,119 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2022-11-03 03:36:08,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-11-03 03:36:08,304 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-03 03:36:08,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:36:08,304 INFO L85 PathProgramCache]: Analyzing trace with hash 365167132, now seen corresponding path program 6 times [2022-11-03 03:36:08,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:36:08,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630272130] [2022-11-03 03:36:08,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:36:08,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:36:08,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:36:08,426 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:36:08,427 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:36:08,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630272130] [2022-11-03 03:36:08,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630272130] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:36:08,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1469399053] [2022-11-03 03:36:08,427 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 03:36:08,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:36:08,428 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:36:08,435 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:36:08,458 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-11-03 03:36:08,578 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 03:36:08,578 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:36:08,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-03 03:36:08,580 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:36:08,674 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 03:36:08,674 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:36:08,762 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 03:36:08,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1469399053] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:36:08,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1244365683] [2022-11-03 03:36:08,763 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 03:36:08,763 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:36:08,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 18 [2022-11-03 03:36:08,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864056462] [2022-11-03 03:36:08,764 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:36:08,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-03 03:36:08,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:36:08,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-03 03:36:08,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2022-11-03 03:36:08,765 INFO L87 Difference]: Start difference. First operand 466 states and 1516 transitions. Second operand has 18 states, 18 states have (on average 2.6666666666666665) internal successors, (48), 18 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:36:10,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:36:10,047 INFO L93 Difference]: Finished difference Result 682 states and 2078 transitions. [2022-11-03 03:36:10,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-11-03 03:36:10,048 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.6666666666666665) internal successors, (48), 18 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-03 03:36:10,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:36:10,051 INFO L225 Difference]: With dead ends: 682 [2022-11-03 03:36:10,051 INFO L226 Difference]: Without dead ends: 565 [2022-11-03 03:36:10,052 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 410 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=464, Invalid=1606, Unknown=0, NotChecked=0, Total=2070 [2022-11-03 03:36:10,052 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 175 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 829 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 876 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 829 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-03 03:36:10,053 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 63 Invalid, 876 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 829 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-03 03:36:10,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2022-11-03 03:36:10,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 359. [2022-11-03 03:36:10,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 358 states have (on average 3.4720670391061454) internal successors, (1243), 358 states have internal predecessors, (1243), 0 states have call successors, (0), 0 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-03 03:36:10,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 1243 transitions. [2022-11-03 03:36:10,065 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 1243 transitions. Word has length 24 [2022-11-03 03:36:10,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:36:10,066 INFO L495 AbstractCegarLoop]: Abstraction has 359 states and 1243 transitions. [2022-11-03 03:36:10,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.6666666666666665) internal successors, (48), 18 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:36:10,066 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 1243 transitions. [2022-11-03 03:36:10,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-03 03:36:10,067 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:36:10,068 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:36:10,103 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-11-03 03:36:10,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-11-03 03:36:10,295 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-03 03:36:10,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:36:10,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1347272505, now seen corresponding path program 20 times [2022-11-03 03:36:10,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:36:10,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142184828] [2022-11-03 03:36:10,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:36:10,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:36:10,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:36:10,462 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 03:36:10,462 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:36:10,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142184828] [2022-11-03 03:36:10,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142184828] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:36:10,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [526436791] [2022-11-03 03:36:10,463 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 03:36:10,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:36:10,463 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:36:10,467 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:36:10,472 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-11-03 03:36:10,653 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-03 03:36:10,653 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:36:10,655 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-03 03:36:10,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:36:10,775 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 03:36:10,775 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:36:10,891 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 03:36:10,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [526436791] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:36:10,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [924438551] [2022-11-03 03:36:10,892 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-03 03:36:10,893 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:36:10,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 20 [2022-11-03 03:36:10,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095309592] [2022-11-03 03:36:10,893 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:36:10,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-03 03:36:10,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:36:10,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-03 03:36:10,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2022-11-03 03:36:10,895 INFO L87 Difference]: Start difference. First operand 359 states and 1243 transitions. Second operand has 21 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 20 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-03 03:36:11,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:36:11,530 INFO L93 Difference]: Finished difference Result 563 states and 1850 transitions. [2022-11-03 03:36:11,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-03 03:36:11,530 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 20 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 25 [2022-11-03 03:36:11,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:36:11,533 INFO L225 Difference]: With dead ends: 563 [2022-11-03 03:36:11,533 INFO L226 Difference]: Without dead ends: 563 [2022-11-03 03:36:11,533 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=276, Invalid=716, Unknown=0, NotChecked=0, Total=992 [2022-11-03 03:36:11,534 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 289 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 03:36:11,534 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 54 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 03:36:11,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2022-11-03 03:36:11,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 383. [2022-11-03 03:36:11,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 382 states have (on average 3.56282722513089) internal successors, (1361), 382 states have internal predecessors, (1361), 0 states have call successors, (0), 0 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-03 03:36:11,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1361 transitions. [2022-11-03 03:36:11,547 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1361 transitions. Word has length 25 [2022-11-03 03:36:11,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:36:11,548 INFO L495 AbstractCegarLoop]: Abstraction has 383 states and 1361 transitions. [2022-11-03 03:36:11,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 20 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-03 03:36:11,548 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1361 transitions. [2022-11-03 03:36:11,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-03 03:36:11,550 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:36:11,550 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:36:11,591 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-11-03 03:36:11,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-11-03 03:36:11,775 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-03 03:36:11,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:36:11,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1339379609, now seen corresponding path program 21 times [2022-11-03 03:36:11,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:36:11,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622626312] [2022-11-03 03:36:11,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:36:11,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:36:11,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:36:11,941 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 03:36:11,941 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:36:11,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622626312] [2022-11-03 03:36:11,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622626312] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:36:11,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [283801084] [2022-11-03 03:36:11,942 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 03:36:11,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:36:11,942 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:36:11,944 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:36:11,945 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-11-03 03:36:12,064 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 03:36:12,064 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:36:12,065 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-03 03:36:12,065 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:36:12,167 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 03:36:12,167 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:36:12,272 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 03:36:12,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [283801084] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:36:12,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [563575320] [2022-11-03 03:36:12,273 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java: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-03 03:36:12,273 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:36:12,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2022-11-03 03:36:12,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432189497] [2022-11-03 03:36:12,273 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:36:12,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-03 03:36:12,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:36:12,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-03 03:36:12,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2022-11-03 03:36:12,274 INFO L87 Difference]: Start difference. First operand 383 states and 1361 transitions. Second operand has 20 states, 20 states have (on average 2.15) internal successors, (43), 20 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-03 03:36:13,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:36:13,271 INFO L93 Difference]: Finished difference Result 547 states and 1817 transitions. [2022-11-03 03:36:13,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-03 03:36:13,272 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.15) internal successors, (43), 20 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 25 [2022-11-03 03:36:13,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:36:13,274 INFO L225 Difference]: With dead ends: 547 [2022-11-03 03:36:13,274 INFO L226 Difference]: Without dead ends: 547 [2022-11-03 03:36:13,275 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=391, Invalid=1249, Unknown=0, NotChecked=0, Total=1640 [2022-11-03 03:36:13,275 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 218 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 03:36:13,276 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 55 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 638 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-03 03:36:13,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2022-11-03 03:36:13,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 371. [2022-11-03 03:36:13,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 370 states have (on average 3.502702702702703) internal successors, (1296), 370 states have internal predecessors, (1296), 0 states have call successors, (0), 0 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-03 03:36:13,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 1296 transitions. [2022-11-03 03:36:13,289 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 1296 transitions. Word has length 25 [2022-11-03 03:36:13,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:36:13,289 INFO L495 AbstractCegarLoop]: Abstraction has 371 states and 1296 transitions. [2022-11-03 03:36:13,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.15) internal successors, (43), 20 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-03 03:36:13,290 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 1296 transitions. [2022-11-03 03:36:13,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-03 03:36:13,291 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:36:13,291 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:36:13,320 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-11-03 03:36:13,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:36:13,511 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-03 03:36:13,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:36:13,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1021660713, now seen corresponding path program 22 times [2022-11-03 03:36:13,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:36:13,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225271259] [2022-11-03 03:36:13,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:36:13,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:36:13,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:36:13,679 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 03:36:13,679 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:36:13,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225271259] [2022-11-03 03:36:13,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225271259] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:36:13,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [421499618] [2022-11-03 03:36:13,680 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 03:36:13,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:36:13,680 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:36:13,683 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:36:13,686 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-11-03 03:36:13,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:36:13,822 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-03 03:36:13,822 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:36:13,931 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 03:36:13,931 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:36:14,037 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 03:36:14,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [421499618] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:36:14,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1966356064] [2022-11-03 03:36:14,038 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-03 03:36:14,039 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:36:14,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 19 [2022-11-03 03:36:14,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925887913] [2022-11-03 03:36:14,040 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:36:14,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-03 03:36:14,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:36:14,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-03 03:36:14,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2022-11-03 03:36:14,041 INFO L87 Difference]: Start difference. First operand 371 states and 1296 transitions. Second operand has 20 states, 20 states have (on average 1.95) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:36:14,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:36:14,346 INFO L93 Difference]: Finished difference Result 413 states and 1395 transitions. [2022-11-03 03:36:14,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-03 03:36:14,346 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.95) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-03 03:36:14,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:36:14,348 INFO L225 Difference]: With dead ends: 413 [2022-11-03 03:36:14,348 INFO L226 Difference]: Without dead ends: 413 [2022-11-03 03:36:14,349 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=158, Invalid=442, Unknown=0, NotChecked=0, Total=600 [2022-11-03 03:36:14,349 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 146 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 03:36:14,350 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 36 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 03:36:14,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2022-11-03 03:36:14,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 359. [2022-11-03 03:36:14,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 358 states have (on average 3.4720670391061454) internal successors, (1243), 358 states have internal predecessors, (1243), 0 states have call successors, (0), 0 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-03 03:36:14,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 1243 transitions. [2022-11-03 03:36:14,360 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 1243 transitions. Word has length 25 [2022-11-03 03:36:14,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:36:14,361 INFO L495 AbstractCegarLoop]: Abstraction has 359 states and 1243 transitions. [2022-11-03 03:36:14,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.95) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:36:14,361 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 1243 transitions. [2022-11-03 03:36:14,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-03 03:36:14,362 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:36:14,363 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:36:14,388 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-11-03 03:36:14,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:36:14,571 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-03 03:36:14,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:36:14,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1996979611, now seen corresponding path program 23 times [2022-11-03 03:36:14,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:36:14,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833412882] [2022-11-03 03:36:14,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:36:14,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:36:14,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:36:14,725 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 03:36:14,726 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:36:14,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833412882] [2022-11-03 03:36:14,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833412882] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:36:14,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2108918425] [2022-11-03 03:36:14,726 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 03:36:14,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:36:14,727 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:36:14,728 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:36:14,759 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-11-03 03:36:14,955 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-03 03:36:14,956 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:36:14,957 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-03 03:36:14,958 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:36:15,090 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 03:36:15,090 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:36:15,202 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 03:36:15,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2108918425] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:36:15,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1749193794] [2022-11-03 03:36:15,203 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-03 03:36:15,203 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:36:15,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 20 [2022-11-03 03:36:15,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827392947] [2022-11-03 03:36:15,203 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:36:15,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-03 03:36:15,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:36:15,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-03 03:36:15,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2022-11-03 03:36:15,205 INFO L87 Difference]: Start difference. First operand 359 states and 1243 transitions. Second operand has 21 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 20 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-03 03:36:15,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:36:15,884 INFO L93 Difference]: Finished difference Result 705 states and 2386 transitions. [2022-11-03 03:36:15,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-03 03:36:15,884 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 20 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 25 [2022-11-03 03:36:15,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:36:15,887 INFO L225 Difference]: With dead ends: 705 [2022-11-03 03:36:15,887 INFO L226 Difference]: Without dead ends: 705 [2022-11-03 03:36:15,887 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=368, Invalid=822, Unknown=0, NotChecked=0, Total=1190 [2022-11-03 03:36:15,888 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 298 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 03:36:15,888 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 50 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 03:36:15,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2022-11-03 03:36:15,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 383. [2022-11-03 03:36:15,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 382 states have (on average 3.56282722513089) internal successors, (1361), 382 states have internal predecessors, (1361), 0 states have call successors, (0), 0 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-03 03:36:15,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1361 transitions. [2022-11-03 03:36:15,899 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1361 transitions. Word has length 25 [2022-11-03 03:36:15,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:36:15,900 INFO L495 AbstractCegarLoop]: Abstraction has 383 states and 1361 transitions. [2022-11-03 03:36:15,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 20 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-03 03:36:15,900 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1361 transitions. [2022-11-03 03:36:15,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-03 03:36:15,901 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:36:15,902 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:36:15,937 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-11-03 03:36:16,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2022-11-03 03:36:16,118 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-03 03:36:16,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:36:16,118 INFO L85 PathProgramCache]: Analyzing trace with hash 689672503, now seen corresponding path program 24 times [2022-11-03 03:36:16,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:36:16,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748727489] [2022-11-03 03:36:16,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:36:16,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:36:16,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:36:16,268 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 03:36:16,268 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:36:16,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748727489] [2022-11-03 03:36:16,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748727489] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:36:16,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2088250008] [2022-11-03 03:36:16,269 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 03:36:16,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:36:16,269 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:36:16,270 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:36:16,290 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-11-03 03:36:16,424 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 03:36:16,424 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:36:16,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-03 03:36:16,425 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:36:16,518 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 03:36:16,518 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:36:16,618 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 03:36:16,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2088250008] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:36:16,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [731058349] [2022-11-03 03:36:16,619 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-03 03:36:16,619 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:36:16,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2022-11-03 03:36:16,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511838851] [2022-11-03 03:36:16,620 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:36:16,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-03 03:36:16,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:36:16,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-03 03:36:16,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2022-11-03 03:36:16,621 INFO L87 Difference]: Start difference. First operand 383 states and 1361 transitions. Second operand has 20 states, 20 states have (on average 2.15) internal successors, (43), 20 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-03 03:36:18,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:36:18,134 INFO L93 Difference]: Finished difference Result 689 states and 2349 transitions. [2022-11-03 03:36:18,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-11-03 03:36:18,134 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.15) internal successors, (43), 20 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 25 [2022-11-03 03:36:18,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:36:18,137 INFO L225 Difference]: With dead ends: 689 [2022-11-03 03:36:18,137 INFO L226 Difference]: Without dead ends: 689 [2022-11-03 03:36:18,138 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 623 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=737, Invalid=2019, Unknown=0, NotChecked=0, Total=2756 [2022-11-03 03:36:18,139 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 246 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 780 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-03 03:36:18,139 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 69 Invalid, 816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 780 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-03 03:36:18,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2022-11-03 03:36:18,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 371. [2022-11-03 03:36:18,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 370 states have (on average 3.502702702702703) internal successors, (1296), 370 states have internal predecessors, (1296), 0 states have call successors, (0), 0 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-03 03:36:18,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 1296 transitions. [2022-11-03 03:36:18,154 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 1296 transitions. Word has length 25 [2022-11-03 03:36:18,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:36:18,154 INFO L495 AbstractCegarLoop]: Abstraction has 371 states and 1296 transitions. [2022-11-03 03:36:18,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.15) internal successors, (43), 20 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-03 03:36:18,155 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 1296 transitions. [2022-11-03 03:36:18,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-03 03:36:18,156 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:36:18,156 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:36:18,187 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-11-03 03:36:18,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-11-03 03:36:18,367 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-03 03:36:18,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:36:18,367 INFO L85 PathProgramCache]: Analyzing trace with hash 147422377, now seen corresponding path program 25 times [2022-11-03 03:36:18,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:36:18,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437906793] [2022-11-03 03:36:18,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:36:18,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:36:18,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:36:18,534 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 03:36:18,534 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:36:18,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437906793] [2022-11-03 03:36:18,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437906793] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:36:18,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [630524688] [2022-11-03 03:36:18,535 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 03:36:18,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:36:18,535 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:36:18,539 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:36:18,562 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-11-03 03:36:18,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:36:18,725 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-03 03:36:18,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:36:18,832 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 03:36:18,832 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:36:18,965 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 03:36:18,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [630524688] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:36:18,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [91672424] [2022-11-03 03:36:18,966 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-03 03:36:18,966 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:36:18,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 19 [2022-11-03 03:36:18,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964537618] [2022-11-03 03:36:18,966 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:36:18,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-03 03:36:18,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:36:18,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-03 03:36:18,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2022-11-03 03:36:18,968 INFO L87 Difference]: Start difference. First operand 371 states and 1296 transitions. Second operand has 20 states, 20 states have (on average 2.05) internal successors, (41), 19 states have internal predecessors, (41), 0 states have call successors, (0), 0 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-03 03:36:19,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:36:19,326 INFO L93 Difference]: Finished difference Result 479 states and 1637 transitions. [2022-11-03 03:36:19,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-03 03:36:19,327 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.05) internal successors, (41), 19 states have internal predecessors, (41), 0 states have call successors, (0), 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 25 [2022-11-03 03:36:19,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:36:19,329 INFO L225 Difference]: With dead ends: 479 [2022-11-03 03:36:19,329 INFO L226 Difference]: Without dead ends: 479 [2022-11-03 03:36:19,330 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=443, Unknown=0, NotChecked=0, Total=600 [2022-11-03 03:36:19,330 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 163 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 03:36:19,330 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 35 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 03:36:19,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2022-11-03 03:36:19,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 383. [2022-11-03 03:36:19,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 382 states have (on average 3.468586387434555) internal successors, (1325), 382 states have internal predecessors, (1325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:36:19,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1325 transitions. [2022-11-03 03:36:19,342 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1325 transitions. Word has length 25 [2022-11-03 03:36:19,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:36:19,343 INFO L495 AbstractCegarLoop]: Abstraction has 383 states and 1325 transitions. [2022-11-03 03:36:19,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.05) internal successors, (41), 19 states have internal predecessors, (41), 0 states have call successors, (0), 0 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-03 03:36:19,343 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1325 transitions. [2022-11-03 03:36:19,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-03 03:36:19,344 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:36:19,345 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:36:19,374 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-11-03 03:36:19,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:36:19,563 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-03 03:36:19,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:36:19,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1829535124, now seen corresponding path program 7 times [2022-11-03 03:36:19,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:36:19,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240706278] [2022-11-03 03:36:19,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:36:19,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:36:19,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:36:21,294 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:36:21,294 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:36:21,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240706278] [2022-11-03 03:36:21,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240706278] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:36:21,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1093661996] [2022-11-03 03:36:21,294 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 03:36:21,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:36:21,295 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:36:21,296 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:36:21,317 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-11-03 03:36:21,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:36:21,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 54 conjunts are in the unsatisfiable core [2022-11-03 03:36:21,487 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:36:21,634 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 03:36:21,701 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:36:21,770 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:36:22,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:36:22,390 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 125 treesize of output 103 [2022-11-03 03:36:22,746 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:36:22,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:36:22,751 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:36:22,751 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 148 treesize of output 81 [2022-11-03 03:36:22,935 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:36:22,935 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:36:23,095 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~A~0.offset (* 4 c_~M~0)))) (and (or (= c_~max1~0 c_~max2~0) (forall ((v_ArrVal_1586 (Array Int Int))) (< c_~max2~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1586) c_~A~0.base) .cse0)))) (forall ((v_ArrVal_1586 (Array Int Int))) (let ((.cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1586) c_~A~0.base) .cse0))) (or (not (< c_~max2~0 .cse1)) (= c_~max1~0 .cse1)))))) is different from false [2022-11-03 03:36:30,396 WARN L234 SmtUtils]: Spent 5.48s on a formula simplification that was a NOOP. DAG size: 109 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 03:36:32,352 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~A~0.offset 4))) (and (or (= c_~max1~0 c_~max2~0) (forall ((~M~0 Int) (v_ArrVal_1586 (Array Int Int)) (v_ArrVal_1585 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1585))) (let ((.cse0 (select .cse3 c_~A~0.base))) (let ((.cse2 (select .cse0 c_~A~0.offset))) (or (< c_~max1~0 (select .cse0 .cse1)) (not (< 0 ~M~0)) (< c_~max2~0 .cse2) (< c_~max1~0 .cse2) (< 1 ~M~0) (< c_~max2~0 (select (select (store .cse3 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1586) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))))))))) (forall ((v_ArrVal_1585 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1585))) (let ((.cse4 (select .cse7 c_~A~0.base))) (let ((.cse5 (select .cse4 c_~A~0.offset))) (or (< c_~max1~0 (select .cse4 .cse1)) (< c_~max2~0 .cse5) (< c_~max1~0 .cse5) (forall ((~M~0 Int)) (or (forall ((v_ArrVal_1586 (Array Int Int))) (let ((.cse6 (select (select (store .cse7 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1586) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (= c_~max1~0 .cse6) (not (< c_~max2~0 .cse6))))) (not (< 0 ~M~0)) (< 1 ~M~0)))))))) (forall ((v_ArrVal_1585 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1585))) (let ((.cse12 (select .cse11 c_~A~0.base))) (let ((.cse8 (select .cse12 c_~A~0.offset)) (.cse9 (select .cse12 .cse1))) (or (< c_~max2~0 .cse8) (not (< c_~max1~0 .cse8)) (not (< .cse8 .cse9)) (forall ((~M~0 Int)) (or (not (< 0 ~M~0)) (forall ((v_ArrVal_1586 (Array Int Int))) (let ((.cse10 (select (select (store .cse11 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1586) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (= .cse9 .cse10) (not (< c_~max2~0 .cse10))))) (< 1 ~M~0)))))))) (forall ((v_ArrVal_1585 (Array Int Int))) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1585))) (let ((.cse16 (select .cse15 c_~A~0.base))) (let ((.cse13 (select .cse16 c_~A~0.offset)) (.cse14 (select .cse16 .cse1))) (or (< c_~max2~0 .cse13) (not (< c_~max1~0 .cse13)) (not (< .cse13 .cse14)) (= .cse14 c_~max2~0) (forall ((~M~0 Int) (v_ArrVal_1586 (Array Int Int))) (or (not (< 0 ~M~0)) (< 1 ~M~0) (< c_~max2~0 (select (select (store .cse15 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1586) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))))))))) (forall ((v_ArrVal_1585 (Array Int Int))) (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1585))) (let ((.cse18 (select .cse20 c_~A~0.base))) (let ((.cse17 (select .cse18 c_~A~0.offset))) (or (not (< c_~max2~0 .cse17)) (< c_~max1~0 (select .cse18 .cse1)) (forall ((~M~0 Int)) (or (not (< 0 ~M~0)) (forall ((v_ArrVal_1586 (Array Int Int))) (let ((.cse19 (select (select (store .cse20 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1586) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (= c_~max1~0 .cse19) (not (< .cse17 .cse19))))) (< 1 ~M~0))) (< c_~max1~0 .cse17)))))) (forall ((v_ArrVal_1585 (Array Int Int))) (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1585))) (let ((.cse23 (select .cse22 c_~A~0.base))) (let ((.cse21 (select .cse23 c_~A~0.offset))) (or (not (< c_~max2~0 .cse21)) (forall ((~M~0 Int) (v_ArrVal_1586 (Array Int Int))) (or (< .cse21 (select (select (store .cse22 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1586) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (not (< 0 ~M~0)) (< 1 ~M~0))) (not (< c_~max1~0 .cse21)) (not (< .cse21 (select .cse23 .cse1)))))))) (forall ((v_ArrVal_1585 (Array Int Int))) (let ((.cse25 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1585))) (let ((.cse26 (select .cse25 c_~A~0.base))) (let ((.cse24 (select .cse26 c_~A~0.offset))) (or (not (< c_~max2~0 .cse24)) (forall ((~M~0 Int)) (or (forall ((v_ArrVal_1586 (Array Int Int))) (<= (select (select (store .cse25 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1586) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) .cse24)) (not (< 0 ~M~0)) (< 1 ~M~0))) (not (< c_~max1~0 .cse24)) (< .cse24 (select .cse26 .cse1))))))) (forall ((v_ArrVal_1585 (Array Int Int))) (let ((.cse28 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1585) c_~A~0.base))) (let ((.cse27 (select .cse28 c_~A~0.offset))) (or (< c_~max2~0 .cse27) (not (< c_~max1~0 .cse27)) (= .cse27 c_~max2~0) (< .cse27 (select .cse28 .cse1)))))) (forall ((v_ArrVal_1585 (Array Int Int))) (let ((.cse32 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1585))) (let ((.cse33 (select .cse32 c_~A~0.base))) (let ((.cse29 (select .cse33 c_~A~0.offset)) (.cse30 (select .cse33 .cse1))) (or (< c_~max2~0 .cse29) (< c_~max1~0 .cse29) (not (< c_~max1~0 .cse30)) (forall ((~M~0 Int)) (or (not (< 0 ~M~0)) (forall ((v_ArrVal_1586 (Array Int Int))) (let ((.cse31 (select (select (store .cse32 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1586) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (= .cse30 .cse31) (not (< c_~max2~0 .cse31))))) (< 1 ~M~0)))))))) (forall ((v_ArrVal_1585 (Array Int Int))) (let ((.cse36 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1585))) (let ((.cse37 (select .cse36 c_~A~0.base))) (let ((.cse34 (select .cse37 c_~A~0.offset)) (.cse35 (select .cse37 .cse1))) (or (< c_~max2~0 .cse34) (< c_~max1~0 .cse34) (not (< c_~max1~0 .cse35)) (= .cse35 c_~max2~0) (forall ((~M~0 Int) (v_ArrVal_1586 (Array Int Int))) (or (not (< 0 ~M~0)) (< 1 ~M~0) (< c_~max2~0 (select (select (store .cse36 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1586) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))))))))) (forall ((v_ArrVal_1585 (Array Int Int))) (let ((.cse39 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1585))) (let ((.cse40 (select .cse39 c_~A~0.base))) (let ((.cse38 (select .cse40 c_~A~0.offset))) (or (not (< c_~max2~0 .cse38)) (forall ((~M~0 Int) (v_ArrVal_1586 (Array Int Int))) (or (< .cse38 (select (select (store .cse39 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1586) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (not (< 0 ~M~0)) (< 1 ~M~0))) (< c_~max1~0 .cse38) (not (< c_~max1~0 (select .cse40 .cse1)))))))) (forall ((v_ArrVal_1585 (Array Int Int))) (let ((.cse41 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1585))) (let ((.cse43 (select .cse41 c_~A~0.base))) (let ((.cse42 (select .cse43 c_~A~0.offset))) (or (forall ((~M~0 Int)) (or (not (< 0 ~M~0)) (forall ((v_ArrVal_1586 (Array Int Int))) (not (< c_~max2~0 (select (select (store .cse41 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1586) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))))) (< 1 ~M~0))) (< c_~max2~0 .cse42) (not (< c_~max1~0 .cse42)) (< .cse42 (select .cse43 .cse1))))))) (forall ((v_ArrVal_1585 (Array Int Int))) (let ((.cse46 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1585))) (let ((.cse45 (select .cse46 c_~A~0.base))) (let ((.cse44 (select .cse45 c_~A~0.offset))) (or (not (< c_~max2~0 .cse44)) (< c_~max1~0 (select .cse45 .cse1)) (forall ((~M~0 Int) (v_ArrVal_1586 (Array Int Int))) (or (< .cse44 (select (select (store .cse46 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1586) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (not (< 0 ~M~0)) (< 1 ~M~0))) (= .cse44 c_~max1~0) (< c_~max1~0 .cse44)))))))) is different from false [2022-11-03 03:36:34,225 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:36:34,225 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 138 treesize of output 90 [2022-11-03 03:36:34,247 INFO L356 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-03 03:36:34,248 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 523 treesize of output 491 [2022-11-03 03:36:34,269 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 282 treesize of output 234 [2022-11-03 03:36:34,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:36:34,284 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 335 treesize of output 287 [2022-11-03 03:36:34,308 INFO L356 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-03 03:36:34,309 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 328 treesize of output 308 [2022-11-03 03:36:34,649 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-03 03:36:34,650 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 168 treesize of output 1 [2022-11-03 03:36:34,662 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:36:34,663 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 166 treesize of output 106 [2022-11-03 03:36:34,672 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:36:34,691 INFO L356 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-03 03:36:34,692 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1972 treesize of output 1740 [2022-11-03 03:36:34,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:36:34,738 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 1562 treesize of output 1406 [2022-11-03 03:36:34,770 INFO L356 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-03 03:36:34,770 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1580 treesize of output 1272 [2022-11-03 03:36:35,261 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-03 03:36:35,262 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 134 treesize of output 1 [2022-11-03 03:36:35,274 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:36:35,275 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 158 treesize of output 98 [2022-11-03 03:36:35,284 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:36:35,303 INFO L356 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-03 03:36:35,304 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 559 treesize of output 497 [2022-11-03 03:36:35,349 INFO L356 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-03 03:36:35,349 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 493 treesize of output 413 [2022-11-03 03:36:35,384 INFO L356 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-03 03:36:35,385 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 346 treesize of output 308 [2022-11-03 03:36:36,276 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-03 03:36:36,276 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 134 treesize of output 1 [2022-11-03 03:36:36,285 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-03 03:36:36,286 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 126 treesize of output 1 [2022-11-03 03:36:36,302 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:36:36,302 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 110 treesize of output 74 [2022-11-03 03:36:36,311 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:36:36,331 INFO L356 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-03 03:36:36,331 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 501 treesize of output 461 [2022-11-03 03:36:36,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:36:36,357 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:36:36,358 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 231 treesize of output 203 [2022-11-03 03:36:36,383 INFO L356 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-03 03:36:36,384 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 429 treesize of output 377 [2022-11-03 03:36:36,729 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-03 03:36:36,729 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 156 treesize of output 1 [2022-11-03 03:36:36,741 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-03 03:36:36,741 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 157 treesize of output 1 [2022-11-03 03:36:36,752 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-03 03:36:36,753 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 191 treesize of output 1 [2022-11-03 03:36:36,765 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-03 03:36:36,765 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 143 treesize of output 1 [2022-11-03 03:36:36,815 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-03 03:36:36,816 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 161 treesize of output 1 [2022-11-03 03:36:37,038 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:36:37,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1093661996] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:36:37,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [574840259] [2022-11-03 03:36:37,039 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java: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-03 03:36:37,039 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:36:37,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 41 [2022-11-03 03:36:37,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197019833] [2022-11-03 03:36:37,039 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:36:37,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-11-03 03:36:37,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:36:37,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-11-03 03:36:37,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=1426, Unknown=23, NotChecked=158, Total=1806 [2022-11-03 03:36:37,041 INFO L87 Difference]: Start difference. First operand 383 states and 1325 transitions. Second operand has 43 states, 42 states have (on average 1.6428571428571428) internal successors, (69), 42 states have internal predecessors, (69), 0 states have call successors, (0), 0 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-03 03:36:41,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:36:41,276 INFO L93 Difference]: Finished difference Result 633 states and 2012 transitions. [2022-11-03 03:36:41,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-03 03:36:41,277 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 1.6428571428571428) internal successors, (69), 42 states have internal predecessors, (69), 0 states have call successors, (0), 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 26 [2022-11-03 03:36:41,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:36:41,279 INFO L225 Difference]: With dead ends: 633 [2022-11-03 03:36:41,279 INFO L226 Difference]: Without dead ends: 619 [2022-11-03 03:36:41,279 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 28 SyntacticMatches, 7 SemanticMatches, 58 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1045 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=414, Invalid=2877, Unknown=23, NotChecked=226, Total=3540 [2022-11-03 03:36:41,280 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 285 mSDsluCounter, 676 mSDsCounter, 0 mSdLazyCounter, 1427 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 2341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 872 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-03 03:36:41,280 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 92 Invalid, 2341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1427 Invalid, 0 Unknown, 872 Unchecked, 1.4s Time] [2022-11-03 03:36:41,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2022-11-03 03:36:41,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 415. [2022-11-03 03:36:41,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 414 states have (on average 3.42512077294686) internal successors, (1418), 414 states have internal predecessors, (1418), 0 states have call successors, (0), 0 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-03 03:36:41,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 1418 transitions. [2022-11-03 03:36:41,288 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 1418 transitions. Word has length 26 [2022-11-03 03:36:41,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:36:41,289 INFO L495 AbstractCegarLoop]: Abstraction has 415 states and 1418 transitions. [2022-11-03 03:36:41,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 1.6428571428571428) internal successors, (69), 42 states have internal predecessors, (69), 0 states have call successors, (0), 0 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-03 03:36:41,289 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 1418 transitions. [2022-11-03 03:36:41,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-03 03:36:41,290 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:36:41,290 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:36:41,315 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-11-03 03:36:41,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-11-03 03:36:41,491 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-03 03:36:41,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:36:41,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1924114878, now seen corresponding path program 8 times [2022-11-03 03:36:41,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:36:41,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570275205] [2022-11-03 03:36:41,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:36:41,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:36:41,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:36:42,701 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:36:42,701 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:36:42,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570275205] [2022-11-03 03:36:42,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570275205] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:36:42,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1545000935] [2022-11-03 03:36:42,702 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 03:36:42,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:36:42,702 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:36:42,703 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:36:42,705 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-11-03 03:36:42,892 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-03 03:36:42,892 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:36:42,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-03 03:36:42,895 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:36:43,243 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:36:43,246 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:36:43,246 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 72 treesize of output 36 [2022-11-03 03:36:43,670 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:36:43,670 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 133 treesize of output 197 [2022-11-03 03:36:45,330 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:36:45,330 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:36:45,429 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:36:45,429 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 87 treesize of output 51 [2022-11-03 03:36:45,838 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:36:45,838 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 87 treesize of output 61 [2022-11-03 03:36:46,191 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:36:46,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1545000935] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:36:46,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1799960317] [2022-11-03 03:36:46,194 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-03 03:36:46,195 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:36:46,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 32 [2022-11-03 03:36:46,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118870982] [2022-11-03 03:36:46,195 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:36:46,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-03 03:36:46,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:36:46,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-03 03:36:46,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=968, Unknown=0, NotChecked=0, Total=1122 [2022-11-03 03:36:46,196 INFO L87 Difference]: Start difference. First operand 415 states and 1418 transitions. Second operand has 34 states, 33 states have (on average 2.090909090909091) internal successors, (69), 33 states have internal predecessors, (69), 0 states have call successors, (0), 0 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-03 03:36:52,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:36:52,967 INFO L93 Difference]: Finished difference Result 1399 states and 4434 transitions. [2022-11-03 03:36:52,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-11-03 03:36:52,968 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.090909090909091) internal successors, (69), 33 states have internal predecessors, (69), 0 states have call successors, (0), 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 26 [2022-11-03 03:36:52,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:36:52,971 INFO L225 Difference]: With dead ends: 1399 [2022-11-03 03:36:52,972 INFO L226 Difference]: Without dead ends: 1357 [2022-11-03 03:36:52,972 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2110 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=714, Invalid=6258, Unknown=0, NotChecked=0, Total=6972 [2022-11-03 03:36:52,973 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 282 mSDsluCounter, 806 mSDsCounter, 0 mSdLazyCounter, 2599 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 2682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 2599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 13 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-03 03:36:52,973 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 74 Invalid, 2682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 2599 Invalid, 0 Unknown, 13 Unchecked, 2.5s Time] [2022-11-03 03:36:52,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1357 states. [2022-11-03 03:36:52,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1357 to 607. [2022-11-03 03:36:52,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 607 states, 606 states have (on average 3.5874587458745872) internal successors, (2174), 606 states have internal predecessors, (2174), 0 states have call successors, (0), 0 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-03 03:36:52,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 2174 transitions. [2022-11-03 03:36:52,987 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 2174 transitions. Word has length 26 [2022-11-03 03:36:52,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:36:52,989 INFO L495 AbstractCegarLoop]: Abstraction has 607 states and 2174 transitions. [2022-11-03 03:36:52,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.090909090909091) internal successors, (69), 33 states have internal predecessors, (69), 0 states have call successors, (0), 0 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-03 03:36:52,990 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 2174 transitions. [2022-11-03 03:36:52,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-03 03:36:52,992 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:36:52,992 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:36:53,015 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-11-03 03:36:53,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-11-03 03:36:53,192 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-03 03:36:53,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:36:53,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1396762404, now seen corresponding path program 9 times [2022-11-03 03:36:53,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:36:53,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744424026] [2022-11-03 03:36:53,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:36:53,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:36:53,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:36:54,258 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:36:54,259 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:36:54,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744424026] [2022-11-03 03:36:54,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744424026] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:36:54,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [892510534] [2022-11-03 03:36:54,259 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 03:36:54,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:36:54,259 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:36:54,260 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:36:54,281 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-11-03 03:36:54,457 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 03:36:54,457 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:36:54,459 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 30 conjunts are in the unsatisfiable core [2022-11-03 03:36:54,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:36:54,804 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:36:54,807 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:36:54,808 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 72 treesize of output 36 [2022-11-03 03:36:55,393 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:36:55,393 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 133 treesize of output 197 [2022-11-03 03:36:56,906 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 03:36:56,907 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:36:56,997 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:36:56,998 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 87 treesize of output 51 [2022-11-03 03:36:57,368 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:36:57,368 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 87 treesize of output 61 [2022-11-03 03:36:57,484 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 03:36:57,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [892510534] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:36:57,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2060114479] [2022-11-03 03:36:57,486 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-03 03:36:57,487 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:36:57,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 8] total 28 [2022-11-03 03:36:57,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812366753] [2022-11-03 03:36:57,488 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:36:57,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-03 03:36:57,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:36:57,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-03 03:36:57,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=759, Unknown=0, NotChecked=0, Total=870 [2022-11-03 03:36:57,489 INFO L87 Difference]: Start difference. First operand 607 states and 2174 transitions. Second operand has 30 states, 29 states have (on average 2.3448275862068964) internal successors, (68), 29 states have internal predecessors, (68), 0 states have call successors, (0), 0 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-03 03:37:01,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:37:01,690 INFO L93 Difference]: Finished difference Result 1134 states and 3667 transitions. [2022-11-03 03:37:01,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-11-03 03:37:01,690 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.3448275862068964) internal successors, (68), 29 states have internal predecessors, (68), 0 states have call successors, (0), 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 26 [2022-11-03 03:37:01,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:37:01,693 INFO L225 Difference]: With dead ends: 1134 [2022-11-03 03:37:01,693 INFO L226 Difference]: Without dead ends: 1113 [2022-11-03 03:37:01,694 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1288 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=504, Invalid=4188, Unknown=0, NotChecked=0, Total=4692 [2022-11-03 03:37:01,694 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 244 mSDsluCounter, 591 mSDsCounter, 0 mSdLazyCounter, 2162 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 2323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 2162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 121 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-11-03 03:37:01,695 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 71 Invalid, 2323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 2162 Invalid, 0 Unknown, 121 Unchecked, 1.8s Time] [2022-11-03 03:37:01,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2022-11-03 03:37:01,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 643. [2022-11-03 03:37:01,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 642 states have (on average 3.5669781931464173) internal successors, (2290), 642 states have internal predecessors, (2290), 0 states have call successors, (0), 0 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-03 03:37:01,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 2290 transitions. [2022-11-03 03:37:01,712 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 2290 transitions. Word has length 26 [2022-11-03 03:37:01,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:37:01,712 INFO L495 AbstractCegarLoop]: Abstraction has 643 states and 2290 transitions. [2022-11-03 03:37:01,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.3448275862068964) internal successors, (68), 29 states have internal predecessors, (68), 0 states have call successors, (0), 0 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-03 03:37:01,712 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 2290 transitions. [2022-11-03 03:37:01,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-03 03:37:01,713 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:37:01,713 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:37:01,739 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-11-03 03:37:01,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:37:01,914 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-03 03:37:01,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:37:01,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1336369556, now seen corresponding path program 10 times [2022-11-03 03:37:01,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:37:01,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292893792] [2022-11-03 03:37:01,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:37:01,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:37:01,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:37:02,949 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:37:02,950 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:37:02,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292893792] [2022-11-03 03:37:02,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292893792] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:37:02,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [994800605] [2022-11-03 03:37:02,950 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 03:37:02,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:37:02,950 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:37:02,951 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:37:02,953 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-11-03 03:37:03,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:37:03,114 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 41 conjunts are in the unsatisfiable core [2022-11-03 03:37:03,115 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:37:03,462 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 57 treesize of output 33 [2022-11-03 03:37:03,791 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:37:03,796 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:37:03,797 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 94 treesize of output 63 [2022-11-03 03:37:03,942 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:37:03,942 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:37:04,030 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:37:04,030 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 87 treesize of output 51 [2022-11-03 03:37:04,382 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:37:04,383 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 87 treesize of output 61 [2022-11-03 03:37:04,619 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:37:04,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [994800605] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:37:04,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1471672956] [2022-11-03 03:37:04,619 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-03 03:37:04,620 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:37:04,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 11] total 33 [2022-11-03 03:37:04,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696477041] [2022-11-03 03:37:04,620 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:37:04,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-03 03:37:04,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:37:04,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-03 03:37:04,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1043, Unknown=0, NotChecked=0, Total=1190 [2022-11-03 03:37:04,621 INFO L87 Difference]: Start difference. First operand 643 states and 2290 transitions. Second operand has 35 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 34 states have internal predecessors, (69), 0 states have call successors, (0), 0 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-03 03:37:08,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:37:08,790 INFO L93 Difference]: Finished difference Result 1031 states and 3385 transitions. [2022-11-03 03:37:08,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-11-03 03:37:08,790 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 34 states have internal predecessors, (69), 0 states have call successors, (0), 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 26 [2022-11-03 03:37:08,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:37:08,792 INFO L225 Difference]: With dead ends: 1031 [2022-11-03 03:37:08,792 INFO L226 Difference]: Without dead ends: 1010 [2022-11-03 03:37:08,793 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 999 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=477, Invalid=3683, Unknown=0, NotChecked=0, Total=4160 [2022-11-03 03:37:08,793 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 301 mSDsluCounter, 839 mSDsCounter, 0 mSdLazyCounter, 2789 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 2846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 2789 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-11-03 03:37:08,793 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 104 Invalid, 2846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 2789 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-11-03 03:37:08,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1010 states. [2022-11-03 03:37:08,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1010 to 667. [2022-11-03 03:37:08,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 667 states, 666 states have (on average 3.5825825825825826) internal successors, (2386), 666 states have internal predecessors, (2386), 0 states have call successors, (0), 0 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-03 03:37:08,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 2386 transitions. [2022-11-03 03:37:08,811 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 2386 transitions. Word has length 26 [2022-11-03 03:37:08,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:37:08,812 INFO L495 AbstractCegarLoop]: Abstraction has 667 states and 2386 transitions. [2022-11-03 03:37:08,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 34 states have internal predecessors, (69), 0 states have call successors, (0), 0 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-03 03:37:08,812 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 2386 transitions. [2022-11-03 03:37:08,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-03 03:37:08,813 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:37:08,814 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:37:08,841 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2022-11-03 03:37:09,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-11-03 03:37:09,014 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-03 03:37:09,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:37:09,014 INFO L85 PathProgramCache]: Analyzing trace with hash 88995556, now seen corresponding path program 11 times [2022-11-03 03:37:09,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:37:09,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36691998] [2022-11-03 03:37:09,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:37:09,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:37:09,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:37:10,216 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:37:10,216 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:37:10,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36691998] [2022-11-03 03:37:10,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36691998] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:37:10,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [509612172] [2022-11-03 03:37:10,216 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 03:37:10,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:37:10,216 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:37:10,218 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:37:10,219 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-11-03 03:37:10,437 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-03 03:37:10,438 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:37:10,440 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-03 03:37:10,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:37:10,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:37:10,878 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 35 treesize of output 33 [2022-11-03 03:37:11,570 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:37:11,570 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 182 treesize of output 254 [2022-11-03 03:37:13,700 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:37:13,700 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:37:14,518 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse23 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse2 (+ c_~A~0.offset (* 4 c_~M~0))) (.cse4 (+ c_~A~0.offset .cse23 4)) (.cse3 (+ c_~A~0.offset .cse23))) (and (forall ((v_ArrVal_1779 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1779) c_~A~0.base))) (let ((.cse0 (select .cse1 .cse4))) (or (not (< c_~max1~0 .cse0)) (< c_~max2~0 (select .cse1 .cse2)) (< c_~max1~0 (select .cse1 .cse3)) (= .cse0 c_~max2~0))))) (forall ((v_ArrVal_1779 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1779) c_~A~0.base))) (let ((.cse5 (select .cse7 .cse2)) (.cse6 (select .cse7 .cse4))) (or (not (< c_~max2~0 .cse5)) (= .cse6 .cse5) (not (< c_~max1~0 .cse6)) (< c_~max1~0 (select .cse7 .cse3)))))) (forall ((v_ArrVal_1779 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1779) c_~A~0.base))) (let ((.cse8 (select .cse9 .cse3))) (or (= .cse8 c_~max2~0) (< .cse8 (select .cse9 .cse4)) (< c_~max2~0 (select .cse9 .cse2)) (not (< c_~max1~0 .cse8)))))) (forall ((v_ArrVal_1779 (Array Int Int))) (let ((.cse11 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1779) c_~A~0.base))) (let ((.cse12 (select .cse11 .cse2)) (.cse10 (select .cse11 .cse3))) (or (< .cse10 (select .cse11 .cse4)) (not (< c_~max2~0 .cse12)) (= .cse10 .cse12) (not (< c_~max1~0 .cse10)))))) (forall ((v_ArrVal_1779 (Array Int Int))) (let ((.cse16 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1779) c_~A~0.base))) (let ((.cse13 (select .cse16 .cse2)) (.cse15 (select .cse16 .cse3)) (.cse14 (select .cse16 .cse4))) (or (not (< c_~max2~0 .cse13)) (= .cse14 .cse13) (not (< c_~max1~0 .cse15)) (not (< .cse15 .cse14)))))) (or (forall ((v_ArrVal_1779 (Array Int Int))) (let ((.cse17 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1779) c_~A~0.base))) (or (< c_~max2~0 (select .cse17 .cse2)) (< c_~max1~0 (select .cse17 .cse3)) (< c_~max1~0 (select .cse17 .cse4))))) (= c_~max1~0 c_~max2~0)) (forall ((v_ArrVal_1779 (Array Int Int))) (let ((.cse19 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1779) c_~A~0.base))) (let ((.cse18 (select .cse19 .cse2))) (or (not (< c_~max2~0 .cse18)) (= c_~max1~0 .cse18) (< c_~max1~0 (select .cse19 .cse3)) (< c_~max1~0 (select .cse19 .cse4)))))) (forall ((v_ArrVal_1779 (Array Int Int))) (let ((.cse20 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1779) c_~A~0.base))) (let ((.cse21 (select .cse20 .cse3)) (.cse22 (select .cse20 .cse4))) (or (< c_~max2~0 (select .cse20 .cse2)) (not (< c_~max1~0 .cse21)) (= .cse22 c_~max2~0) (not (< .cse21 .cse22))))))))) is different from false [2022-11-03 03:37:14,632 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_~A~0.offset 4)) (.cse3 (+ c_~A~0.offset (* 4 c_~M~0)))) (and (forall ((v_ArrVal_1779 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1779) c_~A~0.base))) (let ((.cse1 (select .cse2 .cse4)) (.cse0 (select .cse2 .cse3))) (or (not (< c_~max2~0 .cse0)) (not (< c_~max1~0 .cse1)) (< c_~max1~0 (select .cse2 c_~A~0.offset)) (= .cse1 .cse0))))) (forall ((v_ArrVal_1779 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1779) c_~A~0.base))) (let ((.cse5 (select .cse7 c_~A~0.offset)) (.cse6 (select .cse7 .cse4))) (or (not (< .cse5 .cse6)) (< c_~max2~0 (select .cse7 .cse3)) (not (< c_~max1~0 .cse5)) (= .cse6 c_~max2~0))))) (forall ((v_ArrVal_1779 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1779) c_~A~0.base))) (let ((.cse9 (select .cse8 .cse4))) (or (< c_~max2~0 (select .cse8 .cse3)) (not (< c_~max1~0 .cse9)) (= .cse9 c_~max2~0) (< c_~max1~0 (select .cse8 c_~A~0.offset)))))) (forall ((v_ArrVal_1779 (Array Int Int))) (let ((.cse13 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1779) c_~A~0.base))) (let ((.cse10 (select .cse13 c_~A~0.offset)) (.cse11 (select .cse13 .cse4)) (.cse12 (select .cse13 .cse3))) (or (not (< .cse10 .cse11)) (not (< c_~max2~0 .cse12)) (not (< c_~max1~0 .cse10)) (= .cse11 .cse12))))) (or (= c_~max1~0 c_~max2~0) (forall ((v_ArrVal_1779 (Array Int Int))) (let ((.cse14 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1779) c_~A~0.base))) (or (< c_~max2~0 (select .cse14 .cse3)) (< c_~max1~0 (select .cse14 .cse4)) (< c_~max1~0 (select .cse14 c_~A~0.offset)))))) (forall ((v_ArrVal_1779 (Array Int Int))) (let ((.cse17 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1779) c_~A~0.base))) (let ((.cse15 (select .cse17 .cse3)) (.cse16 (select .cse17 c_~A~0.offset))) (or (not (< c_~max2~0 .cse15)) (not (< c_~max1~0 .cse16)) (= .cse15 .cse16) (< .cse16 (select .cse17 .cse4)))))) (forall ((v_ArrVal_1779 (Array Int Int))) (let ((.cse18 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1779) c_~A~0.base))) (let ((.cse19 (select .cse18 c_~A~0.offset))) (or (< c_~max2~0 (select .cse18 .cse3)) (not (< c_~max1~0 .cse19)) (= c_~max2~0 .cse19) (< .cse19 (select .cse18 .cse4)))))) (forall ((v_ArrVal_1779 (Array Int Int))) (let ((.cse21 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1779) c_~A~0.base))) (let ((.cse20 (select .cse21 .cse3))) (or (not (< c_~max2~0 .cse20)) (= c_~max1~0 .cse20) (< c_~max1~0 (select .cse21 .cse4)) (< c_~max1~0 (select .cse21 c_~A~0.offset)))))))) is different from false [2022-11-03 03:37:15,194 INFO L356 Elim1Store]: treesize reduction 12, result has 77.4 percent of original size [2022-11-03 03:37:15,195 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 932 treesize of output 724 [2022-11-03 03:37:15,249 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:37:15,249 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 661 treesize of output 658 [2022-11-03 03:37:15,298 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:37:15,299 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 637 treesize of output 640 [2022-11-03 03:37:15,349 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:37:15,349 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 619 treesize of output 618 [2022-11-03 03:37:15,389 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:37:15,390 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 597 treesize of output 602 [2022-11-03 03:37:15,438 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:37:15,438 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 581 treesize of output 590 [2022-11-03 03:37:15,490 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:37:15,490 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 569 treesize of output 572 [2022-11-03 03:37:15,543 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:37:15,543 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 551 treesize of output 550 [2022-11-03 03:37:15,596 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:37:15,597 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 529 treesize of output 534 [2022-11-03 03:38:06,596 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:38:06,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [509612172] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:38:06,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1324891233] [2022-11-03 03:38:06,597 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-03 03:38:06,598 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:38:06,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 38 [2022-11-03 03:38:06,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323592261] [2022-11-03 03:38:06,598 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:38:06,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-11-03 03:38:06,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:38:06,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-11-03 03:38:06,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1246, Unknown=2, NotChecked=146, Total=1560 [2022-11-03 03:38:06,599 INFO L87 Difference]: Start difference. First operand 667 states and 2386 transitions. Second operand has 40 states, 39 states have (on average 1.794871794871795) internal successors, (70), 39 states have internal predecessors, (70), 0 states have call successors, (0), 0 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-03 03:38:11,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:38:11,857 INFO L93 Difference]: Finished difference Result 1158 states and 3937 transitions. [2022-11-03 03:38:11,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-11-03 03:38:11,858 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 1.794871794871795) internal successors, (70), 39 states have internal predecessors, (70), 0 states have call successors, (0), 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 26 [2022-11-03 03:38:11,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:38:11,862 INFO L225 Difference]: With dead ends: 1158 [2022-11-03 03:38:11,862 INFO L226 Difference]: Without dead ends: 1144 [2022-11-03 03:38:11,863 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 27 SyntacticMatches, 4 SemanticMatches, 68 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1174 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=508, Invalid=4054, Unknown=2, NotChecked=266, Total=4830 [2022-11-03 03:38:11,863 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 275 mSDsluCounter, 740 mSDsCounter, 0 mSdLazyCounter, 2155 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 2716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 2155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 477 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-11-03 03:38:11,864 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 148 Invalid, 2716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 2155 Invalid, 0 Unknown, 477 Unchecked, 2.0s Time] [2022-11-03 03:38:11,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1144 states. [2022-11-03 03:38:11,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1144 to 739. [2022-11-03 03:38:11,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 739 states, 738 states have (on average 3.535230352303523) internal successors, (2609), 738 states have internal predecessors, (2609), 0 states have call successors, (0), 0 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-03 03:38:11,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 2609 transitions. [2022-11-03 03:38:11,886 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 2609 transitions. Word has length 26 [2022-11-03 03:38:11,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:38:11,887 INFO L495 AbstractCegarLoop]: Abstraction has 739 states and 2609 transitions. [2022-11-03 03:38:11,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 1.794871794871795) internal successors, (70), 39 states have internal predecessors, (70), 0 states have call successors, (0), 0 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-03 03:38:11,887 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 2609 transitions. [2022-11-03 03:38:11,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-03 03:38:11,889 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:38:11,889 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:38:11,926 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2022-11-03 03:38:12,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-11-03 03:38:12,103 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-03 03:38:12,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:38:12,103 INFO L85 PathProgramCache]: Analyzing trace with hash 616348030, now seen corresponding path program 12 times [2022-11-03 03:38:12,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:38:12,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980598657] [2022-11-03 03:38:12,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:38:12,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:38:12,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:38:13,416 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:38:13,416 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:38:13,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980598657] [2022-11-03 03:38:13,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980598657] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:38:13,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1257577833] [2022-11-03 03:38:13,417 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 03:38:13,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:38:13,417 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:38:13,418 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:38:13,419 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-11-03 03:38:13,592 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 03:38:13,592 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:38:13,594 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 47 conjunts are in the unsatisfiable core [2022-11-03 03:38:13,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:38:13,714 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 03:38:13,772 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:38:13,834 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:38:14,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:14,165 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 35 treesize of output 33 [2022-11-03 03:38:14,940 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:38:14,940 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 175 treesize of output 193 [2022-11-03 03:38:15,874 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:38:15,874 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:38:16,594 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse23 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse4 (+ c_~A~0.offset .cse23 4)) (.cse2 (+ c_~A~0.offset (* 4 c_~M~0))) (.cse3 (+ c_~A~0.offset .cse23))) (and (forall ((v_ArrVal_1832 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1832) c_~A~0.base))) (let ((.cse0 (select .cse1 .cse4))) (or (not (< c_~max1~0 .cse0)) (< c_~max2~0 (select .cse1 .cse2)) (< c_~max1~0 (select .cse1 .cse3)) (= .cse0 c_~max2~0))))) (forall ((v_ArrVal_1832 (Array Int Int))) (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1832) c_~A~0.base))) (let ((.cse5 (select .cse6 .cse3)) (.cse7 (select .cse6 .cse2))) (or (< .cse5 (select .cse6 .cse4)) (not (< c_~max1~0 .cse5)) (= .cse5 .cse7) (not (< c_~max2~0 .cse7)))))) (forall ((v_ArrVal_1832 (Array Int Int))) (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1832) c_~A~0.base))) (let ((.cse8 (select .cse10 .cse3)) (.cse9 (select .cse10 .cse4))) (or (not (< .cse8 .cse9)) (not (< c_~max1~0 .cse8)) (< c_~max2~0 (select .cse10 .cse2)) (= .cse9 c_~max2~0))))) (forall ((v_ArrVal_1832 (Array Int Int))) (let ((.cse12 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1832) c_~A~0.base))) (let ((.cse11 (select .cse12 .cse2))) (or (= c_~max1~0 .cse11) (< c_~max1~0 (select .cse12 .cse4)) (< c_~max1~0 (select .cse12 .cse3)) (not (< c_~max2~0 .cse11)))))) (forall ((v_ArrVal_1832 (Array Int Int))) (let ((.cse16 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1832) c_~A~0.base))) (let ((.cse13 (select .cse16 .cse3)) (.cse14 (select .cse16 .cse4)) (.cse15 (select .cse16 .cse2))) (or (not (< .cse13 .cse14)) (not (< c_~max1~0 .cse13)) (= .cse14 .cse15) (not (< c_~max2~0 .cse15)))))) (forall ((v_ArrVal_1832 (Array Int Int))) (let ((.cse19 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1832) c_~A~0.base))) (let ((.cse17 (select .cse19 .cse4)) (.cse18 (select .cse19 .cse2))) (or (not (< c_~max1~0 .cse17)) (= .cse17 .cse18) (< c_~max1~0 (select .cse19 .cse3)) (not (< c_~max2~0 .cse18)))))) (or (forall ((v_ArrVal_1832 (Array Int Int))) (let ((.cse20 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1832) c_~A~0.base))) (or (< c_~max2~0 (select .cse20 .cse2)) (< c_~max1~0 (select .cse20 .cse4)) (< c_~max1~0 (select .cse20 .cse3))))) (= c_~max1~0 c_~max2~0)) (forall ((v_ArrVal_1832 (Array Int Int))) (let ((.cse22 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1832) c_~A~0.base))) (let ((.cse21 (select .cse22 .cse3))) (or (= .cse21 c_~max2~0) (< .cse21 (select .cse22 .cse4)) (not (< c_~max1~0 .cse21)) (< c_~max2~0 (select .cse22 .cse2))))))))) is different from false [2022-11-03 03:38:16,721 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_~A~0.offset (* 4 c_~M~0))) (.cse4 (+ c_~A~0.offset 4))) (and (forall ((v_ArrVal_1832 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1832) c_~A~0.base))) (let ((.cse0 (select .cse2 c_~A~0.offset)) (.cse1 (select .cse2 .cse4))) (or (not (< .cse0 .cse1)) (not (< c_~max1~0 .cse0)) (< c_~max2~0 (select .cse2 .cse3)) (= .cse1 c_~max2~0))))) (forall ((v_ArrVal_1832 (Array Int Int))) (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1832) c_~A~0.base))) (let ((.cse5 (select .cse6 c_~A~0.offset))) (or (< .cse5 (select .cse6 .cse4)) (not (< c_~max1~0 .cse5)) (< c_~max2~0 (select .cse6 .cse3)) (= .cse5 c_~max2~0))))) (forall ((v_ArrVal_1832 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1832) c_~A~0.base))) (let ((.cse8 (select .cse7 .cse3))) (or (< c_~max1~0 (select .cse7 c_~A~0.offset)) (= c_~max1~0 .cse8) (< c_~max1~0 (select .cse7 .cse4)) (not (< c_~max2~0 .cse8)))))) (or (forall ((v_ArrVal_1832 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1832) c_~A~0.base))) (or (< c_~max1~0 (select .cse9 c_~A~0.offset)) (< c_~max2~0 (select .cse9 .cse3)) (< c_~max1~0 (select .cse9 .cse4))))) (= c_~max1~0 c_~max2~0)) (forall ((v_ArrVal_1832 (Array Int Int))) (let ((.cse11 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1832) c_~A~0.base))) (let ((.cse10 (select .cse11 c_~A~0.offset)) (.cse12 (select .cse11 .cse3))) (or (< .cse10 (select .cse11 .cse4)) (not (< c_~max1~0 .cse10)) (not (< c_~max2~0 .cse12)) (= .cse10 .cse12))))) (forall ((v_ArrVal_1832 (Array Int Int))) (let ((.cse16 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1832) c_~A~0.base))) (let ((.cse13 (select .cse16 c_~A~0.offset)) (.cse14 (select .cse16 .cse4)) (.cse15 (select .cse16 .cse3))) (or (not (< .cse13 .cse14)) (not (< c_~max1~0 .cse13)) (= .cse14 .cse15) (not (< c_~max2~0 .cse15)))))) (forall ((v_ArrVal_1832 (Array Int Int))) (let ((.cse17 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1832) c_~A~0.base))) (let ((.cse19 (select .cse17 .cse3)) (.cse18 (select .cse17 .cse4))) (or (< c_~max1~0 (select .cse17 c_~A~0.offset)) (= .cse18 .cse19) (not (< c_~max2~0 .cse19)) (not (< c_~max1~0 .cse18)))))) (forall ((v_ArrVal_1832 (Array Int Int))) (let ((.cse20 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1832) c_~A~0.base))) (let ((.cse21 (select .cse20 .cse4))) (or (< c_~max1~0 (select .cse20 c_~A~0.offset)) (< c_~max2~0 (select .cse20 .cse3)) (= .cse21 c_~max2~0) (not (< c_~max1~0 .cse21)))))))) is different from false [2022-11-03 03:38:21,284 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_~A~0.offset 4))) (and (forall ((v_ArrVal_1831 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1831))) (let ((.cse4 (select (select .cse5 c_~A~0.base) c_~A~0.offset))) (or (forall ((~M~0 Int)) (or (not (< 0 ~M~0)) (forall ((v_ArrVal_1832 (Array Int Int))) (let ((.cse2 (select (store .cse5 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1832) c_~A~0.base))) (let ((.cse0 (select .cse2 c_~A~0.offset)) (.cse1 (select .cse2 (+ c_~A~0.offset (* ~M~0 4))))) (or (= .cse0 .cse1) (not (< c_~max1~0 .cse0)) (< .cse0 (select .cse2 .cse3)) (not (< .cse4 .cse1)))))) (< 1 ~M~0))) (not (< c_~max2~0 .cse4)))))) (forall ((v_ArrVal_1831 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1831))) (or (< c_~max2~0 (select (select .cse6 c_~A~0.base) c_~A~0.offset)) (forall ((~M~0 Int)) (or (not (< 0 ~M~0)) (forall ((v_ArrVal_1832 (Array Int Int))) (let ((.cse8 (select (store .cse6 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1832) c_~A~0.base))) (let ((.cse7 (select .cse8 c_~A~0.offset))) (or (not (< c_~max1~0 .cse7)) (< .cse7 (select .cse8 .cse3)) (< c_~max2~0 (select .cse8 (+ c_~A~0.offset (* ~M~0 4)))) (= .cse7 c_~max2~0))))) (< 1 ~M~0)))))) (forall ((v_ArrVal_1831 (Array Int Int))) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1831))) (let ((.cse9 (select (select .cse12 c_~A~0.base) c_~A~0.offset))) (or (not (< c_~max2~0 .cse9)) (forall ((~M~0 Int)) (or (not (< 0 ~M~0)) (forall ((v_ArrVal_1832 (Array Int Int))) (let ((.cse11 (select (store .cse12 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1832) c_~A~0.base))) (let ((.cse10 (select .cse11 .cse3))) (or (not (< c_~max1~0 .cse10)) (= .cse9 .cse10) (< c_~max1~0 (select .cse11 c_~A~0.offset)) (< .cse9 (select .cse11 (+ c_~A~0.offset (* ~M~0 4)))))))) (< 1 ~M~0))))))) (forall ((v_ArrVal_1831 (Array Int Int))) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1831))) (let ((.cse15 (select (select .cse17 c_~A~0.base) c_~A~0.offset))) (or (forall ((~M~0 Int)) (or (not (< 0 ~M~0)) (forall ((v_ArrVal_1832 (Array Int Int))) (let ((.cse16 (select (store .cse17 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1832) c_~A~0.base))) (let ((.cse13 (select .cse16 c_~A~0.offset)) (.cse14 (select .cse16 .cse3))) (or (not (< c_~max1~0 .cse13)) (not (< .cse13 .cse14)) (= .cse15 .cse14) (< .cse15 (select .cse16 (+ c_~A~0.offset (* ~M~0 4)))))))) (< 1 ~M~0))) (not (< c_~max2~0 .cse15)))))) (forall ((v_ArrVal_1831 (Array Int Int))) (let ((.cse18 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1831))) (or (< c_~max2~0 (select (select .cse18 c_~A~0.base) c_~A~0.offset)) (forall ((~M~0 Int)) (or (not (< 0 ~M~0)) (forall ((v_ArrVal_1832 (Array Int Int))) (let ((.cse21 (select (store .cse18 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1832) c_~A~0.base))) (let ((.cse19 (select .cse21 c_~A~0.offset)) (.cse20 (select .cse21 .cse3))) (or (not (< c_~max1~0 .cse19)) (not (< .cse19 .cse20)) (= .cse20 c_~max2~0) (< c_~max2~0 (select .cse21 (+ c_~A~0.offset (* ~M~0 4)))))))) (< 1 ~M~0)))))) (forall ((v_ArrVal_1831 (Array Int Int))) (let ((.cse25 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1831))) (let ((.cse22 (select (select .cse25 c_~A~0.base) c_~A~0.offset))) (or (forall ((~M~0 Int)) (or (not (< 0 ~M~0)) (forall ((v_ArrVal_1832 (Array Int Int))) (let ((.cse24 (select (store .cse25 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1832) c_~A~0.base))) (let ((.cse23 (select .cse24 c_~A~0.offset))) (or (= .cse22 .cse23) (not (< c_~max1~0 .cse23)) (< .cse23 (select .cse24 .cse3)) (< .cse22 (select .cse24 (+ c_~A~0.offset (* ~M~0 4)))))))) (< 1 ~M~0))) (not (< c_~max2~0 .cse22)))))) (forall ((v_ArrVal_1831 (Array Int Int))) (let ((.cse26 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1831))) (or (< c_~max2~0 (select (select .cse26 c_~A~0.base) c_~A~0.offset)) (forall ((~M~0 Int)) (or (not (< 0 ~M~0)) (forall ((v_ArrVal_1832 (Array Int Int))) (let ((.cse28 (select (store .cse26 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1832) c_~A~0.base))) (let ((.cse27 (select .cse28 (+ c_~A~0.offset (* ~M~0 4))))) (or (= c_~max1~0 .cse27) (< c_~max1~0 (select .cse28 c_~A~0.offset)) (< c_~max1~0 (select .cse28 .cse3)) (not (< c_~max2~0 .cse27)))))) (< 1 ~M~0)))))) (or (= c_~max1~0 c_~max2~0) (forall ((v_ArrVal_1832 (Array Int Int)) (v_ArrVal_1831 (Array Int Int)) (~M~0 Int)) (let ((.cse29 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1831))) (let ((.cse30 (select (store .cse29 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1832) c_~A~0.base))) (or (< c_~max2~0 (select (select .cse29 c_~A~0.base) c_~A~0.offset)) (not (< 0 ~M~0)) (< c_~max1~0 (select .cse30 c_~A~0.offset)) (< c_~max2~0 (select .cse30 (+ c_~A~0.offset (* ~M~0 4)))) (< c_~max1~0 (select .cse30 .cse3)) (< 1 ~M~0)))))) (forall ((v_ArrVal_1831 (Array Int Int))) (let ((.cse34 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1831))) (let ((.cse31 (select (select .cse34 c_~A~0.base) c_~A~0.offset))) (or (not (< c_~max2~0 .cse31)) (forall ((~M~0 Int)) (or (not (< 0 ~M~0)) (forall ((v_ArrVal_1832 (Array Int Int))) (let ((.cse33 (select (store .cse34 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1832) c_~A~0.base))) (let ((.cse32 (select .cse33 (+ c_~A~0.offset (* ~M~0 4))))) (or (= c_~max1~0 .cse32) (< c_~max1~0 (select .cse33 c_~A~0.offset)) (< c_~max1~0 (select .cse33 .cse3)) (not (< .cse31 .cse32)))))) (< 1 ~M~0))))))) (forall ((v_ArrVal_1831 (Array Int Int))) (let ((.cse37 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1831))) (let ((.cse36 (select (select .cse37 c_~A~0.base) c_~A~0.offset))) (or (forall ((v_ArrVal_1832 (Array Int Int)) (~M~0 Int)) (let ((.cse35 (select (store .cse37 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1832) c_~A~0.base))) (or (not (< 0 ~M~0)) (< c_~max1~0 (select .cse35 c_~A~0.offset)) (< c_~max1~0 (select .cse35 .cse3)) (< .cse36 (select .cse35 (+ c_~A~0.offset (* ~M~0 4)))) (< 1 ~M~0)))) (not (< c_~max2~0 .cse36)) (= .cse36 c_~max1~0))))) (forall ((v_ArrVal_1831 (Array Int Int))) (let ((.cse38 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1831))) (or (< c_~max2~0 (select (select .cse38 c_~A~0.base) c_~A~0.offset)) (forall ((~M~0 Int)) (or (not (< 0 ~M~0)) (forall ((v_ArrVal_1832 (Array Int Int))) (let ((.cse40 (select (store .cse38 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1832) c_~A~0.base))) (let ((.cse39 (select .cse40 .cse3))) (or (not (< c_~max1~0 .cse39)) (< c_~max1~0 (select .cse40 c_~A~0.offset)) (= .cse39 c_~max2~0) (< c_~max2~0 (select .cse40 (+ c_~A~0.offset (* ~M~0 4)))))))) (< 1 ~M~0)))))) (forall ((v_ArrVal_1831 (Array Int Int))) (let ((.cse41 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1831))) (or (< c_~max2~0 (select (select .cse41 c_~A~0.base) c_~A~0.offset)) (forall ((~M~0 Int)) (or (not (< 0 ~M~0)) (forall ((v_ArrVal_1832 (Array Int Int))) (let ((.cse44 (select (store .cse41 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1832) c_~A~0.base))) (let ((.cse42 (select .cse44 c_~A~0.offset)) (.cse43 (select .cse44 (+ c_~A~0.offset (* ~M~0 4))))) (or (= .cse42 .cse43) (not (< c_~max1~0 .cse42)) (< .cse42 (select .cse44 .cse3)) (not (< c_~max2~0 .cse43)))))) (< 1 ~M~0)))))))) is different from false [2022-11-03 03:38:22,044 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_1831 (Array Int Int)) (v_ArrVal_1830 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1830) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1831))) (let ((.cse2 (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|))) (or (forall ((v_ArrVal_1832 (Array Int Int)) (~M~0 Int)) (let ((.cse0 (select (store .cse3 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1832) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (< 0 ~M~0)) (< c_~max1~0 (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (< c_~max1~0 (select .cse0 .cse1)) (< .cse2 (select .cse0 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (< 1 ~M~0)))) (not (< c_~max2~0 .cse2)) (= c_~max1~0 .cse2))))) (forall ((v_ArrVal_1831 (Array Int Int)) (v_ArrVal_1830 (Array Int Int))) (let ((.cse7 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1830) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1831))) (let ((.cse5 (select (select .cse7 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (forall ((~M~0 Int)) (or (forall ((v_ArrVal_1832 (Array Int Int))) (let ((.cse4 (select (store .cse7 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1832) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse6 (select .cse4 .cse1))) (or (< c_~max1~0 (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (= .cse5 .cse6) (not (< c_~max1~0 .cse6)) (< .cse5 (select .cse4 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))))) (not (< 0 ~M~0)) (< 1 ~M~0))) (not (< c_~max2~0 .cse5)))))) (forall ((v_ArrVal_1831 (Array Int Int)) (v_ArrVal_1830 (Array Int Int))) (let ((.cse8 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1830) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1831))) (or (< c_~max2~0 (select (select .cse8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (forall ((~M~0 Int)) (or (not (< 0 ~M~0)) (forall ((v_ArrVal_1832 (Array Int Int))) (let ((.cse10 (select (store .cse8 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1832) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse9 (select .cse10 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (< c_~max2~0 .cse9)) (= c_~max1~0 .cse9) (< c_~max1~0 (select .cse10 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (< c_~max1~0 (select .cse10 .cse1)))))) (< 1 ~M~0)))))) (forall ((v_ArrVal_1831 (Array Int Int)) (v_ArrVal_1830 (Array Int Int))) (let ((.cse11 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1830) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1831))) (or (< c_~max2~0 (select (select .cse11 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (forall ((~M~0 Int)) (or (not (< 0 ~M~0)) (forall ((v_ArrVal_1832 (Array Int Int))) (let ((.cse13 (select (store .cse11 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1832) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse12 (select .cse13 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< .cse12 (select .cse13 .cse1)) (= c_~max2~0 .cse12) (< c_~max2~0 (select .cse13 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (not (< c_~max1~0 .cse12)))))) (< 1 ~M~0)))))) (forall ((v_ArrVal_1831 (Array Int Int)) (v_ArrVal_1830 (Array Int Int))) (let ((.cse17 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1830) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1831))) (or (forall ((~M~0 Int)) (or (not (< 0 ~M~0)) (forall ((v_ArrVal_1832 (Array Int Int))) (let ((.cse15 (select (store .cse17 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1832) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse16 (select .cse15 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (.cse14 (select .cse15 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< .cse14 (select .cse15 .cse1)) (not (< c_~max2~0 .cse16)) (= .cse16 .cse14) (not (< c_~max1~0 .cse14)))))) (< 1 ~M~0))) (< c_~max2~0 (select (select .cse17 |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_1831 (Array Int Int)) (v_ArrVal_1830 (Array Int Int))) (let ((.cse21 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1830) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1831))) (let ((.cse20 (select (select .cse21 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (forall ((~M~0 Int)) (or (forall ((v_ArrVal_1832 (Array Int Int))) (let ((.cse19 (select (store .cse21 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1832) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse18 (select .cse19 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< .cse18 (select .cse19 .cse1)) (= .cse20 .cse18) (< .cse20 (select .cse19 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (not (< c_~max1~0 .cse18)))))) (not (< 0 ~M~0)) (< 1 ~M~0))) (not (< c_~max2~0 .cse20)))))) (forall ((v_ArrVal_1831 (Array Int Int)) (v_ArrVal_1830 (Array Int Int))) (let ((.cse26 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1830) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1831))) (let ((.cse25 (select (select .cse26 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (forall ((~M~0 Int)) (or (not (< 0 ~M~0)) (forall ((v_ArrVal_1832 (Array Int Int))) (let ((.cse23 (select (store .cse26 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1832) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse24 (select .cse23 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (.cse22 (select .cse23 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< .cse22 (select .cse23 .cse1)) (= .cse24 .cse22) (not (< .cse25 .cse24)) (not (< c_~max1~0 .cse22)))))) (< 1 ~M~0))) (not (< c_~max2~0 .cse25)))))) (forall ((v_ArrVal_1831 (Array Int Int)) (v_ArrVal_1830 (Array Int Int))) (let ((.cse27 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1830) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1831))) (or (< c_~max2~0 (select (select .cse27 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (forall ((~M~0 Int)) (or (not (< 0 ~M~0)) (forall ((v_ArrVal_1832 (Array Int Int))) (let ((.cse30 (select (store .cse27 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1832) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse29 (select .cse30 .cse1)) (.cse28 (select .cse30 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (< .cse28 .cse29)) (< c_~max2~0 (select .cse30 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (= c_~max2~0 .cse29) (not (< c_~max1~0 .cse28)))))) (< 1 ~M~0)))))) (forall ((v_ArrVal_1831 (Array Int Int)) (v_ArrVal_1830 (Array Int Int))) (let ((.cse34 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1830) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1831))) (let ((.cse31 (select (select .cse34 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (< c_~max2~0 .cse31)) (forall ((~M~0 Int)) (or (not (< 0 ~M~0)) (forall ((v_ArrVal_1832 (Array Int Int))) (let ((.cse33 (select (store .cse34 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1832) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse32 (select .cse33 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (= c_~max1~0 .cse32) (< c_~max1~0 (select .cse33 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (< c_~max1~0 (select .cse33 .cse1)) (not (< .cse31 .cse32)))))) (< 1 ~M~0))))))) (forall ((v_ArrVal_1831 (Array Int Int)) (v_ArrVal_1830 (Array Int Int))) (let ((.cse37 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1830) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1831))) (or (forall ((~M~0 Int)) (or (forall ((v_ArrVal_1832 (Array Int Int))) (let ((.cse35 (select (store .cse37 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1832) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse36 (select .cse35 .cse1))) (or (< c_~max1~0 (select .cse35 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (not (< c_~max1~0 .cse36)) (< c_~max2~0 (select .cse35 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (= c_~max2~0 .cse36))))) (not (< 0 ~M~0)) (< 1 ~M~0))) (< c_~max2~0 (select (select .cse37 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) (or (= c_~max1~0 c_~max2~0) (forall ((v_ArrVal_1832 (Array Int Int)) (v_ArrVal_1831 (Array Int Int)) (v_ArrVal_1830 (Array Int Int)) (~M~0 Int)) (let ((.cse39 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1830) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1831))) (let ((.cse38 (select (store .cse39 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1832) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (< 0 ~M~0)) (< c_~max1~0 (select .cse38 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (< c_~max1~0 (select .cse38 .cse1)) (< c_~max2~0 (select (select .cse39 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (< c_~max2~0 (select .cse38 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (< 1 ~M~0)))))) (forall ((v_ArrVal_1831 (Array Int Int)) (v_ArrVal_1830 (Array Int Int))) (let ((.cse44 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1830) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1831))) (let ((.cse40 (select (select .cse44 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (< c_~max2~0 .cse40)) (forall ((~M~0 Int)) (or (forall ((v_ArrVal_1832 (Array Int Int))) (let ((.cse43 (select (store .cse44 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1832) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse42 (select .cse43 .cse1)) (.cse41 (select .cse43 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (< .cse41 .cse42)) (= .cse40 .cse42) (< .cse40 (select .cse43 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (not (< c_~max1~0 .cse41)))))) (not (< 0 ~M~0)) (< 1 ~M~0))))))))) is different from false [2022-11-03 03:38:22,174 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:38:22,174 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 116 treesize of output 80 [2022-11-03 03:38:22,196 INFO L356 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-03 03:38:22,196 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1675 treesize of output 1603 [2022-11-03 03:38:22,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:22,230 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:38:22,231 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 1552 treesize of output 1360 [2022-11-03 03:38:22,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:22,267 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 730 treesize of output 680 [2022-11-03 03:38:22,294 INFO L356 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-03 03:38:22,295 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1357 treesize of output 1261 [2022-11-03 03:38:24,793 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:38:24,794 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 164 treesize of output 104 [2022-11-03 03:38:24,816 INFO L356 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-03 03:38:24,817 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1987 treesize of output 1835 [2022-11-03 03:38:24,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:24,851 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 1593 treesize of output 1401 [2022-11-03 03:38:24,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:24,872 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:38:24,873 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 1548 treesize of output 1308 [2022-11-03 03:38:24,904 INFO L356 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-03 03:38:24,905 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1378 treesize of output 1286 [2022-11-03 03:38:25,931 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-03 03:38:25,932 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 223 treesize of output 1 [2022-11-03 03:38:25,940 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-03 03:38:25,940 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 200 treesize of output 1 [2022-11-03 03:38:25,947 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-03 03:38:25,947 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 147 treesize of output 1 [2022-11-03 03:38:25,955 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-03 03:38:25,956 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 172 treesize of output 1 [2022-11-03 03:38:25,970 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-03 03:38:25,970 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 170 treesize of output 1 [2022-11-03 03:38:25,978 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-03 03:38:25,979 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 192 treesize of output 1 [2022-11-03 03:38:25,986 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-03 03:38:25,986 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 173 treesize of output 1 [2022-11-03 03:38:25,997 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-03 03:38:25,998 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 149 treesize of output 1 [2022-11-03 03:38:26,005 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-03 03:38:26,006 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 215 treesize of output 1 [2022-11-03 03:38:26,014 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-03 03:38:26,014 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 218 treesize of output 1 [2022-11-03 03:38:26,075 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2022-11-03 03:38:26,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1257577833] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:38:26,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [35407988] [2022-11-03 03:38:26,076 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java: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-03 03:38:26,076 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:38:26,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 13] total 38 [2022-11-03 03:38:26,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25920873] [2022-11-03 03:38:26,077 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:38:26,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-11-03 03:38:26,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:38:26,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-11-03 03:38:26,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1136, Unknown=6, NotChecked=284, Total=1560 [2022-11-03 03:38:26,078 INFO L87 Difference]: Start difference. First operand 739 states and 2609 transitions. Second operand has 40 states, 39 states have (on average 1.794871794871795) internal successors, (70), 39 states have internal predecessors, (70), 0 states have call successors, (0), 0 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-03 03:38:34,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:38:34,481 INFO L93 Difference]: Finished difference Result 1312 states and 4188 transitions. [2022-11-03 03:38:34,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-11-03 03:38:34,481 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 1.794871794871795) internal successors, (70), 39 states have internal predecessors, (70), 0 states have call successors, (0), 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 26 [2022-11-03 03:38:34,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:38:34,484 INFO L225 Difference]: With dead ends: 1312 [2022-11-03 03:38:34,485 INFO L226 Difference]: Without dead ends: 1291 [2022-11-03 03:38:34,485 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 30 SyntacticMatches, 6 SemanticMatches, 75 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1472 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=486, Invalid=4780, Unknown=6, NotChecked=580, Total=5852 [2022-11-03 03:38:34,486 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 300 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 2105 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 3538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 2105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1380 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:38:34,486 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 80 Invalid, 3538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 2105 Invalid, 0 Unknown, 1380 Unchecked, 2.1s Time] [2022-11-03 03:38:34,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1291 states. [2022-11-03 03:38:34,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1291 to 731. [2022-11-03 03:38:34,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 731 states, 730 states have (on average 3.5561643835616437) internal successors, (2596), 730 states have internal predecessors, (2596), 0 states have call successors, (0), 0 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-03 03:38:34,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 2596 transitions. [2022-11-03 03:38:34,510 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 2596 transitions. Word has length 26 [2022-11-03 03:38:34,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:38:34,511 INFO L495 AbstractCegarLoop]: Abstraction has 731 states and 2596 transitions. [2022-11-03 03:38:34,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 1.794871794871795) internal successors, (70), 39 states have internal predecessors, (70), 0 states have call successors, (0), 0 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-03 03:38:34,511 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 2596 transitions. [2022-11-03 03:38:34,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-03 03:38:34,513 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:38:34,513 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:38:34,548 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2022-11-03 03:38:34,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-11-03 03:38:34,727 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-03 03:38:34,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:38:34,727 INFO L85 PathProgramCache]: Analyzing trace with hash 676740878, now seen corresponding path program 13 times [2022-11-03 03:38:34,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:38:34,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807414852] [2022-11-03 03:38:34,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:38:34,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:38:34,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:38:35,803 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:38:35,803 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:38:35,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807414852] [2022-11-03 03:38:35,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807414852] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:38:35,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [413708470] [2022-11-03 03:38:35,804 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 03:38:35,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:38:35,804 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:38:35,805 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:38:35,814 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-11-03 03:38:35,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:38:35,978 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 54 conjunts are in the unsatisfiable core [2022-11-03 03:38:35,980 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:38:36,094 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 03:38:36,146 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:38:36,197 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:38:36,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:36,494 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 35 treesize of output 33 [2022-11-03 03:38:36,991 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:38:36,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:36,996 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:38:36,996 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 152 treesize of output 81 [2022-11-03 03:38:37,189 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:38:37,190 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:38:37,895 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse23 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse5 (+ c_~A~0.offset (* 4 c_~M~0))) (.cse3 (+ c_~A~0.offset .cse23 4)) (.cse4 (+ c_~A~0.offset .cse23))) (and (forall ((v_ArrVal_1885 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1885) c_~A~0.base))) (let ((.cse1 (select .cse2 .cse5)) (.cse0 (select .cse2 .cse4))) (or (not (< c_~max1~0 .cse0)) (not (< c_~max2~0 .cse1)) (< .cse0 (select .cse2 .cse3)) (= .cse1 .cse0))))) (forall ((v_ArrVal_1885 (Array Int Int))) (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1885) c_~A~0.base))) (let ((.cse7 (select .cse6 .cse3))) (or (< c_~max1~0 (select .cse6 .cse4)) (not (< c_~max1~0 .cse7)) (< c_~max2~0 (select .cse6 .cse5)) (= c_~max2~0 .cse7))))) (forall ((v_ArrVal_1885 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1885) c_~A~0.base))) (let ((.cse9 (select .cse8 .cse5)) (.cse10 (select .cse8 .cse3))) (or (< c_~max1~0 (select .cse8 .cse4)) (not (< c_~max2~0 .cse9)) (= .cse9 .cse10) (not (< c_~max1~0 .cse10)))))) (or (= c_~max1~0 c_~max2~0) (forall ((v_ArrVal_1885 (Array Int Int))) (let ((.cse11 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1885) c_~A~0.base))) (or (< c_~max1~0 (select .cse11 .cse4)) (< c_~max1~0 (select .cse11 .cse3)) (< c_~max2~0 (select .cse11 .cse5)))))) (forall ((v_ArrVal_1885 (Array Int Int))) (let ((.cse15 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1885) c_~A~0.base))) (let ((.cse12 (select .cse15 .cse4)) (.cse13 (select .cse15 .cse5)) (.cse14 (select .cse15 .cse3))) (or (not (< c_~max1~0 .cse12)) (not (< c_~max2~0 .cse13)) (not (< .cse12 .cse14)) (= .cse13 .cse14))))) (forall ((v_ArrVal_1885 (Array Int Int))) (let ((.cse16 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1885) c_~A~0.base))) (let ((.cse17 (select .cse16 .cse5))) (or (< c_~max1~0 (select .cse16 .cse4)) (= c_~max1~0 .cse17) (not (< c_~max2~0 .cse17)) (< c_~max1~0 (select .cse16 .cse3)))))) (forall ((v_ArrVal_1885 (Array Int Int))) (let ((.cse19 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1885) c_~A~0.base))) (let ((.cse18 (select .cse19 .cse4))) (or (not (< c_~max1~0 .cse18)) (< .cse18 (select .cse19 .cse3)) (= c_~max2~0 .cse18) (< c_~max2~0 (select .cse19 .cse5)))))) (forall ((v_ArrVal_1885 (Array Int Int))) (let ((.cse22 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1885) c_~A~0.base))) (let ((.cse20 (select .cse22 .cse4)) (.cse21 (select .cse22 .cse3))) (or (not (< c_~max1~0 .cse20)) (not (< .cse20 .cse21)) (< c_~max2~0 (select .cse22 .cse5)) (= c_~max2~0 .cse21)))))))) is different from false [2022-11-03 03:38:38,006 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~A~0.offset 4)) (.cse4 (+ c_~A~0.offset (* 4 c_~M~0)))) (and (forall ((v_ArrVal_1885 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1885) c_~A~0.base))) (let ((.cse0 (select .cse1 c_~A~0.offset)) (.cse3 (select .cse1 .cse4))) (or (< .cse0 (select .cse1 .cse2)) (not (< c_~max1~0 .cse0)) (not (< c_~max2~0 .cse3)) (= .cse0 .cse3))))) (or (= c_~max1~0 c_~max2~0) (forall ((v_ArrVal_1885 (Array Int Int))) (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1885) c_~A~0.base))) (or (< c_~max1~0 (select .cse5 .cse2)) (< c_~max1~0 (select .cse5 c_~A~0.offset)) (< c_~max2~0 (select .cse5 .cse4)))))) (forall ((v_ArrVal_1885 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1885) c_~A~0.base))) (let ((.cse6 (select .cse8 c_~A~0.offset)) (.cse7 (select .cse8 .cse2))) (or (not (< c_~max1~0 .cse6)) (not (< .cse6 .cse7)) (< c_~max2~0 (select .cse8 .cse4)) (= c_~max2~0 .cse7))))) (forall ((v_ArrVal_1885 (Array Int Int))) (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1885) c_~A~0.base))) (let ((.cse9 (select .cse10 .cse4)) (.cse11 (select .cse10 .cse2))) (or (not (< c_~max2~0 .cse9)) (< c_~max1~0 (select .cse10 c_~A~0.offset)) (not (< c_~max1~0 .cse11)) (= .cse9 .cse11))))) (forall ((v_ArrVal_1885 (Array Int Int))) (let ((.cse15 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1885) c_~A~0.base))) (let ((.cse12 (select .cse15 c_~A~0.offset)) (.cse14 (select .cse15 .cse4)) (.cse13 (select .cse15 .cse2))) (or (not (< c_~max1~0 .cse12)) (not (< .cse12 .cse13)) (not (< c_~max2~0 .cse14)) (= .cse14 .cse13))))) (forall ((v_ArrVal_1885 (Array Int Int))) (let ((.cse17 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1885) c_~A~0.base))) (let ((.cse16 (select .cse17 .cse4))) (or (= c_~max1~0 .cse16) (not (< c_~max2~0 .cse16)) (< c_~max1~0 (select .cse17 .cse2)) (< c_~max1~0 (select .cse17 c_~A~0.offset)))))) (forall ((v_ArrVal_1885 (Array Int Int))) (let ((.cse18 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1885) c_~A~0.base))) (let ((.cse19 (select .cse18 .cse2))) (or (< c_~max1~0 (select .cse18 c_~A~0.offset)) (not (< c_~max1~0 .cse19)) (< c_~max2~0 (select .cse18 .cse4)) (= c_~max2~0 .cse19))))) (forall ((v_ArrVal_1885 (Array Int Int))) (let ((.cse21 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1885) c_~A~0.base))) (let ((.cse20 (select .cse21 c_~A~0.offset))) (or (< .cse20 (select .cse21 .cse2)) (not (< c_~max1~0 .cse20)) (= .cse20 c_~max2~0) (< c_~max2~0 (select .cse21 .cse4)))))))) is different from false [2022-11-03 03:38:42,870 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_~A~0.offset 4))) (and (forall ((v_ArrVal_1884 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1884))) (let ((.cse0 (select (select .cse5 c_~A~0.base) c_~A~0.offset))) (or (not (< c_~max2~0 .cse0)) (forall ((~M~0 Int)) (or (forall ((v_ArrVal_1885 (Array Int Int))) (let ((.cse3 (select (store .cse5 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1885) c_~A~0.base))) (let ((.cse1 (select .cse3 c_~A~0.offset)) (.cse2 (select .cse3 .cse4))) (or (not (< .cse1 .cse2)) (< .cse0 (select .cse3 (+ c_~A~0.offset (* ~M~0 4)))) (not (< c_~max1~0 .cse1)) (= .cse2 .cse0))))) (not (< 0 ~M~0)) (< 1 ~M~0))))))) (or (forall ((v_ArrVal_1885 (Array Int Int)) (~M~0 Int) (v_ArrVal_1884 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1884))) (let ((.cse6 (select (store .cse7 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1885) c_~A~0.base))) (or (< c_~max2~0 (select .cse6 (+ c_~A~0.offset (* ~M~0 4)))) (not (< 0 ~M~0)) (< c_~max1~0 (select .cse6 .cse4)) (< c_~max1~0 (select .cse6 c_~A~0.offset)) (< c_~max2~0 (select (select .cse7 c_~A~0.base) c_~A~0.offset)) (< 1 ~M~0))))) (= c_~max1~0 c_~max2~0)) (forall ((v_ArrVal_1884 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1884))) (or (forall ((~M~0 Int)) (or (not (< 0 ~M~0)) (forall ((v_ArrVal_1885 (Array Int Int))) (let ((.cse8 (select (store .cse10 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1885) c_~A~0.base))) (let ((.cse9 (select .cse8 (+ c_~A~0.offset (* ~M~0 4))))) (or (< c_~max1~0 (select .cse8 .cse4)) (= c_~max1~0 .cse9) (not (< c_~max2~0 .cse9)) (< c_~max1~0 (select .cse8 c_~A~0.offset)))))) (< 1 ~M~0))) (< c_~max2~0 (select (select .cse10 c_~A~0.base) c_~A~0.offset))))) (forall ((v_ArrVal_1884 (Array Int Int))) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1884))) (or (forall ((~M~0 Int)) (or (not (< 0 ~M~0)) (forall ((v_ArrVal_1885 (Array Int Int))) (let ((.cse11 (select (store .cse13 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1885) c_~A~0.base))) (let ((.cse12 (select .cse11 .cse4))) (or (< c_~max2~0 (select .cse11 (+ c_~A~0.offset (* ~M~0 4)))) (< c_~max1~0 (select .cse11 c_~A~0.offset)) (not (< c_~max1~0 .cse12)) (= .cse12 c_~max2~0))))) (< 1 ~M~0))) (< c_~max2~0 (select (select .cse13 c_~A~0.base) c_~A~0.offset))))) (forall ((v_ArrVal_1884 (Array Int Int))) (let ((.cse18 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1884))) (let ((.cse14 (select (select .cse18 c_~A~0.base) c_~A~0.offset))) (or (not (< c_~max2~0 .cse14)) (forall ((~M~0 Int)) (or (forall ((v_ArrVal_1885 (Array Int Int))) (let ((.cse17 (select (store .cse18 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1885) c_~A~0.base))) (let ((.cse16 (select .cse17 (+ c_~A~0.offset (* ~M~0 4)))) (.cse15 (select .cse17 c_~A~0.offset))) (or (= .cse15 .cse16) (not (< .cse14 .cse16)) (< .cse15 (select .cse17 .cse4)) (not (< c_~max1~0 .cse15)))))) (not (< 0 ~M~0)) (< 1 ~M~0))))))) (forall ((v_ArrVal_1884 (Array Int Int))) (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1884))) (or (forall ((~M~0 Int)) (or (not (< 0 ~M~0)) (forall ((v_ArrVal_1885 (Array Int Int))) (let ((.cse19 (select (store .cse22 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1885) c_~A~0.base))) (let ((.cse21 (select .cse19 .cse4)) (.cse20 (select .cse19 c_~A~0.offset))) (or (< c_~max2~0 (select .cse19 (+ c_~A~0.offset (* ~M~0 4)))) (not (< .cse20 .cse21)) (= .cse21 c_~max2~0) (not (< c_~max1~0 .cse20)))))) (< 1 ~M~0))) (< c_~max2~0 (select (select .cse22 c_~A~0.base) c_~A~0.offset))))) (forall ((v_ArrVal_1884 (Array Int Int))) (let ((.cse26 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1884))) (let ((.cse23 (select (select .cse26 c_~A~0.base) c_~A~0.offset))) (or (not (< c_~max2~0 .cse23)) (forall ((~M~0 Int)) (or (forall ((v_ArrVal_1885 (Array Int Int))) (let ((.cse24 (select (store .cse26 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1885) c_~A~0.base))) (let ((.cse25 (select .cse24 .cse4))) (or (< .cse23 (select .cse24 (+ c_~A~0.offset (* ~M~0 4)))) (< c_~max1~0 (select .cse24 c_~A~0.offset)) (not (< c_~max1~0 .cse25)) (= .cse25 .cse23))))) (not (< 0 ~M~0)) (< 1 ~M~0))))))) (forall ((v_ArrVal_1884 (Array Int Int))) (let ((.cse30 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1884))) (let ((.cse27 (select (select .cse30 c_~A~0.base) c_~A~0.offset))) (or (not (< c_~max2~0 .cse27)) (forall ((~M~0 Int)) (or (forall ((v_ArrVal_1885 (Array Int Int))) (let ((.cse28 (select (store .cse30 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1885) c_~A~0.base))) (let ((.cse29 (select .cse28 c_~A~0.offset))) (or (< .cse27 (select .cse28 (+ c_~A~0.offset (* ~M~0 4)))) (= .cse29 .cse27) (< .cse29 (select .cse28 .cse4)) (not (< c_~max1~0 .cse29)))))) (not (< 0 ~M~0)) (< 1 ~M~0))))))) (forall ((v_ArrVal_1884 (Array Int Int))) (let ((.cse33 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1884))) (let ((.cse31 (select (select .cse33 c_~A~0.base) c_~A~0.offset))) (or (not (< c_~max2~0 .cse31)) (forall ((v_ArrVal_1885 (Array Int Int)) (~M~0 Int)) (let ((.cse32 (select (store .cse33 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1885) c_~A~0.base))) (or (not (< 0 ~M~0)) (< c_~max1~0 (select .cse32 .cse4)) (< .cse31 (select .cse32 (+ c_~A~0.offset (* ~M~0 4)))) (< c_~max1~0 (select .cse32 c_~A~0.offset)) (< 1 ~M~0)))) (= c_~max1~0 .cse31))))) (forall ((v_ArrVal_1884 (Array Int Int))) (let ((.cse34 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1884))) (or (< c_~max2~0 (select (select .cse34 c_~A~0.base) c_~A~0.offset)) (forall ((~M~0 Int)) (or (not (< 0 ~M~0)) (forall ((v_ArrVal_1885 (Array Int Int))) (let ((.cse37 (select (store .cse34 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1885) c_~A~0.base))) (let ((.cse36 (select .cse37 (+ c_~A~0.offset (* ~M~0 4)))) (.cse35 (select .cse37 c_~A~0.offset))) (or (= .cse35 .cse36) (< .cse35 (select .cse37 .cse4)) (not (< c_~max2~0 .cse36)) (not (< c_~max1~0 .cse35)))))) (< 1 ~M~0)))))) (forall ((v_ArrVal_1884 (Array Int Int))) (let ((.cse41 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1884))) (let ((.cse38 (select (select .cse41 c_~A~0.base) c_~A~0.offset))) (or (forall ((~M~0 Int)) (or (not (< 0 ~M~0)) (forall ((v_ArrVal_1885 (Array Int Int))) (let ((.cse40 (select (store .cse41 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1885) c_~A~0.base))) (let ((.cse39 (select .cse40 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< .cse38 .cse39)) (< c_~max1~0 (select .cse40 .cse4)) (= c_~max1~0 .cse39) (< c_~max1~0 (select .cse40 c_~A~0.offset)))))) (< 1 ~M~0))) (not (< c_~max2~0 .cse38)))))) (forall ((v_ArrVal_1884 (Array Int Int))) (let ((.cse44 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1884))) (or (forall ((~M~0 Int)) (or (forall ((v_ArrVal_1885 (Array Int Int))) (let ((.cse42 (select (store .cse44 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1885) c_~A~0.base))) (let ((.cse43 (select .cse42 c_~A~0.offset))) (or (< c_~max2~0 (select .cse42 (+ c_~A~0.offset (* ~M~0 4)))) (< .cse43 (select .cse42 .cse4)) (= .cse43 c_~max2~0) (not (< c_~max1~0 .cse43)))))) (not (< 0 ~M~0)) (< 1 ~M~0))) (< c_~max2~0 (select (select .cse44 c_~A~0.base) c_~A~0.offset))))))) is different from false [2022-11-03 03:38:44,812 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:38:44,813 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 223 treesize of output 139 [2022-11-03 03:38:44,850 INFO L356 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-03 03:38:44,851 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 3909 treesize of output 3597 [2022-11-03 03:38:44,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:44,892 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:38:44,894 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 3479 treesize of output 2967 [2022-11-03 03:38:44,933 INFO L356 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-03 03:38:44,934 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 3081 treesize of output 2889 [2022-11-03 03:38:44,988 INFO L356 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-03 03:38:44,989 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2885 treesize of output 2497 [2022-11-03 03:38:46,652 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-03 03:38:46,652 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 215 treesize of output 1 [2022-11-03 03:38:46,662 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:38:46,662 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 164 treesize of output 104 [2022-11-03 03:38:46,667 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:38:46,685 INFO L356 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-03 03:38:46,685 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1875 treesize of output 1651 [2022-11-03 03:38:46,752 INFO L356 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-03 03:38:46,753 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1647 treesize of output 1355 [2022-11-03 03:38:46,816 INFO L356 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-03 03:38:46,816 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1351 treesize of output 1207 [2022-11-03 03:38:47,477 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:38:47,477 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 170 treesize of output 110 [2022-11-03 03:38:47,481 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:38:47,497 INFO L356 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-03 03:38:47,497 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 643 treesize of output 587 [2022-11-03 03:38:47,525 INFO L356 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-03 03:38:47,526 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 583 treesize of output 551 [2022-11-03 03:38:47,555 INFO L356 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-03 03:38:47,555 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 547 treesize of output 479 [2022-11-03 03:38:47,955 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-03 03:38:47,955 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 147 treesize of output 1 [2022-11-03 03:38:47,964 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-03 03:38:47,964 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 192 treesize of output 1 [2022-11-03 03:38:47,974 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-03 03:38:47,974 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 218 treesize of output 1 [2022-11-03 03:38:47,983 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-03 03:38:47,983 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 149 treesize of output 1 [2022-11-03 03:38:47,992 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-03 03:38:47,992 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 172 treesize of output 1 [2022-11-03 03:38:48,001 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-03 03:38:48,002 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 200 treesize of output 1 [2022-11-03 03:38:48,011 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:38:48,011 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 116 treesize of output 80 [2022-11-03 03:38:48,015 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:38:48,031 INFO L356 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-03 03:38:48,031 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 501 treesize of output 461 [2022-11-03 03:38:48,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:48,055 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 231 treesize of output 203 [2022-11-03 03:38:48,078 INFO L356 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-03 03:38:48,078 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 429 treesize of output 377 [2022-11-03 03:38:48,361 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-03 03:38:48,361 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 173 treesize of output 1 [2022-11-03 03:38:48,540 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:38:48,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [413708470] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:38:48,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [281250352] [2022-11-03 03:38:48,541 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-03 03:38:48,541 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:38:48,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 14] total 39 [2022-11-03 03:38:48,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236598361] [2022-11-03 03:38:48,542 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:38:48,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-11-03 03:38:48,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:38:48,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-11-03 03:38:48,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1256, Unknown=6, NotChecked=222, Total=1640 [2022-11-03 03:38:48,543 INFO L87 Difference]: Start difference. First operand 731 states and 2596 transitions. Second operand has 41 states, 40 states have (on average 1.725) internal successors, (69), 40 states have internal predecessors, (69), 0 states have call successors, (0), 0 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-03 03:38:59,253 WARN L234 SmtUtils]: Spent 6.40s on a formula simplification that was a NOOP. DAG size: 167 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 03:38:59,940 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse10 (+ c_~A~0.offset 4)) (.cse11 (+ c_~A~0.offset (* 4 c_~M~0)))) (let ((.cse0 (forall ((v_ArrVal_1885 (Array Int Int))) (let ((.cse28 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1885) c_~A~0.base))) (let ((.cse27 (select .cse28 c_~A~0.offset)) (.cse29 (select .cse28 .cse11))) (or (< .cse27 (select .cse28 .cse10)) (not (< c_~max1~0 .cse27)) (not (< c_~max2~0 .cse29)) (= .cse27 .cse29)))))) (.cse1 (or (= c_~max1~0 c_~max2~0) (forall ((v_ArrVal_1885 (Array Int Int))) (let ((.cse26 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1885) c_~A~0.base))) (or (< c_~max1~0 (select .cse26 .cse10)) (< c_~max1~0 (select .cse26 c_~A~0.offset)) (< c_~max2~0 (select .cse26 .cse11))))))) (.cse2 (forall ((v_ArrVal_1885 (Array Int Int))) (let ((.cse25 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1885) c_~A~0.base))) (let ((.cse23 (select .cse25 c_~A~0.offset)) (.cse24 (select .cse25 .cse10))) (or (not (< c_~max1~0 .cse23)) (not (< .cse23 .cse24)) (< c_~max2~0 (select .cse25 .cse11)) (= c_~max2~0 .cse24)))))) (.cse3 (forall ((v_ArrVal_1885 (Array Int Int))) (let ((.cse21 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1885) c_~A~0.base))) (let ((.cse20 (select .cse21 .cse11)) (.cse22 (select .cse21 .cse10))) (or (not (< c_~max2~0 .cse20)) (< c_~max1~0 (select .cse21 c_~A~0.offset)) (not (< c_~max1~0 .cse22)) (= .cse20 .cse22)))))) (.cse4 (forall ((v_ArrVal_1885 (Array Int Int))) (let ((.cse19 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1885) c_~A~0.base))) (let ((.cse16 (select .cse19 c_~A~0.offset)) (.cse18 (select .cse19 .cse11)) (.cse17 (select .cse19 .cse10))) (or (not (< c_~max1~0 .cse16)) (not (< .cse16 .cse17)) (not (< c_~max2~0 .cse18)) (= .cse18 .cse17)))))) (.cse5 (forall ((v_ArrVal_1885 (Array Int Int))) (let ((.cse15 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1885) c_~A~0.base))) (let ((.cse14 (select .cse15 .cse11))) (or (= c_~max1~0 .cse14) (not (< c_~max2~0 .cse14)) (< c_~max1~0 (select .cse15 .cse10)) (< c_~max1~0 (select .cse15 c_~A~0.offset))))))) (.cse6 (forall ((v_ArrVal_1885 (Array Int Int))) (let ((.cse12 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1885) c_~A~0.base))) (let ((.cse13 (select .cse12 .cse10))) (or (< c_~max1~0 (select .cse12 c_~A~0.offset)) (not (< c_~max1~0 .cse13)) (< c_~max2~0 (select .cse12 .cse11)) (= c_~max2~0 .cse13)))))) (.cse7 (forall ((v_ArrVal_1885 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1885) c_~A~0.base))) (let ((.cse8 (select .cse9 c_~A~0.offset))) (or (< .cse8 (select .cse9 .cse10)) (not (< c_~max1~0 .cse8)) (= .cse8 c_~max2~0) (< c_~max2~0 (select .cse9 .cse11)))))))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (or (< c_thread2Thread1of1ForFork0_~i~1 c_~M~0) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7)) .cse7))) is different from false [2022-11-03 03:39:05,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:39:05,979 INFO L93 Difference]: Finished difference Result 1260 states and 4143 transitions. [2022-11-03 03:39:05,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-11-03 03:39:05,980 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 1.725) internal successors, (69), 40 states have internal predecessors, (69), 0 states have call successors, (0), 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 26 [2022-11-03 03:39:05,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:39:05,985 INFO L225 Difference]: With dead ends: 1260 [2022-11-03 03:39:05,985 INFO L226 Difference]: Without dead ends: 1173 [2022-11-03 03:39:05,986 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 25 SyntacticMatches, 4 SemanticMatches, 69 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1093 ImplicationChecksByTransitivity, 20.1s TimeCoverageRelationStatistics Valid=448, Invalid=3976, Unknown=14, NotChecked=532, Total=4970 [2022-11-03 03:39:05,986 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 193 mSDsluCounter, 774 mSDsCounter, 0 mSdLazyCounter, 2930 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 3994 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 2930 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1026 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-11-03 03:39:05,986 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 102 Invalid, 3994 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 2930 Invalid, 0 Unknown, 1026 Unchecked, 2.9s Time] [2022-11-03 03:39:05,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173 states. [2022-11-03 03:39:06,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173 to 826. [2022-11-03 03:39:06,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 826 states, 825 states have (on average 3.541818181818182) internal successors, (2922), 825 states have internal predecessors, (2922), 0 states have call successors, (0), 0 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-03 03:39:06,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 826 states to 826 states and 2922 transitions. [2022-11-03 03:39:06,011 INFO L78 Accepts]: Start accepts. Automaton has 826 states and 2922 transitions. Word has length 26 [2022-11-03 03:39:06,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:39:06,012 INFO L495 AbstractCegarLoop]: Abstraction has 826 states and 2922 transitions. [2022-11-03 03:39:06,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 1.725) internal successors, (69), 40 states have internal predecessors, (69), 0 states have call successors, (0), 0 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-03 03:39:06,012 INFO L276 IsEmpty]: Start isEmpty. Operand 826 states and 2922 transitions. [2022-11-03 03:39:06,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-03 03:39:06,014 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:39:06,014 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:39:06,050 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2022-11-03 03:39:06,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:39:06,243 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-03 03:39:06,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:39:06,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1971819348, now seen corresponding path program 14 times [2022-11-03 03:39:06,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:39:06,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764515741] [2022-11-03 03:39:06,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:39:06,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:39:06,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:39:07,637 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:39:07,637 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:39:07,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764515741] [2022-11-03 03:39:07,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764515741] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:39:07,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [222748675] [2022-11-03 03:39:07,638 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 03:39:07,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:39:07,638 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:39:07,639 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:39:07,640 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_364e6386-f3ef-419d-b3aa-e08fca26a5ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-11-03 03:39:07,862 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-03 03:39:07,862 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:39:07,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 49 conjunts are in the unsatisfiable core [2022-11-03 03:39:07,866 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:39:07,876 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 202 treesize of output 198 [2022-11-03 03:39:08,379 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 35 treesize of output 33 [2022-11-03 03:39:09,080 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:39:09,080 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 181 treesize of output 209 [2022-11-03 03:39:12,935 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:39:12,936 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:39:14,965 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4))) (.cse2 (+ c_~A~0.offset (* 4 c_~M~0)))) (and (forall ((v_ArrVal_1937 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1937) c_~A~0.base))) (let ((.cse0 (select .cse1 .cse3))) (or (not (< c_~max1~0 .cse0)) (= .cse0 c_~max2~0) (forall ((v_subst_2 Int)) (or (< .cse0 (select .cse1 (+ c_~A~0.offset (* 4 v_subst_2)))) (< (+ v_subst_2 1) c_~N~0) (not (< v_subst_2 c_~N~0)))) (< c_~max2~0 (select .cse1 .cse2)))))) (forall ((v_ArrVal_1937 (Array Int Int))) (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1937) c_~A~0.base))) (let ((.cse4 (select .cse6 .cse3)) (.cse5 (select .cse6 .cse2))) (or (not (< c_~max1~0 .cse4)) (= .cse4 .cse5) (forall ((v_subst_2 Int)) (or (< .cse4 (select .cse6 (+ c_~A~0.offset (* 4 v_subst_2)))) (< (+ v_subst_2 1) c_~N~0) (not (< v_subst_2 c_~N~0)))) (not (< c_~max2~0 .cse5)))))) (forall ((v_ArrVal_1937 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1937) c_~A~0.base))) (let ((.cse8 (select .cse9 .cse2))) (or (forall ((thread1Thread1of1ForFork2_~i~0 Int)) (let ((.cse7 (select .cse9 (+ c_~A~0.offset (* thread1Thread1of1ForFork2_~i~0 4))))) (or (not (< c_~max1~0 .cse7)) (= .cse8 .cse7) (< (+ thread1Thread1of1ForFork2_~i~0 1) c_~N~0) (not (< thread1Thread1of1ForFork2_~i~0 c_~N~0))))) (not (< c_~max2~0 .cse8)) (< c_~max1~0 (select .cse9 .cse3)))))) (or (forall ((v_thread1Thread1of1ForFork2_~i~0_191 Int) (v_ArrVal_1937 (Array Int Int))) (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1937) c_~A~0.base))) (or (< (+ v_thread1Thread1of1ForFork2_~i~0_191 1) c_~N~0) (< c_~max1~0 (select .cse10 (+ c_~A~0.offset (* v_thread1Thread1of1ForFork2_~i~0_191 4)))) (< c_~max2~0 (select .cse10 .cse2)) (not (< v_thread1Thread1of1ForFork2_~i~0_191 c_~N~0)) (< c_~max1~0 (select .cse10 .cse3))))) (= c_~max1~0 c_~max2~0)) (forall ((v_ArrVal_1937 (Array Int Int))) (let ((.cse12 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1937) c_~A~0.base))) (let ((.cse11 (select .cse12 .cse3))) (or (not (< c_~max1~0 .cse11)) (< c_~max2~0 (select .cse12 .cse2)) (forall ((v_subst_1 Int)) (let ((.cse13 (select .cse12 (+ c_~A~0.offset (* 4 v_subst_1))))) (or (not (< v_subst_1 c_~N~0)) (not (< .cse11 .cse13)) (= .cse13 c_~max2~0) (< (+ v_subst_1 1) c_~N~0)))))))) (forall ((v_ArrVal_1937 (Array Int Int))) (let ((.cse14 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1937) c_~A~0.base))) (or (< c_~max2~0 (select .cse14 .cse2)) (forall ((thread1Thread1of1ForFork2_~i~0 Int)) (let ((.cse15 (select .cse14 (+ c_~A~0.offset (* thread1Thread1of1ForFork2_~i~0 4))))) (or (not (< c_~max1~0 .cse15)) (= c_~max2~0 .cse15) (< (+ thread1Thread1of1ForFork2_~i~0 1) c_~N~0) (not (< thread1Thread1of1ForFork2_~i~0 c_~N~0))))) (< c_~max1~0 (select .cse14 .cse3))))) (forall ((v_ArrVal_1937 (Array Int Int))) (let ((.cse19 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1937) c_~A~0.base))) (let ((.cse16 (select .cse19 .cse3)) (.cse17 (select .cse19 .cse2))) (or (not (< c_~max1~0 .cse16)) (not (< c_~max2~0 .cse17)) (forall ((v_subst_1 Int)) (let ((.cse18 (select .cse19 (+ c_~A~0.offset (* 4 v_subst_1))))) (or (not (< v_subst_1 c_~N~0)) (not (< .cse16 .cse18)) (= .cse18 .cse17) (< (+ v_subst_1 1) c_~N~0)))))))) (forall ((v_ArrVal_1937 (Array Int Int))) (let ((.cse21 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1937) c_~A~0.base))) (let ((.cse20 (select .cse21 .cse2))) (or (= c_~max1~0 .cse20) (forall ((thread1Thread1of1ForFork2_~i~0 Int)) (or (< c_~max1~0 (select .cse21 (+ c_~A~0.offset (* thread1Thread1of1ForFork2_~i~0 4)))) (< (+ thread1Thread1of1ForFork2_~i~0 1) c_~N~0) (not (< thread1Thread1of1ForFork2_~i~0 c_~N~0)))) (not (< c_~max2~0 .cse20)) (< c_~max1~0 (select .cse21 .cse3)))))))) is different from false [2022-11-03 03:39:15,182 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~A~0.offset (* 4 c_~M~0)))) (and (forall ((v_ArrVal_1937 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1937) c_~A~0.base))) (or (< c_~max1~0 (select .cse0 c_~A~0.offset)) (< c_~max2~0 (select .cse0 .cse1)) (forall ((thread1Thread1of1ForFork2_~i~0 Int)) (let ((.cse2 (select .cse0 (+ c_~A~0.offset (* thread1Thread1of1ForFork2_~i~0 4))))) (or (not (< c_~max1~0 .cse2)) (= c_~max2~0 .cse2) (< (+ thread1Thread1of1ForFork2_~i~0 1) c_~N~0) (not (< thread1Thread1of1ForFork2_~i~0 c_~N~0)))))))) (forall ((v_ArrVal_1937 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1937) c_~A~0.base))) (let ((.cse4 (select .cse3 c_~A~0.offset))) (or (< c_~max2~0 (select .cse3 .cse1)) (forall ((v_subst_1 Int)) (let ((.cse5 (select .cse3 (+ c_~A~0.offset (* 4 v_subst_1))))) (or (not (< v_subst_1 c_~N~0)) (not (< .cse4 .cse5)) (= .cse5 c_~max2~0) (< (+ v_subst_1 1) c_~N~0)))) (not (< c_~max1~0 .cse4)))))) (forall ((v_ArrVal_1937 (Array Int Int))) (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1937) c_~A~0.base))) (let ((.cse8 (select .cse6 .cse1))) (or (< c_~max1~0 (select .cse6 c_~A~0.offset)) (forall ((thread1Thread1of1ForFork2_~i~0 Int)) (let ((.cse7 (select .cse6 (+ c_~A~0.offset (* thread1Thread1of1ForFork2_~i~0 4))))) (or (not (< c_~max1~0 .cse7)) (= .cse8 .cse7) (< (+ thread1Thread1of1ForFork2_~i~0 1) c_~N~0) (not (< thread1Thread1of1ForFork2_~i~0 c_~N~0))))) (not (< c_~max2~0 .cse8)))))) (or (forall ((v_thread1Thread1of1ForFork2_~i~0_191 Int) (v_ArrVal_1937 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1937) c_~A~0.base))) (or (< (+ v_thread1Thread1of1ForFork2_~i~0_191 1) c_~N~0) (< c_~max1~0 (select .cse9 c_~A~0.offset)) (< c_~max1~0 (select .cse9 (+ c_~A~0.offset (* v_thread1Thread1of1ForFork2_~i~0_191 4)))) (< c_~max2~0 (select .cse9 .cse1)) (not (< v_thread1Thread1of1ForFork2_~i~0_191 c_~N~0))))) (= c_~max1~0 c_~max2~0)) (forall ((v_ArrVal_1937 (Array Int Int))) (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1937) c_~A~0.base))) (let ((.cse11 (select .cse10 c_~A~0.offset))) (or (< c_~max2~0 (select .cse10 .cse1)) (not (< c_~max1~0 .cse11)) (forall ((v_subst_2 Int)) (or (< .cse11 (select .cse10 (+ c_~A~0.offset (* 4 v_subst_2)))) (< (+ v_subst_2 1) c_~N~0) (not (< v_subst_2 c_~N~0)))) (= .cse11 c_~max2~0))))) (forall ((v_ArrVal_1937 (Array Int Int))) (let ((.cse12 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1937) c_~A~0.base))) (let ((.cse13 (select .cse12 .cse1))) (or (< c_~max1~0 (select .cse12 c_~A~0.offset)) (= c_~max1~0 .cse13) (forall ((thread1Thread1of1ForFork2_~i~0 Int)) (or (< c_~max1~0 (select .cse12 (+ c_~A~0.offset (* thread1Thread1of1ForFork2_~i~0 4)))) (< (+ thread1Thread1of1ForFork2_~i~0 1) c_~N~0) (not (< thread1Thread1of1ForFork2_~i~0 c_~N~0)))) (not (< c_~max2~0 .cse13)))))) (forall ((v_ArrVal_1937 (Array Int Int))) (let ((.cse17 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1937) c_~A~0.base))) (let ((.cse15 (select .cse17 c_~A~0.offset)) (.cse14 (select .cse17 .cse1))) (or (not (< c_~max2~0 .cse14)) (not (< c_~max1~0 .cse15)) (forall ((v_subst_1 Int)) (let ((.cse16 (select .cse17 (+ c_~A~0.offset (* 4 v_subst_1))))) (or (not (< v_subst_1 c_~N~0)) (not (< .cse15 .cse16)) (= .cse16 .cse14) (< (+ v_subst_1 1) c_~N~0)))))))) (forall ((v_ArrVal_1937 (Array Int Int))) (let ((.cse20 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1937) c_~A~0.base))) (let ((.cse18 (select .cse20 .cse1)) (.cse19 (select .cse20 c_~A~0.offset))) (or (= .cse18 .cse19) (not (< c_~max2~0 .cse18)) (not (< c_~max1~0 .cse19)) (forall ((v_subst_2 Int)) (or (< .cse19 (select .cse20 (+ c_~A~0.offset (* 4 v_subst_2)))) (< (+ v_subst_2 1) c_~N~0) (not (< v_subst_2 c_~N~0)))))))))) is different from false [2022-11-03 03:39:18,279 INFO L356 Elim1Store]: treesize reduction 12, result has 98.1 percent of original size [2022-11-03 03:39:18,280 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 1052 treesize of output 1408 [2022-11-03 03:39:18,476 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:39:18,476 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 757 treesize of output 762 [2022-11-03 03:39:18,603 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:39:18,604 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 729 treesize of output 738 [2022-11-03 03:39:18,739 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:39:18,740 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 705 treesize of output 716 [2022-11-03 03:39:18,903 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:39:18,904 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 683 treesize of output 696 [2022-11-03 03:39:19,092 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:39:19,093 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 663 treesize of output 670 [2022-11-03 03:39:19,334 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:39:19,334 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 637 treesize of output 652 [2022-11-03 03:39:19,518 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:39:19,519 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 619 treesize of output 632 [2022-11-03 03:39:19,726 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:39:19,727 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 599 treesize of output 618 [2022-11-03 03:40:57,093 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-03 03:41:17,219 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-03 03:42:02,773 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-03 03:42:30,261 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-03 03:43:01,270 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-03 03:44:27,100 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-03 03:46:06,153 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-03 03:46:39,042 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts.