./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/chl-word-symm.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 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_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/config/TaipanReach.xml -i ../../sv-benchmarks/c/weaver/chl-word-symm.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh --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 4ca4c99e545bc332635ee8b9969d24118d6fd539f8535aa6ae4c72d296ec330e --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-14 14:34:22,320 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 14:34:22,322 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 14:34:22,343 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 14:34:22,343 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 14:34:22,344 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 14:34:22,345 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 14:34:22,347 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 14:34:22,349 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 14:34:22,349 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 14:34:22,350 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 14:34:22,351 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 14:34:22,351 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 14:34:22,352 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 14:34:22,353 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 14:34:22,354 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 14:34:22,355 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 14:34:22,356 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 14:34:22,358 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 14:34:22,359 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 14:34:22,361 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 14:34:22,362 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 14:34:22,363 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 14:34:22,364 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 14:34:22,367 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 14:34:22,367 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 14:34:22,367 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 14:34:22,368 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 14:34:22,369 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 14:34:22,369 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 14:34:22,370 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 14:34:22,370 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 14:34:22,371 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 14:34:22,372 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 14:34:22,372 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 14:34:22,373 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 14:34:22,373 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 14:34:22,373 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 14:34:22,373 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 14:34:22,374 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 14:34:22,375 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 14:34:22,376 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-12-14 14:34:22,396 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 14:34:22,397 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 14:34:22,397 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 14:34:22,397 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 14:34:22,398 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 14:34:22,398 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 14:34:22,398 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 14:34:22,398 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 14:34:22,398 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 14:34:22,399 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 14:34:22,399 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 14:34:22,399 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 14:34:22,399 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 14:34:22,399 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 14:34:22,399 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 14:34:22,400 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 14:34:22,400 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 14:34:22,400 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 14:34:22,401 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 14:34:22,401 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 14:34:22,401 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 14:34:22,401 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 14:34:22,401 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 14:34:22,401 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 14:34:22,402 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 14:34:22,402 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 14:34:22,402 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 14:34:22,402 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 14:34:22,402 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 14:34:22,402 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 14:34:22,403 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 14:34:22,403 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 14:34:22,403 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 14:34:22,403 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 14:34:22,403 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 14:34:22,403 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 14:34:22,404 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 14:34:22,404 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 14:34:22,404 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 14:34:22,404 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 14:34:22,404 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 14:34:22,404 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_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! 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 -> 4ca4c99e545bc332635ee8b9969d24118d6fd539f8535aa6ae4c72d296ec330e [2022-12-14 14:34:22,588 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 14:34:22,609 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 14:34:22,611 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 14:34:22,612 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 14:34:22,612 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 14:34:22,613 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/weaver/chl-word-symm.wvr.c [2022-12-14 14:34:25,170 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 14:34:25,295 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 14:34:25,296 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/sv-benchmarks/c/weaver/chl-word-symm.wvr.c [2022-12-14 14:34:25,300 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/data/8a8f431f4/2fdcd5d798ee4d3c8700b91cf32d7c98/FLAG36e822d59 [2022-12-14 14:34:25,310 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/data/8a8f431f4/2fdcd5d798ee4d3c8700b91cf32d7c98 [2022-12-14 14:34:25,312 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 14:34:25,313 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 14:34:25,314 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 14:34:25,314 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 14:34:25,316 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 14:34:25,317 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 02:34:25" (1/1) ... [2022-12-14 14:34:25,318 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12953885 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:34:25, skipping insertion in model container [2022-12-14 14:34:25,318 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 02:34:25" (1/1) ... [2022-12-14 14:34:25,323 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 14:34:25,352 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 14:34:25,493 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/sv-benchmarks/c/weaver/chl-word-symm.wvr.c[2848,2861] [2022-12-14 14:34:25,501 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 14:34:25,510 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 14:34:25,529 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/sv-benchmarks/c/weaver/chl-word-symm.wvr.c[2848,2861] [2022-12-14 14:34:25,532 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 14:34:25,542 INFO L208 MainTranslator]: Completed translation [2022-12-14 14:34:25,542 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:34:25 WrapperNode [2022-12-14 14:34:25,542 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 14:34:25,543 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 14:34:25,543 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 14:34:25,543 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 14:34:25,549 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:34:25" (1/1) ... [2022-12-14 14:34:25,557 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:34:25" (1/1) ... [2022-12-14 14:34:25,579 INFO L138 Inliner]: procedures = 24, calls = 35, calls flagged for inlining = 9, calls inlined = 11, statements flattened = 128 [2022-12-14 14:34:25,579 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 14:34:25,580 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 14:34:25,580 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 14:34:25,580 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 14:34:25,590 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:34:25" (1/1) ... [2022-12-14 14:34:25,590 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:34:25" (1/1) ... [2022-12-14 14:34:25,593 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:34:25" (1/1) ... [2022-12-14 14:34:25,593 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:34:25" (1/1) ... [2022-12-14 14:34:25,600 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:34:25" (1/1) ... [2022-12-14 14:34:25,605 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:34:25" (1/1) ... [2022-12-14 14:34:25,606 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:34:25" (1/1) ... [2022-12-14 14:34:25,608 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:34:25" (1/1) ... [2022-12-14 14:34:25,611 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 14:34:25,612 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 14:34:25,612 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 14:34:25,612 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 14:34:25,613 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:34:25" (1/1) ... [2022-12-14 14:34:25,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 14:34:25,630 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:34:25,641 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 14:34:25,643 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 14:34:25,677 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 14:34:25,677 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-14 14:34:25,677 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-14 14:34:25,677 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-14 14:34:25,677 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-14 14:34:25,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 14:34:25,678 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-14 14:34:25,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-14 14:34:25,678 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-14 14:34:25,678 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 14:34:25,678 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 14:34:25,678 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-14 14:34:25,678 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 14:34:25,680 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-12-14 14:34:25,773 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 14:34:25,775 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 14:34:26,028 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 14:34:26,035 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 14:34:26,035 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-14 14:34:26,037 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 02:34:26 BoogieIcfgContainer [2022-12-14 14:34:26,037 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 14:34:26,039 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 14:34:26,039 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 14:34:26,042 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 14:34:26,042 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 02:34:25" (1/3) ... [2022-12-14 14:34:26,042 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40099fea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 02:34:26, skipping insertion in model container [2022-12-14 14:34:26,042 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:34:25" (2/3) ... [2022-12-14 14:34:26,043 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40099fea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 02:34:26, skipping insertion in model container [2022-12-14 14:34:26,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 02:34:26" (3/3) ... [2022-12-14 14:34:26,044 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-word-symm.wvr.c [2022-12-14 14:34:26,050 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-12-14 14:34:26,058 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 14:34:26,058 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-14 14:34:26,058 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-14 14:34:26,114 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-14 14:34:26,144 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-14 14:34:26,157 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 212 places, 226 transitions, 468 flow [2022-12-14 14:34:26,160 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 212 places, 226 transitions, 468 flow [2022-12-14 14:34:26,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 212 places, 226 transitions, 468 flow [2022-12-14 14:34:26,244 INFO L130 PetriNetUnfolder]: 21/224 cut-off events. [2022-12-14 14:34:26,244 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-14 14:34:26,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 233 conditions, 224 events. 21/224 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 226 event pairs, 0 based on Foata normal form. 0/202 useless extension candidates. Maximal degree in co-relation 153. Up to 3 conditions per place. [2022-12-14 14:34:26,253 INFO L119 LiptonReduction]: Number of co-enabled transitions 2700 [2022-12-14 14:34:31,083 INFO L134 LiptonReduction]: Checked pairs total: 3145 [2022-12-14 14:34:31,083 INFO L136 LiptonReduction]: Total number of compositions: 240 [2022-12-14 14:34:31,090 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 28 places, 28 transitions, 72 flow [2022-12-14 14:34:31,106 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 60 states, 59 states have (on average 2.7796610169491527) internal successors, (164), 59 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:34:31,119 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 14:34:31,124 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;@1985a2c8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 14:34:31,124 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-14 14:34:31,125 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 59 states have (on average 2.7796610169491527) internal successors, (164), 59 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:34:31,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-14 14:34:31,129 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:34:31,130 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:34:31,130 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:34:31,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:34:31,133 INFO L85 PathProgramCache]: Analyzing trace with hash -573424571, now seen corresponding path program 1 times [2022-12-14 14:34:31,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:34:31,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932806749] [2022-12-14 14:34:31,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:34:31,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:34:31,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:34:31,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:34:31,527 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:34:31,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932806749] [2022-12-14 14:34:31,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932806749] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:34:31,528 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:34:31,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 14:34:31,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534758332] [2022-12-14 14:34:31,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:34:31,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 14:34:31,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:34:31,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 14:34:31,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 14:34:31,551 INFO L87 Difference]: Start difference. First operand has 60 states, 59 states have (on average 2.7796610169491527) internal successors, (164), 59 states have internal predecessors, (164), 0 states have call successors, (0), 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 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:34:31,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:34:31,667 INFO L93 Difference]: Finished difference Result 81 states and 192 transitions. [2022-12-14 14:34:31,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 14:34:31,669 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-12-14 14:34:31,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:34:31,675 INFO L225 Difference]: With dead ends: 81 [2022-12-14 14:34:31,675 INFO L226 Difference]: Without dead ends: 74 [2022-12-14 14:34:31,676 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 14:34:31,678 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 16 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:34:31,679 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 5 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 14:34:31,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-12-14 14:34:31,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 60. [2022-12-14 14:34:31,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 2.7457627118644066) internal successors, (162), 59 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:34:31,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 162 transitions. [2022-12-14 14:34:31,703 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 162 transitions. Word has length 13 [2022-12-14 14:34:31,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:34:31,704 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 162 transitions. [2022-12-14 14:34:31,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:34:31,704 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 162 transitions. [2022-12-14 14:34:31,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-14 14:34:31,705 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:34:31,705 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:34:31,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 14:34:31,706 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:34:31,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:34:31,706 INFO L85 PathProgramCache]: Analyzing trace with hash -709098551, now seen corresponding path program 2 times [2022-12-14 14:34:31,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:34:31,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001279849] [2022-12-14 14:34:31,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:34:31,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:34:31,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:34:31,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:34:31,869 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:34:31,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001279849] [2022-12-14 14:34:31,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001279849] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:34:31,870 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:34:31,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 14:34:31,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138847194] [2022-12-14 14:34:31,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:34:31,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 14:34:31,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:34:31,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 14:34:31,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 14:34:31,872 INFO L87 Difference]: Start difference. First operand 60 states and 162 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:34:31,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:34:31,973 INFO L93 Difference]: Finished difference Result 81 states and 191 transitions. [2022-12-14 14:34:31,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 14:34:31,974 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-12-14 14:34:31,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:34:31,975 INFO L225 Difference]: With dead ends: 81 [2022-12-14 14:34:31,975 INFO L226 Difference]: Without dead ends: 70 [2022-12-14 14:34:31,975 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 14:34:31,977 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 12 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:34:31,977 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 3 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 14:34:31,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-12-14 14:34:31,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 60. [2022-12-14 14:34:31,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 2.6779661016949152) internal successors, (158), 59 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:34:31,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 158 transitions. [2022-12-14 14:34:31,985 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 158 transitions. Word has length 13 [2022-12-14 14:34:31,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:34:31,986 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 158 transitions. [2022-12-14 14:34:31,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:34:31,986 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 158 transitions. [2022-12-14 14:34:31,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-14 14:34:31,987 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:34:31,987 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:34:31,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-14 14:34:31,988 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:34:31,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:34:31,988 INFO L85 PathProgramCache]: Analyzing trace with hash -130332358, now seen corresponding path program 1 times [2022-12-14 14:34:31,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:34:31,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968697487] [2022-12-14 14:34:31,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:34:31,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:34:32,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:34:32,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:34:32,025 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:34:32,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968697487] [2022-12-14 14:34:32,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968697487] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:34:32,025 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:34:32,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 14:34:32,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531224062] [2022-12-14 14:34:32,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:34:32,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 14:34:32,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:34:32,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 14:34:32,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 14:34:32,027 INFO L87 Difference]: Start difference. First operand 60 states and 158 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:34:32,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:34:32,059 INFO L93 Difference]: Finished difference Result 60 states and 142 transitions. [2022-12-14 14:34:32,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 14:34:32,059 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-12-14 14:34:32,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:34:32,060 INFO L225 Difference]: With dead ends: 60 [2022-12-14 14:34:32,060 INFO L226 Difference]: Without dead ends: 60 [2022-12-14 14:34:32,060 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 14:34:32,061 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 9 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 14:34:32,061 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 14:34:32,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-12-14 14:34:32,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2022-12-14 14:34:32,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 2.406779661016949) internal successors, (142), 59 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:34:32,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 142 transitions. [2022-12-14 14:34:32,067 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 142 transitions. Word has length 14 [2022-12-14 14:34:32,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:34:32,067 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 142 transitions. [2022-12-14 14:34:32,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:34:32,068 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 142 transitions. [2022-12-14 14:34:32,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-12-14 14:34:32,069 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:34:32,069 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:34:32,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-14 14:34:32,069 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:34:32,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:34:32,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1810537566, now seen corresponding path program 1 times [2022-12-14 14:34:32,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:34:32,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833224582] [2022-12-14 14:34:32,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:34:32,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:34:32,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:34:32,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:34:32,468 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:34:32,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833224582] [2022-12-14 14:34:32,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833224582] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:34:32,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:34:32,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 14:34:32,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034187328] [2022-12-14 14:34:32,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:34:32,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-14 14:34:32,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:34:32,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-14 14:34:32,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-12-14 14:34:32,470 INFO L87 Difference]: Start difference. First operand 60 states and 142 transitions. Second operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:34:32,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:34:32,713 INFO L93 Difference]: Finished difference Result 134 states and 293 transitions. [2022-12-14 14:34:32,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-14 14:34:32,714 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-12-14 14:34:32,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:34:32,715 INFO L225 Difference]: With dead ends: 134 [2022-12-14 14:34:32,715 INFO L226 Difference]: Without dead ends: 119 [2022-12-14 14:34:32,715 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2022-12-14 14:34:32,716 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 90 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:34:32,716 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 9 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 14:34:32,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-12-14 14:34:32,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 99. [2022-12-14 14:34:32,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 98 states have (on average 2.3877551020408165) internal successors, (234), 98 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:34:32,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 234 transitions. [2022-12-14 14:34:32,725 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 234 transitions. Word has length 15 [2022-12-14 14:34:32,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:34:32,726 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 234 transitions. [2022-12-14 14:34:32,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:34:32,726 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 234 transitions. [2022-12-14 14:34:32,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 14:34:32,727 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:34:32,727 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:34:32,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-14 14:34:32,727 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:34:32,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:34:32,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1894925798, now seen corresponding path program 1 times [2022-12-14 14:34:32,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:34:32,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845101819] [2022-12-14 14:34:32,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:34:32,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:34:32,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:34:33,081 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:34:33,081 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:34:33,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845101819] [2022-12-14 14:34:33,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845101819] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:34:33,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [960722942] [2022-12-14 14:34:33,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:34:33,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:34:33,082 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:34:33,083 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:34:33,088 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-14 14:34:33,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:34:33,154 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 30 conjunts are in the unsatisfiable core [2022-12-14 14:34:33,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:34:33,463 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:34:33,464 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 115 treesize of output 80 [2022-12-14 14:34:33,520 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:34:33,520 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:34:33,666 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:34:33,666 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 161 treesize of output 125 [2022-12-14 14:34:34,109 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:34:34,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [960722942] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:34:34,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [946373289] [2022-12-14 14:34:34,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:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 14:34:34,117 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:34:34,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2022-12-14 14:34:34,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029283825] [2022-12-14 14:34:34,118 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:34:34,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-14 14:34:34,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:34:34,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-14 14:34:34,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=526, Unknown=0, NotChecked=0, Total=650 [2022-12-14 14:34:34,119 INFO L87 Difference]: Start difference. First operand 99 states and 234 transitions. Second operand has 26 states, 25 states have (on average 1.92) internal successors, (48), 25 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:34:35,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:34:35,393 INFO L93 Difference]: Finished difference Result 313 states and 709 transitions. [2022-12-14 14:34:35,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-12-14 14:34:35,394 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.92) internal successors, (48), 25 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-12-14 14:34:35,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:34:35,396 INFO L225 Difference]: With dead ends: 313 [2022-12-14 14:34:35,396 INFO L226 Difference]: Without dead ends: 283 [2022-12-14 14:34:35,397 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 646 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=544, Invalid=2006, Unknown=0, NotChecked=0, Total=2550 [2022-12-14 14:34:35,397 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 445 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 813 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 813 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 14:34:35,397 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [445 Valid, 27 Invalid, 827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 813 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 14:34:35,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2022-12-14 14:34:35,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 113. [2022-12-14 14:34:35,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 112 states have (on average 2.392857142857143) internal successors, (268), 112 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:34:35,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 268 transitions. [2022-12-14 14:34:35,404 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 268 transitions. Word has length 16 [2022-12-14 14:34:35,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:34:35,404 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 268 transitions. [2022-12-14 14:34:35,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.92) internal successors, (48), 25 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:34:35,404 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 268 transitions. [2022-12-14 14:34:35,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 14:34:35,405 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:34:35,405 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:34:35,410 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-14 14:34:35,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:34:35,607 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:34:35,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:34:35,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1731621144, now seen corresponding path program 2 times [2022-12-14 14:34:35,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:34:35,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903397202] [2022-12-14 14:34:35,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:34:35,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:34:35,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:34:35,911 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:34:35,912 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:34:35,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903397202] [2022-12-14 14:34:35,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903397202] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:34:35,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [540884767] [2022-12-14 14:34:35,912 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 14:34:35,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:34:35,912 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:34:35,913 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:34:35,914 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-14 14:34:35,981 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-12-14 14:34:35,981 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:34:35,983 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-14 14:34:35,985 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:34:36,181 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 14:34:36,182 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 14:34:36,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [540884767] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:34:36,182 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 14:34:36,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 15 [2022-12-14 14:34:36,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001437886] [2022-12-14 14:34:36,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:34:36,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-14 14:34:36,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:34:36,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-14 14:34:36,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2022-12-14 14:34:36,183 INFO L87 Difference]: Start difference. First operand 113 states and 268 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:34:36,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:34:36,353 INFO L93 Difference]: Finished difference Result 164 states and 399 transitions. [2022-12-14 14:34:36,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 14:34:36,354 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-12-14 14:34:36,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:34:36,355 INFO L225 Difference]: With dead ends: 164 [2022-12-14 14:34:36,355 INFO L226 Difference]: Without dead ends: 159 [2022-12-14 14:34:36,356 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2022-12-14 14:34:36,357 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 56 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:34:36,357 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 11 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 14:34:36,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2022-12-14 14:34:36,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 117. [2022-12-14 14:34:36,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 116 states have (on average 2.4310344827586206) internal successors, (282), 116 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:34:36,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 282 transitions. [2022-12-14 14:34:36,366 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 282 transitions. Word has length 16 [2022-12-14 14:34:36,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:34:36,367 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 282 transitions. [2022-12-14 14:34:36,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:34:36,367 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 282 transitions. [2022-12-14 14:34:36,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 14:34:36,368 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:34:36,369 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:34:36,374 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-14 14:34:36,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:34:36,570 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:34:36,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:34:36,571 INFO L85 PathProgramCache]: Analyzing trace with hash -843813154, now seen corresponding path program 3 times [2022-12-14 14:34:36,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:34:36,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291849597] [2022-12-14 14:34:36,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:34:36,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:34:36,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:34:36,976 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:34:36,976 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:34:36,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291849597] [2022-12-14 14:34:36,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291849597] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:34:36,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1133405595] [2022-12-14 14:34:36,976 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 14:34:36,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:34:36,977 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:34:36,978 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:34:36,978 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-14 14:34:37,038 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 14:34:37,038 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:34:37,040 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 26 conjunts are in the unsatisfiable core [2022-12-14 14:34:37,042 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:34:37,252 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:34:37,252 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:34:37,360 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:34:37,360 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 161 treesize of output 125 [2022-12-14 14:34:37,848 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:34:37,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1133405595] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-14 14:34:37,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-14 14:34:37,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8, 8] total 24 [2022-12-14 14:34:37,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823738723] [2022-12-14 14:34:37,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:34:37,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-14 14:34:37,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:34:37,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-14 14:34:37,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=523, Unknown=0, NotChecked=0, Total=650 [2022-12-14 14:34:37,849 INFO L87 Difference]: Start difference. First operand 117 states and 282 transitions. Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:34:38,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:34:38,461 INFO L93 Difference]: Finished difference Result 188 states and 428 transitions. [2022-12-14 14:34:38,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-14 14:34:38,461 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-12-14 14:34:38,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:34:38,463 INFO L225 Difference]: With dead ends: 188 [2022-12-14 14:34:38,463 INFO L226 Difference]: Without dead ends: 179 [2022-12-14 14:34:38,463 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=258, Invalid=1002, Unknown=0, NotChecked=0, Total=1260 [2022-12-14 14:34:38,464 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 270 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 14:34:38,464 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 7 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 14:34:38,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2022-12-14 14:34:38,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 105. [2022-12-14 14:34:38,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 104 states have (on average 2.3653846153846154) internal successors, (246), 104 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:34:38,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 246 transitions. [2022-12-14 14:34:38,470 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 246 transitions. Word has length 16 [2022-12-14 14:34:38,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:34:38,471 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 246 transitions. [2022-12-14 14:34:38,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:34:38,471 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 246 transitions. [2022-12-14 14:34:38,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 14:34:38,472 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:34:38,472 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:34:38,477 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-14 14:34:38,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:34:38,673 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:34:38,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:34:38,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1492675238, now seen corresponding path program 4 times [2022-12-14 14:34:38,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:34:38,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422864067] [2022-12-14 14:34:38,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:34:38,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:34:38,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:34:38,934 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:34:38,934 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:34:38,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422864067] [2022-12-14 14:34:38,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422864067] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:34:38,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1531936876] [2022-12-14 14:34:38,934 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 14:34:38,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:34:38,935 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:34:38,935 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:34:38,936 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-14 14:34:38,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:34:39,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 30 conjunts are in the unsatisfiable core [2022-12-14 14:34:39,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:34:39,174 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:34:39,175 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 111 treesize of output 76 [2022-12-14 14:34:39,274 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:34:39,274 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:34:39,467 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:34:39,468 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 161 treesize of output 125 [2022-12-14 14:34:39,711 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:34:39,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1531936876] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:34:39,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [283178407] [2022-12-14 14:34:39,712 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 14:34:39,712 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:34:39,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2022-12-14 14:34:39,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146653718] [2022-12-14 14:34:39,712 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:34:39,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-14 14:34:39,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:34:39,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-14 14:34:39,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=541, Unknown=0, NotChecked=0, Total=650 [2022-12-14 14:34:39,714 INFO L87 Difference]: Start difference. First operand 105 states and 246 transitions. Second operand has 26 states, 25 states have (on average 1.92) internal successors, (48), 25 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:34:41,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:34:41,095 INFO L93 Difference]: Finished difference Result 337 states and 739 transitions. [2022-12-14 14:34:41,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-12-14 14:34:41,095 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.92) internal successors, (48), 25 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-12-14 14:34:41,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:34:41,096 INFO L225 Difference]: With dead ends: 337 [2022-12-14 14:34:41,096 INFO L226 Difference]: Without dead ends: 327 [2022-12-14 14:34:41,097 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 678 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=561, Invalid=2195, Unknown=0, NotChecked=0, Total=2756 [2022-12-14 14:34:41,097 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 517 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 1012 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 517 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 1032 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1012 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 14:34:41,097 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [517 Valid, 97 Invalid, 1032 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1012 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-14 14:34:41,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2022-12-14 14:34:41,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 121. [2022-12-14 14:34:41,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 120 states have (on average 2.341666666666667) internal successors, (281), 120 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:34:41,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 281 transitions. [2022-12-14 14:34:41,101 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 281 transitions. Word has length 16 [2022-12-14 14:34:41,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:34:41,102 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 281 transitions. [2022-12-14 14:34:41,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.92) internal successors, (48), 25 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:34:41,102 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 281 transitions. [2022-12-14 14:34:41,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 14:34:41,102 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:34:41,102 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:34:41,107 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-14 14:34:41,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-12-14 14:34:41,304 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:34:41,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:34:41,304 INFO L85 PathProgramCache]: Analyzing trace with hash 987615078, now seen corresponding path program 5 times [2022-12-14 14:34:41,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:34:41,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813502007] [2022-12-14 14:34:41,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:34:41,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:34:41,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:34:41,612 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:34:41,613 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:34:41,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813502007] [2022-12-14 14:34:41,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813502007] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:34:41,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [803392816] [2022-12-14 14:34:41,613 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 14:34:41,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:34:41,613 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:34:41,614 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:34:41,615 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-14 14:34:41,684 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-12-14 14:34:41,684 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:34:41,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-14 14:34:41,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:34:41,862 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 14:34:41,862 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 14:34:41,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [803392816] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:34:41,862 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 14:34:41,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 15 [2022-12-14 14:34:41,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113649345] [2022-12-14 14:34:41,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:34:41,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-14 14:34:41,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:34:41,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-14 14:34:41,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2022-12-14 14:34:41,864 INFO L87 Difference]: Start difference. First operand 121 states and 281 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:34:42,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:34:42,025 INFO L93 Difference]: Finished difference Result 146 states and 331 transitions. [2022-12-14 14:34:42,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 14:34:42,025 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-12-14 14:34:42,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:34:42,026 INFO L225 Difference]: With dead ends: 146 [2022-12-14 14:34:42,026 INFO L226 Difference]: Without dead ends: 141 [2022-12-14 14:34:42,027 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2022-12-14 14:34:42,027 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 46 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:34:42,028 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 16 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 14:34:42,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-12-14 14:34:42,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 121. [2022-12-14 14:34:42,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 120 states have (on average 2.341666666666667) internal successors, (281), 120 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:34:42,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 281 transitions. [2022-12-14 14:34:42,033 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 281 transitions. Word has length 16 [2022-12-14 14:34:42,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:34:42,033 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 281 transitions. [2022-12-14 14:34:42,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:34:42,033 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 281 transitions. [2022-12-14 14:34:42,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 14:34:42,034 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:34:42,034 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:34:42,041 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-14 14:34:42,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:34:42,235 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:34:42,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:34:42,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1587819220, now seen corresponding path program 6 times [2022-12-14 14:34:42,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:34:42,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639712418] [2022-12-14 14:34:42,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:34:42,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:34:42,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:34:42,508 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:34:42,508 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:34:42,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639712418] [2022-12-14 14:34:42,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639712418] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:34:42,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1228570901] [2022-12-14 14:34:42,509 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 14:34:42,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:34:42,509 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:34:42,510 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:34:42,515 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-14 14:34:42,584 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 14:34:42,585 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:34:42,586 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-14 14:34:42,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:34:42,791 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:34:42,792 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 115 treesize of output 80 [2022-12-14 14:34:42,830 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:34:42,830 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:34:42,940 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:34:42,940 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 161 treesize of output 125 [2022-12-14 14:34:43,334 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:34:43,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1228570901] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-14 14:34:43,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-14 14:34:43,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8, 8] total 24 [2022-12-14 14:34:43,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185695285] [2022-12-14 14:34:43,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:34:43,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-14 14:34:43,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:34:43,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-14 14:34:43,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=528, Unknown=0, NotChecked=0, Total=650 [2022-12-14 14:34:43,336 INFO L87 Difference]: Start difference. First operand 121 states and 281 transitions. Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:34:44,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:34:44,028 INFO L93 Difference]: Finished difference Result 156 states and 339 transitions. [2022-12-14 14:34:44,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-14 14:34:44,028 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-12-14 14:34:44,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:34:44,029 INFO L225 Difference]: With dead ends: 156 [2022-12-14 14:34:44,029 INFO L226 Difference]: Without dead ends: 147 [2022-12-14 14:34:44,029 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=253, Invalid=1007, Unknown=0, NotChecked=0, Total=1260 [2022-12-14 14:34:44,030 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 177 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 14:34:44,030 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 12 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 14:34:44,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-12-14 14:34:44,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 108. [2022-12-14 14:34:44,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 107 states have (on average 2.317757009345794) internal successors, (248), 107 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:34:44,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 248 transitions. [2022-12-14 14:34:44,033 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 248 transitions. Word has length 16 [2022-12-14 14:34:44,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:34:44,033 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 248 transitions. [2022-12-14 14:34:44,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:34:44,033 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 248 transitions. [2022-12-14 14:34:44,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 14:34:44,033 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:34:44,033 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:34:44,038 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-14 14:34:44,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:34:44,235 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:34:44,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:34:44,236 INFO L85 PathProgramCache]: Analyzing trace with hash -41457113, now seen corresponding path program 1 times [2022-12-14 14:34:44,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:34:44,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251086046] [2022-12-14 14:34:44,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:34:44,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:34:44,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:34:44,510 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:34:44,510 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:34:44,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251086046] [2022-12-14 14:34:44,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251086046] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:34:44,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [537733628] [2022-12-14 14:34:44,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:34:44,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:34:44,510 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:34:44,511 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:34:44,512 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-14 14:34:44,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:34:44,586 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 26 conjunts are in the unsatisfiable core [2022-12-14 14:34:44,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:34:44,768 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:34:44,768 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:34:44,848 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:34:44,849 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 161 treesize of output 125 [2022-12-14 14:34:45,135 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:34:45,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [537733628] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-14 14:34:45,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-14 14:34:45,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 7] total 21 [2022-12-14 14:34:45,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438763318] [2022-12-14 14:34:45,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:34:45,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-14 14:34:45,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:34:45,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-14 14:34:45,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=391, Unknown=0, NotChecked=0, Total=506 [2022-12-14 14:34:45,137 INFO L87 Difference]: Start difference. First operand 108 states and 248 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:34:45,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:34:45,415 INFO L93 Difference]: Finished difference Result 240 states and 531 transitions. [2022-12-14 14:34:45,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-14 14:34:45,415 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-12-14 14:34:45,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:34:45,417 INFO L225 Difference]: With dead ends: 240 [2022-12-14 14:34:45,417 INFO L226 Difference]: Without dead ends: 225 [2022-12-14 14:34:45,417 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=175, Invalid=637, Unknown=0, NotChecked=0, Total=812 [2022-12-14 14:34:45,418 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 149 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:34:45,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 5 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 14:34:45,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2022-12-14 14:34:45,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 124. [2022-12-14 14:34:45,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 123 states have (on average 2.3252032520325203) internal successors, (286), 123 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:34:45,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 286 transitions. [2022-12-14 14:34:45,424 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 286 transitions. Word has length 16 [2022-12-14 14:34:45,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:34:45,424 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 286 transitions. [2022-12-14 14:34:45,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:34:45,425 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 286 transitions. [2022-12-14 14:34:45,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 14:34:45,425 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:34:45,425 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:34:45,429 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-14 14:34:45,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:34:45,626 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:34:45,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:34:45,626 INFO L85 PathProgramCache]: Analyzing trace with hash -204761767, now seen corresponding path program 2 times [2022-12-14 14:34:45,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:34:45,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281188162] [2022-12-14 14:34:45,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:34:45,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:34:45,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:34:45,813 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:34:45,813 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:34:45,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281188162] [2022-12-14 14:34:45,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281188162] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:34:45,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [128246280] [2022-12-14 14:34:45,814 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 14:34:45,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:34:45,814 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:34:45,815 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:34:45,819 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-14 14:34:45,879 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-12-14 14:34:45,879 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:34:45,880 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-14 14:34:45,881 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:34:46,048 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 14:34:46,048 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 14:34:46,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [128246280] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:34:46,049 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 14:34:46,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 13 [2022-12-14 14:34:46,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003543590] [2022-12-14 14:34:46,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:34:46,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 14:34:46,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:34:46,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 14:34:46,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2022-12-14 14:34:46,050 INFO L87 Difference]: Start difference. First operand 124 states and 286 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:34:46,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:34:46,229 INFO L93 Difference]: Finished difference Result 206 states and 494 transitions. [2022-12-14 14:34:46,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-14 14:34:46,229 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-12-14 14:34:46,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:34:46,230 INFO L225 Difference]: With dead ends: 206 [2022-12-14 14:34:46,230 INFO L226 Difference]: Without dead ends: 201 [2022-12-14 14:34:46,230 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2022-12-14 14:34:46,231 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 62 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:34:46,231 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 14 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 14:34:46,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2022-12-14 14:34:46,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 140. [2022-12-14 14:34:46,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 139 states have (on average 2.3597122302158273) internal successors, (328), 139 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-12-14 14:34:46,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 328 transitions. [2022-12-14 14:34:46,234 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 328 transitions. Word has length 16 [2022-12-14 14:34:46,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:34:46,234 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 328 transitions. [2022-12-14 14:34:46,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:34:46,235 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 328 transitions. [2022-12-14 14:34:46,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 14:34:46,235 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:34:46,235 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:34:46,240 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-14 14:34:46,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-12-14 14:34:46,437 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:34:46,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:34:46,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1514771231, now seen corresponding path program 3 times [2022-12-14 14:34:46,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:34:46,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402650625] [2022-12-14 14:34:46,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:34:46,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:34:46,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:34:46,649 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:34:46,649 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:34:46,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402650625] [2022-12-14 14:34:46,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402650625] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:34:46,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1864073190] [2022-12-14 14:34:46,650 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 14:34:46,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:34:46,650 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:34:46,651 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:34:46,652 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-14 14:34:46,718 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 14:34:46,718 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:34:46,720 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 26 conjunts are in the unsatisfiable core [2022-12-14 14:34:46,721 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:34:46,885 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:34:46,886 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:34:46,971 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:34:46,971 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 161 treesize of output 125 [2022-12-14 14:34:47,341 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:34:47,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1864073190] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-14 14:34:47,342 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-14 14:34:47,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 7] total 21 [2022-12-14 14:34:47,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141399966] [2022-12-14 14:34:47,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:34:47,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-14 14:34:47,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:34:47,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-14 14:34:47,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=393, Unknown=0, NotChecked=0, Total=506 [2022-12-14 14:34:47,343 INFO L87 Difference]: Start difference. First operand 140 states and 328 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:34:47,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:34:47,856 INFO L93 Difference]: Finished difference Result 258 states and 578 transitions. [2022-12-14 14:34:47,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-14 14:34:47,856 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-12-14 14:34:47,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:34:47,858 INFO L225 Difference]: With dead ends: 258 [2022-12-14 14:34:47,858 INFO L226 Difference]: Without dead ends: 249 [2022-12-14 14:34:47,859 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=205, Invalid=725, Unknown=0, NotChecked=0, Total=930 [2022-12-14 14:34:47,859 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 193 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:34:47,860 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 7 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 14:34:47,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2022-12-14 14:34:47,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 140. [2022-12-14 14:34:47,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 139 states have (on average 2.3453237410071943) internal successors, (326), 139 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:34:47,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 326 transitions. [2022-12-14 14:34:47,865 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 326 transitions. Word has length 16 [2022-12-14 14:34:47,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:34:47,865 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 326 transitions. [2022-12-14 14:34:47,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:34:47,865 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 326 transitions. [2022-12-14 14:34:47,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 14:34:47,866 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:34:47,866 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:34:47,870 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-14 14:34:48,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-14 14:34:48,068 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:34:48,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:34:48,069 INFO L85 PathProgramCache]: Analyzing trace with hash -443707673, now seen corresponding path program 4 times [2022-12-14 14:34:48,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:34:48,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878850629] [2022-12-14 14:34:48,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:34:48,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:34:48,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:34:48,285 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:34:48,285 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:34:48,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878850629] [2022-12-14 14:34:48,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878850629] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:34:48,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1313687463] [2022-12-14 14:34:48,286 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 14:34:48,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:34:48,286 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:34:48,287 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:34:48,288 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-14 14:34:48,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:34:48,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 26 conjunts are in the unsatisfiable core [2022-12-14 14:34:48,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:34:48,507 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:34:48,507 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:34:48,663 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:34:48,663 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 161 treesize of output 125 [2022-12-14 14:34:48,855 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:34:48,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1313687463] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-14 14:34:48,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-14 14:34:48,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 7] total 21 [2022-12-14 14:34:48,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224912893] [2022-12-14 14:34:48,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:34:48,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-14 14:34:48,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:34:48,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-14 14:34:48,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=410, Unknown=0, NotChecked=0, Total=506 [2022-12-14 14:34:48,857 INFO L87 Difference]: Start difference. First operand 140 states and 326 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:34:49,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:34:49,189 INFO L93 Difference]: Finished difference Result 240 states and 527 transitions. [2022-12-14 14:34:49,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-14 14:34:49,189 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-12-14 14:34:49,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:34:49,190 INFO L225 Difference]: With dead ends: 240 [2022-12-14 14:34:49,190 INFO L226 Difference]: Without dead ends: 235 [2022-12-14 14:34:49,191 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=175, Invalid=755, Unknown=0, NotChecked=0, Total=930 [2022-12-14 14:34:49,191 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 187 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:34:49,192 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 13 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 14:34:49,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2022-12-14 14:34:49,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 122. [2022-12-14 14:34:49,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 121 states have (on average 2.3388429752066116) internal successors, (283), 121 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:34:49,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 283 transitions. [2022-12-14 14:34:49,196 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 283 transitions. Word has length 16 [2022-12-14 14:34:49,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:34:49,196 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 283 transitions. [2022-12-14 14:34:49,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:34:49,197 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 283 transitions. [2022-12-14 14:34:49,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 14:34:49,197 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:34:49,197 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:34:49,202 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-14 14:34:49,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:34:49,398 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:34:49,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:34:49,400 INFO L85 PathProgramCache]: Analyzing trace with hash -948767833, now seen corresponding path program 5 times [2022-12-14 14:34:49,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:34:49,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430777296] [2022-12-14 14:34:49,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:34:49,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:34:49,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:34:49,633 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:34:49,633 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:34:49,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430777296] [2022-12-14 14:34:49,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430777296] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:34:49,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2119837536] [2022-12-14 14:34:49,634 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 14:34:49,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:34:49,634 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:34:49,634 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:34:49,635 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-14 14:34:49,696 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-12-14 14:34:49,697 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:34:49,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-14 14:34:49,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:34:49,811 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 14:34:49,811 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 14:34:49,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2119837536] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:34:49,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 14:34:49,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 13 [2022-12-14 14:34:49,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812865670] [2022-12-14 14:34:49,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:34:49,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 14:34:49,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:34:49,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 14:34:49,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2022-12-14 14:34:49,813 INFO L87 Difference]: Start difference. First operand 122 states and 283 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:34:49,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:34:49,963 INFO L93 Difference]: Finished difference Result 206 states and 482 transitions. [2022-12-14 14:34:49,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-14 14:34:49,964 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-12-14 14:34:49,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:34:49,964 INFO L225 Difference]: With dead ends: 206 [2022-12-14 14:34:49,964 INFO L226 Difference]: Without dead ends: 201 [2022-12-14 14:34:49,965 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2022-12-14 14:34:49,965 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 68 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:34:49,965 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 19 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 14:34:49,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2022-12-14 14:34:49,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 122. [2022-12-14 14:34:49,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 121 states have (on average 2.3388429752066116) internal successors, (283), 121 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:34:49,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 283 transitions. [2022-12-14 14:34:49,970 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 283 transitions. Word has length 16 [2022-12-14 14:34:49,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:34:49,970 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 283 transitions. [2022-12-14 14:34:49,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:34:49,971 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 283 transitions. [2022-12-14 14:34:49,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 14:34:49,971 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:34:49,971 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:34:49,976 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-12-14 14:34:50,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-14 14:34:50,171 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:34:50,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:34:50,172 INFO L85 PathProgramCache]: Analyzing trace with hash 770765165, now seen corresponding path program 6 times [2022-12-14 14:34:50,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:34:50,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712819630] [2022-12-14 14:34:50,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:34:50,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:34:50,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:34:50,364 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:34:50,364 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:34:50,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712819630] [2022-12-14 14:34:50,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712819630] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:34:50,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1493200988] [2022-12-14 14:34:50,364 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 14:34:50,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:34:50,365 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:34:50,365 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:34:50,366 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-14 14:34:50,438 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 14:34:50,438 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:34:50,439 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 26 conjunts are in the unsatisfiable core [2022-12-14 14:34:50,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:34:50,626 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:34:50,626 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:34:50,723 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:34:50,724 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 161 treesize of output 125 [2022-12-14 14:34:51,090 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:34:51,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1493200988] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-14 14:34:51,090 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-14 14:34:51,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 7] total 21 [2022-12-14 14:34:51,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167677107] [2022-12-14 14:34:51,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:34:51,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-14 14:34:51,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:34:51,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-14 14:34:51,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=394, Unknown=0, NotChecked=0, Total=506 [2022-12-14 14:34:51,092 INFO L87 Difference]: Start difference. First operand 122 states and 283 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:34:51,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:34:51,693 INFO L93 Difference]: Finished difference Result 204 states and 445 transitions. [2022-12-14 14:34:51,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-14 14:34:51,693 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-12-14 14:34:51,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:34:51,695 INFO L225 Difference]: With dead ends: 204 [2022-12-14 14:34:51,695 INFO L226 Difference]: Without dead ends: 195 [2022-12-14 14:34:51,695 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=221, Invalid=771, Unknown=0, NotChecked=0, Total=992 [2022-12-14 14:34:51,696 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 171 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 14:34:51,696 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 12 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 14:34:51,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2022-12-14 14:34:51,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 110. [2022-12-14 14:34:51,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 109 states have (on average 2.311926605504587) internal successors, (252), 109 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:34:51,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 252 transitions. [2022-12-14 14:34:51,701 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 252 transitions. Word has length 16 [2022-12-14 14:34:51,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:34:51,701 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 252 transitions. [2022-12-14 14:34:51,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:34:51,701 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 252 transitions. [2022-12-14 14:34:51,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-12-14 14:34:51,701 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:34:51,701 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:34:51,707 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-12-14 14:34:51,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-14 14:34:51,902 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:34:51,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:34:51,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1136209821, now seen corresponding path program 1 times [2022-12-14 14:34:51,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:34:51,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282267840] [2022-12-14 14:34:51,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:34:51,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:34:51,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:34:52,001 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:34:52,002 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:34:52,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282267840] [2022-12-14 14:34:52,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282267840] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:34:52,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1845646749] [2022-12-14 14:34:52,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:34:52,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:34:52,002 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:34:52,003 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:34:52,004 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-14 14:34:52,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:34:52,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-14 14:34:52,059 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:34:52,095 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:34:52,095 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:34:52,135 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:34:52,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1845646749] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-14 14:34:52,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-14 14:34:52,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 13 [2022-12-14 14:34:52,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957429532] [2022-12-14 14:34:52,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:34:52,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 14:34:52,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:34:52,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 14:34:52,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-12-14 14:34:52,137 INFO L87 Difference]: Start difference. First operand 110 states and 252 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:34:52,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:34:52,278 INFO L93 Difference]: Finished difference Result 201 states and 422 transitions. [2022-12-14 14:34:52,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-14 14:34:52,278 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-12-14 14:34:52,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:34:52,279 INFO L225 Difference]: With dead ends: 201 [2022-12-14 14:34:52,279 INFO L226 Difference]: Without dead ends: 201 [2022-12-14 14:34:52,279 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2022-12-14 14:34:52,279 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 77 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:34:52,280 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 0 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 14:34:52,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2022-12-14 14:34:52,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 118. [2022-12-14 14:34:52,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 117 states have (on average 2.3162393162393164) internal successors, (271), 117 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:34:52,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 271 transitions. [2022-12-14 14:34:52,282 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 271 transitions. Word has length 17 [2022-12-14 14:34:52,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:34:52,283 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 271 transitions. [2022-12-14 14:34:52,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:34:52,283 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 271 transitions. [2022-12-14 14:34:52,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-12-14 14:34:52,283 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:34:52,283 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:34:52,288 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-12-14 14:34:52,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-14 14:34:52,484 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:34:52,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:34:52,485 INFO L85 PathProgramCache]: Analyzing trace with hash 628922671, now seen corresponding path program 1 times [2022-12-14 14:34:52,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:34:52,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968145501] [2022-12-14 14:34:52,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:34:52,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:34:52,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:34:52,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:34:52,580 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:34:52,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968145501] [2022-12-14 14:34:52,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968145501] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:34:52,581 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:34:52,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 14:34:52,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549893010] [2022-12-14 14:34:52,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:34:52,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 14:34:52,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:34:52,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 14:34:52,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-14 14:34:52,582 INFO L87 Difference]: Start difference. First operand 118 states and 271 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:34:52,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:34:52,638 INFO L93 Difference]: Finished difference Result 135 states and 298 transitions. [2022-12-14 14:34:52,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 14:34:52,638 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-12-14 14:34:52,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:34:52,639 INFO L225 Difference]: With dead ends: 135 [2022-12-14 14:34:52,639 INFO L226 Difference]: Without dead ends: 117 [2022-12-14 14:34:52,639 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-14 14:34:52,640 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 6 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:34:52,640 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 3 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 14:34:52,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-12-14 14:34:52,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2022-12-14 14:34:52,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 116 states have (on average 2.310344827586207) internal successors, (268), 116 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:34:52,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 268 transitions. [2022-12-14 14:34:52,644 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 268 transitions. Word has length 18 [2022-12-14 14:34:52,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:34:52,644 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 268 transitions. [2022-12-14 14:34:52,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:34:52,644 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 268 transitions. [2022-12-14 14:34:52,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-14 14:34:52,644 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:34:52,644 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:34:52,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-14 14:34:52,644 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:34:52,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:34:52,645 INFO L85 PathProgramCache]: Analyzing trace with hash 838557803, now seen corresponding path program 1 times [2022-12-14 14:34:52,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:34:52,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950690912] [2022-12-14 14:34:52,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:34:52,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:34:52,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:34:52,693 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 14:34:52,694 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:34:52,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950690912] [2022-12-14 14:34:52,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950690912] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:34:52,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:34:52,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 14:34:52,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055919049] [2022-12-14 14:34:52,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:34:52,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 14:34:52,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:34:52,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 14:34:52,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-14 14:34:52,695 INFO L87 Difference]: Start difference. First operand 117 states and 268 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:34:52,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:34:52,766 INFO L93 Difference]: Finished difference Result 87 states and 191 transitions. [2022-12-14 14:34:52,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 14:34:52,766 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-12-14 14:34:52,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:34:52,767 INFO L225 Difference]: With dead ends: 87 [2022-12-14 14:34:52,767 INFO L226 Difference]: Without dead ends: 70 [2022-12-14 14:34:52,767 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-12-14 14:34:52,768 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 13 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:34:52,768 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 3 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 14:34:52,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-12-14 14:34:52,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-12-14 14:34:52,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 69 states have (on average 2.36231884057971) internal successors, (163), 69 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:34:52,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 163 transitions. [2022-12-14 14:34:52,771 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 163 transitions. Word has length 19 [2022-12-14 14:34:52,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:34:52,771 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 163 transitions. [2022-12-14 14:34:52,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:34:52,771 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 163 transitions. [2022-12-14 14:34:52,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-14 14:34:52,772 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:34:52,772 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:34:52,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-14 14:34:52,772 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:34:52,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:34:52,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1131071526, now seen corresponding path program 1 times [2022-12-14 14:34:52,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:34:52,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077141341] [2022-12-14 14:34:52,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:34:52,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:34:52,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:34:53,133 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:34:53,133 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:34:53,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077141341] [2022-12-14 14:34:53,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077141341] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:34:53,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [968795404] [2022-12-14 14:34:53,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:34:53,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:34:53,133 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:34:53,134 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:34:53,135 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-14 14:34:53,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:34:53,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 39 conjunts are in the unsatisfiable core [2022-12-14 14:34:53,222 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:34:53,305 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 14:34:53,335 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 14:34:53,390 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 14:34:53,489 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:34:53,489 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:34:53,947 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:34:53,947 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 37 [2022-12-14 14:34:53,959 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:34:53,959 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 294 treesize of output 274 [2022-12-14 14:34:53,970 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:34:53,971 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 262 treesize of output 255 [2022-12-14 14:34:53,983 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:34:53,983 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 246 treesize of output 223 [2022-12-14 14:34:54,122 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:34:54,122 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 37 [2022-12-14 14:34:54,131 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:34:54,132 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 598 treesize of output 546 [2022-12-14 14:34:54,146 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:34:54,146 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 534 treesize of output 511 [2022-12-14 14:34:54,159 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:34:54,159 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 502 treesize of output 447 [2022-12-14 14:34:54,297 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:34:54,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [968795404] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:34:54,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1750115012] [2022-12-14 14:34:54,298 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 14:34:54,298 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:34:54,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 28 [2022-12-14 14:34:54,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974493652] [2022-12-14 14:34:54,298 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:34:54,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-12-14 14:34:54,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:34:54,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-12-14 14:34:54,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=656, Unknown=31, NotChecked=0, Total=812 [2022-12-14 14:34:54,300 INFO L87 Difference]: Start difference. First operand 70 states and 163 transitions. Second operand has 29 states, 29 states have (on average 1.5517241379310345) internal successors, (45), 28 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:34:54,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:34:54,884 INFO L93 Difference]: Finished difference Result 138 states and 316 transitions. [2022-12-14 14:34:54,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-14 14:34:54,884 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.5517241379310345) internal successors, (45), 28 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-12-14 14:34:54,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:34:54,885 INFO L225 Difference]: With dead ends: 138 [2022-12-14 14:34:54,885 INFO L226 Difference]: Without dead ends: 138 [2022-12-14 14:34:54,886 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=262, Invalid=1113, Unknown=31, NotChecked=0, Total=1406 [2022-12-14 14:34:54,887 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 128 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 616 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 14:34:54,887 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 0 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 616 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 14:34:54,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-12-14 14:34:54,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 76. [2022-12-14 14:34:54,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 75 states have (on average 2.3466666666666667) internal successors, (176), 75 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:34:54,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 176 transitions. [2022-12-14 14:34:54,890 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 176 transitions. Word has length 19 [2022-12-14 14:34:54,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:34:54,890 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 176 transitions. [2022-12-14 14:34:54,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.5517241379310345) internal successors, (45), 28 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:34:54,890 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 176 transitions. [2022-12-14 14:34:54,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-14 14:34:54,891 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:34:54,891 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:34:54,895 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-12-14 14:34:55,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:34:55,092 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:34:55,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:34:55,093 INFO L85 PathProgramCache]: Analyzing trace with hash -607095054, now seen corresponding path program 2 times [2022-12-14 14:34:55,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:34:55,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005427621] [2022-12-14 14:34:55,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:34:55,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:34:55,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:34:55,430 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:34:55,430 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:34:55,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005427621] [2022-12-14 14:34:55,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005427621] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:34:55,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [180849388] [2022-12-14 14:34:55,430 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 14:34:55,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:34:55,431 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:34:55,431 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:34:55,432 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-14 14:34:55,510 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 14:34:55,511 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:34:55,512 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 51 conjunts are in the unsatisfiable core [2022-12-14 14:34:55,514 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:34:55,895 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:34:55,895 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:34:56,359 INFO L321 Elim1Store]: treesize reduction 32, result has 62.4 percent of original size [2022-12-14 14:34:56,360 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 60 [2022-12-14 14:34:56,405 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-14 14:34:56,405 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 4 [2022-12-14 14:34:56,714 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:34:56,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [180849388] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:34:56,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1212998233] [2022-12-14 14:34:56,715 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 14:34:56,716 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:34:56,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 30 [2022-12-14 14:34:56,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449055188] [2022-12-14 14:34:56,716 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:34:56,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-12-14 14:34:56,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:34:56,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-12-14 14:34:56,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=741, Unknown=0, NotChecked=0, Total=930 [2022-12-14 14:34:56,718 INFO L87 Difference]: Start difference. First operand 76 states and 176 transitions. Second operand has 31 states, 31 states have (on average 1.6774193548387097) internal successors, (52), 30 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:34:58,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:34:58,825 INFO L93 Difference]: Finished difference Result 331 states and 763 transitions. [2022-12-14 14:34:58,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-12-14 14:34:58,826 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.6774193548387097) internal successors, (52), 30 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-12-14 14:34:58,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:34:58,827 INFO L225 Difference]: With dead ends: 331 [2022-12-14 14:34:58,827 INFO L226 Difference]: Without dead ends: 326 [2022-12-14 14:34:58,827 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 827 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=764, Invalid=2658, Unknown=0, NotChecked=0, Total=3422 [2022-12-14 14:34:58,828 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 464 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 797 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 14:34:58,828 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 0 Invalid, 820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 797 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-14 14:34:58,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2022-12-14 14:34:58,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 108. [2022-12-14 14:34:58,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 107 states have (on average 2.532710280373832) internal successors, (271), 107 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:34:58,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 271 transitions. [2022-12-14 14:34:58,831 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 271 transitions. Word has length 19 [2022-12-14 14:34:58,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:34:58,831 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 271 transitions. [2022-12-14 14:34:58,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 1.6774193548387097) internal successors, (52), 30 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:34:58,831 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 271 transitions. [2022-12-14 14:34:58,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-14 14:34:58,832 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:34:58,832 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:34:58,836 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-12-14 14:34:59,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-12-14 14:34:59,033 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:34:59,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:34:59,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1461807062, now seen corresponding path program 3 times [2022-12-14 14:34:59,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:34:59,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109859786] [2022-12-14 14:34:59,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:34:59,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:34:59,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:34:59,378 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:34:59,378 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:34:59,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109859786] [2022-12-14 14:34:59,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109859786] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:34:59,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1294204045] [2022-12-14 14:34:59,378 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 14:34:59,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:34:59,378 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:34:59,379 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:34:59,380 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-14 14:34:59,446 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 14:34:59,446 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:34:59,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-14 14:34:59,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:34:59,555 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 14:34:59,559 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 14:34:59,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1294204045] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:34:59,559 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 14:34:59,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 16 [2022-12-14 14:34:59,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657974005] [2022-12-14 14:34:59,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:34:59,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 14:34:59,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:34:59,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 14:34:59,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2022-12-14 14:34:59,560 INFO L87 Difference]: Start difference. First operand 108 states and 271 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:34:59,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:34:59,695 INFO L93 Difference]: Finished difference Result 184 states and 447 transitions. [2022-12-14 14:34:59,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 14:34:59,695 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-12-14 14:34:59,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:34:59,697 INFO L225 Difference]: With dead ends: 184 [2022-12-14 14:34:59,697 INFO L226 Difference]: Without dead ends: 184 [2022-12-14 14:34:59,697 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2022-12-14 14:34:59,698 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 75 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:34:59,698 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 0 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 14:34:59,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2022-12-14 14:34:59,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 120. [2022-12-14 14:34:59,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 119 states have (on average 2.53781512605042) internal successors, (302), 119 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:34:59,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 302 transitions. [2022-12-14 14:34:59,701 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 302 transitions. Word has length 19 [2022-12-14 14:34:59,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:34:59,702 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 302 transitions. [2022-12-14 14:34:59,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:34:59,702 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 302 transitions. [2022-12-14 14:34:59,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-14 14:34:59,702 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:34:59,702 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:34:59,707 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-12-14 14:34:59,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:34:59,903 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:34:59,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:34:59,904 INFO L85 PathProgramCache]: Analyzing trace with hash -131454310, now seen corresponding path program 4 times [2022-12-14 14:34:59,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:34:59,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940318374] [2022-12-14 14:34:59,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:34:59,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:34:59,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:35:00,302 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:35:00,302 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:35:00,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940318374] [2022-12-14 14:35:00,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940318374] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:35:00,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1755558570] [2022-12-14 14:35:00,303 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 14:35:00,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:35:00,303 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:35:00,304 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:35:00,304 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-14 14:35:00,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:35:00,372 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 39 conjunts are in the unsatisfiable core [2022-12-14 14:35:00,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:35:00,472 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 14:35:00,510 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 14:35:00,562 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 14:35:00,641 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:35:00,641 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:35:01,021 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:35:01,022 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 37 [2022-12-14 14:35:01,028 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:35:01,029 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 598 treesize of output 546 [2022-12-14 14:35:01,038 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:35:01,038 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 534 treesize of output 479 [2022-12-14 14:35:01,047 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:35:01,047 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 470 treesize of output 447 [2022-12-14 14:35:01,131 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:35:01,132 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 37 [2022-12-14 14:35:01,142 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:35:01,142 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 598 treesize of output 546 [2022-12-14 14:35:01,156 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:35:01,156 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 534 treesize of output 511 [2022-12-14 14:35:01,170 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:35:01,170 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 502 treesize of output 447 [2022-12-14 14:35:01,343 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:35:01,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1755558570] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:35:01,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [492750231] [2022-12-14 14:35:01,344 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 14:35:01,344 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:35:01,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 28 [2022-12-14 14:35:01,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402040170] [2022-12-14 14:35:01,345 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:35:01,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-12-14 14:35:01,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:35:01,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-12-14 14:35:01,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=639, Unknown=29, NotChecked=0, Total=812 [2022-12-14 14:35:01,346 INFO L87 Difference]: Start difference. First operand 120 states and 302 transitions. Second operand has 29 states, 29 states have (on average 1.5172413793103448) internal successors, (44), 28 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:35:01,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:35:01,976 INFO L93 Difference]: Finished difference Result 228 states and 565 transitions. [2022-12-14 14:35:01,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-14 14:35:01,976 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.5172413793103448) internal successors, (44), 28 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-12-14 14:35:01,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:35:01,977 INFO L225 Difference]: With dead ends: 228 [2022-12-14 14:35:01,977 INFO L226 Difference]: Without dead ends: 228 [2022-12-14 14:35:01,977 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=337, Invalid=1268, Unknown=35, NotChecked=0, Total=1640 [2022-12-14 14:35:01,978 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 218 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 616 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 14:35:01,978 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 0 Invalid, 621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 616 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 14:35:01,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2022-12-14 14:35:01,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 130. [2022-12-14 14:35:01,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 129 states have (on average 2.635658914728682) internal successors, (340), 129 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:35:01,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 340 transitions. [2022-12-14 14:35:01,982 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 340 transitions. Word has length 19 [2022-12-14 14:35:01,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:35:01,982 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 340 transitions. [2022-12-14 14:35:01,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.5172413793103448) internal successors, (44), 28 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:35:01,982 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 340 transitions. [2022-12-14 14:35:01,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-14 14:35:01,983 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:35:01,983 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:35:01,987 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-12-14 14:35:02,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-12-14 14:35:02,183 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:35:02,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:35:02,183 INFO L85 PathProgramCache]: Analyzing trace with hash -986166318, now seen corresponding path program 5 times [2022-12-14 14:35:02,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:35:02,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746919884] [2022-12-14 14:35:02,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:35:02,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:35:02,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:35:02,484 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:35:02,485 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:35:02,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746919884] [2022-12-14 14:35:02,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746919884] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:35:02,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1542873383] [2022-12-14 14:35:02,485 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 14:35:02,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:35:02,485 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:35:02,486 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:35:02,486 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-12-14 14:35:02,607 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 14:35:02,607 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:35:02,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 27 conjunts are in the unsatisfiable core [2022-12-14 14:35:02,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:35:02,750 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:35:02,750 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:35:02,894 INFO L321 Elim1Store]: treesize reduction 30, result has 58.9 percent of original size [2022-12-14 14:35:02,894 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 50 [2022-12-14 14:35:02,907 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-14 14:35:02,908 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 4 [2022-12-14 14:35:02,911 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-14 14:35:02,911 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 4 [2022-12-14 14:35:03,022 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:35:03,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1542873383] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-14 14:35:03,022 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-14 14:35:03,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 10] total 22 [2022-12-14 14:35:03,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392179109] [2022-12-14 14:35:03,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:35:03,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-14 14:35:03,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:35:03,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-14 14:35:03,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=390, Unknown=0, NotChecked=0, Total=506 [2022-12-14 14:35:03,023 INFO L87 Difference]: Start difference. First operand 130 states and 340 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:35:03,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:35:03,382 INFO L93 Difference]: Finished difference Result 194 states and 497 transitions. [2022-12-14 14:35:03,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-14 14:35:03,382 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-12-14 14:35:03,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:35:03,383 INFO L225 Difference]: With dead ends: 194 [2022-12-14 14:35:03,383 INFO L226 Difference]: Without dead ends: 194 [2022-12-14 14:35:03,384 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=164, Invalid=538, Unknown=0, NotChecked=0, Total=702 [2022-12-14 14:35:03,384 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 70 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 14:35:03,384 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 0 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 14:35:03,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2022-12-14 14:35:03,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 126. [2022-12-14 14:35:03,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 125 states have (on average 2.576) internal successors, (322), 125 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:35:03,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 322 transitions. [2022-12-14 14:35:03,387 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 322 transitions. Word has length 19 [2022-12-14 14:35:03,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:35:03,387 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 322 transitions. [2022-12-14 14:35:03,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:35:03,387 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 322 transitions. [2022-12-14 14:35:03,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-14 14:35:03,387 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:35:03,388 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:35:03,392 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-12-14 14:35:03,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-12-14 14:35:03,589 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:35:03,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:35:03,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1432281436, now seen corresponding path program 6 times [2022-12-14 14:35:03,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:35:03,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391917567] [2022-12-14 14:35:03,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:35:03,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:35:03,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:35:03,943 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:35:03,943 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:35:03,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391917567] [2022-12-14 14:35:03,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391917567] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:35:03,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [151855586] [2022-12-14 14:35:03,944 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 14:35:03,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:35:03,944 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:35:03,945 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:35:03,945 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-12-14 14:35:04,021 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 14:35:04,022 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:35:04,023 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-14 14:35:04,024 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:35:04,117 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 14:35:04,117 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 14:35:04,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [151855586] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:35:04,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 14:35:04,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 16 [2022-12-14 14:35:04,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125275240] [2022-12-14 14:35:04,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:35:04,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 14:35:04,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:35:04,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 14:35:04,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2022-12-14 14:35:04,118 INFO L87 Difference]: Start difference. First operand 126 states and 322 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:35:04,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:35:04,282 INFO L93 Difference]: Finished difference Result 235 states and 590 transitions. [2022-12-14 14:35:04,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 14:35:04,283 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-12-14 14:35:04,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:35:04,284 INFO L225 Difference]: With dead ends: 235 [2022-12-14 14:35:04,284 INFO L226 Difference]: Without dead ends: 235 [2022-12-14 14:35:04,284 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=365, Unknown=0, NotChecked=0, Total=462 [2022-12-14 14:35:04,284 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 100 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:35:04,284 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 0 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 14:35:04,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2022-12-14 14:35:04,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 143. [2022-12-14 14:35:04,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 142 states have (on average 2.563380281690141) internal successors, (364), 142 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:35:04,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 364 transitions. [2022-12-14 14:35:04,287 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 364 transitions. Word has length 19 [2022-12-14 14:35:04,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:35:04,288 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 364 transitions. [2022-12-14 14:35:04,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:35:04,288 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 364 transitions. [2022-12-14 14:35:04,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-14 14:35:04,288 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:35:04,288 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:35:04,293 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-12-14 14:35:04,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-12-14 14:35:04,489 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:35:04,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:35:04,489 INFO L85 PathProgramCache]: Analyzing trace with hash 697560960, now seen corresponding path program 7 times [2022-12-14 14:35:04,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:35:04,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368423563] [2022-12-14 14:35:04,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:35:04,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:35:04,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:35:04,869 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:35:04,869 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:35:04,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368423563] [2022-12-14 14:35:04,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368423563] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:35:04,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1698534214] [2022-12-14 14:35:04,870 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 14:35:04,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:35:04,870 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:35:04,871 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:35:04,872 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-12-14 14:35:04,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:35:04,949 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 41 conjunts are in the unsatisfiable core [2022-12-14 14:35:04,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:35:05,055 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 14:35:05,097 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 14:35:05,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:35:05,209 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-14 14:35:05,301 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:35:05,301 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:35:05,736 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:35:05,737 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 34 [2022-12-14 14:35:05,744 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:35:05,744 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 302 treesize of output 266 [2022-12-14 14:35:05,754 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:35:05,754 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 254 treesize of output 239 [2022-12-14 14:35:05,760 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 230 treesize of output 214 [2022-12-14 14:35:05,831 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:35:05,831 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 34 [2022-12-14 14:35:05,839 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:35:05,839 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 146 treesize of output 134 [2022-12-14 14:35:05,847 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:35:05,847 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 122 treesize of output 119 [2022-12-14 14:35:05,852 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 102 [2022-12-14 14:35:05,919 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:35:05,919 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 93 treesize of output 57 [2022-12-14 14:35:05,929 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-14 14:35:05,929 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 712 treesize of output 624 [2022-12-14 14:35:05,945 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:35:05,946 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 624 treesize of output 588 [2022-12-14 14:35:05,957 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:35:05,957 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 580 treesize of output 516 [2022-12-14 14:35:06,417 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:35:06,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1698534214] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:35:06,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [760755679] [2022-12-14 14:35:06,418 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 14:35:06,418 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:35:06,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2022-12-14 14:35:06,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428240402] [2022-12-14 14:35:06,418 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:35:06,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-12-14 14:35:06,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:35:06,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-12-14 14:35:06,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=770, Unknown=27, NotChecked=0, Total=930 [2022-12-14 14:35:06,420 INFO L87 Difference]: Start difference. First operand 143 states and 364 transitions. Second operand has 31 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 30 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:35:07,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:35:07,804 INFO L93 Difference]: Finished difference Result 246 states and 595 transitions. [2022-12-14 14:35:07,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-14 14:35:07,804 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 30 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-12-14 14:35:07,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:35:07,806 INFO L225 Difference]: With dead ends: 246 [2022-12-14 14:35:07,806 INFO L226 Difference]: Without dead ends: 246 [2022-12-14 14:35:07,807 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=359, Invalid=1506, Unknown=27, NotChecked=0, Total=1892 [2022-12-14 14:35:07,807 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 317 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 629 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 14:35:07,808 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 0 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 629 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-14 14:35:07,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2022-12-14 14:35:07,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 145. [2022-12-14 14:35:07,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 144 states have (on average 2.5902777777777777) internal successors, (373), 144 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:35:07,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 373 transitions. [2022-12-14 14:35:07,812 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 373 transitions. Word has length 19 [2022-12-14 14:35:07,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:35:07,812 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 373 transitions. [2022-12-14 14:35:07,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 30 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:35:07,813 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 373 transitions. [2022-12-14 14:35:07,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-14 14:35:07,813 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:35:07,813 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:35:07,818 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-12-14 14:35:08,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-12-14 14:35:08,014 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:35:08,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:35:08,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1940576806, now seen corresponding path program 8 times [2022-12-14 14:35:08,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:35:08,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132282661] [2022-12-14 14:35:08,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:35:08,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:35:08,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:35:08,453 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:35:08,453 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:35:08,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132282661] [2022-12-14 14:35:08,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132282661] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:35:08,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [338719317] [2022-12-14 14:35:08,453 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 14:35:08,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:35:08,453 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:35:08,454 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:35:08,455 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-12-14 14:35:08,542 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 14:35:08,543 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:35:08,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 31 conjunts are in the unsatisfiable core [2022-12-14 14:35:08,545 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:35:08,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:35:08,760 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-14 14:35:08,848 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:35:08,849 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:35:09,006 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_~get2~0.offset (* c_thread1Thread1of1ForFork1_~i~0 4)))) (let ((.cse0 (forall ((v_ArrVal_855 (Array Int Int)) (~get2~0.base Int)) (not (= |c_thread1Thread1of1ForFork1_#t~mem2| (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_855) ~get2~0.base) .cse3)))))) (and (or (< 0 c_~n2~0) .cse0) (or (< 0 c_~n1~0) .cse0) (forall ((v_ArrVal_855 (Array Int Int)) (~get2~0.base Int)) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_855))) (let ((.cse1 (select .cse2 ~get2~0.base))) (or (= (select .cse1 c_~get2~0.offset) (select (select .cse2 c_~get1~0.base) c_~get1~0.offset)) (not (= |c_thread1Thread1of1ForFork1_#t~mem2| (select .cse1 .cse3)))))))))) is different from false [2022-12-14 14:35:09,016 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:35:09,016 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 36 [2022-12-14 14:35:09,019 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2022-12-14 14:35:09,056 INFO L321 Elim1Store]: treesize reduction 15, result has 79.5 percent of original size [2022-12-14 14:35:09,057 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 114 treesize of output 131 [2022-12-14 14:35:09,071 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:35:09,071 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 90 [2022-12-14 14:35:09,278 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-14 14:35:09,279 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 24 [2022-12-14 14:35:09,387 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:35:09,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [338719317] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-14 14:35:09,388 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-14 14:35:09,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11, 11] total 28 [2022-12-14 14:35:09,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811690322] [2022-12-14 14:35:09,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:35:09,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-14 14:35:09,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:35:09,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-14 14:35:09,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=652, Unknown=1, NotChecked=52, Total=812 [2022-12-14 14:35:09,389 INFO L87 Difference]: Start difference. First operand 145 states and 373 transitions. Second operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:35:10,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:35:10,062 INFO L93 Difference]: Finished difference Result 235 states and 611 transitions. [2022-12-14 14:35:10,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-14 14:35:10,062 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-12-14 14:35:10,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:35:10,063 INFO L225 Difference]: With dead ends: 235 [2022-12-14 14:35:10,063 INFO L226 Difference]: Without dead ends: 235 [2022-12-14 14:35:10,063 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=156, Invalid=967, Unknown=3, NotChecked=64, Total=1190 [2022-12-14 14:35:10,064 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 101 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 42 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 14:35:10,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 0 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 291 Invalid, 1 Unknown, 42 Unchecked, 0.3s Time] [2022-12-14 14:35:10,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2022-12-14 14:35:10,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 147. [2022-12-14 14:35:10,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 146 states have (on average 2.5821917808219177) internal successors, (377), 146 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:35:10,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 377 transitions. [2022-12-14 14:35:10,067 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 377 transitions. Word has length 19 [2022-12-14 14:35:10,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:35:10,067 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 377 transitions. [2022-12-14 14:35:10,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:35:10,067 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 377 transitions. [2022-12-14 14:35:10,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-14 14:35:10,068 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:35:10,068 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:35:10,072 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-12-14 14:35:10,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:35:10,269 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:35:10,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:35:10,270 INFO L85 PathProgramCache]: Analyzing trace with hash -628933504, now seen corresponding path program 9 times [2022-12-14 14:35:10,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:35:10,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881138580] [2022-12-14 14:35:10,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:35:10,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:35:10,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:35:10,696 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:35:10,697 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:35:10,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881138580] [2022-12-14 14:35:10,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881138580] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:35:10,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1059303389] [2022-12-14 14:35:10,697 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 14:35:10,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:35:10,697 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:35:10,698 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:35:10,699 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-12-14 14:35:10,792 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 14:35:10,792 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:35:10,794 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-14 14:35:10,795 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:35:10,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:35:10,886 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-14 14:35:10,994 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 14:35:10,995 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 14:35:10,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1059303389] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:35:10,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 14:35:10,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 18 [2022-12-14 14:35:10,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606538629] [2022-12-14 14:35:10,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:35:10,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-14 14:35:10,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:35:10,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-14 14:35:10,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2022-12-14 14:35:10,996 INFO L87 Difference]: Start difference. First operand 147 states and 377 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:35:11,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:35:11,245 INFO L93 Difference]: Finished difference Result 256 states and 637 transitions. [2022-12-14 14:35:11,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 14:35:11,246 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-12-14 14:35:11,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:35:11,246 INFO L225 Difference]: With dead ends: 256 [2022-12-14 14:35:11,247 INFO L226 Difference]: Without dead ends: 256 [2022-12-14 14:35:11,247 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2022-12-14 14:35:11,247 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 67 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 14:35:11,247 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 0 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 14:35:11,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2022-12-14 14:35:11,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 141. [2022-12-14 14:35:11,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 140 states have (on average 2.55) internal successors, (357), 140 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:35:11,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 357 transitions. [2022-12-14 14:35:11,253 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 357 transitions. Word has length 19 [2022-12-14 14:35:11,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:35:11,253 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 357 transitions. [2022-12-14 14:35:11,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:35:11,254 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 357 transitions. [2022-12-14 14:35:11,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-14 14:35:11,254 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:35:11,254 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:35:11,258 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-12-14 14:35:11,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-12-14 14:35:11,455 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:35:11,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:35:11,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1145142862, now seen corresponding path program 10 times [2022-12-14 14:35:11,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:35:11,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958265930] [2022-12-14 14:35:11,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:35:11,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:35:11,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:35:11,923 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:35:11,923 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:35:11,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958265930] [2022-12-14 14:35:11,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958265930] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:35:11,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [208222690] [2022-12-14 14:35:11,923 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 14:35:11,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:35:11,924 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:35:11,924 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:35:11,925 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-12-14 14:35:12,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:35:12,002 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 42 conjunts are in the unsatisfiable core [2022-12-14 14:35:12,004 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:35:12,111 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 14:35:12,141 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 14:35:12,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:35:12,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:35:12,302 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-14 14:35:12,302 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 18 treesize of output 23 [2022-12-14 14:35:12,381 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:35:12,381 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:35:12,645 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:35:12,646 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 31 [2022-12-14 14:35:12,651 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:35:12,651 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 66 [2022-12-14 14:35:12,658 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:35:12,658 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 55 [2022-12-14 14:35:12,679 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:35:12,680 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 54 [2022-12-14 14:35:12,688 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-14 14:35:12,688 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 636 treesize of output 556 [2022-12-14 14:35:12,701 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:35:12,702 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 502 treesize of output 446 [2022-12-14 14:35:12,713 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:35:12,714 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 492 treesize of output 460 [2022-12-14 14:35:13,171 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:35:13,171 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 31 [2022-12-14 14:35:13,182 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:35:13,182 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 66 [2022-12-14 14:35:13,190 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:35:13,191 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 55 [2022-12-14 14:35:13,390 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:35:13,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [208222690] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:35:13,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1391000725] [2022-12-14 14:35:13,390 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 14:35:13,391 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:35:13,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2022-12-14 14:35:13,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80706399] [2022-12-14 14:35:13,391 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:35:13,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-12-14 14:35:13,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:35:13,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-12-14 14:35:13,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=857, Unknown=6, NotChecked=0, Total=992 [2022-12-14 14:35:13,392 INFO L87 Difference]: Start difference. First operand 141 states and 357 transitions. Second operand has 32 states, 32 states have (on average 1.46875) internal successors, (47), 31 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:35:14,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:35:14,142 INFO L93 Difference]: Finished difference Result 203 states and 499 transitions. [2022-12-14 14:35:14,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-14 14:35:14,143 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.46875) internal successors, (47), 31 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-12-14 14:35:14,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:35:14,144 INFO L225 Difference]: With dead ends: 203 [2022-12-14 14:35:14,144 INFO L226 Difference]: Without dead ends: 203 [2022-12-14 14:35:14,144 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=257, Invalid=1377, Unknown=6, NotChecked=0, Total=1640 [2022-12-14 14:35:14,144 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 186 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 646 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 14:35:14,144 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 0 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 646 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 14:35:14,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2022-12-14 14:35:14,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 136. [2022-12-14 14:35:14,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 135 states have (on average 2.466666666666667) internal successors, (333), 135 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:35:14,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 333 transitions. [2022-12-14 14:35:14,147 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 333 transitions. Word has length 19 [2022-12-14 14:35:14,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:35:14,147 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 333 transitions. [2022-12-14 14:35:14,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.46875) internal successors, (47), 31 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:35:14,147 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 333 transitions. [2022-12-14 14:35:14,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-14 14:35:14,148 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:35:14,148 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:35:14,152 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-12-14 14:35:14,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-12-14 14:35:14,348 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:35:14,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:35:14,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1170146792, now seen corresponding path program 11 times [2022-12-14 14:35:14,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:35:14,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16330783] [2022-12-14 14:35:14,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:35:14,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:35:14,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:35:14,702 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:35:14,702 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:35:14,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16330783] [2022-12-14 14:35:14,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16330783] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:35:14,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1250872790] [2022-12-14 14:35:14,703 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 14:35:14,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:35:14,703 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:35:14,704 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:35:14,704 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-12-14 14:35:14,797 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 14:35:14,798 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:35:14,799 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 44 conjunts are in the unsatisfiable core [2022-12-14 14:35:14,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:35:15,365 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:35:15,365 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:35:15,878 INFO L321 Elim1Store]: treesize reduction 11, result has 84.9 percent of original size [2022-12-14 14:35:15,878 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 174 treesize of output 179 [2022-12-14 14:35:16,103 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 14:35:16,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1250872790] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-14 14:35:16,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-14 14:35:16,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10, 11] total 28 [2022-12-14 14:35:16,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403276619] [2022-12-14 14:35:16,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:35:16,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 14:35:16,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:35:16,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 14:35:16,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=675, Unknown=0, NotChecked=0, Total=756 [2022-12-14 14:35:16,105 INFO L87 Difference]: Start difference. First operand 136 states and 333 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:35:16,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:35:16,728 INFO L93 Difference]: Finished difference Result 191 states and 451 transitions. [2022-12-14 14:35:16,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-14 14:35:16,728 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-12-14 14:35:16,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:35:16,728 INFO L225 Difference]: With dead ends: 191 [2022-12-14 14:35:16,728 INFO L226 Difference]: Without dead ends: 186 [2022-12-14 14:35:16,729 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=127, Invalid=995, Unknown=0, NotChecked=0, Total=1122 [2022-12-14 14:35:16,729 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 68 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 14:35:16,729 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 5 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 14:35:16,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-12-14 14:35:16,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 140. [2022-12-14 14:35:16,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 139 states have (on average 2.4676258992805757) internal successors, (343), 139 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:35:16,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 343 transitions. [2022-12-14 14:35:16,733 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 343 transitions. Word has length 19 [2022-12-14 14:35:16,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:35:16,733 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 343 transitions. [2022-12-14 14:35:16,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:35:16,733 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 343 transitions. [2022-12-14 14:35:16,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-14 14:35:16,734 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:35:16,734 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:35:16,738 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-12-14 14:35:16,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:35:16,935 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:35:16,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:35:16,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1138637480, now seen corresponding path program 12 times [2022-12-14 14:35:16,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:35:16,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965918011] [2022-12-14 14:35:16,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:35:16,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:35:16,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:35:17,288 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:35:17,288 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:35:17,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965918011] [2022-12-14 14:35:17,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965918011] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:35:17,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1917355229] [2022-12-14 14:35:17,288 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 14:35:17,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:35:17,289 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:35:17,289 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:35:17,290 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-12-14 14:35:17,369 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 14:35:17,369 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:35:17,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-14 14:35:17,372 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:35:17,509 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 14:35:17,509 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 14:35:17,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1917355229] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:35:17,510 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 14:35:17,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 16 [2022-12-14 14:35:17,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909234749] [2022-12-14 14:35:17,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:35:17,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 14:35:17,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:35:17,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 14:35:17,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2022-12-14 14:35:17,510 INFO L87 Difference]: Start difference. First operand 140 states and 343 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:35:17,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:35:17,695 INFO L93 Difference]: Finished difference Result 212 states and 497 transitions. [2022-12-14 14:35:17,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 14:35:17,695 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-12-14 14:35:17,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:35:17,696 INFO L225 Difference]: With dead ends: 212 [2022-12-14 14:35:17,696 INFO L226 Difference]: Without dead ends: 212 [2022-12-14 14:35:17,696 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2022-12-14 14:35:17,696 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 75 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:35:17,697 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 0 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 14:35:17,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2022-12-14 14:35:17,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 142. [2022-12-14 14:35:17,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 141 states have (on average 2.482269503546099) internal successors, (350), 141 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:35:17,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 350 transitions. [2022-12-14 14:35:17,699 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 350 transitions. Word has length 19 [2022-12-14 14:35:17,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:35:17,699 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 350 transitions. [2022-12-14 14:35:17,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:35:17,700 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 350 transitions. [2022-12-14 14:35:17,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-14 14:35:17,700 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:35:17,700 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:35:17,704 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2022-12-14 14:35:17,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-12-14 14:35:17,901 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:35:17,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:35:17,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1662613952, now seen corresponding path program 13 times [2022-12-14 14:35:17,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:35:17,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416059194] [2022-12-14 14:35:17,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:35:17,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:35:17,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:35:18,225 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:35:18,225 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:35:18,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416059194] [2022-12-14 14:35:18,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416059194] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:35:18,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1022121136] [2022-12-14 14:35:18,225 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 14:35:18,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:35:18,225 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:35:18,226 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:35:18,227 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-12-14 14:35:18,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:35:18,323 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 39 conjunts are in the unsatisfiable core [2022-12-14 14:35:18,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:35:18,396 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 14:35:18,422 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 14:35:18,444 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 14:35:18,532 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:35:18,532 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:35:18,845 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:35:18,845 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 37 [2022-12-14 14:35:18,856 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:35:18,856 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 294 treesize of output 274 [2022-12-14 14:35:18,865 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:35:18,865 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 262 treesize of output 255 [2022-12-14 14:35:18,873 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:35:18,873 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 246 treesize of output 223 [2022-12-14 14:35:18,923 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:35:18,923 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 37 [2022-12-14 14:35:18,932 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:35:18,932 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 598 treesize of output 546 [2022-12-14 14:35:18,944 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:35:18,944 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 534 treesize of output 511 [2022-12-14 14:35:18,955 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:35:18,955 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 502 treesize of output 447 [2022-12-14 14:35:19,186 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:35:19,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1022121136] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:35:19,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [723209641] [2022-12-14 14:35:19,186 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 14:35:19,186 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:35:19,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 27 [2022-12-14 14:35:19,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901699864] [2022-12-14 14:35:19,187 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:35:19,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-12-14 14:35:19,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:35:19,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-12-14 14:35:19,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=602, Unknown=11, NotChecked=0, Total=756 [2022-12-14 14:35:19,188 INFO L87 Difference]: Start difference. First operand 142 states and 350 transitions. Second operand has 28 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 27 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-12-14 14:35:19,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:35:19,691 INFO L93 Difference]: Finished difference Result 218 states and 517 transitions. [2022-12-14 14:35:19,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-14 14:35:19,692 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 27 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 19 [2022-12-14 14:35:19,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:35:19,693 INFO L225 Difference]: With dead ends: 218 [2022-12-14 14:35:19,693 INFO L226 Difference]: Without dead ends: 218 [2022-12-14 14:35:19,694 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=320, Invalid=1151, Unknown=11, NotChecked=0, Total=1482 [2022-12-14 14:35:19,694 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 197 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 14:35:19,695 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 0 Invalid, 556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 14:35:19,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2022-12-14 14:35:19,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 144. [2022-12-14 14:35:19,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 143 states have (on average 2.5104895104895104) internal successors, (359), 143 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:35:19,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 359 transitions. [2022-12-14 14:35:19,698 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 359 transitions. Word has length 19 [2022-12-14 14:35:19,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:35:19,698 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 359 transitions. [2022-12-14 14:35:19,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 27 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-12-14 14:35:19,698 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 359 transitions. [2022-12-14 14:35:19,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-14 14:35:19,698 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:35:19,698 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:35:19,702 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2022-12-14 14:35:19,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2022-12-14 14:35:19,900 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:35:19,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:35:19,901 INFO L85 PathProgramCache]: Analyzing trace with hash 807901944, now seen corresponding path program 14 times [2022-12-14 14:35:19,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:35:19,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147216443] [2022-12-14 14:35:19,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:35:19,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:35:19,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:35:20,231 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:35:20,232 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:35:20,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147216443] [2022-12-14 14:35:20,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147216443] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:35:20,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [985905702] [2022-12-14 14:35:20,232 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 14:35:20,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:35:20,232 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:35:20,233 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:35:20,233 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-12-14 14:35:20,348 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 14:35:20,349 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:35:20,350 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 51 conjunts are in the unsatisfiable core [2022-12-14 14:35:20,352 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:35:20,742 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:35:20,742 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:35:21,225 INFO L321 Elim1Store]: treesize reduction 32, result has 62.4 percent of original size [2022-12-14 14:35:21,226 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 60 [2022-12-14 14:35:21,259 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-14 14:35:21,260 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 4 [2022-12-14 14:35:21,551 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:35:21,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [985905702] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:35:21,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [106600626] [2022-12-14 14:35:21,551 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 14:35:21,551 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:35:21,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 30 [2022-12-14 14:35:21,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040385008] [2022-12-14 14:35:21,552 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:35:21,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-12-14 14:35:21,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:35:21,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-12-14 14:35:21,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=732, Unknown=0, NotChecked=0, Total=930 [2022-12-14 14:35:21,553 INFO L87 Difference]: Start difference. First operand 144 states and 359 transitions. Second operand has 31 states, 31 states have (on average 1.6774193548387097) internal successors, (52), 30 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:35:23,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:35:23,284 INFO L93 Difference]: Finished difference Result 446 states and 1000 transitions. [2022-12-14 14:35:23,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-12-14 14:35:23,284 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.6774193548387097) internal successors, (52), 30 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-12-14 14:35:23,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:35:23,287 INFO L225 Difference]: With dead ends: 446 [2022-12-14 14:35:23,287 INFO L226 Difference]: Without dead ends: 414 [2022-12-14 14:35:23,289 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 814 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=727, Invalid=2579, Unknown=0, NotChecked=0, Total=3306 [2022-12-14 14:35:23,289 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 434 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 976 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 434 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1039 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 976 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-14 14:35:23,289 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [434 Valid, 0 Invalid, 1039 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 976 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-14 14:35:23,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2022-12-14 14:35:23,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 156. [2022-12-14 14:35:23,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 155 states have (on average 2.52258064516129) internal successors, (391), 155 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:35:23,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 391 transitions. [2022-12-14 14:35:23,296 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 391 transitions. Word has length 19 [2022-12-14 14:35:23,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:35:23,296 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 391 transitions. [2022-12-14 14:35:23,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 1.6774193548387097) internal successors, (52), 30 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:35:23,297 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 391 transitions. [2022-12-14 14:35:23,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-14 14:35:23,297 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:35:23,297 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-12-14 14:35:23,301 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-12-14 14:35:23,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:35:23,498 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:35:23,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:35:23,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1964730574, now seen corresponding path program 1 times [2022-12-14 14:35:23,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:35:23,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931695408] [2022-12-14 14:35:23,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:35:23,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:35:23,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:35:23,968 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:35:23,968 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:35:23,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931695408] [2022-12-14 14:35:23,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931695408] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:35:23,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2137096325] [2022-12-14 14:35:23,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:35:23,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:35:23,969 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:35:23,969 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:35:23,970 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-12-14 14:35:24,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:35:24,063 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 41 conjunts are in the unsatisfiable core [2022-12-14 14:35:24,065 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:35:24,160 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 14:35:24,190 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 14:35:24,250 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 14:35:24,462 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:35:24,462 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 87 treesize of output 71 [2022-12-14 14:35:24,534 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:35:24,535 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:35:25,168 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:35:25,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2137096325] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-14 14:35:25,168 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-14 14:35:25,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10, 11] total 28 [2022-12-14 14:35:25,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51233494] [2022-12-14 14:35:25,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:35:25,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-14 14:35:25,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:35:25,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-14 14:35:25,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=719, Unknown=18, NotChecked=0, Total=870 [2022-12-14 14:35:25,169 INFO L87 Difference]: Start difference. First operand 156 states and 391 transitions. Second operand has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:35:27,393 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:35:29,830 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:35:29,871 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse22 (* c_thread1Thread1of1ForFork1_~i~0 4))) (let ((.cse5 (+ c_~get2~0.offset .cse22)) (.cse20 (* c_thread2Thread1of1ForFork0_~i~1 4)) (.cse21 (select |c_#memory_int| c_~get2~0.base))) (let ((.cse12 (select .cse21 c_~get2~0.offset)) (.cse9 (select .cse21 (+ .cse20 c_~get2~0.offset))) (.cse3 (+ .cse22 c_~get1~0.offset)) (.cse10 (select .cse21 .cse5)) (.cse8 (+ .cse20 c_~get1~0.offset))) (and (< 0 c_~n1~0) (forall ((~get1~0.base Int) (v_ArrVal_1134 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1134))) (let ((.cse2 (select .cse6 ~get1~0.base)) (.cse4 (select .cse6 c_~get2~0.base))) (let ((.cse1 (select .cse4 c_~get2~0.offset)) (.cse0 (select .cse2 c_~get1~0.offset))) (or (= .cse0 .cse1) (< (select .cse2 .cse3) (select .cse4 .cse5)) (< .cse1 .cse0)))))) (< 0 c_~n2~0) (forall ((~get1~0.base Int)) (let ((.cse7 (select |c_#memory_int| ~get1~0.base))) (or (<= (select .cse7 .cse8) .cse9) (<= .cse10 (select .cse7 .cse3))))) (< c_thread2Thread1of1ForFork0_~i~1 c_~n1~0) (forall ((~get1~0.base Int)) (let ((.cse11 (select |c_#memory_int| ~get1~0.base))) (or (<= (select .cse11 c_~get1~0.offset) .cse12) (<= .cse10 (select .cse11 .cse3))))) (forall ((~get1~0.base Int) (v_ArrVal_1134 (Array Int Int))) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1134))) (let ((.cse14 (select .cse15 ~get1~0.base)) (.cse13 (select .cse15 c_~get2~0.base))) (or (<= (select .cse13 .cse5) (select .cse14 .cse3)) (<= (select .cse14 c_~get1~0.offset) (select .cse13 c_~get2~0.offset)))))) (forall ((~get1~0.base Int)) (let ((.cse17 (select |c_#memory_int| ~get1~0.base))) (let ((.cse16 (select .cse17 c_~get1~0.offset))) (or (< .cse12 .cse16) (< (select .cse17 .cse3) .cse10) (= .cse16 .cse12))))) (< c_thread2Thread1of1ForFork0_~i~1 c_~n2~0) (forall ((~get1~0.base Int)) (let ((.cse19 (select |c_#memory_int| ~get1~0.base))) (let ((.cse18 (select .cse19 .cse8))) (or (= .cse18 .cse9) (< .cse9 .cse18) (< (select .cse19 .cse3) .cse10))))))))) is different from false [2022-12-14 14:35:31,919 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:35:38,054 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:35:40,132 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:35:42,216 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:35:43,950 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:35:46,112 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:35:48,129 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:35:50,138 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:35:50,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:35:50,224 INFO L93 Difference]: Finished difference Result 382 states and 939 transitions. [2022-12-14 14:35:50,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-14 14:35:50,225 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-12-14 14:35:50,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:35:50,226 INFO L225 Difference]: With dead ends: 382 [2022-12-14 14:35:50,226 INFO L226 Difference]: Without dead ends: 356 [2022-12-14 14:35:50,226 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=221, Invalid=1154, Unknown=35, NotChecked=72, Total=1482 [2022-12-14 14:35:50,226 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 134 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 1 mSolverCounterUnsat, 41 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 41 IncrementalHoareTripleChecker+Unknown, 40 IncrementalHoareTripleChecker+Unchecked, 20.3s IncrementalHoareTripleChecker+Time [2022-12-14 14:35:50,226 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 1 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 338 Invalid, 41 Unknown, 40 Unchecked, 20.3s Time] [2022-12-14 14:35:50,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2022-12-14 14:35:50,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 189. [2022-12-14 14:35:50,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 188 states have (on average 2.5851063829787235) internal successors, (486), 188 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:35:50,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 486 transitions. [2022-12-14 14:35:50,230 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 486 transitions. Word has length 20 [2022-12-14 14:35:50,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:35:50,230 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 486 transitions. [2022-12-14 14:35:50,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:35:50,230 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 486 transitions. [2022-12-14 14:35:50,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-14 14:35:50,231 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:35:50,231 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-12-14 14:35:50,235 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-12-14 14:35:50,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2022-12-14 14:35:50,432 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:35:50,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:35:50,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1228572020, now seen corresponding path program 2 times [2022-12-14 14:35:50,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:35:50,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913461719] [2022-12-14 14:35:50,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:35:50,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:35:50,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:35:50,809 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:35:50,809 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:35:50,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913461719] [2022-12-14 14:35:50,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913461719] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:35:50,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1301536198] [2022-12-14 14:35:50,809 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 14:35:50,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:35:50,810 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:35:50,810 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:35:50,811 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-12-14 14:35:50,934 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-12-14 14:35:50,934 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:35:50,935 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 30 conjunts are in the unsatisfiable core [2022-12-14 14:35:50,937 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:35:51,224 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:35:51,224 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 87 treesize of output 71 [2022-12-14 14:35:51,278 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 14:35:51,278 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 14:35:51,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1301536198] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:35:51,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 14:35:51,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 19 [2022-12-14 14:35:51,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387467710] [2022-12-14 14:35:51,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:35:51,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-14 14:35:51,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:35:51,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-14 14:35:51,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2022-12-14 14:35:51,279 INFO L87 Difference]: Start difference. First operand 189 states and 486 transitions. Second operand has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:35:51,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:35:51,522 INFO L93 Difference]: Finished difference Result 256 states and 668 transitions. [2022-12-14 14:35:51,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 14:35:51,522 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-12-14 14:35:51,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:35:51,523 INFO L225 Difference]: With dead ends: 256 [2022-12-14 14:35:51,523 INFO L226 Difference]: Without dead ends: 249 [2022-12-14 14:35:51,523 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=152, Invalid=604, Unknown=0, NotChecked=0, Total=756 [2022-12-14 14:35:51,524 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 102 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:35:51,524 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 0 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 14:35:51,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2022-12-14 14:35:51,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 205. [2022-12-14 14:35:51,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 204 states have (on average 2.6519607843137254) internal successors, (541), 204 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:35:51,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 541 transitions. [2022-12-14 14:35:51,528 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 541 transitions. Word has length 20 [2022-12-14 14:35:51,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:35:51,528 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 541 transitions. [2022-12-14 14:35:51,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:35:51,528 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 541 transitions. [2022-12-14 14:35:51,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-14 14:35:51,529 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:35:51,529 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-12-14 14:35:51,533 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2022-12-14 14:35:51,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:35:51,730 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:35:51,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:35:51,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1616450840, now seen corresponding path program 3 times [2022-12-14 14:35:51,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:35:51,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942710861] [2022-12-14 14:35:51,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:35:51,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:35:51,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:35:52,133 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:35:52,133 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:35:52,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942710861] [2022-12-14 14:35:52,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942710861] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:35:52,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1031869674] [2022-12-14 14:35:52,133 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 14:35:52,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:35:52,134 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:35:52,134 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:35:52,135 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-12-14 14:35:52,222 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 14:35:52,222 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:35:52,223 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-14 14:35:52,224 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:35:52,399 INFO L321 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2022-12-14 14:35:52,399 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 50 [2022-12-14 14:35:52,443 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 14:35:52,443 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 14:35:52,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1031869674] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:35:52,443 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 14:35:52,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 18 [2022-12-14 14:35:52,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096118111] [2022-12-14 14:35:52,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:35:52,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-14 14:35:52,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:35:52,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-14 14:35:52,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2022-12-14 14:35:52,444 INFO L87 Difference]: Start difference. First operand 205 states and 541 transitions. Second operand has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:35:52,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:35:52,717 INFO L93 Difference]: Finished difference Result 278 states and 690 transitions. [2022-12-14 14:35:52,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 14:35:52,718 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-12-14 14:35:52,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:35:52,719 INFO L225 Difference]: With dead ends: 278 [2022-12-14 14:35:52,719 INFO L226 Difference]: Without dead ends: 273 [2022-12-14 14:35:52,719 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=148, Invalid=554, Unknown=0, NotChecked=0, Total=702 [2022-12-14 14:35:52,719 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 92 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:35:52,719 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 0 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 14:35:52,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2022-12-14 14:35:52,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 195. [2022-12-14 14:35:52,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 194 states have (on average 2.6391752577319587) internal successors, (512), 194 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:35:52,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 512 transitions. [2022-12-14 14:35:52,722 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 512 transitions. Word has length 20 [2022-12-14 14:35:52,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:35:52,723 INFO L495 AbstractCegarLoop]: Abstraction has 195 states and 512 transitions. [2022-12-14 14:35:52,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:35:52,723 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 512 transitions. [2022-12-14 14:35:52,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-14 14:35:52,723 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:35:52,723 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-12-14 14:35:52,727 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2022-12-14 14:35:52,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-12-14 14:35:52,924 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:35:52,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:35:52,924 INFO L85 PathProgramCache]: Analyzing trace with hash 631389156, now seen corresponding path program 4 times [2022-12-14 14:35:52,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:35:52,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005199861] [2022-12-14 14:35:52,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:35:52,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:35:52,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:35:53,331 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:35:53,331 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:35:53,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005199861] [2022-12-14 14:35:53,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005199861] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:35:53,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [783588897] [2022-12-14 14:35:53,331 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 14:35:53,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:35:53,332 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:35:53,332 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:35:53,333 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-12-14 14:35:53,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:35:53,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 41 conjunts are in the unsatisfiable core [2022-12-14 14:35:53,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:35:53,506 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 14:35:53,546 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 14:35:53,593 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 14:35:53,725 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:35:53,725 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 87 treesize of output 71 [2022-12-14 14:35:53,779 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:35:53,779 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:35:54,436 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:35:54,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [783588897] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-14 14:35:54,436 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-14 14:35:54,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10, 11] total 28 [2022-12-14 14:35:54,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388994631] [2022-12-14 14:35:54,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:35:54,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-14 14:35:54,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:35:54,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-14 14:35:54,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=712, Unknown=15, NotChecked=0, Total=870 [2022-12-14 14:35:54,437 INFO L87 Difference]: Start difference. First operand 195 states and 512 transitions. Second operand has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:35:57,302 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:35:58,933 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:36:00,948 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:36:01,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:36:01,341 INFO L93 Difference]: Finished difference Result 290 states and 765 transitions. [2022-12-14 14:36:01,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-14 14:36:01,342 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-12-14 14:36:01,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:36:01,342 INFO L225 Difference]: With dead ends: 290 [2022-12-14 14:36:01,342 INFO L226 Difference]: Without dead ends: 283 [2022-12-14 14:36:01,343 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=213, Invalid=1019, Unknown=28, NotChecked=0, Total=1260 [2022-12-14 14:36:01,343 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 56 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 1 mSolverCounterUnsat, 17 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 17 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2022-12-14 14:36:01,343 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 0 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 305 Invalid, 17 Unknown, 0 Unchecked, 6.5s Time] [2022-12-14 14:36:01,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2022-12-14 14:36:01,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 201. [2022-12-14 14:36:01,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 200 states have (on average 2.66) internal successors, (532), 200 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:36:01,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 532 transitions. [2022-12-14 14:36:01,346 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 532 transitions. Word has length 20 [2022-12-14 14:36:01,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:36:01,347 INFO L495 AbstractCegarLoop]: Abstraction has 201 states and 532 transitions. [2022-12-14 14:36:01,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:36:01,347 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 532 transitions. [2022-12-14 14:36:01,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-14 14:36:01,347 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:36:01,347 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-12-14 14:36:01,351 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-12-14 14:36:01,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-12-14 14:36:01,549 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:36:01,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:36:01,550 INFO L85 PathProgramCache]: Analyzing trace with hash 243510336, now seen corresponding path program 5 times [2022-12-14 14:36:01,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:36:01,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813754712] [2022-12-14 14:36:01,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:36:01,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:36:01,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:36:02,234 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:36:02,234 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:36:02,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813754712] [2022-12-14 14:36:02,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813754712] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:36:02,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2129382450] [2022-12-14 14:36:02,234 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 14:36:02,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:36:02,234 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:36:02,235 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:36:02,236 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-12-14 14:36:02,356 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-12-14 14:36:02,356 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:36:02,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-14 14:36:02,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:36:02,563 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 14:36:02,563 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 45 [2022-12-14 14:36:02,608 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 14:36:02,608 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 14:36:02,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2129382450] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:36:02,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 14:36:02,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 17 [2022-12-14 14:36:02,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357704604] [2022-12-14 14:36:02,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:36:02,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-14 14:36:02,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:36:02,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-14 14:36:02,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2022-12-14 14:36:02,609 INFO L87 Difference]: Start difference. First operand 201 states and 532 transitions. Second operand has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:36:02,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:36:02,922 INFO L93 Difference]: Finished difference Result 279 states and 695 transitions. [2022-12-14 14:36:02,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 14:36:02,922 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-12-14 14:36:02,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:36:02,923 INFO L225 Difference]: With dead ends: 279 [2022-12-14 14:36:02,924 INFO L226 Difference]: Without dead ends: 274 [2022-12-14 14:36:02,924 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=137, Invalid=513, Unknown=0, NotChecked=0, Total=650 [2022-12-14 14:36:02,924 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 87 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 14:36:02,924 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 0 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 14:36:02,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2022-12-14 14:36:02,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 189. [2022-12-14 14:36:02,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 188 states have (on average 2.622340425531915) internal successors, (493), 188 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:36:02,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 493 transitions. [2022-12-14 14:36:02,932 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 493 transitions. Word has length 20 [2022-12-14 14:36:02,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:36:02,932 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 493 transitions. [2022-12-14 14:36:02,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:36:02,932 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 493 transitions. [2022-12-14 14:36:02,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-14 14:36:02,933 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:36:02,933 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-12-14 14:36:02,937 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2022-12-14 14:36:03,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:36:03,134 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:36:03,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:36:03,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1239712014, now seen corresponding path program 6 times [2022-12-14 14:36:03,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:36:03,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775317600] [2022-12-14 14:36:03,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:36:03,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:36:03,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:36:03,832 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:36:03,832 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:36:03,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775317600] [2022-12-14 14:36:03,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775317600] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:36:03,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [922002593] [2022-12-14 14:36:03,832 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 14:36:03,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:36:03,833 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:36:03,833 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:36:03,834 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-12-14 14:36:03,935 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 14:36:03,935 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:36:03,936 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-14 14:36:03,937 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:36:04,186 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:36:04,187 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 87 treesize of output 79 [2022-12-14 14:36:04,261 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 14:36:04,261 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 14:36:04,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [922002593] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:36:04,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 14:36:04,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 19 [2022-12-14 14:36:04,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132841276] [2022-12-14 14:36:04,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:36:04,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-14 14:36:04,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:36:04,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-14 14:36:04,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2022-12-14 14:36:04,263 INFO L87 Difference]: Start difference. First operand 189 states and 493 transitions. Second operand has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:36:04,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:36:04,568 INFO L93 Difference]: Finished difference Result 249 states and 634 transitions. [2022-12-14 14:36:04,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 14:36:04,568 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-12-14 14:36:04,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:36:04,569 INFO L225 Difference]: With dead ends: 249 [2022-12-14 14:36:04,569 INFO L226 Difference]: Without dead ends: 242 [2022-12-14 14:36:04,569 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=144, Invalid=612, Unknown=0, NotChecked=0, Total=756 [2022-12-14 14:36:04,569 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 83 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 14:36:04,570 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 0 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 14:36:04,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2022-12-14 14:36:04,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 194. [2022-12-14 14:36:04,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 193 states have (on average 2.616580310880829) internal successors, (505), 193 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:36:04,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 505 transitions. [2022-12-14 14:36:04,575 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 505 transitions. Word has length 20 [2022-12-14 14:36:04,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:36:04,575 INFO L495 AbstractCegarLoop]: Abstraction has 194 states and 505 transitions. [2022-12-14 14:36:04,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:36:04,575 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 505 transitions. [2022-12-14 14:36:04,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-14 14:36:04,575 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:36:04,576 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-12-14 14:36:04,580 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2022-12-14 14:36:04,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-12-14 14:36:04,776 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:36:04,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:36:04,778 INFO L85 PathProgramCache]: Analyzing trace with hash 851833194, now seen corresponding path program 7 times [2022-12-14 14:36:04,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:36:04,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488050554] [2022-12-14 14:36:04,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:36:04,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:36:04,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:36:05,212 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:36:05,212 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:36:05,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488050554] [2022-12-14 14:36:05,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488050554] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:36:05,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1083458016] [2022-12-14 14:36:05,212 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 14:36:05,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:36:05,213 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:36:05,213 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:36:05,214 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-12-14 14:36:05,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:36:05,292 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 44 conjunts are in the unsatisfiable core [2022-12-14 14:36:05,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:36:05,393 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 14:36:05,428 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 14:36:05,489 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 14:36:05,715 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 14:36:05,715 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 45 [2022-12-14 14:36:05,754 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:36:05,754 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:36:20,048 WARN L233 SmtUtils]: Spent 7.77s on a formula simplification that was a NOOP. DAG size: 28 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 14:36:20,318 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:36:20,318 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 36 [2022-12-14 14:36:20,335 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-12-14 14:36:20,335 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 566 treesize of output 509 [2022-12-14 14:36:20,351 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:36:20,352 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 502 treesize of output 446 [2022-12-14 14:36:20,368 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:36:20,369 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 438 treesize of output 414 [2022-12-14 14:36:20,855 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:36:20,856 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 59 [2022-12-14 14:36:20,875 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-12-14 14:36:20,875 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1131 treesize of output 1010 [2022-12-14 14:36:20,896 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:36:20,896 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1003 treesize of output 947 [2022-12-14 14:36:20,919 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:36:20,919 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 939 treesize of output 819 [2022-12-14 14:36:32,328 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:36:32,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1083458016] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:36:32,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [205473711] [2022-12-14 14:36:32,329 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 14:36:32,329 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:36:32,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 13] total 34 [2022-12-14 14:36:32,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644629352] [2022-12-14 14:36:32,329 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:36:32,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-12-14 14:36:32,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:36:32,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-12-14 14:36:32,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=987, Unknown=39, NotChecked=0, Total=1260 [2022-12-14 14:36:32,331 INFO L87 Difference]: Start difference. First operand 194 states and 505 transitions. Second operand has 36 states, 35 states have (on average 1.542857142857143) internal successors, (54), 35 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:36:35,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:36:35,677 INFO L93 Difference]: Finished difference Result 447 states and 1095 transitions. [2022-12-14 14:36:35,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-14 14:36:35,677 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.542857142857143) internal successors, (54), 35 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-12-14 14:36:35,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:36:35,678 INFO L225 Difference]: With dead ends: 447 [2022-12-14 14:36:35,678 INFO L226 Difference]: Without dead ends: 431 [2022-12-14 14:36:35,679 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 663 ImplicationChecksByTransitivity, 16.5s TimeCoverageRelationStatistics Valid=678, Invalid=2461, Unknown=53, NotChecked=0, Total=3192 [2022-12-14 14:36:35,679 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 287 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1392 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-12-14 14:36:35,679 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 0 Invalid, 1402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1392 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-12-14 14:36:35,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2022-12-14 14:36:35,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 204. [2022-12-14 14:36:35,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 203 states have (on average 2.6206896551724137) internal successors, (532), 203 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:36:35,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 532 transitions. [2022-12-14 14:36:35,683 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 532 transitions. Word has length 20 [2022-12-14 14:36:35,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:36:35,684 INFO L495 AbstractCegarLoop]: Abstraction has 204 states and 532 transitions. [2022-12-14 14:36:35,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.542857142857143) internal successors, (54), 35 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:36:35,684 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 532 transitions. [2022-12-14 14:36:35,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-14 14:36:35,684 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:36:35,684 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-12-14 14:36:35,689 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-12-14 14:36:35,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-12-14 14:36:35,885 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:36:35,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:36:35,886 INFO L85 PathProgramCache]: Analyzing trace with hash 844102796, now seen corresponding path program 8 times [2022-12-14 14:36:35,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:36:35,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934176869] [2022-12-14 14:36:35,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:36:35,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:36:35,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:36:36,655 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:36:36,655 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:36:36,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934176869] [2022-12-14 14:36:36,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934176869] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:36:36,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [64204780] [2022-12-14 14:36:36,655 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 14:36:36,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:36:36,655 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:36:36,656 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:36:36,657 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-12-14 14:36:36,755 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-12-14 14:36:36,755 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:36:36,756 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-14 14:36:36,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:36:37,062 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 14:36:37,062 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 45 [2022-12-14 14:36:37,122 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 14:36:37,122 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 14:36:37,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [64204780] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:36:37,122 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 14:36:37,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 18 [2022-12-14 14:36:37,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127499666] [2022-12-14 14:36:37,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:36:37,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-14 14:36:37,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:36:37,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-14 14:36:37,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2022-12-14 14:36:37,123 INFO L87 Difference]: Start difference. First operand 204 states and 532 transitions. Second operand has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:36:37,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:36:37,604 INFO L93 Difference]: Finished difference Result 276 states and 691 transitions. [2022-12-14 14:36:37,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 14:36:37,605 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-12-14 14:36:37,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:36:37,607 INFO L225 Difference]: With dead ends: 276 [2022-12-14 14:36:37,607 INFO L226 Difference]: Without dead ends: 271 [2022-12-14 14:36:37,607 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=142, Invalid=560, Unknown=0, NotChecked=0, Total=702 [2022-12-14 14:36:37,607 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 124 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 14:36:37,608 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 0 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 14:36:37,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2022-12-14 14:36:37,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 192. [2022-12-14 14:36:37,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 191 states have (on average 2.607329842931937) internal successors, (498), 191 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:36:37,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 498 transitions. [2022-12-14 14:36:37,612 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 498 transitions. Word has length 20 [2022-12-14 14:36:37,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:36:37,613 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 498 transitions. [2022-12-14 14:36:37,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:36:37,613 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 498 transitions. [2022-12-14 14:36:37,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-14 14:36:37,613 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:36:37,614 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-12-14 14:36:37,618 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Ended with exit code 0 [2022-12-14 14:36:37,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:36:37,814 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:36:37,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:36:37,815 INFO L85 PathProgramCache]: Analyzing trace with hash -857533958, now seen corresponding path program 9 times [2022-12-14 14:36:37,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:36:37,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828268233] [2022-12-14 14:36:37,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:36:37,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:36:37,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:36:38,703 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:36:38,703 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:36:38,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828268233] [2022-12-14 14:36:38,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828268233] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:36:38,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [456069825] [2022-12-14 14:36:38,704 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 14:36:38,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:36:38,704 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:36:38,705 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:36:38,706 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-12-14 14:36:38,787 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 14:36:38,787 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:36:38,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 24 conjunts are in the unsatisfiable core [2022-12-14 14:36:38,789 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:36:39,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:36:39,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:36:39,150 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-14 14:36:39,150 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 41 treesize of output 42 [2022-12-14 14:36:39,330 INFO L321 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2022-12-14 14:36:39,331 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 50 [2022-12-14 14:36:39,402 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 14:36:39,403 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 14:36:39,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [456069825] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:36:39,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 14:36:39,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 21 [2022-12-14 14:36:39,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204804002] [2022-12-14 14:36:39,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:36:39,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-14 14:36:39,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:36:39,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-14 14:36:39,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=447, Unknown=0, NotChecked=0, Total=506 [2022-12-14 14:36:39,404 INFO L87 Difference]: Start difference. First operand 192 states and 498 transitions. Second operand has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:36:40,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:36:40,074 INFO L93 Difference]: Finished difference Result 266 states and 672 transitions. [2022-12-14 14:36:40,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 14:36:40,074 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-12-14 14:36:40,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:36:40,075 INFO L225 Difference]: With dead ends: 266 [2022-12-14 14:36:40,075 INFO L226 Difference]: Without dead ends: 261 [2022-12-14 14:36:40,075 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=134, Invalid=736, Unknown=0, NotChecked=0, Total=870 [2022-12-14 14:36:40,076 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 120 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 14:36:40,076 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 0 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 14:36:40,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2022-12-14 14:36:40,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 186. [2022-12-14 14:36:40,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 185 states have (on average 2.6432432432432433) internal successors, (489), 185 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:36:40,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 489 transitions. [2022-12-14 14:36:40,079 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 489 transitions. Word has length 20 [2022-12-14 14:36:40,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:36:40,079 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 489 transitions. [2022-12-14 14:36:40,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:36:40,079 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 489 transitions. [2022-12-14 14:36:40,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-14 14:36:40,079 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:36:40,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] [2022-12-14 14:36:40,083 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-12-14 14:36:40,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2022-12-14 14:36:40,280 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:36:40,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:36:40,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1245981268, now seen corresponding path program 10 times [2022-12-14 14:36:40,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:36:40,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986853894] [2022-12-14 14:36:40,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:36:40,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:36:40,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:36:40,841 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:36:40,841 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:36:40,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986853894] [2022-12-14 14:36:40,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986853894] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:36:40,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1142435381] [2022-12-14 14:36:40,842 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 14:36:40,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:36:40,842 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:36:40,843 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:36:40,843 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-12-14 14:36:40,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:36:40,939 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 34 conjunts are in the unsatisfiable core [2022-12-14 14:36:40,940 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:36:41,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:36:41,303 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-14 14:36:41,482 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:36:41,482 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 87 treesize of output 71 [2022-12-14 14:36:41,584 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:36:41,584 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:36:42,006 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_~get2~0.offset (* c_thread1Thread1of1ForFork1_~i~0 4)))) (and (< 0 c_~n1~0) (forall ((~get2~0.base Int) (v_ArrVal_1486 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1486))) (let ((.cse2 (select .cse4 ~get2~0.base))) (let ((.cse0 (select .cse2 c_~get2~0.offset)) (.cse1 (select (select .cse4 c_~get1~0.base) c_~get1~0.offset))) (or (< .cse0 .cse1) (= .cse0 .cse1) (< |c_thread1Thread1of1ForFork1_#t~mem4| (select .cse2 .cse3))))))) (< 0 c_~n2~0) (forall ((~get2~0.base Int) (v_ArrVal_1486 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1486))) (let ((.cse6 (select .cse5 ~get2~0.base))) (or (<= (select (select .cse5 c_~get1~0.base) c_~get1~0.offset) (select .cse6 c_~get2~0.offset)) (<= (select .cse6 .cse3) |c_thread1Thread1of1ForFork1_#t~mem4|))))))) is different from false [2022-12-14 14:36:42,087 INFO L321 Elim1Store]: treesize reduction 15, result has 79.5 percent of original size [2022-12-14 14:36:42,087 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 111 treesize of output 128 [2022-12-14 14:36:42,114 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:36:42,114 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 79 [2022-12-14 14:36:42,593 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:36:42,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:36:42,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:36:42,601 INFO L321 Elim1Store]: treesize reduction 30, result has 3.2 percent of original size [2022-12-14 14:36:42,601 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 104 treesize of output 1 [2022-12-14 14:36:42,828 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:36:42,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1142435381] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-14 14:36:42,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-14 14:36:42,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11, 11] total 29 [2022-12-14 14:36:42,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653680574] [2022-12-14 14:36:42,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:36:42,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-14 14:36:42,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:36:42,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-14 14:36:42,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=759, Unknown=1, NotChecked=56, Total=930 [2022-12-14 14:36:42,829 INFO L87 Difference]: Start difference. First operand 186 states and 489 transitions. Second operand has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:36:57,543 WARN L233 SmtUtils]: Spent 14.41s on a formula simplification. DAG size of input: 59 DAG size of output: 44 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 14:37:00,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:37:00,472 INFO L93 Difference]: Finished difference Result 268 states and 681 transitions. [2022-12-14 14:37:00,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-14 14:37:00,472 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-12-14 14:37:00,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:37:00,473 INFO L225 Difference]: With dead ends: 268 [2022-12-14 14:37:00,473 INFO L226 Difference]: Without dead ends: 261 [2022-12-14 14:37:00,473 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 18.1s TimeCoverageRelationStatistics Valid=177, Invalid=1156, Unknown=3, NotChecked=70, Total=1406 [2022-12-14 14:37:00,473 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 77 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 2 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 60 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 14:37:00,474 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 0 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 309 Invalid, 9 Unknown, 60 Unchecked, 0.5s Time] [2022-12-14 14:37:00,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2022-12-14 14:37:00,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 188. [2022-12-14 14:37:00,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 187 states have (on average 2.641711229946524) internal successors, (494), 187 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:37:00,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 494 transitions. [2022-12-14 14:37:00,476 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 494 transitions. Word has length 20 [2022-12-14 14:37:00,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:37:00,477 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 494 transitions. [2022-12-14 14:37:00,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:37:00,477 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 494 transitions. [2022-12-14 14:37:00,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-14 14:37:00,477 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:37:00,477 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-12-14 14:37:00,481 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Ended with exit code 0 [2022-12-14 14:37:00,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2022-12-14 14:37:00,679 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:37:00,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:37:00,680 INFO L85 PathProgramCache]: Analyzing trace with hash -385322800, now seen corresponding path program 11 times [2022-12-14 14:37:00,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:37:00,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381563904] [2022-12-14 14:37:00,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:37:00,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:37:00,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:37:01,292 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:37:01,292 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:37:01,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381563904] [2022-12-14 14:37:01,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381563904] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:37:01,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [216586580] [2022-12-14 14:37:01,292 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 14:37:01,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:37:01,292 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:37:01,293 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:37:01,293 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-12-14 14:37:01,432 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-12-14 14:37:01,432 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:37:01,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 33 conjunts are in the unsatisfiable core [2022-12-14 14:37:01,435 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:37:01,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:37:01,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:37:01,824 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-14 14:37:01,824 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 38 treesize of output 41 [2022-12-14 14:37:02,100 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 14:37:02,100 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 45 [2022-12-14 14:37:02,197 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 14:37:02,197 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 14:37:02,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [216586580] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:37:02,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 14:37:02,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [11] total 22 [2022-12-14 14:37:02,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635314936] [2022-12-14 14:37:02,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:37:02,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-14 14:37:02,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:37:02,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-14 14:37:02,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=490, Unknown=0, NotChecked=0, Total=552 [2022-12-14 14:37:02,198 INFO L87 Difference]: Start difference. First operand 188 states and 494 transitions. Second operand has 13 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:37:03,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:37:03,270 INFO L93 Difference]: Finished difference Result 265 states and 662 transitions. [2022-12-14 14:37:03,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-14 14:37:03,271 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-12-14 14:37:03,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:37:03,272 INFO L225 Difference]: With dead ends: 265 [2022-12-14 14:37:03,272 INFO L226 Difference]: Without dead ends: 248 [2022-12-14 14:37:03,272 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=146, Invalid=846, Unknown=0, NotChecked=0, Total=992 [2022-12-14 14:37:03,273 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 117 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 14:37:03,273 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 0 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 14:37:03,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2022-12-14 14:37:03,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 183. [2022-12-14 14:37:03,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 182 states have (on average 2.6483516483516483) internal successors, (482), 182 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:37:03,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 482 transitions. [2022-12-14 14:37:03,275 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 482 transitions. Word has length 20 [2022-12-14 14:37:03,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:37:03,276 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 482 transitions. [2022-12-14 14:37:03,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:37:03,276 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 482 transitions. [2022-12-14 14:37:03,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-14 14:37:03,276 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:37:03,276 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-12-14 14:37:03,280 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2022-12-14 14:37:03,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:37:03,477 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:37:03,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:37:03,478 INFO L85 PathProgramCache]: Analyzing trace with hash -385710426, now seen corresponding path program 12 times [2022-12-14 14:37:03,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:37:03,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466074109] [2022-12-14 14:37:03,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:37:03,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:37:03,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:37:04,021 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:37:04,021 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:37:04,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466074109] [2022-12-14 14:37:04,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466074109] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:37:04,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [527876868] [2022-12-14 14:37:04,021 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 14:37:04,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:37:04,021 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:37:04,022 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:37:04,023 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-12-14 14:37:04,131 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 14:37:04,131 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:37:04,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-14 14:37:04,134 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:37:04,545 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:37:04,545 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 87 treesize of output 79 [2022-12-14 14:37:04,638 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 14:37:04,638 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 14:37:04,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [527876868] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:37:04,638 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 14:37:04,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 18 [2022-12-14 14:37:04,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982498886] [2022-12-14 14:37:04,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:37:04,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-14 14:37:04,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:37:04,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-14 14:37:04,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2022-12-14 14:37:04,639 INFO L87 Difference]: Start difference. First operand 183 states and 482 transitions. Second operand has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:37:05,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:37:05,091 INFO L93 Difference]: Finished difference Result 253 states and 622 transitions. [2022-12-14 14:37:05,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 14:37:05,092 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-12-14 14:37:05,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:37:05,092 INFO L225 Difference]: With dead ends: 253 [2022-12-14 14:37:05,092 INFO L226 Difference]: Without dead ends: 245 [2022-12-14 14:37:05,093 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=134, Invalid=568, Unknown=0, NotChecked=0, Total=702 [2022-12-14 14:37:05,093 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 85 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 14:37:05,093 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 0 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 14:37:05,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2022-12-14 14:37:05,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 181. [2022-12-14 14:37:05,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 180 states have (on average 2.6444444444444444) internal successors, (476), 180 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:37:05,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 476 transitions. [2022-12-14 14:37:05,096 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 476 transitions. Word has length 20 [2022-12-14 14:37:05,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:37:05,096 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 476 transitions. [2022-12-14 14:37:05,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:37:05,096 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 476 transitions. [2022-12-14 14:37:05,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-14 14:37:05,096 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:37:05,096 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-12-14 14:37:05,100 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Ended with exit code 0 [2022-12-14 14:37:05,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:37:05,298 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:37:05,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:37:05,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1395852448, now seen corresponding path program 13 times [2022-12-14 14:37:05,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:37:05,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159206836] [2022-12-14 14:37:05,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:37:05,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:37:05,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:37:05,820 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:37:05,820 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:37:05,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159206836] [2022-12-14 14:37:05,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159206836] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:37:05,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [200249765] [2022-12-14 14:37:05,820 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 14:37:05,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:37:05,820 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:37:05,821 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:37:05,822 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-12-14 14:37:05,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:37:05,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 51 conjunts are in the unsatisfiable core [2022-12-14 14:37:05,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:37:05,941 INFO L321 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2022-12-14 14:37:05,941 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 12 treesize of output 16 [2022-12-14 14:37:06,064 INFO L321 Elim1Store]: treesize reduction 36, result has 26.5 percent of original size [2022-12-14 14:37:06,064 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 21 treesize of output 25 [2022-12-14 14:37:06,137 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 14:37:06,198 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 14:37:06,264 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 14:37:06,652 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:37:06,652 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 87 treesize of output 71 [2022-12-14 14:37:06,756 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:37:06,757 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:37:07,482 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:37:07,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [200249765] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-14 14:37:07,483 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-14 14:37:07,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 11] total 29 [2022-12-14 14:37:07,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786724555] [2022-12-14 14:37:07,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:37:07,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-14 14:37:07,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:37:07,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-14 14:37:07,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=785, Unknown=0, NotChecked=0, Total=930 [2022-12-14 14:37:07,483 INFO L87 Difference]: Start difference. First operand 181 states and 476 transitions. Second operand has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:37:08,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:37:08,176 INFO L93 Difference]: Finished difference Result 243 states and 603 transitions. [2022-12-14 14:37:08,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-14 14:37:08,176 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-12-14 14:37:08,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:37:08,177 INFO L225 Difference]: With dead ends: 243 [2022-12-14 14:37:08,177 INFO L226 Difference]: Without dead ends: 232 [2022-12-14 14:37:08,177 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=211, Invalid=1049, Unknown=0, NotChecked=0, Total=1260 [2022-12-14 14:37:08,178 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 45 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 14:37:08,178 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 0 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 14:37:08,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2022-12-14 14:37:08,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 152. [2022-12-14 14:37:08,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 151 states have (on average 2.5496688741721854) internal successors, (385), 151 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:37:08,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 385 transitions. [2022-12-14 14:37:08,180 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 385 transitions. Word has length 20 [2022-12-14 14:37:08,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:37:08,180 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 385 transitions. [2022-12-14 14:37:08,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:37:08,181 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 385 transitions. [2022-12-14 14:37:08,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-14 14:37:08,181 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:37:08,181 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-12-14 14:37:08,185 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2022-12-14 14:37:08,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:37:08,382 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:37:08,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:37:08,383 INFO L85 PathProgramCache]: Analyzing trace with hash 288054400, now seen corresponding path program 14 times [2022-12-14 14:37:08,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:37:08,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762341515] [2022-12-14 14:37:08,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:37:08,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:37:08,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:37:08,902 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:37:08,902 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:37:08,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762341515] [2022-12-14 14:37:08,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762341515] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:37:08,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1730526326] [2022-12-14 14:37:08,902 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 14:37:08,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:37:08,902 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:37:08,903 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:37:08,904 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-12-14 14:37:09,035 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-12-14 14:37:09,035 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:37:09,036 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-14 14:37:09,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:37:09,640 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:37:09,640 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 87 treesize of output 71 [2022-12-14 14:37:09,766 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 14:37:09,766 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 14:37:09,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1730526326] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:37:09,766 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 14:37:09,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 19 [2022-12-14 14:37:09,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675342601] [2022-12-14 14:37:09,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:37:09,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-14 14:37:09,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:37:09,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-14 14:37:09,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2022-12-14 14:37:09,767 INFO L87 Difference]: Start difference. First operand 152 states and 385 transitions. Second operand has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:37:10,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:37:10,375 INFO L93 Difference]: Finished difference Result 189 states and 450 transitions. [2022-12-14 14:37:10,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 14:37:10,376 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-12-14 14:37:10,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:37:10,376 INFO L225 Difference]: With dead ends: 189 [2022-12-14 14:37:10,376 INFO L226 Difference]: Without dead ends: 180 [2022-12-14 14:37:10,377 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=147, Invalid=609, Unknown=0, NotChecked=0, Total=756 [2022-12-14 14:37:10,377 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 101 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 14:37:10,377 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 0 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 14:37:10,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2022-12-14 14:37:10,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 158. [2022-12-14 14:37:10,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 157 states have (on average 2.5095541401273884) internal successors, (394), 157 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:37:10,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 394 transitions. [2022-12-14 14:37:10,379 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 394 transitions. Word has length 20 [2022-12-14 14:37:10,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:37:10,379 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 394 transitions. [2022-12-14 14:37:10,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:37:10,379 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 394 transitions. [2022-12-14 14:37:10,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-14 14:37:10,380 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:37:10,380 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-12-14 14:37:10,384 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2022-12-14 14:37:10,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2022-12-14 14:37:10,581 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:37:10,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:37:10,582 INFO L85 PathProgramCache]: Analyzing trace with hash -688734272, now seen corresponding path program 15 times [2022-12-14 14:37:10,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:37:10,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320934001] [2022-12-14 14:37:10,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:37:10,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:37:10,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:37:11,063 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:37:11,063 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:37:11,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320934001] [2022-12-14 14:37:11,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320934001] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:37:11,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1192311224] [2022-12-14 14:37:11,064 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 14:37:11,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:37:11,064 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:37:11,065 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:37:11,065 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-12-14 14:37:11,149 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 14:37:11,149 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:37:11,150 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-14 14:37:11,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:37:11,574 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:37:11,574 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 87 treesize of output 79 [2022-12-14 14:37:11,677 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 14:37:11,677 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 14:37:11,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1192311224] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:37:11,678 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 14:37:11,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 18 [2022-12-14 14:37:11,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000509811] [2022-12-14 14:37:11,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:37:11,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-14 14:37:11,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:37:11,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-14 14:37:11,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2022-12-14 14:37:11,679 INFO L87 Difference]: Start difference. First operand 158 states and 394 transitions. Second operand has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:37:12,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:37:12,181 INFO L93 Difference]: Finished difference Result 201 states and 462 transitions. [2022-12-14 14:37:12,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 14:37:12,182 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-12-14 14:37:12,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:37:12,182 INFO L225 Difference]: With dead ends: 201 [2022-12-14 14:37:12,182 INFO L226 Difference]: Without dead ends: 188 [2022-12-14 14:37:12,182 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=131, Invalid=571, Unknown=0, NotChecked=0, Total=702 [2022-12-14 14:37:12,183 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 82 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 14:37:12,183 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 0 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 14:37:12,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2022-12-14 14:37:12,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 156. [2022-12-14 14:37:12,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 155 states have (on average 2.496774193548387) internal successors, (387), 155 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:37:12,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 387 transitions. [2022-12-14 14:37:12,185 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 387 transitions. Word has length 20 [2022-12-14 14:37:12,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:37:12,185 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 387 transitions. [2022-12-14 14:37:12,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:37:12,185 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 387 transitions. [2022-12-14 14:37:12,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-14 14:37:12,186 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:37:12,186 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-12-14 14:37:12,190 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Ended with exit code 0 [2022-12-14 14:37:12,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 43 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2022-12-14 14:37:12,387 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:37:12,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:37:12,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1625332824, now seen corresponding path program 16 times [2022-12-14 14:37:12,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:37:12,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103771178] [2022-12-14 14:37:12,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:37:12,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:37:12,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:37:12,899 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:37:12,899 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:37:12,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103771178] [2022-12-14 14:37:12,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103771178] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:37:12,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1032198704] [2022-12-14 14:37:12,899 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 14:37:12,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:37:12,899 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:37:12,900 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:37:12,901 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2022-12-14 14:37:12,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:37:12,991 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 41 conjunts are in the unsatisfiable core [2022-12-14 14:37:12,992 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:37:13,132 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 14:37:13,182 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 14:37:13,233 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 14:37:13,518 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:37:13,519 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 87 treesize of output 71 [2022-12-14 14:37:13,612 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:37:13,612 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:37:14,355 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:37:14,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1032198704] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-14 14:37:14,356 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-14 14:37:14,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 11] total 26 [2022-12-14 14:37:14,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408856103] [2022-12-14 14:37:14,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:37:14,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-14 14:37:14,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:37:14,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-14 14:37:14,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=646, Unknown=0, NotChecked=0, Total=756 [2022-12-14 14:37:14,356 INFO L87 Difference]: Start difference. First operand 156 states and 387 transitions. Second operand has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:37:15,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:37:15,551 INFO L93 Difference]: Finished difference Result 195 states and 449 transitions. [2022-12-14 14:37:15,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-14 14:37:15,551 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-12-14 14:37:15,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:37:15,552 INFO L225 Difference]: With dead ends: 195 [2022-12-14 14:37:15,552 INFO L226 Difference]: Without dead ends: 184 [2022-12-14 14:37:15,552 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=185, Invalid=937, Unknown=0, NotChecked=0, Total=1122 [2022-12-14 14:37:15,552 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 59 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-14 14:37:15,552 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 2 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-14 14:37:15,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2022-12-14 14:37:15,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 156. [2022-12-14 14:37:15,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 155 states have (on average 2.4838709677419355) internal successors, (385), 155 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:37:15,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 385 transitions. [2022-12-14 14:37:15,555 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 385 transitions. Word has length 20 [2022-12-14 14:37:15,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:37:15,555 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 385 transitions. [2022-12-14 14:37:15,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:37:15,555 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 385 transitions. [2022-12-14 14:37:15,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-14 14:37:15,555 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:37:15,555 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-12-14 14:37:15,559 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Ended with exit code 0 [2022-12-14 14:37:15,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48,44 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:37:15,756 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:37:15,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:37:15,757 INFO L85 PathProgramCache]: Analyzing trace with hash 412930430, now seen corresponding path program 17 times [2022-12-14 14:37:15,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:37:15,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764791725] [2022-12-14 14:37:15,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:37:15,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:37:15,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:37:16,555 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:37:16,555 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:37:16,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764791725] [2022-12-14 14:37:16,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764791725] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:37:16,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1403992784] [2022-12-14 14:37:16,555 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 14:37:16,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:37:16,555 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:37:16,556 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:37:16,557 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2022-12-14 14:37:16,731 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-12-14 14:37:16,731 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:37:16,732 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-14 14:37:16,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:37:17,048 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:37:17,048 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 87 treesize of output 71 [2022-12-14 14:37:17,137 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 14:37:17,137 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 14:37:17,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1403992784] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:37:17,138 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 14:37:17,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 18 [2022-12-14 14:37:17,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141854129] [2022-12-14 14:37:17,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:37:17,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-14 14:37:17,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:37:17,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-14 14:37:17,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2022-12-14 14:37:17,138 INFO L87 Difference]: Start difference. First operand 156 states and 385 transitions. Second operand has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:37:17,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:37:17,547 INFO L93 Difference]: Finished difference Result 189 states and 434 transitions. [2022-12-14 14:37:17,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 14:37:17,547 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-12-14 14:37:17,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:37:17,548 INFO L225 Difference]: With dead ends: 189 [2022-12-14 14:37:17,548 INFO L226 Difference]: Without dead ends: 182 [2022-12-14 14:37:17,548 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=149, Invalid=553, Unknown=0, NotChecked=0, Total=702 [2022-12-14 14:37:17,548 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 102 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 14:37:17,548 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 0 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 14:37:17,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2022-12-14 14:37:17,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 158. [2022-12-14 14:37:17,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 157 states have (on average 2.484076433121019) internal successors, (390), 157 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:37:17,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 390 transitions. [2022-12-14 14:37:17,551 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 390 transitions. Word has length 20 [2022-12-14 14:37:17,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:37:17,551 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 390 transitions. [2022-12-14 14:37:17,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:37:17,552 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 390 transitions. [2022-12-14 14:37:17,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-14 14:37:17,552 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:37:17,552 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-12-14 14:37:17,556 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Forceful destruction successful, exit code 0 [2022-12-14 14:37:17,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2022-12-14 14:37:17,753 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:37:17,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:37:17,754 INFO L85 PathProgramCache]: Analyzing trace with hash 25051610, now seen corresponding path program 18 times [2022-12-14 14:37:17,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:37:17,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768599009] [2022-12-14 14:37:17,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:37:17,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:37:17,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:37:18,565 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:37:18,565 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:37:18,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768599009] [2022-12-14 14:37:18,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768599009] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:37:18,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [961642358] [2022-12-14 14:37:18,565 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 14:37:18,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:37:18,565 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:37:18,566 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:37:18,567 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2022-12-14 14:37:18,661 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 14:37:18,661 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:37:18,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-14 14:37:18,663 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:37:18,952 INFO L321 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2022-12-14 14:37:18,952 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 50 [2022-12-14 14:37:19,014 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 14:37:19,015 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 14:37:19,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [961642358] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:37:19,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 14:37:19,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 19 [2022-12-14 14:37:19,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058793145] [2022-12-14 14:37:19,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:37:19,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-14 14:37:19,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:37:19,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-14 14:37:19,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2022-12-14 14:37:19,016 INFO L87 Difference]: Start difference. First operand 158 states and 390 transitions. Second operand has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:37:19,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:37:19,435 INFO L93 Difference]: Finished difference Result 181 states and 424 transitions. [2022-12-14 14:37:19,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 14:37:19,435 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-12-14 14:37:19,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:37:19,436 INFO L225 Difference]: With dead ends: 181 [2022-12-14 14:37:19,436 INFO L226 Difference]: Without dead ends: 176 [2022-12-14 14:37:19,436 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=151, Invalid=605, Unknown=0, NotChecked=0, Total=756 [2022-12-14 14:37:19,436 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 70 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 14:37:19,436 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 0 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 14:37:19,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2022-12-14 14:37:19,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 146. [2022-12-14 14:37:19,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 145 states have (on average 2.4551724137931035) internal successors, (356), 145 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:37:19,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 356 transitions. [2022-12-14 14:37:19,438 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 356 transitions. Word has length 20 [2022-12-14 14:37:19,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:37:19,438 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 356 transitions. [2022-12-14 14:37:19,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:37:19,438 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 356 transitions. [2022-12-14 14:37:19,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 14:37:19,441 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:37:19,441 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] [2022-12-14 14:37:19,446 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Ended with exit code 0 [2022-12-14 14:37:19,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,46 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:37:19,642 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:37:19,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:37:19,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1003230286, now seen corresponding path program 1 times [2022-12-14 14:37:19,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:37:19,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99214734] [2022-12-14 14:37:19,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:37:19,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:37:19,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:37:19,939 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 14:37:19,939 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:37:19,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99214734] [2022-12-14 14:37:19,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99214734] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:37:19,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [118343987] [2022-12-14 14:37:19,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:37:19,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:37:19,940 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:37:19,940 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:37:19,941 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2022-12-14 14:37:20,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:37:20,065 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 34 conjunts are in the unsatisfiable core [2022-12-14 14:37:20,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:37:20,472 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:37:20,472 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 111 treesize of output 76 [2022-12-14 14:37:20,603 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 14:37:20,603 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:37:20,884 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:37:20,885 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 161 treesize of output 125 [2022-12-14 14:37:21,923 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 14:37:21,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [118343987] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:37:21,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1990194828] [2022-12-14 14:37:21,923 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 14:37:21,924 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:37:21,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2022-12-14 14:37:21,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929325393] [2022-12-14 14:37:21,924 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:37:21,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-12-14 14:37:21,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:37:21,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-12-14 14:37:21,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=998, Unknown=0, NotChecked=0, Total=1190 [2022-12-14 14:37:21,925 INFO L87 Difference]: Start difference. First operand 146 states and 356 transitions. Second operand has 35 states, 34 states have (on average 1.8529411764705883) internal successors, (63), 34 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:37:26,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:37:26,209 INFO L93 Difference]: Finished difference Result 606 states and 1417 transitions. [2022-12-14 14:37:26,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-12-14 14:37:26,209 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.8529411764705883) internal successors, (63), 34 states have internal predecessors, (63), 0 states have call successors, (0), 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-12-14 14:37:26,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:37:26,211 INFO L225 Difference]: With dead ends: 606 [2022-12-14 14:37:26,211 INFO L226 Difference]: Without dead ends: 596 [2022-12-14 14:37:26,211 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1393 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=1026, Invalid=4086, Unknown=0, NotChecked=0, Total=5112 [2022-12-14 14:37:26,211 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 725 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 1476 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 725 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 1509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-12-14 14:37:26,211 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [725 Valid, 117 Invalid, 1509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1476 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-12-14 14:37:26,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2022-12-14 14:37:26,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 222. [2022-12-14 14:37:26,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 221 states have (on average 2.479638009049774) internal successors, (548), 221 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:37:26,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 548 transitions. [2022-12-14 14:37:26,216 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 548 transitions. Word has length 21 [2022-12-14 14:37:26,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:37:26,216 INFO L495 AbstractCegarLoop]: Abstraction has 222 states and 548 transitions. [2022-12-14 14:37:26,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.8529411764705883) internal successors, (63), 34 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:37:26,216 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 548 transitions. [2022-12-14 14:37:26,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 14:37:26,216 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:37:26,216 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] [2022-12-14 14:37:26,221 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Ended with exit code 0 [2022-12-14 14:37:26,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,47 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:37:26,417 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:37:26,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:37:26,418 INFO L85 PathProgramCache]: Analyzing trace with hash 312321560, now seen corresponding path program 2 times [2022-12-14 14:37:26,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:37:26,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110316166] [2022-12-14 14:37:26,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:37:26,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:37:26,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:37:26,750 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 14:37:26,750 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:37:26,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110316166] [2022-12-14 14:37:26,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110316166] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:37:26,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1446433748] [2022-12-14 14:37:26,751 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 14:37:26,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:37:26,751 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:37:26,752 INFO L229 MonitoredProcess]: Starting monitored process 48 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:37:26,752 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2022-12-14 14:37:26,856 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 14:37:26,856 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:37:26,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 30 conjunts are in the unsatisfiable core [2022-12-14 14:37:26,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:37:27,377 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 14:37:27,377 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:37:27,474 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:37:27,474 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 161 treesize of output 125 [2022-12-14 14:37:28,741 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 14:37:28,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1446433748] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:37:28,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1984302084] [2022-12-14 14:37:28,742 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 14:37:28,742 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:37:28,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2022-12-14 14:37:28,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004965802] [2022-12-14 14:37:28,743 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:37:28,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-12-14 14:37:28,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:37:28,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-12-14 14:37:28,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=988, Unknown=0, NotChecked=0, Total=1190 [2022-12-14 14:37:28,743 INFO L87 Difference]: Start difference. First operand 222 states and 548 transitions. Second operand has 35 states, 34 states have (on average 1.8529411764705883) internal successors, (63), 34 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:37:31,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:37:31,017 INFO L93 Difference]: Finished difference Result 465 states and 1084 transitions. [2022-12-14 14:37:31,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-12-14 14:37:31,018 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.8529411764705883) internal successors, (63), 34 states have internal predecessors, (63), 0 states have call successors, (0), 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-12-14 14:37:31,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:37:31,019 INFO L225 Difference]: With dead ends: 465 [2022-12-14 14:37:31,019 INFO L226 Difference]: Without dead ends: 456 [2022-12-14 14:37:31,019 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 789 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=640, Invalid=2782, Unknown=0, NotChecked=0, Total=3422 [2022-12-14 14:37:31,019 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 451 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 1268 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 451 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 1285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-12-14 14:37:31,019 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [451 Valid, 93 Invalid, 1285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1268 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-12-14 14:37:31,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2022-12-14 14:37:31,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 216. [2022-12-14 14:37:31,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 215 states have (on average 2.4604651162790696) internal successors, (529), 215 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:37:31,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 529 transitions. [2022-12-14 14:37:31,023 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 529 transitions. Word has length 21 [2022-12-14 14:37:31,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:37:31,023 INFO L495 AbstractCegarLoop]: Abstraction has 216 states and 529 transitions. [2022-12-14 14:37:31,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.8529411764705883) internal successors, (63), 34 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:37:31,023 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 529 transitions. [2022-12-14 14:37:31,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 14:37:31,024 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:37:31,024 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] [2022-12-14 14:37:31,028 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Ended with exit code 0 [2022-12-14 14:37:31,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 48 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable52 [2022-12-14 14:37:31,225 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:37:31,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:37:31,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1640039538, now seen corresponding path program 3 times [2022-12-14 14:37:31,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:37:31,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825246154] [2022-12-14 14:37:31,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:37:31,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:37:31,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:37:31,538 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 14:37:31,538 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:37:31,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825246154] [2022-12-14 14:37:31,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825246154] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:37:31,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [781326485] [2022-12-14 14:37:31,538 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 14:37:31,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:37:31,539 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:37:31,539 INFO L229 MonitoredProcess]: Starting monitored process 49 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:37:31,540 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2022-12-14 14:37:31,632 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 14:37:31,632 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:37:31,633 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 28 conjunts are in the unsatisfiable core [2022-12-14 14:37:31,634 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:37:32,064 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:37:32,064 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 115 treesize of output 80 [2022-12-14 14:37:32,115 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 14:37:32,115 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:37:32,212 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:37:32,212 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 161 treesize of output 125 [2022-12-14 14:37:33,561 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 14:37:33,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [781326485] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:37:33,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [225838821] [2022-12-14 14:37:33,562 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 14:37:33,563 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:37:33,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2022-12-14 14:37:33,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347101967] [2022-12-14 14:37:33,563 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:37:33,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-12-14 14:37:33,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:37:33,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-12-14 14:37:33,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=989, Unknown=0, NotChecked=0, Total=1190 [2022-12-14 14:37:33,564 INFO L87 Difference]: Start difference. First operand 216 states and 529 transitions. Second operand has 35 states, 34 states have (on average 1.8529411764705883) internal successors, (63), 34 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:37:35,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:37:35,939 INFO L93 Difference]: Finished difference Result 445 states and 1051 transitions. [2022-12-14 14:37:35,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-12-14 14:37:35,939 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.8529411764705883) internal successors, (63), 34 states have internal predecessors, (63), 0 states have call successors, (0), 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-12-14 14:37:35,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:37:35,940 INFO L225 Difference]: With dead ends: 445 [2022-12-14 14:37:35,940 INFO L226 Difference]: Without dead ends: 432 [2022-12-14 14:37:35,941 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 776 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=613, Invalid=2693, Unknown=0, NotChecked=0, Total=3306 [2022-12-14 14:37:35,941 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 398 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 1184 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 1195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-12-14 14:37:35,941 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 68 Invalid, 1195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1184 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-12-14 14:37:35,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2022-12-14 14:37:35,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 210. [2022-12-14 14:37:35,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 209 states have (on average 2.4401913875598087) internal successors, (510), 209 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:37:35,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 510 transitions. [2022-12-14 14:37:35,945 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 510 transitions. Word has length 21 [2022-12-14 14:37:35,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:37:35,945 INFO L495 AbstractCegarLoop]: Abstraction has 210 states and 510 transitions. [2022-12-14 14:37:35,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.8529411764705883) internal successors, (63), 34 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:37:35,945 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 510 transitions. [2022-12-14 14:37:35,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 14:37:35,945 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:37:35,945 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] [2022-12-14 14:37:35,951 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Forceful destruction successful, exit code 0 [2022-12-14 14:37:36,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53,49 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:37:36,147 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:37:36,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:37:36,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1501945000, now seen corresponding path program 4 times [2022-12-14 14:37:36,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:37:36,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769127095] [2022-12-14 14:37:36,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:37:36,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:37:36,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:37:36,537 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 14:37:36,537 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:37:36,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769127095] [2022-12-14 14:37:36,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769127095] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:37:36,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [570110817] [2022-12-14 14:37:36,537 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 14:37:36,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:37:36,538 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:37:36,538 INFO L229 MonitoredProcess]: Starting monitored process 50 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:37:36,539 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2022-12-14 14:37:36,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:37:36,651 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 34 conjunts are in the unsatisfiable core [2022-12-14 14:37:36,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:37:37,244 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:37:37,244 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 115 treesize of output 80 [2022-12-14 14:37:37,310 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 14:37:37,310 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:37:37,435 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:37:37,435 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 161 treesize of output 125 [2022-12-14 14:37:38,438 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 14:37:38,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [570110817] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:37:38,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1392777450] [2022-12-14 14:37:38,438 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 14:37:38,438 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:37:38,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2022-12-14 14:37:38,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010961225] [2022-12-14 14:37:38,439 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:37:38,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-12-14 14:37:38,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:37:38,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-12-14 14:37:38,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=991, Unknown=0, NotChecked=0, Total=1190 [2022-12-14 14:37:38,439 INFO L87 Difference]: Start difference. First operand 210 states and 510 transitions. Second operand has 35 states, 34 states have (on average 1.8529411764705883) internal successors, (63), 34 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:37:41,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:37:41,845 INFO L93 Difference]: Finished difference Result 586 states and 1373 transitions. [2022-12-14 14:37:41,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-12-14 14:37:41,845 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.8529411764705883) internal successors, (63), 34 states have internal predecessors, (63), 0 states have call successors, (0), 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-12-14 14:37:41,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:37:41,848 INFO L225 Difference]: With dead ends: 586 [2022-12-14 14:37:41,848 INFO L226 Difference]: Without dead ends: 548 [2022-12-14 14:37:41,848 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1224 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=843, Invalid=3579, Unknown=0, NotChecked=0, Total=4422 [2022-12-14 14:37:41,848 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 557 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 1169 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 557 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 1194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-12-14 14:37:41,848 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [557 Valid, 39 Invalid, 1194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1169 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-12-14 14:37:41,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2022-12-14 14:37:41,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 180. [2022-12-14 14:37:41,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 179 states have (on average 2.452513966480447) internal successors, (439), 179 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:37:41,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 439 transitions. [2022-12-14 14:37:41,852 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 439 transitions. Word has length 21 [2022-12-14 14:37:41,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:37:41,852 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 439 transitions. [2022-12-14 14:37:41,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.8529411764705883) internal successors, (63), 34 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:37:41,852 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 439 transitions. [2022-12-14 14:37:41,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 14:37:41,852 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:37:41,853 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] [2022-12-14 14:37:41,857 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Forceful destruction successful, exit code 0 [2022-12-14 14:37:42,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable54 [2022-12-14 14:37:42,054 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:37:42,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:37:42,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1650234560, now seen corresponding path program 5 times [2022-12-14 14:37:42,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:37:42,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097474240] [2022-12-14 14:37:42,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:37:42,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:37:42,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:37:42,421 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 14:37:42,421 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:37:42,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097474240] [2022-12-14 14:37:42,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097474240] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:37:42,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [57484874] [2022-12-14 14:37:42,421 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 14:37:42,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:37:42,421 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:37:42,422 INFO L229 MonitoredProcess]: Starting monitored process 51 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:37:42,423 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2022-12-14 14:37:42,607 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 14:37:42,608 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:37:42,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 28 conjunts are in the unsatisfiable core [2022-12-14 14:37:42,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:37:43,029 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:37:43,030 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 111 treesize of output 76 [2022-12-14 14:37:43,156 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 14:37:43,156 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:37:43,453 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:37:43,453 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 161 treesize of output 125 [2022-12-14 14:37:44,423 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 14:37:44,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [57484874] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:37:44,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1928101378] [2022-12-14 14:37:44,424 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 14:37:44,424 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:37:44,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2022-12-14 14:37:44,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306880539] [2022-12-14 14:37:44,425 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:37:44,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-12-14 14:37:44,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:37:44,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-12-14 14:37:44,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=998, Unknown=0, NotChecked=0, Total=1190 [2022-12-14 14:37:44,426 INFO L87 Difference]: Start difference. First operand 180 states and 439 transitions. Second operand has 35 states, 34 states have (on average 1.8529411764705883) internal successors, (63), 34 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:37:47,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:37:47,892 INFO L93 Difference]: Finished difference Result 483 states and 1116 transitions. [2022-12-14 14:37:47,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-12-14 14:37:47,892 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.8529411764705883) internal successors, (63), 34 states have internal predecessors, (63), 0 states have call successors, (0), 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-12-14 14:37:47,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:37:47,893 INFO L225 Difference]: With dead ends: 483 [2022-12-14 14:37:47,893 INFO L226 Difference]: Without dead ends: 478 [2022-12-14 14:37:47,894 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1014 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=795, Invalid=3495, Unknown=0, NotChecked=0, Total=4290 [2022-12-14 14:37:47,894 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 503 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 1684 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 1710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-12-14 14:37:47,894 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [503 Valid, 168 Invalid, 1710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1684 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-12-14 14:37:47,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2022-12-14 14:37:47,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 214. [2022-12-14 14:37:47,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 213 states have (on average 2.5492957746478875) internal successors, (543), 213 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:37:47,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 543 transitions. [2022-12-14 14:37:47,898 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 543 transitions. Word has length 21 [2022-12-14 14:37:47,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:37:47,898 INFO L495 AbstractCegarLoop]: Abstraction has 214 states and 543 transitions. [2022-12-14 14:37:47,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.8529411764705883) internal successors, (63), 34 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:37:47,898 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 543 transitions. [2022-12-14 14:37:47,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 14:37:47,898 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:37:47,899 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] [2022-12-14 14:37:47,903 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Ended with exit code 0 [2022-12-14 14:37:48,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable55 [2022-12-14 14:37:48,100 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:37:48,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:37:48,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1953824010, now seen corresponding path program 6 times [2022-12-14 14:37:48,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:37:48,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151540198] [2022-12-14 14:37:48,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:37:48,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:37:48,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:37:48,439 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 14:37:48,440 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:37:48,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151540198] [2022-12-14 14:37:48,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151540198] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:37:48,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1932788459] [2022-12-14 14:37:48,440 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 14:37:48,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:37:48,440 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:37:48,441 INFO L229 MonitoredProcess]: Starting monitored process 52 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:37:48,441 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2022-12-14 14:37:48,572 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 14:37:48,572 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:37:48,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 28 conjunts are in the unsatisfiable core [2022-12-14 14:37:48,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:37:49,094 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:37:49,094 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 115 treesize of output 80 [2022-12-14 14:37:49,154 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 14:37:49,154 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:37:49,255 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:37:49,255 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 161 treesize of output 125 [2022-12-14 14:37:50,571 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 14:37:50,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1932788459] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:37:50,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1954749313] [2022-12-14 14:37:50,572 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 14:37:50,572 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:37:50,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2022-12-14 14:37:50,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980416656] [2022-12-14 14:37:50,572 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:37:50,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-12-14 14:37:50,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:37:50,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-12-14 14:37:50,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=992, Unknown=0, NotChecked=0, Total=1190 [2022-12-14 14:37:50,573 INFO L87 Difference]: Start difference. First operand 214 states and 543 transitions. Second operand has 35 states, 34 states have (on average 1.8529411764705883) internal successors, (63), 34 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:37:53,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:37:53,931 INFO L93 Difference]: Finished difference Result 485 states and 1118 transitions. [2022-12-14 14:37:53,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-12-14 14:37:53,931 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.8529411764705883) internal successors, (63), 34 states have internal predecessors, (63), 0 states have call successors, (0), 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-12-14 14:37:53,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:37:53,933 INFO L225 Difference]: With dead ends: 485 [2022-12-14 14:37:53,933 INFO L226 Difference]: Without dead ends: 476 [2022-12-14 14:37:53,933 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 947 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=757, Invalid=3275, Unknown=0, NotChecked=0, Total=4032 [2022-12-14 14:37:53,933 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 473 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 1437 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 473 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 1459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-12-14 14:37:53,933 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [473 Valid, 130 Invalid, 1459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1437 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-12-14 14:37:53,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2022-12-14 14:37:53,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 208. [2022-12-14 14:37:53,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 207 states have (on average 2.531400966183575) internal successors, (524), 207 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:37:53,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 524 transitions. [2022-12-14 14:37:53,937 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 524 transitions. Word has length 21 [2022-12-14 14:37:53,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:37:53,937 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 524 transitions. [2022-12-14 14:37:53,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.8529411764705883) internal successors, (63), 34 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:37:53,937 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 524 transitions. [2022-12-14 14:37:53,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 14:37:53,938 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:37:53,938 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] [2022-12-14 14:37:53,942 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Forceful destruction successful, exit code 0 [2022-12-14 14:37:54,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56,52 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:37:54,139 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:37:54,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:37:54,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1462912, now seen corresponding path program 7 times [2022-12-14 14:37:54,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:37:54,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701990625] [2022-12-14 14:37:54,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:37:54,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:37:54,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:37:54,462 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 14:37:54,462 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:37:54,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701990625] [2022-12-14 14:37:54,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701990625] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:37:54,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1497173081] [2022-12-14 14:37:54,463 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 14:37:54,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:37:54,463 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:37:54,464 INFO L229 MonitoredProcess]: Starting monitored process 53 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:37:54,464 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Waiting until timeout for monitored process [2022-12-14 14:37:54,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:37:54,581 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 34 conjunts are in the unsatisfiable core [2022-12-14 14:37:54,582 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:37:55,118 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:37:55,118 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 115 treesize of output 80 [2022-12-14 14:37:55,171 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 14:37:55,171 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:37:55,265 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:37:55,266 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 161 treesize of output 125 [2022-12-14 14:37:56,460 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 14:37:56,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1497173081] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:37:56,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [35658772] [2022-12-14 14:37:56,461 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 14:37:56,461 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:37:56,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2022-12-14 14:37:56,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142530642] [2022-12-14 14:37:56,461 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:37:56,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-12-14 14:37:56,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:37:56,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-12-14 14:37:56,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=998, Unknown=0, NotChecked=0, Total=1190 [2022-12-14 14:37:56,462 INFO L87 Difference]: Start difference. First operand 208 states and 524 transitions. Second operand has 35 states, 34 states have (on average 1.8529411764705883) internal successors, (63), 34 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:38:01,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:38:01,744 INFO L93 Difference]: Finished difference Result 593 states and 1405 transitions. [2022-12-14 14:38:01,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-12-14 14:38:01,745 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.8529411764705883) internal successors, (63), 34 states have internal predecessors, (63), 0 states have call successors, (0), 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-12-14 14:38:01,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:38:01,746 INFO L225 Difference]: With dead ends: 593 [2022-12-14 14:38:01,746 INFO L226 Difference]: Without dead ends: 558 [2022-12-14 14:38:01,747 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1640 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=1157, Invalid=4695, Unknown=0, NotChecked=0, Total=5852 [2022-12-14 14:38:01,747 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 557 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 1307 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 557 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 1350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-12-14 14:38:01,747 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [557 Valid, 102 Invalid, 1350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1307 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-12-14 14:38:01,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2022-12-14 14:38:01,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 194. [2022-12-14 14:38:01,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 193 states have (on average 2.523316062176166) internal successors, (487), 193 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:38:01,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 487 transitions. [2022-12-14 14:38:01,751 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 487 transitions. Word has length 21 [2022-12-14 14:38:01,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:38:01,751 INFO L495 AbstractCegarLoop]: Abstraction has 194 states and 487 transitions. [2022-12-14 14:38:01,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.8529411764705883) internal successors, (63), 34 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:38:01,751 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 487 transitions. [2022-12-14 14:38:01,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 14:38:01,754 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:38:01,754 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] [2022-12-14 14:38:01,758 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Ended with exit code 0 [2022-12-14 14:38:01,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable57 [2022-12-14 14:38:01,955 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:38:01,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:38:01,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1220650376, now seen corresponding path program 8 times [2022-12-14 14:38:01,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:38:01,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889079348] [2022-12-14 14:38:01,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:38:01,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:38:01,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:38:02,306 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 14:38:02,306 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:38:02,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889079348] [2022-12-14 14:38:02,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889079348] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:38:02,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [143684481] [2022-12-14 14:38:02,306 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 14:38:02,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:38:02,306 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:38:02,307 INFO L229 MonitoredProcess]: Starting monitored process 54 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:38:02,308 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2022-12-14 14:38:02,415 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 14:38:02,415 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:38:02,417 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 28 conjunts are in the unsatisfiable core [2022-12-14 14:38:02,418 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:38:02,748 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:38:02,748 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 111 treesize of output 76 [2022-12-14 14:38:02,917 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 14:38:02,917 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:38:03,235 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:38:03,236 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 161 treesize of output 125 [2022-12-14 14:38:03,750 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 14:38:03,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [143684481] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:38:03,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1806477068] [2022-12-14 14:38:03,750 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 14:38:03,750 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:38:03,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2022-12-14 14:38:03,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442729892] [2022-12-14 14:38:03,751 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:38:03,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-12-14 14:38:03,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:38:03,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-12-14 14:38:03,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=1006, Unknown=0, NotChecked=0, Total=1190 [2022-12-14 14:38:03,752 INFO L87 Difference]: Start difference. First operand 194 states and 487 transitions. Second operand has 35 states, 34 states have (on average 1.8529411764705883) internal successors, (63), 34 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:38:06,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:38:06,548 INFO L93 Difference]: Finished difference Result 439 states and 977 transitions. [2022-12-14 14:38:06,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-12-14 14:38:06,549 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.8529411764705883) internal successors, (63), 34 states have internal predecessors, (63), 0 states have call successors, (0), 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-12-14 14:38:06,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:38:06,550 INFO L225 Difference]: With dead ends: 439 [2022-12-14 14:38:06,550 INFO L226 Difference]: Without dead ends: 434 [2022-12-14 14:38:06,551 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 830 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=613, Invalid=2927, Unknown=0, NotChecked=0, Total=3540 [2022-12-14 14:38:06,551 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 337 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 1858 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 1868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1858 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-12-14 14:38:06,551 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 166 Invalid, 1868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1858 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-12-14 14:38:06,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2022-12-14 14:38:06,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 200. [2022-12-14 14:38:06,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 199 states have (on average 2.3618090452261304) internal successors, (470), 199 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:38:06,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 470 transitions. [2022-12-14 14:38:06,557 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 470 transitions. Word has length 21 [2022-12-14 14:38:06,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:38:06,557 INFO L495 AbstractCegarLoop]: Abstraction has 200 states and 470 transitions. [2022-12-14 14:38:06,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.8529411764705883) internal successors, (63), 34 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:38:06,557 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 470 transitions. [2022-12-14 14:38:06,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 14:38:06,558 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:38:06,558 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] [2022-12-14 14:38:06,562 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Forceful destruction successful, exit code 0 [2022-12-14 14:38:06,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable58 [2022-12-14 14:38:06,759 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:38:06,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:38:06,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1189141064, now seen corresponding path program 9 times [2022-12-14 14:38:06,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:38:06,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344999319] [2022-12-14 14:38:06,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:38:06,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:38:06,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:38:07,082 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 14:38:07,082 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:38:07,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344999319] [2022-12-14 14:38:07,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344999319] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:38:07,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [705622168] [2022-12-14 14:38:07,083 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 14:38:07,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:38:07,083 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:38:07,083 INFO L229 MonitoredProcess]: Starting monitored process 55 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:38:07,084 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2022-12-14 14:38:07,181 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 14:38:07,181 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:38:07,182 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 26 conjunts are in the unsatisfiable core [2022-12-14 14:38:07,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:38:07,502 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:38:07,502 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 111 treesize of output 76 [2022-12-14 14:38:07,804 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 14:38:07,805 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:38:08,208 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:38:08,209 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 161 treesize of output 125 [2022-12-14 14:38:09,150 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 14:38:09,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [705622168] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:38:09,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2101994467] [2022-12-14 14:38:09,151 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 14:38:09,151 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:38:09,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 29 [2022-12-14 14:38:09,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570661619] [2022-12-14 14:38:09,152 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:38:09,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-12-14 14:38:09,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:38:09,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-12-14 14:38:09,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=802, Unknown=0, NotChecked=0, Total=930 [2022-12-14 14:38:09,152 INFO L87 Difference]: Start difference. First operand 200 states and 470 transitions. Second operand has 31 states, 30 states have (on average 2.1) internal successors, (63), 30 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:38:13,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:38:13,455 INFO L93 Difference]: Finished difference Result 529 states and 1175 transitions. [2022-12-14 14:38:13,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-12-14 14:38:13,455 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.1) internal successors, (63), 30 states have internal predecessors, (63), 0 states have call successors, (0), 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-12-14 14:38:13,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:38:13,457 INFO L225 Difference]: With dead ends: 529 [2022-12-14 14:38:13,457 INFO L226 Difference]: Without dead ends: 514 [2022-12-14 14:38:13,457 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1123 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=848, Invalid=4264, Unknown=0, NotChecked=0, Total=5112 [2022-12-14 14:38:13,457 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 466 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1970 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2003 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1970 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-12-14 14:38:13,457 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 0 Invalid, 2003 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1970 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-12-14 14:38:13,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2022-12-14 14:38:13,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 218. [2022-12-14 14:38:13,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 217 states have (on average 2.3963133640552994) internal successors, (520), 217 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:38:13,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 520 transitions. [2022-12-14 14:38:13,461 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 520 transitions. Word has length 21 [2022-12-14 14:38:13,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:38:13,461 INFO L495 AbstractCegarLoop]: Abstraction has 218 states and 520 transitions. [2022-12-14 14:38:13,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.1) internal successors, (63), 30 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:38:13,462 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 520 transitions. [2022-12-14 14:38:13,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 14:38:13,462 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:38:13,462 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] [2022-12-14 14:38:13,466 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Forceful destruction successful, exit code 0 [2022-12-14 14:38:13,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 55 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59 [2022-12-14 14:38:13,663 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:38:13,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:38:13,664 INFO L85 PathProgramCache]: Analyzing trace with hash 498232338, now seen corresponding path program 10 times [2022-12-14 14:38:13,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:38:13,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202209449] [2022-12-14 14:38:13,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:38:13,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:38:13,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:38:13,985 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 14:38:13,986 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:38:13,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202209449] [2022-12-14 14:38:13,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202209449] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:38:13,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [849399502] [2022-12-14 14:38:13,986 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 14:38:13,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:38:13,986 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:38:13,987 INFO L229 MonitoredProcess]: Starting monitored process 56 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:38:13,987 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Waiting until timeout for monitored process [2022-12-14 14:38:14,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:38:14,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 34 conjunts are in the unsatisfiable core [2022-12-14 14:38:14,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:38:14,622 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:38:14,622 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 115 treesize of output 80 [2022-12-14 14:38:14,668 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 14:38:14,669 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:38:14,754 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:38:14,755 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 161 treesize of output 125 [2022-12-14 14:38:15,897 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 14:38:15,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [849399502] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:38:15,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [790747334] [2022-12-14 14:38:15,897 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 14:38:15,898 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:38:15,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2022-12-14 14:38:15,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611844983] [2022-12-14 14:38:15,898 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:38:15,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-12-14 14:38:15,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:38:15,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-12-14 14:38:15,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=999, Unknown=0, NotChecked=0, Total=1190 [2022-12-14 14:38:15,899 INFO L87 Difference]: Start difference. First operand 218 states and 520 transitions. Second operand has 35 states, 34 states have (on average 1.8529411764705883) internal successors, (63), 34 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:38:21,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:38:21,027 INFO L93 Difference]: Finished difference Result 590 states and 1323 transitions. [2022-12-14 14:38:21,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-12-14 14:38:21,028 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.8529411764705883) internal successors, (63), 34 states have internal predecessors, (63), 0 states have call successors, (0), 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-12-14 14:38:21,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:38:21,029 INFO L225 Difference]: With dead ends: 590 [2022-12-14 14:38:21,029 INFO L226 Difference]: Without dead ends: 572 [2022-12-14 14:38:21,029 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1488 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=1051, Invalid=4205, Unknown=0, NotChecked=0, Total=5256 [2022-12-14 14:38:21,030 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 549 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 1727 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 549 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 1762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-12-14 14:38:21,030 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [549 Valid, 140 Invalid, 1762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1727 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-12-14 14:38:21,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2022-12-14 14:38:21,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 203. [2022-12-14 14:38:21,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 202 states have (on average 2.371287128712871) internal successors, (479), 202 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:38:21,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 479 transitions. [2022-12-14 14:38:21,033 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 479 transitions. Word has length 21 [2022-12-14 14:38:21,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:38:21,034 INFO L495 AbstractCegarLoop]: Abstraction has 203 states and 479 transitions. [2022-12-14 14:38:21,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.8529411764705883) internal successors, (63), 34 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:38:21,034 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 479 transitions. [2022-12-14 14:38:21,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 14:38:21,034 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:38:21,034 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-12-14 14:38:21,038 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Ended with exit code 0 [2022-12-14 14:38:21,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,56 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:38:21,236 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:38:21,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:38:21,236 INFO L85 PathProgramCache]: Analyzing trace with hash -949159018, now seen corresponding path program 1 times [2022-12-14 14:38:21,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:38:21,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988283668] [2022-12-14 14:38:21,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:38:21,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:38:21,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:38:21,462 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 14:38:21,462 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:38:21,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988283668] [2022-12-14 14:38:21,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988283668] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:38:21,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [783718840] [2022-12-14 14:38:21,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:38:21,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:38:21,463 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:38:21,463 INFO L229 MonitoredProcess]: Starting monitored process 57 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:38:21,464 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Waiting until timeout for monitored process [2022-12-14 14:38:21,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:38:21,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 48 conjunts are in the unsatisfiable core [2022-12-14 14:38:21,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:38:21,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:38:21,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:38:21,586 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 14:38:21,587 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 20 [2022-12-14 14:38:21,630 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 14:38:21,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:38:21,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:38:21,688 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 14:38:21,688 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 18 [2022-12-14 14:38:21,743 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 14:38:21,808 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 14:38:21,891 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 14:38:22,026 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:38:22,026 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:38:22,165 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 14:38:22,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [783718840] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-14 14:38:22,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-14 14:38:22,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 11] total 24 [2022-12-14 14:38:22,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079375101] [2022-12-14 14:38:22,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:38:22,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 14:38:22,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:38:22,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 14:38:22,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=446, Unknown=2, NotChecked=0, Total=552 [2022-12-14 14:38:22,166 INFO L87 Difference]: Start difference. First operand 203 states and 479 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:38:22,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:38:22,733 INFO L93 Difference]: Finished difference Result 457 states and 1059 transitions. [2022-12-14 14:38:22,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-14 14:38:22,733 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 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-12-14 14:38:22,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:38:22,734 INFO L225 Difference]: With dead ends: 457 [2022-12-14 14:38:22,734 INFO L226 Difference]: Without dead ends: 457 [2022-12-14 14:38:22,734 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=167, Invalid=698, Unknown=5, NotChecked=0, Total=870 [2022-12-14 14:38:22,735 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 47 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 3 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 14:38:22,735 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 0 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 302 Invalid, 6 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 14:38:22,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2022-12-14 14:38:22,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 219. [2022-12-14 14:38:22,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 218 states have (on average 2.3807339449541285) internal successors, (519), 218 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-12-14 14:38:22,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 519 transitions. [2022-12-14 14:38:22,742 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 519 transitions. Word has length 21 [2022-12-14 14:38:22,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:38:22,742 INFO L495 AbstractCegarLoop]: Abstraction has 219 states and 519 transitions. [2022-12-14 14:38:22,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:38:22,742 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 519 transitions. [2022-12-14 14:38:22,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 14:38:22,742 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:38:22,742 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-12-14 14:38:22,748 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Ended with exit code 0 [2022-12-14 14:38:22,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61,57 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:38:22,943 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:38:22,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:38:22,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1431283506, now seen corresponding path program 2 times [2022-12-14 14:38:22,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:38:22,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318077396] [2022-12-14 14:38:22,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:38:22,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:38:22,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:38:23,166 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 14:38:23,166 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:38:23,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318077396] [2022-12-14 14:38:23,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318077396] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:38:23,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:38:23,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-14 14:38:23,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315531131] [2022-12-14 14:38:23,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:38:23,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-14 14:38:23,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:38:23,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-14 14:38:23,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-12-14 14:38:23,167 INFO L87 Difference]: Start difference. First operand 219 states and 519 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:38:23,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:38:23,326 INFO L93 Difference]: Finished difference Result 333 states and 760 transitions. [2022-12-14 14:38:23,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 14:38:23,326 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 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-12-14 14:38:23,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:38:23,327 INFO L225 Difference]: With dead ends: 333 [2022-12-14 14:38:23,327 INFO L226 Difference]: Without dead ends: 317 [2022-12-14 14:38:23,327 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2022-12-14 14:38:23,327 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 111 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:38:23,328 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 0 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 14:38:23,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2022-12-14 14:38:23,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 223. [2022-12-14 14:38:23,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 222 states have (on average 2.3828828828828827) internal successors, (529), 222 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:38:23,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 529 transitions. [2022-12-14 14:38:23,331 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 529 transitions. Word has length 21 [2022-12-14 14:38:23,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:38:23,331 INFO L495 AbstractCegarLoop]: Abstraction has 223 states and 529 transitions. [2022-12-14 14:38:23,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:38:23,331 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 529 transitions. [2022-12-14 14:38:23,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 14:38:23,331 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:38:23,331 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-12-14 14:38:23,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2022-12-14 14:38:23,331 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:38:23,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:38:23,331 INFO L85 PathProgramCache]: Analyzing trace with hash -561454698, now seen corresponding path program 3 times [2022-12-14 14:38:23,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:38:23,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761737362] [2022-12-14 14:38:23,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:38:23,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:38:23,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:38:23,571 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 14:38:23,571 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:38:23,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761737362] [2022-12-14 14:38:23,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761737362] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:38:23,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [569361365] [2022-12-14 14:38:23,571 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 14:38:23,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:38:23,572 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:38:23,572 INFO L229 MonitoredProcess]: Starting monitored process 58 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:38:23,573 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Waiting until timeout for monitored process [2022-12-14 14:38:23,671 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 14:38:23,671 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:38:23,672 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-14 14:38:23,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:38:23,756 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 14:38:23,756 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:38:23,870 INFO L321 Elim1Store]: treesize reduction 32, result has 62.4 percent of original size [2022-12-14 14:38:23,870 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 60 [2022-12-14 14:38:23,902 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 14:38:23,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [569361365] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:38:23,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [233501621] [2022-12-14 14:38:23,903 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 14:38:23,903 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:38:23,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 16 [2022-12-14 14:38:23,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237025869] [2022-12-14 14:38:23,904 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:38:23,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-14 14:38:23,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:38:23,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-14 14:38:23,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2022-12-14 14:38:23,904 INFO L87 Difference]: Start difference. First operand 223 states and 529 transitions. Second operand has 16 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:38:24,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:38:24,161 INFO L93 Difference]: Finished difference Result 325 states and 756 transitions. [2022-12-14 14:38:24,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 14:38:24,161 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.625) internal successors, (42), 16 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 21 [2022-12-14 14:38:24,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:38:24,163 INFO L225 Difference]: With dead ends: 325 [2022-12-14 14:38:24,163 INFO L226 Difference]: Without dead ends: 325 [2022-12-14 14:38:24,164 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2022-12-14 14:38:24,164 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 117 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 14:38:24,164 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 0 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 14:38:24,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2022-12-14 14:38:24,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 223. [2022-12-14 14:38:24,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 222 states have (on average 2.3828828828828827) internal successors, (529), 222 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:38:24,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 529 transitions. [2022-12-14 14:38:24,169 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 529 transitions. Word has length 21 [2022-12-14 14:38:24,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:38:24,169 INFO L495 AbstractCegarLoop]: Abstraction has 223 states and 529 transitions. [2022-12-14 14:38:24,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:38:24,169 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 529 transitions. [2022-12-14 14:38:24,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 14:38:24,170 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:38:24,170 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-12-14 14:38:24,174 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Forceful destruction successful, exit code 0 [2022-12-14 14:38:24,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63,58 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:38:24,371 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:38:24,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:38:24,371 INFO L85 PathProgramCache]: Analyzing trace with hash 392938102, now seen corresponding path program 4 times [2022-12-14 14:38:24,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:38:24,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434298046] [2022-12-14 14:38:24,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:38:24,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:38:24,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:38:24,640 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 14:38:24,640 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:38:24,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434298046] [2022-12-14 14:38:24,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434298046] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:38:24,640 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:38:24,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-14 14:38:24,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833554840] [2022-12-14 14:38:24,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:38:24,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-14 14:38:24,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:38:24,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-14 14:38:24,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-12-14 14:38:24,641 INFO L87 Difference]: Start difference. First operand 223 states and 529 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:38:24,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:38:24,830 INFO L93 Difference]: Finished difference Result 335 states and 782 transitions. [2022-12-14 14:38:24,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 14:38:24,831 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 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-12-14 14:38:24,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:38:24,832 INFO L225 Difference]: With dead ends: 335 [2022-12-14 14:38:24,832 INFO L226 Difference]: Without dead ends: 319 [2022-12-14 14:38:24,832 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2022-12-14 14:38:24,832 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 80 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:38:24,832 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 0 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 14:38:24,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2022-12-14 14:38:24,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 233. [2022-12-14 14:38:24,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 232 states have (on average 2.4094827586206895) internal successors, (559), 232 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:38:24,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 559 transitions. [2022-12-14 14:38:24,835 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 559 transitions. Word has length 21 [2022-12-14 14:38:24,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:38:24,836 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 559 transitions. [2022-12-14 14:38:24,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:38:24,836 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 559 transitions. [2022-12-14 14:38:24,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 14:38:24,836 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:38:24,836 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-12-14 14:38:24,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2022-12-14 14:38:24,836 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:38:24,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:38:24,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1262766910, now seen corresponding path program 5 times [2022-12-14 14:38:24,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:38:24,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383502930] [2022-12-14 14:38:24,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:38:24,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:38:24,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:38:25,084 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 14:38:25,084 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:38:25,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383502930] [2022-12-14 14:38:25,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383502930] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:38:25,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [731535197] [2022-12-14 14:38:25,085 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 14:38:25,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:38:25,085 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:38:25,086 INFO L229 MonitoredProcess]: Starting monitored process 59 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:38:25,089 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Waiting until timeout for monitored process [2022-12-14 14:38:25,242 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 14:38:25,242 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:38:25,243 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-14 14:38:25,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:38:25,345 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 14:38:25,345 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:38:25,461 INFO L321 Elim1Store]: treesize reduction 30, result has 58.9 percent of original size [2022-12-14 14:38:25,461 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 50 [2022-12-14 14:38:25,496 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 14:38:25,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [731535197] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:38:25,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1304028651] [2022-12-14 14:38:25,497 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 14:38:25,497 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:38:25,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 6] total 14 [2022-12-14 14:38:25,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127862549] [2022-12-14 14:38:25,497 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:38:25,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-14 14:38:25,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:38:25,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-14 14:38:25,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2022-12-14 14:38:25,498 INFO L87 Difference]: Start difference. First operand 233 states and 559 transitions. Second operand has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:38:25,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:38:25,832 INFO L93 Difference]: Finished difference Result 327 states and 778 transitions. [2022-12-14 14:38:25,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 14:38:25,832 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 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 21 [2022-12-14 14:38:25,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:38:25,833 INFO L225 Difference]: With dead ends: 327 [2022-12-14 14:38:25,833 INFO L226 Difference]: Without dead ends: 327 [2022-12-14 14:38:25,834 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2022-12-14 14:38:25,834 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 120 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 14:38:25,834 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 0 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 14:38:25,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2022-12-14 14:38:25,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 229. [2022-12-14 14:38:25,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 228 states have (on average 2.4078947368421053) internal successors, (549), 228 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:38:25,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 549 transitions. [2022-12-14 14:38:25,838 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 549 transitions. Word has length 21 [2022-12-14 14:38:25,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:38:25,838 INFO L495 AbstractCegarLoop]: Abstraction has 229 states and 549 transitions. [2022-12-14 14:38:25,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:38:25,838 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 549 transitions. [2022-12-14 14:38:25,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 14:38:25,838 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:38:25,838 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-12-14 14:38:25,843 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Ended with exit code 0 [2022-12-14 14:38:26,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 59 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable65 [2022-12-14 14:38:26,039 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:38:26,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:38:26,040 INFO L85 PathProgramCache]: Analyzing trace with hash 2003879060, now seen corresponding path program 6 times [2022-12-14 14:38:26,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:38:26,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646857217] [2022-12-14 14:38:26,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:38:26,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:38:26,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:38:26,292 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 14:38:26,292 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:38:26,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646857217] [2022-12-14 14:38:26,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646857217] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:38:26,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:38:26,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-14 14:38:26,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576008358] [2022-12-14 14:38:26,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:38:26,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-14 14:38:26,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:38:26,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-14 14:38:26,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-12-14 14:38:26,293 INFO L87 Difference]: Start difference. First operand 229 states and 549 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:38:26,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:38:26,516 INFO L93 Difference]: Finished difference Result 395 states and 895 transitions. [2022-12-14 14:38:26,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 14:38:26,516 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 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-12-14 14:38:26,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:38:26,518 INFO L225 Difference]: With dead ends: 395 [2022-12-14 14:38:26,518 INFO L226 Difference]: Without dead ends: 357 [2022-12-14 14:38:26,518 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2022-12-14 14:38:26,518 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 130 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 14:38:26,519 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 0 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 14:38:26,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2022-12-14 14:38:26,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 229. [2022-12-14 14:38:26,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 228 states have (on average 2.3815789473684212) internal successors, (543), 228 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:38:26,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 543 transitions. [2022-12-14 14:38:26,524 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 543 transitions. Word has length 21 [2022-12-14 14:38:26,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:38:26,524 INFO L495 AbstractCegarLoop]: Abstraction has 229 states and 543 transitions. [2022-12-14 14:38:26,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:38:26,524 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 543 transitions. [2022-12-14 14:38:26,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 14:38:26,525 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:38:26,525 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-12-14 14:38:26,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2022-12-14 14:38:26,525 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:38:26,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:38:26,525 INFO L85 PathProgramCache]: Analyzing trace with hash -390048426, now seen corresponding path program 7 times [2022-12-14 14:38:26,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:38:26,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776784687] [2022-12-14 14:38:26,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:38:26,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:38:26,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:38:26,995 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 14:38:26,995 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:38:26,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776784687] [2022-12-14 14:38:26,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776784687] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:38:26,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:38:26,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-14 14:38:26,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470720007] [2022-12-14 14:38:26,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:38:26,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-14 14:38:26,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:38:26,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-14 14:38:26,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-12-14 14:38:26,996 INFO L87 Difference]: Start difference. First operand 229 states and 543 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:38:27,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:38:27,288 INFO L93 Difference]: Finished difference Result 319 states and 722 transitions. [2022-12-14 14:38:27,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 14:38:27,289 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 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-12-14 14:38:27,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:38:27,290 INFO L225 Difference]: With dead ends: 319 [2022-12-14 14:38:27,290 INFO L226 Difference]: Without dead ends: 275 [2022-12-14 14:38:27,290 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2022-12-14 14:38:27,290 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 119 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 14:38:27,290 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 0 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 14:38:27,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2022-12-14 14:38:27,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 213. [2022-12-14 14:38:27,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 212 states have (on average 2.3726415094339623) internal successors, (503), 212 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:38:27,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 503 transitions. [2022-12-14 14:38:27,293 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 503 transitions. Word has length 21 [2022-12-14 14:38:27,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:38:27,293 INFO L495 AbstractCegarLoop]: Abstraction has 213 states and 503 transitions. [2022-12-14 14:38:27,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:38:27,293 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 503 transitions. [2022-12-14 14:38:27,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 14:38:27,294 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:38:27,294 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-12-14 14:38:27,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2022-12-14 14:38:27,294 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:38:27,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:38:27,294 INFO L85 PathProgramCache]: Analyzing trace with hash -671295680, now seen corresponding path program 8 times [2022-12-14 14:38:27,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:38:27,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101003762] [2022-12-14 14:38:27,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:38:27,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:38:27,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:38:27,625 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 14:38:27,625 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:38:27,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101003762] [2022-12-14 14:38:27,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101003762] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:38:27,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:38:27,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-14 14:38:27,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70339715] [2022-12-14 14:38:27,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:38:27,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-14 14:38:27,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:38:27,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-14 14:38:27,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-12-14 14:38:27,626 INFO L87 Difference]: Start difference. First operand 213 states and 503 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:38:27,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:38:27,894 INFO L93 Difference]: Finished difference Result 299 states and 688 transitions. [2022-12-14 14:38:27,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 14:38:27,894 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 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-12-14 14:38:27,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:38:27,895 INFO L225 Difference]: With dead ends: 299 [2022-12-14 14:38:27,895 INFO L226 Difference]: Without dead ends: 283 [2022-12-14 14:38:27,895 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-12-14 14:38:27,895 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 77 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 14:38:27,895 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 0 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 14:38:27,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2022-12-14 14:38:27,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 217. [2022-12-14 14:38:27,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 216 states have (on average 2.375) internal successors, (513), 216 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:38:27,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 513 transitions. [2022-12-14 14:38:27,898 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 513 transitions. Word has length 21 [2022-12-14 14:38:27,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:38:27,898 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 513 transitions. [2022-12-14 14:38:27,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:38:27,898 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 513 transitions. [2022-12-14 14:38:27,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 14:38:27,898 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:38:27,899 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-12-14 14:38:27,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2022-12-14 14:38:27,899 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:38:27,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:38:27,899 INFO L85 PathProgramCache]: Analyzing trace with hash 523593592, now seen corresponding path program 9 times [2022-12-14 14:38:27,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:38:27,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001463275] [2022-12-14 14:38:27,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:38:27,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:38:27,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:38:28,339 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 14:38:28,339 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:38:28,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001463275] [2022-12-14 14:38:28,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001463275] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:38:28,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [106768635] [2022-12-14 14:38:28,339 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 14:38:28,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:38:28,339 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:38:28,340 INFO L229 MonitoredProcess]: Starting monitored process 60 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:38:28,341 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Waiting until timeout for monitored process [2022-12-14 14:38:28,456 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 14:38:28,456 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:38:28,457 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-14 14:38:28,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:38:28,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:38:28,651 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-14 14:38:28,805 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 14:38:28,806 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:38:28,941 WARN L837 $PredicateComparison]: unable to prove that (forall ((~get2~0.base Int) (v_ArrVal_2481 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2481))) (let ((.cse0 (select .cse1 ~get2~0.base))) (or (= |c_thread1Thread1of1ForFork1_#t~mem2| (select .cse0 (+ c_~get2~0.offset (* c_thread1Thread1of1ForFork1_~i~0 4)))) (not (= (select (select .cse1 c_~get1~0.base) c_~get1~0.offset) (select .cse0 c_~get2~0.offset))))))) is different from false [2022-12-14 14:38:28,994 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:38:28,994 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 116 treesize of output 148 [2022-12-14 14:38:29,027 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:38:29,027 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 84 [2022-12-14 14:38:29,769 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 14:38:29,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [106768635] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:38:29,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1847827556] [2022-12-14 14:38:29,770 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 14:38:29,770 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:38:29,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 8] total 25 [2022-12-14 14:38:29,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604177097] [2022-12-14 14:38:29,771 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:38:29,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-14 14:38:29,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:38:29,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-14 14:38:29,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=506, Unknown=1, NotChecked=46, Total=650 [2022-12-14 14:38:29,771 INFO L87 Difference]: Start difference. First operand 217 states and 513 transitions. Second operand has 26 states, 26 states have (on average 1.8846153846153846) internal successors, (49), 25 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-12-14 14:38:30,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:38:30,923 INFO L93 Difference]: Finished difference Result 560 states and 1309 transitions. [2022-12-14 14:38:30,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-14 14:38:30,923 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.8846153846153846) internal successors, (49), 25 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 21 [2022-12-14 14:38:30,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:38:30,925 INFO L225 Difference]: With dead ends: 560 [2022-12-14 14:38:30,925 INFO L226 Difference]: Without dead ends: 560 [2022-12-14 14:38:30,925 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=272, Invalid=1137, Unknown=1, NotChecked=72, Total=1482 [2022-12-14 14:38:30,925 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 242 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 566 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 73 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-14 14:38:30,925 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 0 Invalid, 650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 566 Invalid, 0 Unknown, 73 Unchecked, 0.6s Time] [2022-12-14 14:38:30,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2022-12-14 14:38:30,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 219. [2022-12-14 14:38:30,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 218 states have (on average 2.371559633027523) internal successors, (517), 218 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:38:30,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 517 transitions. [2022-12-14 14:38:30,929 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 517 transitions. Word has length 21 [2022-12-14 14:38:30,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:38:30,929 INFO L495 AbstractCegarLoop]: Abstraction has 219 states and 517 transitions. [2022-12-14 14:38:30,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.8846153846153846) internal successors, (49), 25 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-12-14 14:38:30,929 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 517 transitions. [2022-12-14 14:38:30,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 14:38:30,929 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:38:30,930 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-12-14 14:38:30,934 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Forceful destruction successful, exit code 0 [2022-12-14 14:38:31,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69,60 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:38:31,131 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:38:31,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:38:31,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1602190620, now seen corresponding path program 10 times [2022-12-14 14:38:31,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:38:31,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072389560] [2022-12-14 14:38:31,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:38:31,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:38:31,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:38:31,406 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 14:38:31,406 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:38:31,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072389560] [2022-12-14 14:38:31,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072389560] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:38:31,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [960521601] [2022-12-14 14:38:31,407 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 14:38:31,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:38:31,407 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:38:31,408 INFO L229 MonitoredProcess]: Starting monitored process 61 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:38:31,408 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Waiting until timeout for monitored process [2022-12-14 14:38:31,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:38:31,521 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 51 conjunts are in the unsatisfiable core [2022-12-14 14:38:31,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:38:31,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:38:31,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:38:31,548 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 14:38:31,548 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 16 [2022-12-14 14:38:31,603 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 14:38:31,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:38:31,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:38:31,685 INFO L321 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2022-12-14 14:38:31,685 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 21 treesize of output 25 [2022-12-14 14:38:31,750 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 14:38:31,811 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 14:38:31,864 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 14:38:32,067 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:38:32,067 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:38:32,189 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 14:38:32,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [960521601] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-14 14:38:32,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-14 14:38:32,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8, 11] total 23 [2022-12-14 14:38:32,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786158860] [2022-12-14 14:38:32,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:38:32,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 14:38:32,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:38:32,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 14:38:32,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2022-12-14 14:38:32,191 INFO L87 Difference]: Start difference. First operand 219 states and 517 transitions. Second operand has 6 states, 6 states have (on average 3.5) 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-12-14 14:38:32,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:38:32,476 INFO L93 Difference]: Finished difference Result 347 states and 815 transitions. [2022-12-14 14:38:32,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 14:38:32,477 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) 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-12-14 14:38:32,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:38:32,478 INFO L225 Difference]: With dead ends: 347 [2022-12-14 14:38:32,478 INFO L226 Difference]: Without dead ends: 347 [2022-12-14 14:38:32,478 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=110, Invalid=540, Unknown=0, NotChecked=0, Total=650 [2022-12-14 14:38:32,478 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 45 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 14:38:32,478 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 1 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 14:38:32,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2022-12-14 14:38:32,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 229. [2022-12-14 14:38:32,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 228 states have (on average 2.3771929824561404) internal successors, (542), 228 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:38:32,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 542 transitions. [2022-12-14 14:38:32,482 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 542 transitions. Word has length 21 [2022-12-14 14:38:32,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:38:32,482 INFO L495 AbstractCegarLoop]: Abstraction has 229 states and 542 transitions. [2022-12-14 14:38:32,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) 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-12-14 14:38:32,482 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 542 transitions. [2022-12-14 14:38:32,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 14:38:32,482 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:38:32,483 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-12-14 14:38:32,487 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Forceful destruction successful, exit code 0 [2022-12-14 14:38:32,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70,61 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:38:32,684 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:38:32,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:38:32,685 INFO L85 PathProgramCache]: Analyzing trace with hash -2084315108, now seen corresponding path program 11 times [2022-12-14 14:38:32,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:38:32,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109847713] [2022-12-14 14:38:32,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:38:32,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:38:32,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:38:32,999 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 14:38:32,999 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:38:32,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109847713] [2022-12-14 14:38:32,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109847713] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:38:32,999 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:38:32,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-14 14:38:32,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056780914] [2022-12-14 14:38:32,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:38:32,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-14 14:38:33,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:38:33,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-14 14:38:33,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-12-14 14:38:33,000 INFO L87 Difference]: Start difference. First operand 229 states and 542 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:38:33,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:38:33,184 INFO L93 Difference]: Finished difference Result 267 states and 599 transitions. [2022-12-14 14:38:33,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 14:38:33,184 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 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-12-14 14:38:33,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:38:33,185 INFO L225 Difference]: With dead ends: 267 [2022-12-14 14:38:33,185 INFO L226 Difference]: Without dead ends: 251 [2022-12-14 14:38:33,185 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2022-12-14 14:38:33,185 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 58 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:38:33,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 0 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 14:38:33,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2022-12-14 14:38:33,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 233. [2022-12-14 14:38:33,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 232 states have (on average 2.3793103448275863) internal successors, (552), 232 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:38:33,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 552 transitions. [2022-12-14 14:38:33,188 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 552 transitions. Word has length 21 [2022-12-14 14:38:33,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:38:33,189 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 552 transitions. [2022-12-14 14:38:33,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:38:33,189 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 552 transitions. [2022-12-14 14:38:33,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 14:38:33,189 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:38:33,189 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-12-14 14:38:33,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2022-12-14 14:38:33,189 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:38:33,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:38:33,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1214486300, now seen corresponding path program 12 times [2022-12-14 14:38:33,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:38:33,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550749511] [2022-12-14 14:38:33,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:38:33,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:38:33,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:38:33,425 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 14:38:33,425 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:38:33,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550749511] [2022-12-14 14:38:33,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550749511] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:38:33,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [547913827] [2022-12-14 14:38:33,425 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 14:38:33,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:38:33,425 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:38:33,426 INFO L229 MonitoredProcess]: Starting monitored process 62 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:38:33,430 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Waiting until timeout for monitored process [2022-12-14 14:38:33,543 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 14:38:33,543 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:38:33,543 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-14 14:38:33,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:38:33,643 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 14:38:33,643 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:38:33,751 INFO L321 Elim1Store]: treesize reduction 32, result has 62.4 percent of original size [2022-12-14 14:38:33,751 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 60 [2022-12-14 14:38:33,787 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 14:38:33,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [547913827] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:38:33,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1961702667] [2022-12-14 14:38:33,787 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 14:38:33,788 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:38:33,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 16 [2022-12-14 14:38:33,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654036277] [2022-12-14 14:38:33,788 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:38:33,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-14 14:38:33,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:38:33,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-14 14:38:33,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2022-12-14 14:38:33,788 INFO L87 Difference]: Start difference. First operand 233 states and 552 transitions. Second operand has 16 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:38:34,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:38:34,127 INFO L93 Difference]: Finished difference Result 259 states and 595 transitions. [2022-12-14 14:38:34,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 14:38:34,128 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.625) internal successors, (42), 16 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 21 [2022-12-14 14:38:34,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:38:34,128 INFO L225 Difference]: With dead ends: 259 [2022-12-14 14:38:34,129 INFO L226 Difference]: Without dead ends: 259 [2022-12-14 14:38:34,129 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=105, Invalid=315, Unknown=0, NotChecked=0, Total=420 [2022-12-14 14:38:34,129 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 75 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 14:38:34,129 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 0 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 14:38:34,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2022-12-14 14:38:34,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 225. [2022-12-14 14:38:34,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 224 states have (on average 2.375) internal successors, (532), 224 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:38:34,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 532 transitions. [2022-12-14 14:38:34,132 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 532 transitions. Word has length 21 [2022-12-14 14:38:34,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:38:34,132 INFO L495 AbstractCegarLoop]: Abstraction has 225 states and 532 transitions. [2022-12-14 14:38:34,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:38:34,132 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 532 transitions. [2022-12-14 14:38:34,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 14:38:34,132 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:38:34,132 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-12-14 14:38:34,136 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Ended with exit code 0 [2022-12-14 14:38:34,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72,62 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:38:34,333 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:38:34,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:38:34,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1495896476, now seen corresponding path program 13 times [2022-12-14 14:38:34,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:38:34,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798523928] [2022-12-14 14:38:34,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:38:34,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:38:34,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:38:34,546 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 14:38:34,547 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:38:34,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798523928] [2022-12-14 14:38:34,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798523928] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:38:34,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [741672709] [2022-12-14 14:38:34,547 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 14:38:34,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:38:34,547 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:38:34,548 INFO L229 MonitoredProcess]: Starting monitored process 63 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:38:34,548 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Waiting until timeout for monitored process [2022-12-14 14:38:34,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:38:34,676 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-14 14:38:34,677 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:38:34,766 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 14:38:34,766 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:38:34,867 INFO L321 Elim1Store]: treesize reduction 30, result has 58.9 percent of original size [2022-12-14 14:38:34,868 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 50 [2022-12-14 14:38:34,891 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 14:38:34,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [741672709] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:38:34,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [478951626] [2022-12-14 14:38:34,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:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 14:38:34,892 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:38:34,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 6] total 14 [2022-12-14 14:38:34,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054645813] [2022-12-14 14:38:34,892 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:38:34,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-14 14:38:34,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:38:34,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-14 14:38:34,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2022-12-14 14:38:34,893 INFO L87 Difference]: Start difference. First operand 225 states and 532 transitions. Second operand has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 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-12-14 14:38:35,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:38:35,206 INFO L93 Difference]: Finished difference Result 265 states and 602 transitions. [2022-12-14 14:38:35,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 14:38:35,207 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 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 21 [2022-12-14 14:38:35,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:38:35,207 INFO L225 Difference]: With dead ends: 265 [2022-12-14 14:38:35,207 INFO L226 Difference]: Without dead ends: 265 [2022-12-14 14:38:35,207 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=283, Unknown=0, NotChecked=0, Total=380 [2022-12-14 14:38:35,208 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 91 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 14:38:35,208 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 0 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 14:38:35,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2022-12-14 14:38:35,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 213. [2022-12-14 14:38:35,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 212 states have (on average 2.349056603773585) internal successors, (498), 212 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:38:35,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 498 transitions. [2022-12-14 14:38:35,210 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 498 transitions. Word has length 21 [2022-12-14 14:38:35,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:38:35,211 INFO L495 AbstractCegarLoop]: Abstraction has 213 states and 498 transitions. [2022-12-14 14:38:35,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 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-12-14 14:38:35,211 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 498 transitions. [2022-12-14 14:38:35,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 14:38:35,211 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:38:35,211 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] [2022-12-14 14:38:35,216 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Ended with exit code 0 [2022-12-14 14:38:35,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73,63 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:38:35,412 INFO L420 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:38:35,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:38:35,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1958948879, now seen corresponding path program 11 times [2022-12-14 14:38:35,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:38:35,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359999442] [2022-12-14 14:38:35,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:38:35,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:38:35,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:38:35,724 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 14:38:35,725 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:38:35,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359999442] [2022-12-14 14:38:35,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359999442] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:38:35,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1774936293] [2022-12-14 14:38:35,725 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 14:38:35,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:38:35,725 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:38:35,726 INFO L229 MonitoredProcess]: Starting monitored process 64 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:38:35,726 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Waiting until timeout for monitored process [2022-12-14 14:38:35,845 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 14:38:35,845 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:38:35,846 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 34 conjunts are in the unsatisfiable core [2022-12-14 14:38:35,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:38:36,204 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:38:36,205 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 111 treesize of output 76 [2022-12-14 14:38:36,325 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 14:38:36,325 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:38:36,613 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:38:36,613 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 161 treesize of output 125 [2022-12-14 14:38:37,677 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 14:38:37,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1774936293] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:38:37,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1370072598] [2022-12-14 14:38:37,677 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 14:38:37,677 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:38:37,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 32 [2022-12-14 14:38:37,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440161166] [2022-12-14 14:38:37,678 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:38:37,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-12-14 14:38:37,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:38:37,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-12-14 14:38:37,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=916, Unknown=0, NotChecked=0, Total=1122 [2022-12-14 14:38:37,678 INFO L87 Difference]: Start difference. First operand 213 states and 498 transitions. Second operand has 34 states, 33 states have (on average 1.9090909090909092) internal successors, (63), 33 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:38:40,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:38:40,249 INFO L93 Difference]: Finished difference Result 602 states and 1392 transitions. [2022-12-14 14:38:40,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-12-14 14:38:40,249 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.9090909090909092) internal successors, (63), 33 states have internal predecessors, (63), 0 states have call successors, (0), 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-12-14 14:38:40,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:38:40,250 INFO L225 Difference]: With dead ends: 602 [2022-12-14 14:38:40,250 INFO L226 Difference]: Without dead ends: 592 [2022-12-14 14:38:40,251 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 856 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=760, Invalid=3022, Unknown=0, NotChecked=0, Total=3782 [2022-12-14 14:38:40,251 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 496 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 1573 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 1591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-12-14 14:38:40,251 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 131 Invalid, 1591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1573 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-12-14 14:38:40,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2022-12-14 14:38:40,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 249. [2022-12-14 14:38:40,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 248 states have (on average 2.4193548387096775) internal successors, (600), 248 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:38:40,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 600 transitions. [2022-12-14 14:38:40,255 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 600 transitions. Word has length 21 [2022-12-14 14:38:40,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:38:40,255 INFO L495 AbstractCegarLoop]: Abstraction has 249 states and 600 transitions. [2022-12-14 14:38:40,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.9090909090909092) internal successors, (63), 33 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:38:40,256 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 600 transitions. [2022-12-14 14:38:40,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 14:38:40,256 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:38:40,256 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] [2022-12-14 14:38:40,260 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Ended with exit code 0 [2022-12-14 14:38:40,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 64 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable74 [2022-12-14 14:38:40,457 INFO L420 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:38:40,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:38:40,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1268040153, now seen corresponding path program 12 times [2022-12-14 14:38:40,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:38:40,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338266589] [2022-12-14 14:38:40,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:38:40,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:38:40,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:38:40,751 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 14:38:40,751 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:38:40,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338266589] [2022-12-14 14:38:40,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338266589] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:38:40,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [836943131] [2022-12-14 14:38:40,751 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 14:38:40,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:38:40,752 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:38:40,752 INFO L229 MonitoredProcess]: Starting monitored process 65 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:38:40,753 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Waiting until timeout for monitored process [2022-12-14 14:38:40,870 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 14:38:40,870 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:38:40,871 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 30 conjunts are in the unsatisfiable core [2022-12-14 14:38:40,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:38:41,298 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 14:38:41,298 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:38:41,403 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:38:41,403 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 161 treesize of output 125 [2022-12-14 14:38:42,538 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 14:38:42,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [836943131] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:38:42,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [819634479] [2022-12-14 14:38:42,539 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 14:38:42,539 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:38:42,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2022-12-14 14:38:42,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47373372] [2022-12-14 14:38:42,539 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:38:42,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-12-14 14:38:42,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:38:42,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-12-14 14:38:42,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=805, Unknown=0, NotChecked=0, Total=992 [2022-12-14 14:38:42,540 INFO L87 Difference]: Start difference. First operand 249 states and 600 transitions. Second operand has 32 states, 31 states have (on average 2.032258064516129) internal successors, (63), 31 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:38:44,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:38:44,515 INFO L93 Difference]: Finished difference Result 499 states and 1115 transitions. [2022-12-14 14:38:44,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-14 14:38:44,516 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.032258064516129) internal successors, (63), 31 states have internal predecessors, (63), 0 states have call successors, (0), 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-12-14 14:38:44,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:38:44,516 INFO L225 Difference]: With dead ends: 499 [2022-12-14 14:38:44,516 INFO L226 Difference]: Without dead ends: 490 [2022-12-14 14:38:44,517 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 577 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=530, Invalid=2226, Unknown=0, NotChecked=0, Total=2756 [2022-12-14 14:38:44,517 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 373 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 1118 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 1134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-12-14 14:38:44,517 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 84 Invalid, 1134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1118 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-12-14 14:38:44,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2022-12-14 14:38:44,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 249. [2022-12-14 14:38:44,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 248 states have (on average 2.411290322580645) internal successors, (598), 248 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:38:44,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 598 transitions. [2022-12-14 14:38:44,521 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 598 transitions. Word has length 21 [2022-12-14 14:38:44,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:38:44,521 INFO L495 AbstractCegarLoop]: Abstraction has 249 states and 598 transitions. [2022-12-14 14:38:44,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.032258064516129) internal successors, (63), 31 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:38:44,521 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 598 transitions. [2022-12-14 14:38:44,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 14:38:44,522 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:38:44,522 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] [2022-12-14 14:38:44,526 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Ended with exit code 0 [2022-12-14 14:38:44,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 65 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable75 [2022-12-14 14:38:44,723 INFO L420 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:38:44,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:38:44,724 INFO L85 PathProgramCache]: Analyzing trace with hash -684320945, now seen corresponding path program 13 times [2022-12-14 14:38:44,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:38:44,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587465124] [2022-12-14 14:38:44,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:38:44,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:38:44,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:38:45,003 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 14:38:45,003 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:38:45,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587465124] [2022-12-14 14:38:45,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587465124] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:38:45,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [826815731] [2022-12-14 14:38:45,004 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 14:38:45,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:38:45,004 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:38:45,004 INFO L229 MonitoredProcess]: Starting monitored process 66 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:38:45,005 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Waiting until timeout for monitored process [2022-12-14 14:38:45,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:38:45,122 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 30 conjunts are in the unsatisfiable core [2022-12-14 14:38:45,123 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:38:45,587 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 14:38:45,588 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:38:45,708 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:38:45,708 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 161 treesize of output 125 [2022-12-14 14:38:46,938 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 14:38:46,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [826815731] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:38:46,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1698808371] [2022-12-14 14:38:46,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:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 14:38:46,939 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:38:46,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2022-12-14 14:38:46,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969816966] [2022-12-14 14:38:46,939 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:38:46,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-12-14 14:38:46,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:38:46,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-12-14 14:38:46,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=802, Unknown=0, NotChecked=0, Total=992 [2022-12-14 14:38:46,939 INFO L87 Difference]: Start difference. First operand 249 states and 598 transitions. Second operand has 32 states, 31 states have (on average 2.032258064516129) internal successors, (63), 31 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:38:48,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:38:48,588 INFO L93 Difference]: Finished difference Result 473 states and 1075 transitions. [2022-12-14 14:38:48,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-14 14:38:48,589 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.032258064516129) internal successors, (63), 31 states have internal predecessors, (63), 0 states have call successors, (0), 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-12-14 14:38:48,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:38:48,590 INFO L225 Difference]: With dead ends: 473 [2022-12-14 14:38:48,590 INFO L226 Difference]: Without dead ends: 460 [2022-12-14 14:38:48,590 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 584 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=511, Invalid=2141, Unknown=0, NotChecked=0, Total=2652 [2022-12-14 14:38:48,590 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 321 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 857 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 857 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-14 14:38:48,590 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 46 Invalid, 866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 857 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-12-14 14:38:48,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2022-12-14 14:38:48,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 249. [2022-12-14 14:38:48,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 248 states have (on average 2.403225806451613) internal successors, (596), 248 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:38:48,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 596 transitions. [2022-12-14 14:38:48,594 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 596 transitions. Word has length 21 [2022-12-14 14:38:48,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:38:48,594 INFO L495 AbstractCegarLoop]: Abstraction has 249 states and 596 transitions. [2022-12-14 14:38:48,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.032258064516129) internal successors, (63), 31 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:38:48,594 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 596 transitions. [2022-12-14 14:38:48,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 14:38:48,595 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:38:48,595 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] [2022-12-14 14:38:48,599 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Forceful destruction successful, exit code 0 [2022-12-14 14:38:48,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76,66 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:38:48,796 INFO L420 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:38:48,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:38:48,797 INFO L85 PathProgramCache]: Analyzing trace with hash -546226407, now seen corresponding path program 14 times [2022-12-14 14:38:48,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:38:48,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241757903] [2022-12-14 14:38:48,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:38:48,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:38:48,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:38:49,074 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 14:38:49,074 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:38:49,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241757903] [2022-12-14 14:38:49,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241757903] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:38:49,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [755346087] [2022-12-14 14:38:49,074 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 14:38:49,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:38:49,074 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:38:49,075 INFO L229 MonitoredProcess]: Starting monitored process 67 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:38:49,076 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Waiting until timeout for monitored process [2022-12-14 14:38:49,280 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 14:38:49,280 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:38:49,281 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 28 conjunts are in the unsatisfiable core [2022-12-14 14:38:49,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:38:49,713 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:38:49,713 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 115 treesize of output 80 [2022-12-14 14:38:49,772 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 14:38:49,772 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:38:49,879 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:38:49,879 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 161 treesize of output 125 [2022-12-14 14:38:50,761 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 14:38:50,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [755346087] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:38:50,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [78709767] [2022-12-14 14:38:50,762 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 14:38:50,762 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:38:50,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2022-12-14 14:38:50,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269833033] [2022-12-14 14:38:50,762 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:38:50,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-12-14 14:38:50,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:38:50,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-12-14 14:38:50,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=797, Unknown=0, NotChecked=0, Total=992 [2022-12-14 14:38:50,763 INFO L87 Difference]: Start difference. First operand 249 states and 596 transitions. Second operand has 32 states, 31 states have (on average 2.032258064516129) internal successors, (63), 31 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:38:52,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:38:52,365 INFO L93 Difference]: Finished difference Result 441 states and 995 transitions. [2022-12-14 14:38:52,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-14 14:38:52,365 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.032258064516129) internal successors, (63), 31 states have internal predecessors, (63), 0 states have call successors, (0), 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-12-14 14:38:52,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:38:52,366 INFO L225 Difference]: With dead ends: 441 [2022-12-14 14:38:52,367 INFO L226 Difference]: Without dead ends: 422 [2022-12-14 14:38:52,367 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 506 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=450, Invalid=1902, Unknown=0, NotChecked=0, Total=2352 [2022-12-14 14:38:52,367 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 269 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 1083 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 1086 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1083 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-12-14 14:38:52,367 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 40 Invalid, 1086 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1083 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-12-14 14:38:52,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2022-12-14 14:38:52,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 249. [2022-12-14 14:38:52,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 248 states have (on average 2.3870967741935485) internal successors, (592), 248 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:38:52,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 592 transitions. [2022-12-14 14:38:52,371 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 592 transitions. Word has length 21 [2022-12-14 14:38:52,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:38:52,371 INFO L495 AbstractCegarLoop]: Abstraction has 249 states and 592 transitions. [2022-12-14 14:38:52,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.032258064516129) internal successors, (63), 31 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:38:52,371 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 592 transitions. [2022-12-14 14:38:52,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 14:38:52,371 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:38:52,371 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] [2022-12-14 14:38:52,376 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Forceful destruction successful, exit code 0 [2022-12-14 14:38:52,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77,67 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:38:52,573 INFO L420 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:38:52,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:38:52,573 INFO L85 PathProgramCache]: Analyzing trace with hash -694515967, now seen corresponding path program 15 times [2022-12-14 14:38:52,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:38:52,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800754193] [2022-12-14 14:38:52,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:38:52,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:38:52,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:38:52,910 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 14:38:52,910 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:38:52,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800754193] [2022-12-14 14:38:52,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800754193] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:38:52,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1652297] [2022-12-14 14:38:52,910 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 14:38:52,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:38:52,910 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:38:52,911 INFO L229 MonitoredProcess]: Starting monitored process 68 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:38:52,911 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Waiting until timeout for monitored process [2022-12-14 14:38:53,031 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 14:38:53,031 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:38:53,032 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 28 conjunts are in the unsatisfiable core [2022-12-14 14:38:53,033 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:38:53,308 INFO L321 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2022-12-14 14:38:53,308 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 32 [2022-12-14 14:38:53,528 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 14:38:53,528 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:38:53,921 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:38:53,921 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 161 treesize of output 125 [2022-12-14 14:38:54,822 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 14:38:54,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1652297] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:38:54,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1998131351] [2022-12-14 14:38:54,822 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 14:38:54,822 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:38:54,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2022-12-14 14:38:54,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999379099] [2022-12-14 14:38:54,822 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:38:54,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-12-14 14:38:54,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:38:54,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-12-14 14:38:54,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=805, Unknown=0, NotChecked=0, Total=930 [2022-12-14 14:38:54,823 INFO L87 Difference]: Start difference. First operand 249 states and 592 transitions. Second operand has 31 states, 30 states have (on average 2.1) internal successors, (63), 31 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:39:00,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:39:00,745 INFO L93 Difference]: Finished difference Result 655 states and 1468 transitions. [2022-12-14 14:39:00,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2022-12-14 14:39:00,746 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.1) internal successors, (63), 31 states have internal predecessors, (63), 0 states have call successors, (0), 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-12-14 14:39:00,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:39:00,747 INFO L225 Difference]: With dead ends: 655 [2022-12-14 14:39:00,747 INFO L226 Difference]: Without dead ends: 630 [2022-12-14 14:39:00,747 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2184 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=1377, Invalid=6813, Unknown=0, NotChecked=0, Total=8190 [2022-12-14 14:39:00,747 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 569 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1986 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 569 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2046 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1986 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-12-14 14:39:00,747 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [569 Valid, 0 Invalid, 2046 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1986 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-12-14 14:39:00,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2022-12-14 14:39:00,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 297. [2022-12-14 14:39:00,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 296 states have (on average 2.527027027027027) internal successors, (748), 296 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:39:00,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 748 transitions. [2022-12-14 14:39:00,752 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 748 transitions. Word has length 21 [2022-12-14 14:39:00,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:39:00,752 INFO L495 AbstractCegarLoop]: Abstraction has 297 states and 748 transitions. [2022-12-14 14:39:00,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.1) internal successors, (63), 31 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:39:00,753 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 748 transitions. [2022-12-14 14:39:00,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 14:39:00,753 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:39:00,753 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] [2022-12-14 14:39:00,758 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Ended with exit code 0 [2022-12-14 14:39:00,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 68 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable78 [2022-12-14 14:39:00,954 INFO L420 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:39:00,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:39:00,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1385424693, now seen corresponding path program 16 times [2022-12-14 14:39:00,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:39:00,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544948077] [2022-12-14 14:39:00,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:39:00,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:39:00,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:39:01,279 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 14:39:01,279 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:39:01,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544948077] [2022-12-14 14:39:01,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544948077] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:39:01,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1649730227] [2022-12-14 14:39:01,279 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 14:39:01,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:39:01,279 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:39:01,280 INFO L229 MonitoredProcess]: Starting monitored process 69 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:39:01,281 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Waiting until timeout for monitored process [2022-12-14 14:39:01,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:39:01,440 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 30 conjunts are in the unsatisfiable core [2022-12-14 14:39:01,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:39:01,876 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 14:39:01,876 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:39:01,971 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:39:01,971 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 161 treesize of output 125 [2022-12-14 14:39:03,075 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 14:39:03,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1649730227] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:39:03,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1305451573] [2022-12-14 14:39:03,076 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 14:39:03,076 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:39:03,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2022-12-14 14:39:03,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913360868] [2022-12-14 14:39:03,076 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:39:03,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-12-14 14:39:03,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:39:03,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-12-14 14:39:03,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=810, Unknown=0, NotChecked=0, Total=992 [2022-12-14 14:39:03,077 INFO L87 Difference]: Start difference. First operand 297 states and 748 transitions. Second operand has 32 states, 31 states have (on average 2.032258064516129) internal successors, (63), 31 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:39:06,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:39:06,494 INFO L93 Difference]: Finished difference Result 574 states and 1259 transitions. [2022-12-14 14:39:06,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-12-14 14:39:06,495 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.032258064516129) internal successors, (63), 31 states have internal predecessors, (63), 0 states have call successors, (0), 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-12-14 14:39:06,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:39:06,495 INFO L225 Difference]: With dead ends: 574 [2022-12-14 14:39:06,495 INFO L226 Difference]: Without dead ends: 556 [2022-12-14 14:39:06,496 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 827 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=702, Invalid=2958, Unknown=0, NotChecked=0, Total=3660 [2022-12-14 14:39:06,496 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 375 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 1181 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 1215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-12-14 14:39:06,496 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 100 Invalid, 1215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1181 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-12-14 14:39:06,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2022-12-14 14:39:06,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 285. [2022-12-14 14:39:06,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 284 states have (on average 2.482394366197183) internal successors, (705), 284 states have internal predecessors, (705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:39:06,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 705 transitions. [2022-12-14 14:39:06,500 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 705 transitions. Word has length 21 [2022-12-14 14:39:06,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:39:06,501 INFO L495 AbstractCegarLoop]: Abstraction has 285 states and 705 transitions. [2022-12-14 14:39:06,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.032258064516129) internal successors, (63), 31 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:39:06,501 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 705 transitions. [2022-12-14 14:39:06,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 14:39:06,501 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:39:06,501 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] [2022-12-14 14:39:06,505 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Forceful destruction successful, exit code 0 [2022-12-14 14:39:06,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79,69 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:39:06,702 INFO L420 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:39:06,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:39:06,703 INFO L85 PathProgramCache]: Analyzing trace with hash 957181505, now seen corresponding path program 17 times [2022-12-14 14:39:06,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:39:06,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224943524] [2022-12-14 14:39:06,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:39:06,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:39:06,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:39:07,018 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 14:39:07,019 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:39:07,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224943524] [2022-12-14 14:39:07,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224943524] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:39:07,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [133876390] [2022-12-14 14:39:07,019 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 14:39:07,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:39:07,019 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:39:07,020 INFO L229 MonitoredProcess]: Starting monitored process 70 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:39:07,021 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Waiting until timeout for monitored process [2022-12-14 14:39:07,154 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 14:39:07,154 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:39:07,155 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 34 conjunts are in the unsatisfiable core [2022-12-14 14:39:07,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:39:07,619 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:39:07,619 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 115 treesize of output 80 [2022-12-14 14:39:07,678 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 14:39:07,678 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:39:07,782 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:39:07,783 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 161 treesize of output 125 [2022-12-14 14:39:09,079 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 14:39:09,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [133876390] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:39:09,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1592086611] [2022-12-14 14:39:09,080 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 14:39:09,080 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:39:09,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 32 [2022-12-14 14:39:09,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621408087] [2022-12-14 14:39:09,080 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:39:09,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-12-14 14:39:09,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:39:09,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-12-14 14:39:09,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=916, Unknown=0, NotChecked=0, Total=1122 [2022-12-14 14:39:09,081 INFO L87 Difference]: Start difference. First operand 285 states and 705 transitions. Second operand has 34 states, 33 states have (on average 1.9090909090909092) internal successors, (63), 33 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:39:12,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:39:12,613 INFO L93 Difference]: Finished difference Result 607 states and 1429 transitions. [2022-12-14 14:39:12,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-12-14 14:39:12,613 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.9090909090909092) internal successors, (63), 33 states have internal predecessors, (63), 0 states have call successors, (0), 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-12-14 14:39:12,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:39:12,614 INFO L225 Difference]: With dead ends: 607 [2022-12-14 14:39:12,614 INFO L226 Difference]: Without dead ends: 572 [2022-12-14 14:39:12,614 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1072 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=874, Invalid=3548, Unknown=0, NotChecked=0, Total=4422 [2022-12-14 14:39:12,615 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 392 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 1330 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 1357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-12-14 14:39:12,615 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [392 Valid, 100 Invalid, 1357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1330 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-12-14 14:39:12,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2022-12-14 14:39:12,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 273. [2022-12-14 14:39:12,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 272 states have (on average 2.463235294117647) internal successors, (670), 272 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:39:12,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 670 transitions. [2022-12-14 14:39:12,619 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 670 transitions. Word has length 21 [2022-12-14 14:39:12,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:39:12,619 INFO L495 AbstractCegarLoop]: Abstraction has 273 states and 670 transitions. [2022-12-14 14:39:12,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.9090909090909092) internal successors, (63), 33 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:39:12,619 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 670 transitions. [2022-12-14 14:39:12,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 14:39:12,620 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:39:12,620 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] [2022-12-14 14:39:12,624 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Ended with exit code 0 [2022-12-14 14:39:12,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80,70 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:39:12,821 INFO L420 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:39:12,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:39:12,822 INFO L85 PathProgramCache]: Analyzing trace with hash -2118598327, now seen corresponding path program 18 times [2022-12-14 14:39:12,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:39:12,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590648160] [2022-12-14 14:39:12,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:39:12,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:39:12,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:39:13,122 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 14:39:13,123 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:39:13,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590648160] [2022-12-14 14:39:13,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590648160] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:39:13,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2081088343] [2022-12-14 14:39:13,123 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 14:39:13,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:39:13,123 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:39:13,124 INFO L229 MonitoredProcess]: Starting monitored process 71 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:39:13,124 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Waiting until timeout for monitored process [2022-12-14 14:39:13,284 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 14:39:13,285 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:39:13,286 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 26 conjunts are in the unsatisfiable core [2022-12-14 14:39:13,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:39:13,508 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:39:13,508 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 111 treesize of output 76 [2022-12-14 14:39:13,839 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 14:39:13,839 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:39:14,290 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:39:14,290 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 161 treesize of output 125 [2022-12-14 14:39:14,583 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 14:39:14,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2081088343] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:39:14,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [195226101] [2022-12-14 14:39:14,584 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 14:39:14,584 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:39:14,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2022-12-14 14:39:14,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733900259] [2022-12-14 14:39:14,584 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:39:14,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-12-14 14:39:14,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:39:14,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-12-14 14:39:14,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=802, Unknown=0, NotChecked=0, Total=930 [2022-12-14 14:39:14,585 INFO L87 Difference]: Start difference. First operand 273 states and 670 transitions. Second operand has 31 states, 30 states have (on average 2.1) internal successors, (63), 31 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:39:18,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:39:18,426 INFO L93 Difference]: Finished difference Result 562 states and 1206 transitions. [2022-12-14 14:39:18,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-12-14 14:39:18,426 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.1) internal successors, (63), 31 states have internal predecessors, (63), 0 states have call successors, (0), 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-12-14 14:39:18,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:39:18,427 INFO L225 Difference]: With dead ends: 562 [2022-12-14 14:39:18,427 INFO L226 Difference]: Without dead ends: 552 [2022-12-14 14:39:18,427 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1188 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=788, Invalid=4042, Unknown=0, NotChecked=0, Total=4830 [2022-12-14 14:39:18,427 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 527 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1744 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 527 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-12-14 14:39:18,427 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [527 Valid, 0 Invalid, 1770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1744 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-12-14 14:39:18,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2022-12-14 14:39:18,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 213. [2022-12-14 14:39:18,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 212 states have (on average 2.3679245283018866) internal successors, (502), 212 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:39:18,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 502 transitions. [2022-12-14 14:39:18,431 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 502 transitions. Word has length 21 [2022-12-14 14:39:18,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:39:18,431 INFO L495 AbstractCegarLoop]: Abstraction has 213 states and 502 transitions. [2022-12-14 14:39:18,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.1) internal successors, (63), 31 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:39:18,432 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 502 transitions. [2022-12-14 14:39:18,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 14:39:18,432 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:39:18,432 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] [2022-12-14 14:39:18,436 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Ended with exit code 0 [2022-12-14 14:39:18,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81,71 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:39:18,633 INFO L420 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:39:18,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:39:18,634 INFO L85 PathProgramCache]: Analyzing trace with hash 2144859657, now seen corresponding path program 19 times [2022-12-14 14:39:18,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:39:18,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221359400] [2022-12-14 14:39:18,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:39:18,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:39:18,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:39:18,962 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 14:39:18,963 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:39:18,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221359400] [2022-12-14 14:39:18,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221359400] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:39:18,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [546872065] [2022-12-14 14:39:18,963 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 14:39:18,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:39:18,963 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:39:18,964 INFO L229 MonitoredProcess]: Starting monitored process 72 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:39:18,964 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (72)] Waiting until timeout for monitored process [2022-12-14 14:39:19,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:39:19,076 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 30 conjunts are in the unsatisfiable core [2022-12-14 14:39:19,077 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:39:19,551 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 14:39:19,551 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:39:19,852 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:39:19,853 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 161 treesize of output 125 [2022-12-14 14:39:20,624 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 14:39:20,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [546872065] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:39:20,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [648324495] [2022-12-14 14:39:20,624 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 14:39:20,624 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:39:20,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2022-12-14 14:39:20,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820010164] [2022-12-14 14:39:20,625 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:39:20,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-12-14 14:39:20,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:39:20,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-12-14 14:39:20,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=822, Unknown=0, NotChecked=0, Total=992 [2022-12-14 14:39:20,626 INFO L87 Difference]: Start difference. First operand 213 states and 502 transitions. Second operand has 32 states, 31 states have (on average 2.032258064516129) internal successors, (63), 31 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:39:22,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:39:22,881 INFO L93 Difference]: Finished difference Result 505 states and 1066 transitions. [2022-12-14 14:39:22,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-12-14 14:39:22,882 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.032258064516129) internal successors, (63), 31 states have internal predecessors, (63), 0 states have call successors, (0), 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-12-14 14:39:22,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:39:22,883 INFO L225 Difference]: With dead ends: 505 [2022-12-14 14:39:22,883 INFO L226 Difference]: Without dead ends: 500 [2022-12-14 14:39:22,883 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 655 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=572, Invalid=2508, Unknown=0, NotChecked=0, Total=3080 [2022-12-14 14:39:22,883 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 329 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 1133 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 1152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-12-14 14:39:22,883 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 115 Invalid, 1152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1133 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-12-14 14:39:22,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2022-12-14 14:39:22,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 213. [2022-12-14 14:39:22,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 212 states have (on average 2.3679245283018866) internal successors, (502), 212 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:39:22,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 502 transitions. [2022-12-14 14:39:22,887 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 502 transitions. Word has length 21 [2022-12-14 14:39:22,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:39:22,887 INFO L495 AbstractCegarLoop]: Abstraction has 213 states and 502 transitions. [2022-12-14 14:39:22,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.032258064516129) internal successors, (63), 31 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:39:22,887 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 502 transitions. [2022-12-14 14:39:22,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 14:39:22,888 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:39:22,888 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] [2022-12-14 14:39:22,892 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (72)] Ended with exit code 0 [2022-12-14 14:39:23,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82,72 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:39:23,089 INFO L420 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:39:23,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:39:23,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1453950931, now seen corresponding path program 20 times [2022-12-14 14:39:23,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:39:23,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648430138] [2022-12-14 14:39:23,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:39:23,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:39:23,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:39:23,381 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 14:39:23,381 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:39:23,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648430138] [2022-12-14 14:39:23,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648430138] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:39:23,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [837904273] [2022-12-14 14:39:23,382 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 14:39:23,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:39:23,382 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:39:23,383 INFO L229 MonitoredProcess]: Starting monitored process 73 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:39:23,384 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Waiting until timeout for monitored process [2022-12-14 14:39:23,502 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 14:39:23,502 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:39:23,503 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 28 conjunts are in the unsatisfiable core [2022-12-14 14:39:23,504 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:39:23,951 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:39:23,952 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 115 treesize of output 80 [2022-12-14 14:39:24,007 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 14:39:24,008 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:39:24,113 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:39:24,113 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 161 treesize of output 125 [2022-12-14 14:39:25,159 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 14:39:25,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [837904273] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:39:25,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [427092236] [2022-12-14 14:39:25,160 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 14:39:25,160 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:39:25,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2022-12-14 14:39:25,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708834698] [2022-12-14 14:39:25,160 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:39:25,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-12-14 14:39:25,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:39:25,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-12-14 14:39:25,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=813, Unknown=0, NotChecked=0, Total=992 [2022-12-14 14:39:25,162 INFO L87 Difference]: Start difference. First operand 213 states and 502 transitions. Second operand has 32 states, 31 states have (on average 2.032258064516129) internal successors, (63), 31 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:39:27,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:39:27,209 INFO L93 Difference]: Finished difference Result 475 states and 1019 transitions. [2022-12-14 14:39:27,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-14 14:39:27,209 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.032258064516129) internal successors, (63), 31 states have internal predecessors, (63), 0 states have call successors, (0), 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-12-14 14:39:27,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:39:27,210 INFO L225 Difference]: With dead ends: 475 [2022-12-14 14:39:27,210 INFO L226 Difference]: Without dead ends: 466 [2022-12-14 14:39:27,210 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 635 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=539, Invalid=2323, Unknown=0, NotChecked=0, Total=2862 [2022-12-14 14:39:27,210 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 378 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 1068 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 1085 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1068 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-12-14 14:39:27,210 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 91 Invalid, 1085 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1068 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-12-14 14:39:27,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2022-12-14 14:39:27,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 195. [2022-12-14 14:39:27,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 194 states have (on average 2.3402061855670104) internal successors, (454), 194 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:39:27,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 454 transitions. [2022-12-14 14:39:27,214 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 454 transitions. Word has length 21 [2022-12-14 14:39:27,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:39:27,214 INFO L495 AbstractCegarLoop]: Abstraction has 195 states and 454 transitions. [2022-12-14 14:39:27,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.032258064516129) internal successors, (63), 31 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:39:27,214 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 454 transitions. [2022-12-14 14:39:27,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-14 14:39:27,214 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:39:27,215 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] [2022-12-14 14:39:27,219 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Ended with exit code 0 [2022-12-14 14:39:27,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83,73 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:39:27,416 INFO L420 AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:39:27,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:39:27,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1978249389, now seen corresponding path program 21 times [2022-12-14 14:39:27,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:39:27,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48874056] [2022-12-14 14:39:27,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:39:27,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:39:27,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:39:27,599 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 14:39:27,599 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:39:27,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48874056] [2022-12-14 14:39:27,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48874056] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:39:27,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [182336844] [2022-12-14 14:39:27,599 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 14:39:27,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:39:27,599 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:39:27,600 INFO L229 MonitoredProcess]: Starting monitored process 74 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:39:27,601 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (74)] Waiting until timeout for monitored process [2022-12-14 14:39:27,737 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 14:39:27,737 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:39:27,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-14 14:39:27,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:39:27,936 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 14:39:27,936 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:39:28,133 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 14:39:28,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [182336844] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:39:28,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1416733006] [2022-12-14 14:39:28,134 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 14:39:28,134 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:39:28,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2022-12-14 14:39:28,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375692634] [2022-12-14 14:39:28,134 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:39:28,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-14 14:39:28,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:39:28,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-14 14:39:28,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=348, Unknown=0, NotChecked=0, Total=462 [2022-12-14 14:39:28,135 INFO L87 Difference]: Start difference. First operand 195 states and 454 transitions. Second operand has 22 states, 22 states have (on average 2.409090909090909) internal successors, (53), 21 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:39:28,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:39:28,864 INFO L93 Difference]: Finished difference Result 390 states and 855 transitions. [2022-12-14 14:39:28,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-14 14:39:28,865 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.409090909090909) internal successors, (53), 21 states have internal predecessors, (53), 0 states have call successors, (0), 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-12-14 14:39:28,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:39:28,866 INFO L225 Difference]: With dead ends: 390 [2022-12-14 14:39:28,866 INFO L226 Difference]: Without dead ends: 390 [2022-12-14 14:39:28,866 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=209, Invalid=603, Unknown=0, NotChecked=0, Total=812 [2022-12-14 14:39:28,866 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 168 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-14 14:39:28,866 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 0 Invalid, 639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 634 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-14 14:39:28,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2022-12-14 14:39:28,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 191. [2022-12-14 14:39:28,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 190 states have (on average 2.3421052631578947) internal successors, (445), 190 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:39:28,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 445 transitions. [2022-12-14 14:39:28,869 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 445 transitions. Word has length 22 [2022-12-14 14:39:28,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:39:28,869 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 445 transitions. [2022-12-14 14:39:28,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.409090909090909) internal successors, (53), 21 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:39:28,870 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 445 transitions. [2022-12-14 14:39:28,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-14 14:39:28,870 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:39:28,870 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] [2022-12-14 14:39:28,874 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (74)] Forceful destruction successful, exit code 0 [2022-12-14 14:39:29,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84,74 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:39:29,071 INFO L420 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:39:29,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:39:29,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1157503375, now seen corresponding path program 1 times [2022-12-14 14:39:29,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:39:29,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761646356] [2022-12-14 14:39:29,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:39:29,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:39:29,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:39:29,162 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 14:39:29,162 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:39:29,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761646356] [2022-12-14 14:39:29,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761646356] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:39:29,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1596200590] [2022-12-14 14:39:29,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:39:29,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:39:29,162 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:39:29,163 INFO L229 MonitoredProcess]: Starting monitored process 75 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:39:29,164 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Waiting until timeout for monitored process [2022-12-14 14:39:29,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:39:29,281 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-14 14:39:29,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:39:29,374 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 14:39:29,374 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:39:29,464 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 14:39:29,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1596200590] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:39:29,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [818937356] [2022-12-14 14:39:29,464 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 14:39:29,464 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:39:29,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 16 [2022-12-14 14:39:29,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302520975] [2022-12-14 14:39:29,464 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:39:29,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-14 14:39:29,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:39:29,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-14 14:39:29,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2022-12-14 14:39:29,465 INFO L87 Difference]: Start difference. First operand 191 states and 445 transitions. Second operand has 16 states, 16 states have (on average 2.8125) 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-12-14 14:39:29,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:39:29,919 INFO L93 Difference]: Finished difference Result 244 states and 523 transitions. [2022-12-14 14:39:29,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-14 14:39:29,920 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.8125) 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 22 [2022-12-14 14:39:29,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:39:29,920 INFO L225 Difference]: With dead ends: 244 [2022-12-14 14:39:29,920 INFO L226 Difference]: Without dead ends: 118 [2022-12-14 14:39:29,920 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=134, Invalid=466, Unknown=0, NotChecked=0, Total=600 [2022-12-14 14:39:29,921 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 88 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 14:39:29,921 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 6 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 14:39:29,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-12-14 14:39:29,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2022-12-14 14:39:29,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 117 states have (on average 2.3333333333333335) internal successors, (273), 117 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:39:29,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 273 transitions. [2022-12-14 14:39:29,923 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 273 transitions. Word has length 22 [2022-12-14 14:39:29,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:39:29,924 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 273 transitions. [2022-12-14 14:39:29,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.8125) 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-12-14 14:39:29,924 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 273 transitions. [2022-12-14 14:39:29,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 14:39:29,924 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:39:29,924 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:39:29,928 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Ended with exit code 0 [2022-12-14 14:39:30,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 75 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable85 [2022-12-14 14:39:30,125 INFO L420 AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:39:30,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:39:30,126 INFO L85 PathProgramCache]: Analyzing trace with hash -892107356, now seen corresponding path program 22 times [2022-12-14 14:39:30,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:39:30,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787384468] [2022-12-14 14:39:30,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:39:30,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:39:30,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:39:30,675 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:39:30,675 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:39:30,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787384468] [2022-12-14 14:39:30,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787384468] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:39:30,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [280997547] [2022-12-14 14:39:30,675 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 14:39:30,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:39:30,676 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:39:30,676 INFO L229 MonitoredProcess]: Starting monitored process 76 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:39:30,677 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (76)] Waiting until timeout for monitored process [2022-12-14 14:39:30,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:39:30,811 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 31 conjunts are in the unsatisfiable core [2022-12-14 14:39:30,812 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:39:31,336 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:39:31,336 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:39:31,512 INFO L321 Elim1Store]: treesize reduction 11, result has 87.9 percent of original size [2022-12-14 14:39:31,512 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 94 [2022-12-14 14:39:31,998 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:39:31,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [280997547] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:39:31,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1049680762] [2022-12-14 14:39:31,998 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 14:39:31,998 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:39:31,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 13] total 38 [2022-12-14 14:39:31,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808633013] [2022-12-14 14:39:31,998 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:39:31,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-12-14 14:39:31,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:39:31,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-12-14 14:39:31,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=1267, Unknown=0, NotChecked=0, Total=1482 [2022-12-14 14:39:31,999 INFO L87 Difference]: Start difference. First operand 118 states and 273 transitions. Second operand has 39 states, 39 states have (on average 1.5897435897435896) internal successors, (62), 38 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:39:33,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:39:33,091 INFO L93 Difference]: Finished difference Result 144 states and 320 transitions. [2022-12-14 14:39:33,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-14 14:39:33,092 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.5897435897435896) internal successors, (62), 38 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 14:39:33,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:39:33,092 INFO L225 Difference]: With dead ends: 144 [2022-12-14 14:39:33,092 INFO L226 Difference]: Without dead ends: 144 [2022-12-14 14:39:33,092 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 415 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=395, Invalid=1861, Unknown=0, NotChecked=0, Total=2256 [2022-12-14 14:39:33,093 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 112 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 859 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 859 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-14 14:39:33,093 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 0 Invalid, 860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 859 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-14 14:39:33,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-12-14 14:39:33,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 134. [2022-12-14 14:39:33,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 133 states have (on average 2.3233082706766917) internal successors, (309), 133 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:39:33,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 309 transitions. [2022-12-14 14:39:33,096 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 309 transitions. Word has length 24 [2022-12-14 14:39:33,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:39:33,096 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 309 transitions. [2022-12-14 14:39:33,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 1.5897435897435896) internal successors, (62), 38 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:39:33,096 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 309 transitions. [2022-12-14 14:39:33,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 14:39:33,096 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:39:33,097 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:39:33,101 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (76)] Ended with exit code 0 [2022-12-14 14:39:33,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 76 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable86 [2022-12-14 14:39:33,298 INFO L420 AbstractCegarLoop]: === Iteration 88 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:39:33,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:39:33,298 INFO L85 PathProgramCache]: Analyzing trace with hash -901377548, now seen corresponding path program 23 times [2022-12-14 14:39:33,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:39:33,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344008469] [2022-12-14 14:39:33,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:39:33,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:39:33,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:39:33,982 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:39:33,982 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:39:33,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344008469] [2022-12-14 14:39:33,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344008469] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:39:33,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1641846368] [2022-12-14 14:39:33,982 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 14:39:33,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:39:33,982 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:39:33,983 INFO L229 MonitoredProcess]: Starting monitored process 77 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:39:33,984 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Waiting until timeout for monitored process [2022-12-14 14:39:34,200 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 14:39:34,200 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:39:34,201 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 27 conjunts are in the unsatisfiable core [2022-12-14 14:39:34,203 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:39:34,658 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 14:39:34,658 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:39:34,810 INFO L321 Elim1Store]: treesize reduction 11, result has 87.1 percent of original size [2022-12-14 14:39:34,810 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 88 [2022-12-14 14:39:35,109 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 14:39:35,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1641846368] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:39:35,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [220054314] [2022-12-14 14:39:35,110 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 14:39:35,110 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:39:35,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 10] total 34 [2022-12-14 14:39:35,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929477019] [2022-12-14 14:39:35,110 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:39:35,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-12-14 14:39:35,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:39:35,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-12-14 14:39:35,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1021, Unknown=0, NotChecked=0, Total=1190 [2022-12-14 14:39:35,111 INFO L87 Difference]: Start difference. First operand 134 states and 309 transitions. Second operand has 35 states, 35 states have (on average 1.7142857142857142) 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-12-14 14:39:36,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:39:36,216 INFO L93 Difference]: Finished difference Result 172 states and 383 transitions. [2022-12-14 14:39:36,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-14 14:39:36,216 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.7142857142857142) 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 24 [2022-12-14 14:39:36,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:39:36,217 INFO L225 Difference]: With dead ends: 172 [2022-12-14 14:39:36,217 INFO L226 Difference]: Without dead ends: 172 [2022-12-14 14:39:36,217 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=318, Invalid=1574, Unknown=0, NotChecked=0, Total=1892 [2022-12-14 14:39:36,217 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 118 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 990 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 990 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-14 14:39:36,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 0 Invalid, 992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 990 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-14 14:39:36,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2022-12-14 14:39:36,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 136. [2022-12-14 14:39:36,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 135 states have (on average 2.3407407407407406) internal successors, (316), 135 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:39:36,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 316 transitions. [2022-12-14 14:39:36,219 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 316 transitions. Word has length 24 [2022-12-14 14:39:36,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:39:36,219 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 316 transitions. [2022-12-14 14:39:36,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 1.7142857142857142) 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-12-14 14:39:36,219 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 316 transitions. [2022-12-14 14:39:36,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 14:39:36,220 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:39:36,220 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:39:36,224 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Ended with exit code 0 [2022-12-14 14:39:36,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87,77 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:39:36,421 INFO L420 AbstractCegarLoop]: === Iteration 89 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:39:36,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:39:36,422 INFO L85 PathProgramCache]: Analyzing trace with hash -982455110, now seen corresponding path program 24 times [2022-12-14 14:39:36,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:39:36,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543468063] [2022-12-14 14:39:36,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:39:36,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:39:36,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:39:37,193 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:39:37,193 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:39:37,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543468063] [2022-12-14 14:39:37,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543468063] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:39:37,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [590048375] [2022-12-14 14:39:37,193 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 14:39:37,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:39:37,193 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:39:37,194 INFO L229 MonitoredProcess]: Starting monitored process 78 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:39:37,194 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Waiting until timeout for monitored process [2022-12-14 14:39:37,340 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 14:39:37,340 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:39:37,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-14 14:39:37,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:39:37,645 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 14:39:37,645 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:39:39,969 INFO L321 Elim1Store]: treesize reduction 17, result has 92.1 percent of original size [2022-12-14 14:39:39,969 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 89 treesize of output 224 [2022-12-14 14:39:49,031 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 14:39:49,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [590048375] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:39:49,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1283416935] [2022-12-14 14:39:49,031 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 14:39:49,032 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:39:49,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 7] total 29 [2022-12-14 14:39:49,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948371594] [2022-12-14 14:39:49,032 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:39:49,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-12-14 14:39:49,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:39:49,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-12-14 14:39:49,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=708, Unknown=0, NotChecked=0, Total=812 [2022-12-14 14:39:49,033 INFO L87 Difference]: Start difference. First operand 136 states and 316 transitions. Second operand has 29 states, 29 states have (on average 2.0344827586206895) internal successors, (59), 29 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-12-14 14:39:51,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:39:51,988 INFO L93 Difference]: Finished difference Result 292 states and 662 transitions. [2022-12-14 14:39:51,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-14 14:39:51,989 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.0344827586206895) internal successors, (59), 29 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 24 [2022-12-14 14:39:51,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:39:51,990 INFO L225 Difference]: With dead ends: 292 [2022-12-14 14:39:51,990 INFO L226 Difference]: Without dead ends: 292 [2022-12-14 14:39:51,990 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 390 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=384, Invalid=1968, Unknown=0, NotChecked=0, Total=2352 [2022-12-14 14:39:51,990 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 172 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1304 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-12-14 14:39:51,990 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 0 Invalid, 1315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1304 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-12-14 14:39:51,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2022-12-14 14:39:51,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 150. [2022-12-14 14:39:51,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 149 states have (on average 2.530201342281879) internal successors, (377), 149 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:39:51,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 377 transitions. [2022-12-14 14:39:51,995 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 377 transitions. Word has length 24 [2022-12-14 14:39:51,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:39:51,995 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 377 transitions. [2022-12-14 14:39:51,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.0344827586206895) internal successors, (59), 29 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-12-14 14:39:51,995 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 377 transitions. [2022-12-14 14:39:51,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 14:39:51,995 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:39:51,995 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:39:52,000 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Ended with exit code 0 [2022-12-14 14:39:52,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88,78 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:39:52,197 INFO L420 AbstractCegarLoop]: === Iteration 90 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:39:52,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:39:52,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1837167118, now seen corresponding path program 25 times [2022-12-14 14:39:52,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:39:52,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039338478] [2022-12-14 14:39:52,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:39:52,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:39:52,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:39:53,522 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:39:53,522 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:39:53,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039338478] [2022-12-14 14:39:53,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039338478] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:39:53,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1273981061] [2022-12-14 14:39:53,522 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 14:39:53,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:39:53,522 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:39:53,523 INFO L229 MonitoredProcess]: Starting monitored process 79 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:39:53,524 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (79)] Waiting until timeout for monitored process [2022-12-14 14:39:53,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:39:53,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 31 conjunts are in the unsatisfiable core [2022-12-14 14:39:53,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:39:54,277 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:39:54,277 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:39:54,650 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-14 14:39:54,650 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 4 [2022-12-14 14:39:54,657 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-14 14:39:54,657 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 4 [2022-12-14 14:39:54,711 INFO L321 Elim1Store]: treesize reduction 32, result has 62.4 percent of original size [2022-12-14 14:39:54,711 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 60 [2022-12-14 14:39:55,232 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:39:55,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1273981061] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:39:55,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [66185558] [2022-12-14 14:39:55,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:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 14:39:55,232 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:39:55,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 13] total 40 [2022-12-14 14:39:55,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575338927] [2022-12-14 14:39:55,233 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:39:55,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-12-14 14:39:55,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:39:55,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-12-14 14:39:55,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=266, Invalid=1374, Unknown=0, NotChecked=0, Total=1640 [2022-12-14 14:39:55,234 INFO L87 Difference]: Start difference. First operand 150 states and 377 transitions. Second operand has 41 states, 41 states have (on average 1.5121951219512195) internal successors, (62), 40 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:39:57,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:39:57,147 INFO L93 Difference]: Finished difference Result 200 states and 497 transitions. [2022-12-14 14:39:57,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-14 14:39:57,148 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 1.5121951219512195) internal successors, (62), 40 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 14:39:57,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:39:57,148 INFO L225 Difference]: With dead ends: 200 [2022-12-14 14:39:57,148 INFO L226 Difference]: Without dead ends: 200 [2022-12-14 14:39:57,148 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 549 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=519, Invalid=2237, Unknown=0, NotChecked=0, Total=2756 [2022-12-14 14:39:57,149 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 174 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1374 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:39:57,149 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 0 Invalid, 1375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1374 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-12-14 14:39:57,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2022-12-14 14:39:57,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 152. [2022-12-14 14:39:57,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 151 states have (on average 2.556291390728477) internal successors, (386), 151 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:39:57,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 386 transitions. [2022-12-14 14:39:57,151 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 386 transitions. Word has length 24 [2022-12-14 14:39:57,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:39:57,151 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 386 transitions. [2022-12-14 14:39:57,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 1.5121951219512195) internal successors, (62), 40 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:39:57,151 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 386 transitions. [2022-12-14 14:39:57,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 14:39:57,151 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:39:57,152 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:39:57,156 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (79)] Forceful destruction successful, exit code 0 [2022-12-14 14:39:57,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 79 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable89 [2022-12-14 14:39:57,353 INFO L420 AbstractCegarLoop]: === Iteration 91 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:39:57,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:39:57,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1494680044, now seen corresponding path program 26 times [2022-12-14 14:39:57,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:39:57,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722233482] [2022-12-14 14:39:57,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:39:57,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:39:57,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:39:57,922 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:39:57,922 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:39:57,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722233482] [2022-12-14 14:39:57,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722233482] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:39:57,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1090809852] [2022-12-14 14:39:57,922 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 14:39:57,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:39:57,923 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:39:57,923 INFO L229 MonitoredProcess]: Starting monitored process 80 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:39:57,924 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (80)] Waiting until timeout for monitored process [2022-12-14 14:39:58,100 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-12-14 14:39:58,100 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:39:58,102 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 60 conjunts are in the unsatisfiable core [2022-12-14 14:39:58,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:39:58,348 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 14:39:58,415 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 14:39:58,555 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 14:39:58,962 INFO L321 Elim1Store]: treesize reduction 54, result has 16.9 percent of original size [2022-12-14 14:39:58,962 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 28 treesize of output 18 [2022-12-14 14:39:59,018 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:39:59,018 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:40:05,426 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:40:05,426 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 108 treesize of output 72 [2022-12-14 14:40:05,484 INFO L321 Elim1Store]: treesize reduction 30, result has 61.0 percent of original size [2022-12-14 14:40:05,484 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 764 treesize of output 698 [2022-12-14 14:40:05,496 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:40:05,502 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:40:05,526 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:40:05,526 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 652 treesize of output 616 [2022-12-14 14:40:05,541 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:40:05,547 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:40:05,571 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:40:05,572 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 572 treesize of output 456 [2022-12-14 14:40:07,326 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:40:07,326 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 108 treesize of output 72 [2022-12-14 14:40:07,392 INFO L321 Elim1Store]: treesize reduction 30, result has 61.0 percent of original size [2022-12-14 14:40:07,393 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1548 treesize of output 1370 [2022-12-14 14:40:07,407 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:40:07,414 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:40:07,439 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:40:07,439 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 1324 treesize of output 1208 [2022-12-14 14:40:07,456 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:40:07,463 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:40:07,488 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:40:07,488 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 1164 treesize of output 888 [2022-12-14 14:40:14,647 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:40:14,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1090809852] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:40:14,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [772926549] [2022-12-14 14:40:14,647 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 14:40:14,647 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:40:14,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 14] total 41 [2022-12-14 14:40:14,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898272676] [2022-12-14 14:40:14,648 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:40:14,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-12-14 14:40:14,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:40:14,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-12-14 14:40:14,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=1481, Unknown=14, NotChecked=0, Total=1722 [2022-12-14 14:40:14,649 INFO L87 Difference]: Start difference. First operand 152 states and 386 transitions. Second operand has 42 states, 42 states have (on average 1.5238095238095237) internal successors, (64), 41 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:40:15,718 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse12 (< 1 c_~n2~0)) (.cse14 (< 1 c_~n1~0))) (let ((.cse3 (+ c_~get1~0.offset 4)) (.cse4 (+ c_~get2~0.offset 4)) (.cse13 (and (forall ((~get1~0.base Int) (v_ArrVal_3363 (Array Int Int)) (thread1Thread1of1ForFork1_~i~0 Int)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) c_~n1~0) (not (< thread1Thread1of1ForFork1_~i~0 c_~n2~0)) (not (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3363)) (.cse16 (* thread1Thread1of1ForFork1_~i~0 4))) (= (select (select .cse15 c_~get2~0.base) (+ c_~get2~0.offset .cse16)) (select (select .cse15 ~get1~0.base) (+ c_~get1~0.offset .cse16))))))) (forall ((~get1~0.base Int) (v_ArrVal_3363 (Array Int Int)) (thread1Thread1of1ForFork1_~i~0 Int)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) c_~n2~0) (not (< thread1Thread1of1ForFork1_~i~0 c_~n2~0)) (not (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3363)) (.cse18 (* thread1Thread1of1ForFork1_~i~0 4))) (= (select (select .cse17 c_~get2~0.base) (+ c_~get2~0.offset .cse18)) (select (select .cse17 ~get1~0.base) (+ c_~get1~0.offset .cse18))))))))) (.cse10 (< (+ |c_ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse11 (and .cse12 (< c_~n2~0 3) .cse14))) (and (forall ((~get1~0.base Int) (v_ArrVal_3363 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3363))) (let ((.cse2 (select .cse5 ~get1~0.base)) (.cse0 (select .cse5 c_~get2~0.base))) (or (forall ((thread1Thread1of1ForFork1_~i~0 Int)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) c_~n1~0) (not (< thread1Thread1of1ForFork1_~i~0 c_~n2~0)) (not (let ((.cse1 (* thread1Thread1of1ForFork1_~i~0 4))) (= (select .cse0 (+ c_~get2~0.offset .cse1)) (select .cse2 (+ c_~get1~0.offset .cse1))))))) (= (select .cse2 .cse3) (select .cse0 .cse4)))))) (<= 2 c_~n1~0) (forall ((~get1~0.base Int) (v_ArrVal_3363 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3363))) (let ((.cse8 (select .cse9 ~get1~0.base)) (.cse6 (select .cse9 c_~get2~0.base))) (or (forall ((thread1Thread1of1ForFork1_~i~0 Int)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) c_~n2~0) (not (< thread1Thread1of1ForFork1_~i~0 c_~n2~0)) (not (let ((.cse7 (* thread1Thread1of1ForFork1_~i~0 4))) (= (select .cse6 (+ c_~get2~0.offset .cse7)) (select .cse8 (+ c_~get1~0.offset .cse7))))))) (= (select .cse8 .cse3) (select .cse6 .cse4)))))) (or .cse10 (not (< |c_ULTIMATE.start_create_fresh_int_array_~i~2#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) .cse11) (or .cse12 .cse13) (or .cse13 .cse14) (or (< (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~i~2#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (not .cse10) .cse11) (= c_~get1~0.offset 0) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= (+ |c_ULTIMATE.start_create_fresh_int_array_~size#1| 1) (+ c_~n2~0 |c_ULTIMATE.start_create_fresh_int_array_~i~2#1|)) (<= 2 c_~n2~0) (= c_~get2~0.offset 0)))) is different from false [2022-12-14 14:40:22,608 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:40:31,383 WARN L233 SmtUtils]: Spent 6.13s on a formula simplification. DAG size of input: 79 DAG size of output: 61 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 14:40:39,557 WARN L233 SmtUtils]: Spent 6.16s on a formula simplification. DAG size of input: 84 DAG size of output: 64 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 14:40:46,108 WARN L233 SmtUtils]: Spent 6.39s on a formula simplification. DAG size of input: 79 DAG size of output: 64 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 14:40:54,761 WARN L233 SmtUtils]: Spent 6.21s on a formula simplification. DAG size of input: 90 DAG size of output: 70 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 14:40:57,726 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (< 1 c_~n2~0)) (.cse7 (< 1 c_~n1~0)) (.cse2 (select |c_#memory_int| c_~get2~0.base)) (.cse26 (+ c_~get2~0.offset 4))) (let ((.cse6 (select .cse2 .cse26)) (.cse5 (+ c_~get1~0.offset 4)) (.cse22 (< |c_ULTIMATE.start_create_fresh_int_array_~i~2#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse1 (and (forall ((~get1~0.base Int) (thread1Thread1of1ForFork1_~i~0 Int)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) c_~n1~0) (not (< thread1Thread1of1ForFork1_~i~0 c_~n2~0)) (not (let ((.cse41 (* thread1Thread1of1ForFork1_~i~0 4))) (= (select .cse2 (+ c_~get2~0.offset .cse41)) (select (select |c_#memory_int| ~get1~0.base) (+ c_~get1~0.offset .cse41))))))) (forall ((~get1~0.base Int) (thread1Thread1of1ForFork1_~i~0 Int)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) c_~n2~0) (not (< thread1Thread1of1ForFork1_~i~0 c_~n2~0)) (not (let ((.cse42 (* thread1Thread1of1ForFork1_~i~0 4))) (= (select .cse2 (+ c_~get2~0.offset .cse42)) (select (select |c_#memory_int| ~get1~0.base) (+ c_~get1~0.offset .cse42))))))))) (.cse36 (and (forall ((~get1~0.base Int) (v_ArrVal_3363 (Array Int Int)) (thread1Thread1of1ForFork1_~i~0 Int)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) c_~n1~0) (not (< thread1Thread1of1ForFork1_~i~0 c_~n2~0)) (not (let ((.cse37 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3363)) (.cse38 (* thread1Thread1of1ForFork1_~i~0 4))) (= (select (select .cse37 c_~get2~0.base) (+ c_~get2~0.offset .cse38)) (select (select .cse37 ~get1~0.base) (+ c_~get1~0.offset .cse38))))))) (forall ((~get1~0.base Int) (v_ArrVal_3363 (Array Int Int)) (thread1Thread1of1ForFork1_~i~0 Int)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) c_~n2~0) (not (< thread1Thread1of1ForFork1_~i~0 c_~n2~0)) (not (let ((.cse39 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3363)) (.cse40 (* thread1Thread1of1ForFork1_~i~0 4))) (= (select (select .cse39 c_~get2~0.base) (+ c_~get2~0.offset .cse40)) (select (select .cse39 ~get1~0.base) (+ c_~get1~0.offset .cse40))))))))) (.cse34 (< (+ |c_ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse35 (and .cse0 (< c_~n2~0 3) .cse7))) (and (or .cse0 .cse1) (forall ((~get1~0.base Int)) (let ((.cse4 (select |c_#memory_int| ~get1~0.base))) (or (forall ((thread1Thread1of1ForFork1_~i~0 Int)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) c_~n2~0) (not (< thread1Thread1of1ForFork1_~i~0 c_~n2~0)) (not (let ((.cse3 (* thread1Thread1of1ForFork1_~i~0 4))) (= (select .cse2 (+ c_~get2~0.offset .cse3)) (select .cse4 (+ c_~get1~0.offset .cse3))))))) (= (select .cse4 .cse5) .cse6)))) (<= 2 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (or (let ((.cse8 (and (forall ((v_ArrVal_3362 (Array Int Int)) (~get1~0.base Int) (v_ArrVal_3363 (Array Int Int)) (thread1Thread1of1ForFork1_~i~0 Int)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) c_~n1~0) (not (< thread1Thread1of1ForFork1_~i~0 c_~n2~0)) (not (let ((.cse18 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_3362) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3363)) (.cse19 (* thread1Thread1of1ForFork1_~i~0 4))) (= (select (select .cse18 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse19 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select .cse18 ~get1~0.base) (+ c_~get1~0.offset .cse19))))))) (forall ((v_ArrVal_3362 (Array Int Int)) (~get1~0.base Int) (v_ArrVal_3363 (Array Int Int)) (thread1Thread1of1ForFork1_~i~0 Int)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) c_~n2~0) (not (< thread1Thread1of1ForFork1_~i~0 c_~n2~0)) (not (let ((.cse20 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_3362) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3363)) (.cse21 (* thread1Thread1of1ForFork1_~i~0 4))) (= (select (select .cse20 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse21 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select .cse20 ~get1~0.base) (+ c_~get1~0.offset .cse21))))))))) (.cse12 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (or .cse7 .cse8) (forall ((v_ArrVal_3362 (Array Int Int)) (~get1~0.base Int) (v_ArrVal_3363 (Array Int Int))) (let ((.cse13 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_3362) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3363))) (let ((.cse9 (select .cse13 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse11 (select .cse13 ~get1~0.base))) (or (forall ((thread1Thread1of1ForFork1_~i~0 Int)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) c_~n2~0) (not (< thread1Thread1of1ForFork1_~i~0 c_~n2~0)) (not (let ((.cse10 (* thread1Thread1of1ForFork1_~i~0 4))) (= (select .cse9 (+ .cse10 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select .cse11 (+ c_~get1~0.offset .cse10))))))) (= (select .cse9 .cse12) (select .cse11 .cse5)))))) (or .cse0 .cse8) (forall ((v_ArrVal_3362 (Array Int Int)) (~get1~0.base Int) (v_ArrVal_3363 (Array Int Int))) (let ((.cse17 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_3362) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3363))) (let ((.cse14 (select .cse17 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse16 (select .cse17 ~get1~0.base))) (or (forall ((thread1Thread1of1ForFork1_~i~0 Int)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) c_~n1~0) (not (< thread1Thread1of1ForFork1_~i~0 c_~n2~0)) (not (let ((.cse15 (* thread1Thread1of1ForFork1_~i~0 4))) (= (select .cse14 (+ .cse15 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select .cse16 (+ c_~get1~0.offset .cse15))))))) (= (select .cse14 .cse12) (select .cse16 .cse5)))))))) .cse22) (forall ((~get1~0.base Int) (v_ArrVal_3363 (Array Int Int))) (let ((.cse27 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3363))) (let ((.cse25 (select .cse27 ~get1~0.base)) (.cse23 (select .cse27 c_~get2~0.base))) (or (forall ((thread1Thread1of1ForFork1_~i~0 Int)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) c_~n1~0) (not (< thread1Thread1of1ForFork1_~i~0 c_~n2~0)) (not (let ((.cse24 (* thread1Thread1of1ForFork1_~i~0 4))) (= (select .cse23 (+ c_~get2~0.offset .cse24)) (select .cse25 (+ c_~get1~0.offset .cse24))))))) (= (select .cse25 .cse5) (select .cse23 .cse26)))))) (<= 2 c_~n1~0) (forall ((~get1~0.base Int)) (let ((.cse29 (select |c_#memory_int| ~get1~0.base))) (or (forall ((thread1Thread1of1ForFork1_~i~0 Int)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) c_~n1~0) (not (< thread1Thread1of1ForFork1_~i~0 c_~n2~0)) (not (let ((.cse28 (* thread1Thread1of1ForFork1_~i~0 4))) (= (select .cse2 (+ c_~get2~0.offset .cse28)) (select .cse29 (+ c_~get1~0.offset .cse28))))))) (= (select .cse29 .cse5) .cse6)))) (= |c_ULTIMATE.start_create_fresh_int_array_~size#1| c_~n1~0) (forall ((~get1~0.base Int) (v_ArrVal_3363 (Array Int Int))) (let ((.cse33 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3363))) (let ((.cse32 (select .cse33 ~get1~0.base)) (.cse30 (select .cse33 c_~get2~0.base))) (or (forall ((thread1Thread1of1ForFork1_~i~0 Int)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) c_~n2~0) (not (< thread1Thread1of1ForFork1_~i~0 c_~n2~0)) (not (let ((.cse31 (* thread1Thread1of1ForFork1_~i~0 4))) (= (select .cse30 (+ c_~get2~0.offset .cse31)) (select .cse32 (+ c_~get1~0.offset .cse31))))))) (= (select .cse32 .cse5) (select .cse30 .cse26)))))) (or .cse34 (not .cse22) .cse35) (<= 1 |c_ULTIMATE.start_create_fresh_int_array_~i~2#1|) (or .cse0 .cse36) (< c_thread1Thread1of1ForFork1_~i~0 c_~n2~0) (or .cse7 .cse1) (or .cse36 .cse7) (or (< (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~i~2#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (not .cse34) .cse35) (= c_~get1~0.offset 0) (< c_thread1Thread1of1ForFork1_~i~0 c_~n1~0) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= (+ |c_ULTIMATE.start_create_fresh_int_array_~size#1| 1) (+ c_~n2~0 |c_ULTIMATE.start_create_fresh_int_array_~i~2#1|)) (<= 2 c_~n2~0) (= c_~get2~0.offset 0)))) is different from false [2022-12-14 14:41:33,192 WARN L233 SmtUtils]: Spent 6.16s on a formula simplification. DAG size of input: 81 DAG size of output: 63 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 14:41:37,010 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse45 (* c_thread2Thread1of1ForFork0_~i~1 4)) (.cse0 (< 1 c_~n2~0)) (.cse11 (< 1 c_~n1~0)) (.cse2 (select |c_#memory_int| c_~get2~0.base)) (.cse30 (+ c_~get2~0.offset 4))) (let ((.cse6 (select .cse2 .cse30)) (.cse5 (+ c_~get1~0.offset 4)) (.cse26 (< |c_ULTIMATE.start_create_fresh_int_array_~i~2#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse41 (and (forall ((~get1~0.base Int) (v_ArrVal_3363 (Array Int Int)) (thread1Thread1of1ForFork1_~i~0 Int)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) c_~n1~0) (not (< thread1Thread1of1ForFork1_~i~0 c_~n2~0)) (not (let ((.cse48 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3363)) (.cse49 (* thread1Thread1of1ForFork1_~i~0 4))) (= (select (select .cse48 c_~get2~0.base) (+ c_~get2~0.offset .cse49)) (select (select .cse48 ~get1~0.base) (+ c_~get1~0.offset .cse49))))))) (forall ((~get1~0.base Int) (v_ArrVal_3363 (Array Int Int)) (thread1Thread1of1ForFork1_~i~0 Int)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) c_~n2~0) (not (< thread1Thread1of1ForFork1_~i~0 c_~n2~0)) (not (let ((.cse50 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3363)) (.cse51 (* thread1Thread1of1ForFork1_~i~0 4))) (= (select (select .cse50 c_~get2~0.base) (+ c_~get2~0.offset .cse51)) (select (select .cse50 ~get1~0.base) (+ c_~get1~0.offset .cse51))))))))) (.cse39 (< (+ |c_ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse40 (and .cse0 (< c_~n2~0 3) .cse11)) (.cse1 (and (forall ((~get1~0.base Int) (thread1Thread1of1ForFork1_~i~0 Int)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) c_~n1~0) (not (< thread1Thread1of1ForFork1_~i~0 c_~n2~0)) (not (let ((.cse46 (* thread1Thread1of1ForFork1_~i~0 4))) (= (select .cse2 (+ c_~get2~0.offset .cse46)) (select (select |c_#memory_int| ~get1~0.base) (+ c_~get1~0.offset .cse46))))))) (forall ((~get1~0.base Int) (thread1Thread1of1ForFork1_~i~0 Int)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) c_~n2~0) (not (< thread1Thread1of1ForFork1_~i~0 c_~n2~0)) (not (let ((.cse47 (* thread1Thread1of1ForFork1_~i~0 4))) (= (select .cse2 (+ c_~get2~0.offset .cse47)) (select (select |c_#memory_int| ~get1~0.base) (+ c_~get1~0.offset .cse47))))))))) (.cse42 (+ c_thread2Thread1of1ForFork0_~i~1 1)) (.cse32 (* c_thread1Thread1of1ForFork1_~i~0 4)) (.cse7 (select .cse2 (+ .cse45 c_~get2~0.offset 4))) (.cse9 (+ .cse45 c_~get1~0.offset 4))) (and (or .cse0 .cse1) (forall ((~get1~0.base Int)) (let ((.cse4 (select |c_#memory_int| ~get1~0.base))) (or (forall ((thread1Thread1of1ForFork1_~i~0 Int)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) c_~n2~0) (not (< thread1Thread1of1ForFork1_~i~0 c_~n2~0)) (not (let ((.cse3 (* thread1Thread1of1ForFork1_~i~0 4))) (= (select .cse2 (+ c_~get2~0.offset .cse3)) (select .cse4 (+ c_~get1~0.offset .cse3))))))) (= (select .cse4 .cse5) .cse6)))) (<= 2 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~get1~0.base Int)) (let ((.cse8 (select |c_#memory_int| ~get1~0.base))) (or (= .cse7 (select .cse8 .cse9)) (forall ((thread1Thread1of1ForFork1_~i~0 Int)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) c_~n1~0) (not (< thread1Thread1of1ForFork1_~i~0 c_~n2~0)) (not (let ((.cse10 (* thread1Thread1of1ForFork1_~i~0 4))) (= (select .cse2 (+ c_~get2~0.offset .cse10)) (select .cse8 (+ c_~get1~0.offset .cse10)))))))))) (or (let ((.cse12 (and (forall ((v_ArrVal_3362 (Array Int Int)) (~get1~0.base Int) (v_ArrVal_3363 (Array Int Int)) (thread1Thread1of1ForFork1_~i~0 Int)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) c_~n1~0) (not (< thread1Thread1of1ForFork1_~i~0 c_~n2~0)) (not (let ((.cse22 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_3362) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3363)) (.cse23 (* thread1Thread1of1ForFork1_~i~0 4))) (= (select (select .cse22 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse23 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select .cse22 ~get1~0.base) (+ c_~get1~0.offset .cse23))))))) (forall ((v_ArrVal_3362 (Array Int Int)) (~get1~0.base Int) (v_ArrVal_3363 (Array Int Int)) (thread1Thread1of1ForFork1_~i~0 Int)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) c_~n2~0) (not (< thread1Thread1of1ForFork1_~i~0 c_~n2~0)) (not (let ((.cse24 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_3362) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3363)) (.cse25 (* thread1Thread1of1ForFork1_~i~0 4))) (= (select (select .cse24 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse25 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select .cse24 ~get1~0.base) (+ c_~get1~0.offset .cse25))))))))) (.cse16 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (or .cse11 .cse12) (forall ((v_ArrVal_3362 (Array Int Int)) (~get1~0.base Int) (v_ArrVal_3363 (Array Int Int))) (let ((.cse17 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_3362) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3363))) (let ((.cse13 (select .cse17 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse15 (select .cse17 ~get1~0.base))) (or (forall ((thread1Thread1of1ForFork1_~i~0 Int)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) c_~n2~0) (not (< thread1Thread1of1ForFork1_~i~0 c_~n2~0)) (not (let ((.cse14 (* thread1Thread1of1ForFork1_~i~0 4))) (= (select .cse13 (+ .cse14 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select .cse15 (+ c_~get1~0.offset .cse14))))))) (= (select .cse13 .cse16) (select .cse15 .cse5)))))) (or .cse0 .cse12) (forall ((v_ArrVal_3362 (Array Int Int)) (~get1~0.base Int) (v_ArrVal_3363 (Array Int Int))) (let ((.cse21 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_3362) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3363))) (let ((.cse18 (select .cse21 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse20 (select .cse21 ~get1~0.base))) (or (forall ((thread1Thread1of1ForFork1_~i~0 Int)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) c_~n1~0) (not (< thread1Thread1of1ForFork1_~i~0 c_~n2~0)) (not (let ((.cse19 (* thread1Thread1of1ForFork1_~i~0 4))) (= (select .cse18 (+ .cse19 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select .cse20 (+ c_~get1~0.offset .cse19))))))) (= (select .cse18 .cse16) (select .cse20 .cse5)))))))) .cse26) (forall ((~get1~0.base Int) (v_ArrVal_3363 (Array Int Int))) (let ((.cse31 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3363))) (let ((.cse29 (select .cse31 ~get1~0.base)) (.cse27 (select .cse31 c_~get2~0.base))) (or (forall ((thread1Thread1of1ForFork1_~i~0 Int)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) c_~n1~0) (not (< thread1Thread1of1ForFork1_~i~0 c_~n2~0)) (not (let ((.cse28 (* thread1Thread1of1ForFork1_~i~0 4))) (= (select .cse27 (+ c_~get2~0.offset .cse28)) (select .cse29 (+ c_~get1~0.offset .cse28))))))) (= (select .cse29 .cse5) (select .cse27 .cse30)))))) (= (+ .cse32 c_~get1~0.offset) 4) (<= 2 c_~n1~0) (forall ((~get1~0.base Int)) (let ((.cse34 (select |c_#memory_int| ~get1~0.base))) (or (forall ((thread1Thread1of1ForFork1_~i~0 Int)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) c_~n1~0) (not (< thread1Thread1of1ForFork1_~i~0 c_~n2~0)) (not (let ((.cse33 (* thread1Thread1of1ForFork1_~i~0 4))) (= (select .cse2 (+ c_~get2~0.offset .cse33)) (select .cse34 (+ c_~get1~0.offset .cse33))))))) (= (select .cse34 .cse5) .cse6)))) (= |c_ULTIMATE.start_create_fresh_int_array_~size#1| c_~n1~0) (forall ((~get1~0.base Int) (v_ArrVal_3363 (Array Int Int))) (let ((.cse38 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3363))) (let ((.cse37 (select .cse38 ~get1~0.base)) (.cse35 (select .cse38 c_~get2~0.base))) (or (forall ((thread1Thread1of1ForFork1_~i~0 Int)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) c_~n2~0) (not (< thread1Thread1of1ForFork1_~i~0 c_~n2~0)) (not (let ((.cse36 (* thread1Thread1of1ForFork1_~i~0 4))) (= (select .cse35 (+ c_~get2~0.offset .cse36)) (select .cse37 (+ c_~get1~0.offset .cse36))))))) (= (select .cse37 .cse5) (select .cse35 .cse30)))))) (or .cse39 (not .cse26) .cse40) (<= 1 |c_ULTIMATE.start_create_fresh_int_array_~i~2#1|) (or .cse0 .cse41) (or .cse11 .cse1) (or (< .cse42 c_~n2~0) .cse1) (or .cse41 .cse11) (or (< (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~i~2#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (not .cse39) .cse40) (or .cse1 (< .cse42 c_~n1~0)) (= c_~get1~0.offset 0) (= c_thread2Thread1of1ForFork0_~i~1 0) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= (+ |c_ULTIMATE.start_create_fresh_int_array_~size#1| 1) (+ c_~n2~0 |c_ULTIMATE.start_create_fresh_int_array_~i~2#1|)) (= (+ c_~get2~0.offset .cse32) 4) (<= 2 c_~n2~0) (= c_~get2~0.offset 0) (forall ((~get1~0.base Int)) (let ((.cse43 (select |c_#memory_int| ~get1~0.base))) (or (= .cse7 (select .cse43 .cse9)) (forall ((thread1Thread1of1ForFork1_~i~0 Int)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) c_~n2~0) (not (< thread1Thread1of1ForFork1_~i~0 c_~n2~0)) (not (let ((.cse44 (* thread1Thread1of1ForFork1_~i~0 4))) (= (select .cse2 (+ c_~get2~0.offset .cse44)) (select .cse43 (+ c_~get1~0.offset .cse44))))))))))))) is different from false [2022-12-14 14:41:37,073 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse44 (* c_thread2Thread1of1ForFork0_~i~1 4)) (.cse0 (< 1 c_~n2~0)) (.cse11 (< 1 c_~n1~0)) (.cse2 (select |c_#memory_int| c_~get2~0.base)) (.cse30 (+ c_~get2~0.offset 4))) (let ((.cse6 (select .cse2 .cse30)) (.cse5 (+ c_~get1~0.offset 4)) (.cse26 (< |c_ULTIMATE.start_create_fresh_int_array_~i~2#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse40 (and (forall ((~get1~0.base Int) (v_ArrVal_3363 (Array Int Int)) (thread1Thread1of1ForFork1_~i~0 Int)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) c_~n1~0) (not (< thread1Thread1of1ForFork1_~i~0 c_~n2~0)) (not (let ((.cse47 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3363)) (.cse48 (* thread1Thread1of1ForFork1_~i~0 4))) (= (select (select .cse47 c_~get2~0.base) (+ c_~get2~0.offset .cse48)) (select (select .cse47 ~get1~0.base) (+ c_~get1~0.offset .cse48))))))) (forall ((~get1~0.base Int) (v_ArrVal_3363 (Array Int Int)) (thread1Thread1of1ForFork1_~i~0 Int)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) c_~n2~0) (not (< thread1Thread1of1ForFork1_~i~0 c_~n2~0)) (not (let ((.cse49 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3363)) (.cse50 (* thread1Thread1of1ForFork1_~i~0 4))) (= (select (select .cse49 c_~get2~0.base) (+ c_~get2~0.offset .cse50)) (select (select .cse49 ~get1~0.base) (+ c_~get1~0.offset .cse50))))))))) (.cse38 (< (+ |c_ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse39 (and .cse0 (< c_~n2~0 3) .cse11)) (.cse1 (and (forall ((~get1~0.base Int) (thread1Thread1of1ForFork1_~i~0 Int)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) c_~n1~0) (not (< thread1Thread1of1ForFork1_~i~0 c_~n2~0)) (not (let ((.cse45 (* thread1Thread1of1ForFork1_~i~0 4))) (= (select .cse2 (+ c_~get2~0.offset .cse45)) (select (select |c_#memory_int| ~get1~0.base) (+ c_~get1~0.offset .cse45))))))) (forall ((~get1~0.base Int) (thread1Thread1of1ForFork1_~i~0 Int)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) c_~n2~0) (not (< thread1Thread1of1ForFork1_~i~0 c_~n2~0)) (not (let ((.cse46 (* thread1Thread1of1ForFork1_~i~0 4))) (= (select .cse2 (+ c_~get2~0.offset .cse46)) (select (select |c_#memory_int| ~get1~0.base) (+ c_~get1~0.offset .cse46))))))))) (.cse41 (+ c_thread2Thread1of1ForFork0_~i~1 1)) (.cse7 (select .cse2 (+ .cse44 c_~get2~0.offset 4))) (.cse9 (+ .cse44 c_~get1~0.offset 4))) (and (or .cse0 .cse1) (forall ((~get1~0.base Int)) (let ((.cse4 (select |c_#memory_int| ~get1~0.base))) (or (forall ((thread1Thread1of1ForFork1_~i~0 Int)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) c_~n2~0) (not (< thread1Thread1of1ForFork1_~i~0 c_~n2~0)) (not (let ((.cse3 (* thread1Thread1of1ForFork1_~i~0 4))) (= (select .cse2 (+ c_~get2~0.offset .cse3)) (select .cse4 (+ c_~get1~0.offset .cse3))))))) (= (select .cse4 .cse5) .cse6)))) (<= 2 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~get1~0.base Int)) (let ((.cse8 (select |c_#memory_int| ~get1~0.base))) (or (= .cse7 (select .cse8 .cse9)) (forall ((thread1Thread1of1ForFork1_~i~0 Int)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) c_~n1~0) (not (< thread1Thread1of1ForFork1_~i~0 c_~n2~0)) (not (let ((.cse10 (* thread1Thread1of1ForFork1_~i~0 4))) (= (select .cse2 (+ c_~get2~0.offset .cse10)) (select .cse8 (+ c_~get1~0.offset .cse10)))))))))) (or (let ((.cse12 (and (forall ((v_ArrVal_3362 (Array Int Int)) (~get1~0.base Int) (v_ArrVal_3363 (Array Int Int)) (thread1Thread1of1ForFork1_~i~0 Int)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) c_~n1~0) (not (< thread1Thread1of1ForFork1_~i~0 c_~n2~0)) (not (let ((.cse22 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_3362) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3363)) (.cse23 (* thread1Thread1of1ForFork1_~i~0 4))) (= (select (select .cse22 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse23 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select .cse22 ~get1~0.base) (+ c_~get1~0.offset .cse23))))))) (forall ((v_ArrVal_3362 (Array Int Int)) (~get1~0.base Int) (v_ArrVal_3363 (Array Int Int)) (thread1Thread1of1ForFork1_~i~0 Int)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) c_~n2~0) (not (< thread1Thread1of1ForFork1_~i~0 c_~n2~0)) (not (let ((.cse24 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_3362) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3363)) (.cse25 (* thread1Thread1of1ForFork1_~i~0 4))) (= (select (select .cse24 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse25 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select .cse24 ~get1~0.base) (+ c_~get1~0.offset .cse25))))))))) (.cse16 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (or .cse11 .cse12) (forall ((v_ArrVal_3362 (Array Int Int)) (~get1~0.base Int) (v_ArrVal_3363 (Array Int Int))) (let ((.cse17 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_3362) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3363))) (let ((.cse13 (select .cse17 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse15 (select .cse17 ~get1~0.base))) (or (forall ((thread1Thread1of1ForFork1_~i~0 Int)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) c_~n2~0) (not (< thread1Thread1of1ForFork1_~i~0 c_~n2~0)) (not (let ((.cse14 (* thread1Thread1of1ForFork1_~i~0 4))) (= (select .cse13 (+ .cse14 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select .cse15 (+ c_~get1~0.offset .cse14))))))) (= (select .cse13 .cse16) (select .cse15 .cse5)))))) (or .cse0 .cse12) (forall ((v_ArrVal_3362 (Array Int Int)) (~get1~0.base Int) (v_ArrVal_3363 (Array Int Int))) (let ((.cse21 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_3362) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3363))) (let ((.cse18 (select .cse21 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse20 (select .cse21 ~get1~0.base))) (or (forall ((thread1Thread1of1ForFork1_~i~0 Int)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) c_~n1~0) (not (< thread1Thread1of1ForFork1_~i~0 c_~n2~0)) (not (let ((.cse19 (* thread1Thread1of1ForFork1_~i~0 4))) (= (select .cse18 (+ .cse19 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select .cse20 (+ c_~get1~0.offset .cse19))))))) (= (select .cse18 .cse16) (select .cse20 .cse5)))))))) .cse26) (forall ((~get1~0.base Int) (v_ArrVal_3363 (Array Int Int))) (let ((.cse31 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3363))) (let ((.cse29 (select .cse31 ~get1~0.base)) (.cse27 (select .cse31 c_~get2~0.base))) (or (forall ((thread1Thread1of1ForFork1_~i~0 Int)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) c_~n1~0) (not (< thread1Thread1of1ForFork1_~i~0 c_~n2~0)) (not (let ((.cse28 (* thread1Thread1of1ForFork1_~i~0 4))) (= (select .cse27 (+ c_~get2~0.offset .cse28)) (select .cse29 (+ c_~get1~0.offset .cse28))))))) (= (select .cse29 .cse5) (select .cse27 .cse30)))))) (<= 2 c_~n1~0) (forall ((~get1~0.base Int)) (let ((.cse33 (select |c_#memory_int| ~get1~0.base))) (or (forall ((thread1Thread1of1ForFork1_~i~0 Int)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) c_~n1~0) (not (< thread1Thread1of1ForFork1_~i~0 c_~n2~0)) (not (let ((.cse32 (* thread1Thread1of1ForFork1_~i~0 4))) (= (select .cse2 (+ c_~get2~0.offset .cse32)) (select .cse33 (+ c_~get1~0.offset .cse32))))))) (= (select .cse33 .cse5) .cse6)))) (= |c_ULTIMATE.start_create_fresh_int_array_~size#1| c_~n1~0) (forall ((~get1~0.base Int) (v_ArrVal_3363 (Array Int Int))) (let ((.cse37 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3363))) (let ((.cse36 (select .cse37 ~get1~0.base)) (.cse34 (select .cse37 c_~get2~0.base))) (or (forall ((thread1Thread1of1ForFork1_~i~0 Int)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) c_~n2~0) (not (< thread1Thread1of1ForFork1_~i~0 c_~n2~0)) (not (let ((.cse35 (* thread1Thread1of1ForFork1_~i~0 4))) (= (select .cse34 (+ c_~get2~0.offset .cse35)) (select .cse36 (+ c_~get1~0.offset .cse35))))))) (= (select .cse36 .cse5) (select .cse34 .cse30)))))) (or .cse38 (not .cse26) .cse39) (<= 1 |c_ULTIMATE.start_create_fresh_int_array_~i~2#1|) (or .cse0 .cse40) (< c_thread1Thread1of1ForFork1_~i~0 c_~n2~0) (or .cse11 .cse1) (or (< .cse41 c_~n2~0) .cse1) (or .cse40 .cse11) (or (< (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~i~2#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (not .cse38) .cse39) (or .cse1 (< .cse41 c_~n1~0)) (= c_~get1~0.offset 0) (< c_thread1Thread1of1ForFork1_~i~0 c_~n1~0) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= (+ |c_ULTIMATE.start_create_fresh_int_array_~size#1| 1) (+ c_~n2~0 |c_ULTIMATE.start_create_fresh_int_array_~i~2#1|)) (<= 2 c_~n2~0) (= c_~get2~0.offset 0) (forall ((~get1~0.base Int)) (let ((.cse42 (select |c_#memory_int| ~get1~0.base))) (or (= .cse7 (select .cse42 .cse9)) (forall ((thread1Thread1of1ForFork1_~i~0 Int)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) c_~n2~0) (not (< thread1Thread1of1ForFork1_~i~0 c_~n2~0)) (not (let ((.cse43 (* thread1Thread1of1ForFork1_~i~0 4))) (= (select .cse2 (+ c_~get2~0.offset .cse43)) (select .cse42 (+ c_~get1~0.offset .cse43))))))))))))) is different from false [2022-12-14 14:41:44,633 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| c_~get2~0.base)) (.cse42 (* c_thread2Thread1of1ForFork0_~i~1 4))) (let ((.cse0 (< 1 c_~n2~0)) (.cse7 (< 1 c_~n1~0)) (.cse33 (+ .cse42 c_~get1~0.offset)) (.cse34 (select .cse2 (+ .cse42 c_~get2~0.offset))) (.cse28 (+ c_~get2~0.offset 4))) (let ((.cse6 (select .cse2 .cse28)) (.cse5 (+ c_~get1~0.offset 4)) (.cse22 (< |c_ULTIMATE.start_create_fresh_int_array_~i~2#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse24 (= (select (select |c_#memory_int| c_~get1~0.base) .cse33) .cse34)) (.cse43 (and (forall ((~get1~0.base Int) (v_ArrVal_3363 (Array Int Int)) (thread1Thread1of1ForFork1_~i~0 Int)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) c_~n1~0) (not (< thread1Thread1of1ForFork1_~i~0 c_~n2~0)) (not (let ((.cse48 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3363)) (.cse49 (* thread1Thread1of1ForFork1_~i~0 4))) (= (select (select .cse48 c_~get2~0.base) (+ c_~get2~0.offset .cse49)) (select (select .cse48 ~get1~0.base) (+ c_~get1~0.offset .cse49))))))) (forall ((~get1~0.base Int) (v_ArrVal_3363 (Array Int Int)) (thread1Thread1of1ForFork1_~i~0 Int)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) c_~n2~0) (not (< thread1Thread1of1ForFork1_~i~0 c_~n2~0)) (not (let ((.cse50 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3363)) (.cse51 (* thread1Thread1of1ForFork1_~i~0 4))) (= (select (select .cse50 c_~get2~0.base) (+ c_~get2~0.offset .cse51)) (select (select .cse50 ~get1~0.base) (+ c_~get1~0.offset .cse51))))))))) (.cse40 (< (+ |c_ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse41 (and .cse0 (< c_~n2~0 3) .cse7)) (.cse1 (and (forall ((~get1~0.base Int) (thread1Thread1of1ForFork1_~i~0 Int)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) c_~n1~0) (not (< thread1Thread1of1ForFork1_~i~0 c_~n2~0)) (not (let ((.cse46 (* thread1Thread1of1ForFork1_~i~0 4))) (= (select .cse2 (+ c_~get2~0.offset .cse46)) (select (select |c_#memory_int| ~get1~0.base) (+ c_~get1~0.offset .cse46))))))) (forall ((~get1~0.base Int) (thread1Thread1of1ForFork1_~i~0 Int)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) c_~n2~0) (not (< thread1Thread1of1ForFork1_~i~0 c_~n2~0)) (not (let ((.cse47 (* thread1Thread1of1ForFork1_~i~0 4))) (= (select .cse2 (+ c_~get2~0.offset .cse47)) (select (select |c_#memory_int| ~get1~0.base) (+ c_~get1~0.offset .cse47)))))))))) (and (or .cse0 .cse1) (forall ((~get1~0.base Int)) (let ((.cse4 (select |c_#memory_int| ~get1~0.base))) (or (forall ((thread1Thread1of1ForFork1_~i~0 Int)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) c_~n2~0) (not (< thread1Thread1of1ForFork1_~i~0 c_~n2~0)) (not (let ((.cse3 (* thread1Thread1of1ForFork1_~i~0 4))) (= (select .cse2 (+ c_~get2~0.offset .cse3)) (select .cse4 (+ c_~get1~0.offset .cse3))))))) (= (select .cse4 .cse5) .cse6)))) (<= 2 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (or (let ((.cse8 (and (forall ((v_ArrVal_3362 (Array Int Int)) (~get1~0.base Int) (v_ArrVal_3363 (Array Int Int)) (thread1Thread1of1ForFork1_~i~0 Int)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) c_~n1~0) (not (< thread1Thread1of1ForFork1_~i~0 c_~n2~0)) (not (let ((.cse18 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_3362) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3363)) (.cse19 (* thread1Thread1of1ForFork1_~i~0 4))) (= (select (select .cse18 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse19 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select .cse18 ~get1~0.base) (+ c_~get1~0.offset .cse19))))))) (forall ((v_ArrVal_3362 (Array Int Int)) (~get1~0.base Int) (v_ArrVal_3363 (Array Int Int)) (thread1Thread1of1ForFork1_~i~0 Int)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) c_~n2~0) (not (< thread1Thread1of1ForFork1_~i~0 c_~n2~0)) (not (let ((.cse20 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_3362) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3363)) (.cse21 (* thread1Thread1of1ForFork1_~i~0 4))) (= (select (select .cse20 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse21 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select .cse20 ~get1~0.base) (+ c_~get1~0.offset .cse21))))))))) (.cse12 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (or .cse7 .cse8) (forall ((v_ArrVal_3362 (Array Int Int)) (~get1~0.base Int) (v_ArrVal_3363 (Array Int Int))) (let ((.cse13 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_3362) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3363))) (let ((.cse9 (select .cse13 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse11 (select .cse13 ~get1~0.base))) (or (forall ((thread1Thread1of1ForFork1_~i~0 Int)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) c_~n2~0) (not (< thread1Thread1of1ForFork1_~i~0 c_~n2~0)) (not (let ((.cse10 (* thread1Thread1of1ForFork1_~i~0 4))) (= (select .cse9 (+ .cse10 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select .cse11 (+ c_~get1~0.offset .cse10))))))) (= (select .cse9 .cse12) (select .cse11 .cse5)))))) (or .cse0 .cse8) (forall ((v_ArrVal_3362 (Array Int Int)) (~get1~0.base Int) (v_ArrVal_3363 (Array Int Int))) (let ((.cse17 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_3362) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3363))) (let ((.cse14 (select .cse17 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse16 (select .cse17 ~get1~0.base))) (or (forall ((thread1Thread1of1ForFork1_~i~0 Int)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) c_~n1~0) (not (< thread1Thread1of1ForFork1_~i~0 c_~n2~0)) (not (let ((.cse15 (* thread1Thread1of1ForFork1_~i~0 4))) (= (select .cse14 (+ .cse15 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select .cse16 (+ c_~get1~0.offset .cse15))))))) (= (select .cse14 .cse12) (select .cse16 .cse5)))))))) .cse22) (or (let ((.cse23 (+ c_thread2Thread1of1ForFork0_~i~1 1))) (and (<= .cse23 c_~n2~0) (<= .cse23 c_~n1~0))) (not .cse24)) (forall ((~get1~0.base Int) (v_ArrVal_3363 (Array Int Int))) (let ((.cse29 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3363))) (let ((.cse27 (select .cse29 ~get1~0.base)) (.cse25 (select .cse29 c_~get2~0.base))) (or (forall ((thread1Thread1of1ForFork1_~i~0 Int)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) c_~n1~0) (not (< thread1Thread1of1ForFork1_~i~0 c_~n2~0)) (not (let ((.cse26 (* thread1Thread1of1ForFork1_~i~0 4))) (= (select .cse25 (+ c_~get2~0.offset .cse26)) (select .cse27 (+ c_~get1~0.offset .cse26))))))) (= (select .cse27 .cse5) (select .cse25 .cse28)))))) (<= 2 c_~n1~0) (forall ((~get1~0.base Int)) (let ((.cse31 (select |c_#memory_int| ~get1~0.base))) (or (forall ((thread1Thread1of1ForFork1_~i~0 Int)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) c_~n1~0) (not (< thread1Thread1of1ForFork1_~i~0 c_~n2~0)) (not (let ((.cse30 (* thread1Thread1of1ForFork1_~i~0 4))) (= (select .cse2 (+ c_~get2~0.offset .cse30)) (select .cse31 (+ c_~get1~0.offset .cse30))))))) (= (select .cse31 .cse5) .cse6)))) (forall ((~get1~0.base Int)) (let ((.cse32 (select |c_#memory_int| ~get1~0.base))) (or (= (select .cse32 .cse33) .cse34) (forall ((thread1Thread1of1ForFork1_~i~0 Int)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) c_~n2~0) (not (< thread1Thread1of1ForFork1_~i~0 c_~n2~0)) (not (let ((.cse35 (* thread1Thread1of1ForFork1_~i~0 4))) (= (select .cse2 (+ c_~get2~0.offset .cse35)) (select .cse32 (+ c_~get1~0.offset .cse35)))))))))) (= |c_ULTIMATE.start_create_fresh_int_array_~size#1| c_~n1~0) (forall ((~get1~0.base Int) (v_ArrVal_3363 (Array Int Int))) (let ((.cse39 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3363))) (let ((.cse38 (select .cse39 ~get1~0.base)) (.cse36 (select .cse39 c_~get2~0.base))) (or (forall ((thread1Thread1of1ForFork1_~i~0 Int)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) c_~n2~0) (not (< thread1Thread1of1ForFork1_~i~0 c_~n2~0)) (not (let ((.cse37 (* thread1Thread1of1ForFork1_~i~0 4))) (= (select .cse36 (+ c_~get2~0.offset .cse37)) (select .cse38 (+ c_~get1~0.offset .cse37))))))) (= (select .cse38 .cse5) (select .cse36 .cse28)))))) (or .cse40 (not .cse22) .cse41) (<= 1 |c_ULTIMATE.start_create_fresh_int_array_~i~2#1|) (or (= .cse42 (* c_thread1Thread1of1ForFork1_~i~0 4)) .cse24) (or .cse0 .cse43) (< c_thread1Thread1of1ForFork1_~i~0 c_~n2~0) (or .cse7 .cse1) (or .cse43 .cse7) (or (< (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~i~2#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (not .cse40) .cse41) (= c_~get1~0.offset 0) (< c_thread1Thread1of1ForFork1_~i~0 c_~n1~0) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= (+ |c_ULTIMATE.start_create_fresh_int_array_~size#1| 1) (+ c_~n2~0 |c_ULTIMATE.start_create_fresh_int_array_~i~2#1|)) (forall ((~get1~0.base Int)) (let ((.cse44 (select |c_#memory_int| ~get1~0.base))) (or (= (select .cse44 .cse33) .cse34) (forall ((thread1Thread1of1ForFork1_~i~0 Int)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) c_~n1~0) (not (< thread1Thread1of1ForFork1_~i~0 c_~n2~0)) (not (let ((.cse45 (* thread1Thread1of1ForFork1_~i~0 4))) (= (select .cse2 (+ c_~get2~0.offset .cse45)) (select .cse44 (+ c_~get1~0.offset .cse45)))))))))) (or .cse1 (< c_thread2Thread1of1ForFork0_~i~1 c_~n2~0)) (<= 2 c_~n2~0) (= c_~get2~0.offset 0) (or (< c_thread2Thread1of1ForFork0_~i~1 c_~n1~0) .cse1))))) is different from false [2022-12-14 14:41:45,023 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse45 (* c_thread2Thread1of1ForFork0_~i~1 4)) (.cse0 (< 1 c_~n2~0)) (.cse7 (< 1 c_~n1~0)) (.cse2 (select |c_#memory_int| c_~get2~0.base)) (.cse26 (+ c_~get2~0.offset 4))) (let ((.cse6 (select .cse2 .cse26)) (.cse5 (+ c_~get1~0.offset 4)) (.cse22 (< |c_ULTIMATE.start_create_fresh_int_array_~i~2#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse40 (and (forall ((~get1~0.base Int) (v_ArrVal_3363 (Array Int Int)) (thread1Thread1of1ForFork1_~i~0 Int)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) c_~n1~0) (not (< thread1Thread1of1ForFork1_~i~0 c_~n2~0)) (not (let ((.cse46 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3363)) (.cse47 (* thread1Thread1of1ForFork1_~i~0 4))) (= (select (select .cse46 c_~get2~0.base) (+ c_~get2~0.offset .cse47)) (select (select .cse46 ~get1~0.base) (+ c_~get1~0.offset .cse47))))))) (forall ((~get1~0.base Int) (v_ArrVal_3363 (Array Int Int)) (thread1Thread1of1ForFork1_~i~0 Int)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) c_~n2~0) (not (< thread1Thread1of1ForFork1_~i~0 c_~n2~0)) (not (let ((.cse48 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3363)) (.cse49 (* thread1Thread1of1ForFork1_~i~0 4))) (= (select (select .cse48 c_~get2~0.base) (+ c_~get2~0.offset .cse49)) (select (select .cse48 ~get1~0.base) (+ c_~get1~0.offset .cse49))))))))) (.cse38 (< (+ |c_ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse39 (and .cse0 (< c_~n2~0 3) .cse7)) (.cse31 (+ .cse45 c_~get1~0.offset)) (.cse32 (select .cse2 (+ .cse45 c_~get2~0.offset))) (.cse1 (and (forall ((~get1~0.base Int) (thread1Thread1of1ForFork1_~i~0 Int)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) c_~n1~0) (not (< thread1Thread1of1ForFork1_~i~0 c_~n2~0)) (not (let ((.cse43 (* thread1Thread1of1ForFork1_~i~0 4))) (= (select .cse2 (+ c_~get2~0.offset .cse43)) (select (select |c_#memory_int| ~get1~0.base) (+ c_~get1~0.offset .cse43))))))) (forall ((~get1~0.base Int) (thread1Thread1of1ForFork1_~i~0 Int)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) c_~n2~0) (not (< thread1Thread1of1ForFork1_~i~0 c_~n2~0)) (not (let ((.cse44 (* thread1Thread1of1ForFork1_~i~0 4))) (= (select .cse2 (+ c_~get2~0.offset .cse44)) (select (select |c_#memory_int| ~get1~0.base) (+ c_~get1~0.offset .cse44)))))))))) (and (or .cse0 .cse1) (forall ((~get1~0.base Int)) (let ((.cse4 (select |c_#memory_int| ~get1~0.base))) (or (forall ((thread1Thread1of1ForFork1_~i~0 Int)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) c_~n2~0) (not (< thread1Thread1of1ForFork1_~i~0 c_~n2~0)) (not (let ((.cse3 (* thread1Thread1of1ForFork1_~i~0 4))) (= (select .cse2 (+ c_~get2~0.offset .cse3)) (select .cse4 (+ c_~get1~0.offset .cse3))))))) (= (select .cse4 .cse5) .cse6)))) (<= 2 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (or (let ((.cse8 (and (forall ((v_ArrVal_3362 (Array Int Int)) (~get1~0.base Int) (v_ArrVal_3363 (Array Int Int)) (thread1Thread1of1ForFork1_~i~0 Int)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) c_~n1~0) (not (< thread1Thread1of1ForFork1_~i~0 c_~n2~0)) (not (let ((.cse18 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_3362) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3363)) (.cse19 (* thread1Thread1of1ForFork1_~i~0 4))) (= (select (select .cse18 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse19 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select .cse18 ~get1~0.base) (+ c_~get1~0.offset .cse19))))))) (forall ((v_ArrVal_3362 (Array Int Int)) (~get1~0.base Int) (v_ArrVal_3363 (Array Int Int)) (thread1Thread1of1ForFork1_~i~0 Int)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) c_~n2~0) (not (< thread1Thread1of1ForFork1_~i~0 c_~n2~0)) (not (let ((.cse20 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_3362) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3363)) (.cse21 (* thread1Thread1of1ForFork1_~i~0 4))) (= (select (select .cse20 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse21 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select .cse20 ~get1~0.base) (+ c_~get1~0.offset .cse21))))))))) (.cse12 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (or .cse7 .cse8) (forall ((v_ArrVal_3362 (Array Int Int)) (~get1~0.base Int) (v_ArrVal_3363 (Array Int Int))) (let ((.cse13 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_3362) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3363))) (let ((.cse9 (select .cse13 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse11 (select .cse13 ~get1~0.base))) (or (forall ((thread1Thread1of1ForFork1_~i~0 Int)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) c_~n2~0) (not (< thread1Thread1of1ForFork1_~i~0 c_~n2~0)) (not (let ((.cse10 (* thread1Thread1of1ForFork1_~i~0 4))) (= (select .cse9 (+ .cse10 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select .cse11 (+ c_~get1~0.offset .cse10))))))) (= (select .cse9 .cse12) (select .cse11 .cse5)))))) (or .cse0 .cse8) (forall ((v_ArrVal_3362 (Array Int Int)) (~get1~0.base Int) (v_ArrVal_3363 (Array Int Int))) (let ((.cse17 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_3362) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3363))) (let ((.cse14 (select .cse17 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse16 (select .cse17 ~get1~0.base))) (or (forall ((thread1Thread1of1ForFork1_~i~0 Int)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) c_~n1~0) (not (< thread1Thread1of1ForFork1_~i~0 c_~n2~0)) (not (let ((.cse15 (* thread1Thread1of1ForFork1_~i~0 4))) (= (select .cse14 (+ .cse15 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select .cse16 (+ c_~get1~0.offset .cse15))))))) (= (select .cse14 .cse12) (select .cse16 .cse5)))))))) .cse22) (forall ((~get1~0.base Int) (v_ArrVal_3363 (Array Int Int))) (let ((.cse27 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3363))) (let ((.cse25 (select .cse27 ~get1~0.base)) (.cse23 (select .cse27 c_~get2~0.base))) (or (forall ((thread1Thread1of1ForFork1_~i~0 Int)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) c_~n1~0) (not (< thread1Thread1of1ForFork1_~i~0 c_~n2~0)) (not (let ((.cse24 (* thread1Thread1of1ForFork1_~i~0 4))) (= (select .cse23 (+ c_~get2~0.offset .cse24)) (select .cse25 (+ c_~get1~0.offset .cse24))))))) (= (select .cse25 .cse5) (select .cse23 .cse26)))))) (<= 2 c_~n1~0) (forall ((~get1~0.base Int)) (let ((.cse29 (select |c_#memory_int| ~get1~0.base))) (or (forall ((thread1Thread1of1ForFork1_~i~0 Int)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) c_~n1~0) (not (< thread1Thread1of1ForFork1_~i~0 c_~n2~0)) (not (let ((.cse28 (* thread1Thread1of1ForFork1_~i~0 4))) (= (select .cse2 (+ c_~get2~0.offset .cse28)) (select .cse29 (+ c_~get1~0.offset .cse28))))))) (= (select .cse29 .cse5) .cse6)))) (forall ((~get1~0.base Int)) (let ((.cse30 (select |c_#memory_int| ~get1~0.base))) (or (= (select .cse30 .cse31) .cse32) (forall ((thread1Thread1of1ForFork1_~i~0 Int)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) c_~n2~0) (not (< thread1Thread1of1ForFork1_~i~0 c_~n2~0)) (not (let ((.cse33 (* thread1Thread1of1ForFork1_~i~0 4))) (= (select .cse2 (+ c_~get2~0.offset .cse33)) (select .cse30 (+ c_~get1~0.offset .cse33)))))))))) (= |c_ULTIMATE.start_create_fresh_int_array_~size#1| c_~n1~0) (forall ((~get1~0.base Int) (v_ArrVal_3363 (Array Int Int))) (let ((.cse37 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3363))) (let ((.cse36 (select .cse37 ~get1~0.base)) (.cse34 (select .cse37 c_~get2~0.base))) (or (forall ((thread1Thread1of1ForFork1_~i~0 Int)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) c_~n2~0) (not (< thread1Thread1of1ForFork1_~i~0 c_~n2~0)) (not (let ((.cse35 (* thread1Thread1of1ForFork1_~i~0 4))) (= (select .cse34 (+ c_~get2~0.offset .cse35)) (select .cse36 (+ c_~get1~0.offset .cse35))))))) (= (select .cse36 .cse5) (select .cse34 .cse26)))))) (or .cse38 (not .cse22) .cse39) (<= 1 |c_ULTIMATE.start_create_fresh_int_array_~i~2#1|) (or .cse0 .cse40) (< c_thread1Thread1of1ForFork1_~i~0 c_~n2~0) (or .cse7 .cse1) (or .cse40 .cse7) (or (< (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~i~2#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (not .cse38) .cse39) (= c_~get1~0.offset 0) (< c_thread1Thread1of1ForFork1_~i~0 c_~n1~0) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= (+ |c_ULTIMATE.start_create_fresh_int_array_~size#1| 1) (+ c_~n2~0 |c_ULTIMATE.start_create_fresh_int_array_~i~2#1|)) (forall ((~get1~0.base Int)) (let ((.cse41 (select |c_#memory_int| ~get1~0.base))) (or (= (select .cse41 .cse31) .cse32) (forall ((thread1Thread1of1ForFork1_~i~0 Int)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) c_~n1~0) (not (< thread1Thread1of1ForFork1_~i~0 c_~n2~0)) (not (let ((.cse42 (* thread1Thread1of1ForFork1_~i~0 4))) (= (select .cse2 (+ c_~get2~0.offset .cse42)) (select .cse41 (+ c_~get1~0.offset .cse42)))))))))) (or .cse1 (< c_thread2Thread1of1ForFork0_~i~1 c_~n2~0)) (<= 2 c_~n2~0) (= c_~get2~0.offset 0) (or (< c_thread2Thread1of1ForFork0_~i~1 c_~n1~0) .cse1)))) is different from false [2022-12-14 14:41:47,578 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:41:47,981 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_~get2~0.base)) (.cse45 (* c_thread2Thread1of1ForFork0_~i~1 4))) (let ((.cse3 (< 1 c_~n2~0)) (.cse9 (< 1 c_~n1~0)) (.cse2 (select |c_#memory_int| c_~get1~0.base)) (.cse35 (+ .cse45 c_~get1~0.offset)) (.cse36 (select .cse0 (+ .cse45 c_~get2~0.offset))) (.cse30 (+ c_~get2~0.offset 4))) (let ((.cse8 (select .cse0 .cse30)) (.cse7 (+ c_~get1~0.offset 4)) (.cse24 (< |c_ULTIMATE.start_create_fresh_int_array_~i~2#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse26 (= (select .cse2 .cse35) .cse36)) (.cse46 (* c_thread1Thread1of1ForFork1_~i~0 4)) (.cse47 (and (forall ((~get1~0.base Int) (v_ArrVal_3363 (Array Int Int)) (thread1Thread1of1ForFork1_~i~0 Int)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) c_~n1~0) (not (< thread1Thread1of1ForFork1_~i~0 c_~n2~0)) (not (let ((.cse52 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3363)) (.cse53 (* thread1Thread1of1ForFork1_~i~0 4))) (= (select (select .cse52 c_~get2~0.base) (+ c_~get2~0.offset .cse53)) (select (select .cse52 ~get1~0.base) (+ c_~get1~0.offset .cse53))))))) (forall ((~get1~0.base Int) (v_ArrVal_3363 (Array Int Int)) (thread1Thread1of1ForFork1_~i~0 Int)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) c_~n2~0) (not (< thread1Thread1of1ForFork1_~i~0 c_~n2~0)) (not (let ((.cse54 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3363)) (.cse55 (* thread1Thread1of1ForFork1_~i~0 4))) (= (select (select .cse54 c_~get2~0.base) (+ c_~get2~0.offset .cse55)) (select (select .cse54 ~get1~0.base) (+ c_~get1~0.offset .cse55))))))))) (.cse43 (< (+ |c_ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse44 (and .cse3 (< c_~n2~0 3) .cse9)) (.cse4 (and (forall ((~get1~0.base Int) (thread1Thread1of1ForFork1_~i~0 Int)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) c_~n1~0) (not (< thread1Thread1of1ForFork1_~i~0 c_~n2~0)) (not (let ((.cse50 (* thread1Thread1of1ForFork1_~i~0 4))) (= (select .cse0 (+ c_~get2~0.offset .cse50)) (select (select |c_#memory_int| ~get1~0.base) (+ c_~get1~0.offset .cse50))))))) (forall ((~get1~0.base Int) (thread1Thread1of1ForFork1_~i~0 Int)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) c_~n2~0) (not (< thread1Thread1of1ForFork1_~i~0 c_~n2~0)) (not (let ((.cse51 (* thread1Thread1of1ForFork1_~i~0 4))) (= (select .cse0 (+ c_~get2~0.offset .cse51)) (select (select |c_#memory_int| ~get1~0.base) (+ c_~get1~0.offset .cse51)))))))))) (and (forall ((thread1Thread1of1ForFork1_~i~0 Int)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) c_~n1~0) (not (let ((.cse1 (* thread1Thread1of1ForFork1_~i~0 4))) (= (select .cse0 (+ c_~get2~0.offset .cse1)) (select .cse2 (+ c_~get1~0.offset .cse1))))) (not (< thread1Thread1of1ForFork1_~i~0 c_~n2~0)))) (or .cse3 .cse4) (forall ((~get1~0.base Int)) (let ((.cse6 (select |c_#memory_int| ~get1~0.base))) (or (forall ((thread1Thread1of1ForFork1_~i~0 Int)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) c_~n2~0) (not (< thread1Thread1of1ForFork1_~i~0 c_~n2~0)) (not (let ((.cse5 (* thread1Thread1of1ForFork1_~i~0 4))) (= (select .cse0 (+ c_~get2~0.offset .cse5)) (select .cse6 (+ c_~get1~0.offset .cse5))))))) (= (select .cse6 .cse7) .cse8)))) (<= 2 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (or (let ((.cse10 (and (forall ((v_ArrVal_3362 (Array Int Int)) (~get1~0.base Int) (v_ArrVal_3363 (Array Int Int)) (thread1Thread1of1ForFork1_~i~0 Int)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) c_~n1~0) (not (< thread1Thread1of1ForFork1_~i~0 c_~n2~0)) (not (let ((.cse20 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_3362) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3363)) (.cse21 (* thread1Thread1of1ForFork1_~i~0 4))) (= (select (select .cse20 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse21 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select .cse20 ~get1~0.base) (+ c_~get1~0.offset .cse21))))))) (forall ((v_ArrVal_3362 (Array Int Int)) (~get1~0.base Int) (v_ArrVal_3363 (Array Int Int)) (thread1Thread1of1ForFork1_~i~0 Int)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) c_~n2~0) (not (< thread1Thread1of1ForFork1_~i~0 c_~n2~0)) (not (let ((.cse22 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_3362) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3363)) (.cse23 (* thread1Thread1of1ForFork1_~i~0 4))) (= (select (select .cse22 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse23 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select .cse22 ~get1~0.base) (+ c_~get1~0.offset .cse23))))))))) (.cse14 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (or .cse9 .cse10) (forall ((v_ArrVal_3362 (Array Int Int)) (~get1~0.base Int) (v_ArrVal_3363 (Array Int Int))) (let ((.cse15 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_3362) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3363))) (let ((.cse11 (select .cse15 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse13 (select .cse15 ~get1~0.base))) (or (forall ((thread1Thread1of1ForFork1_~i~0 Int)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) c_~n2~0) (not (< thread1Thread1of1ForFork1_~i~0 c_~n2~0)) (not (let ((.cse12 (* thread1Thread1of1ForFork1_~i~0 4))) (= (select .cse11 (+ .cse12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select .cse13 (+ c_~get1~0.offset .cse12))))))) (= (select .cse11 .cse14) (select .cse13 .cse7)))))) (or .cse3 .cse10) (forall ((v_ArrVal_3362 (Array Int Int)) (~get1~0.base Int) (v_ArrVal_3363 (Array Int Int))) (let ((.cse19 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_3362) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3363))) (let ((.cse16 (select .cse19 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse18 (select .cse19 ~get1~0.base))) (or (forall ((thread1Thread1of1ForFork1_~i~0 Int)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) c_~n1~0) (not (< thread1Thread1of1ForFork1_~i~0 c_~n2~0)) (not (let ((.cse17 (* thread1Thread1of1ForFork1_~i~0 4))) (= (select .cse16 (+ .cse17 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select .cse18 (+ c_~get1~0.offset .cse17))))))) (= (select .cse16 .cse14) (select .cse18 .cse7)))))))) .cse24) (or (let ((.cse25 (+ c_thread2Thread1of1ForFork0_~i~1 1))) (and (<= .cse25 c_~n2~0) (<= .cse25 c_~n1~0))) (not .cse26)) (forall ((~get1~0.base Int) (v_ArrVal_3363 (Array Int Int))) (let ((.cse31 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3363))) (let ((.cse29 (select .cse31 ~get1~0.base)) (.cse27 (select .cse31 c_~get2~0.base))) (or (forall ((thread1Thread1of1ForFork1_~i~0 Int)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) c_~n1~0) (not (< thread1Thread1of1ForFork1_~i~0 c_~n2~0)) (not (let ((.cse28 (* thread1Thread1of1ForFork1_~i~0 4))) (= (select .cse27 (+ c_~get2~0.offset .cse28)) (select .cse29 (+ c_~get1~0.offset .cse28))))))) (= (select .cse29 .cse7) (select .cse27 .cse30)))))) (<= 2 c_~n1~0) (forall ((~get1~0.base Int)) (let ((.cse33 (select |c_#memory_int| ~get1~0.base))) (or (forall ((thread1Thread1of1ForFork1_~i~0 Int)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) c_~n1~0) (not (< thread1Thread1of1ForFork1_~i~0 c_~n2~0)) (not (let ((.cse32 (* thread1Thread1of1ForFork1_~i~0 4))) (= (select .cse0 (+ c_~get2~0.offset .cse32)) (select .cse33 (+ c_~get1~0.offset .cse32))))))) (= (select .cse33 .cse7) .cse8)))) (forall ((~get1~0.base Int)) (let ((.cse34 (select |c_#memory_int| ~get1~0.base))) (or (= (select .cse34 .cse35) .cse36) (forall ((thread1Thread1of1ForFork1_~i~0 Int)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) c_~n2~0) (not (< thread1Thread1of1ForFork1_~i~0 c_~n2~0)) (not (let ((.cse37 (* thread1Thread1of1ForFork1_~i~0 4))) (= (select .cse0 (+ c_~get2~0.offset .cse37)) (select .cse34 (+ c_~get1~0.offset .cse37)))))))))) (= |c_ULTIMATE.start_create_fresh_int_array_~size#1| c_~n1~0) (forall ((~get1~0.base Int) (v_ArrVal_3363 (Array Int Int))) (let ((.cse41 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3363))) (let ((.cse40 (select .cse41 ~get1~0.base)) (.cse38 (select .cse41 c_~get2~0.base))) (or (forall ((thread1Thread1of1ForFork1_~i~0 Int)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) c_~n2~0) (not (< thread1Thread1of1ForFork1_~i~0 c_~n2~0)) (not (let ((.cse39 (* thread1Thread1of1ForFork1_~i~0 4))) (= (select .cse38 (+ c_~get2~0.offset .cse39)) (select .cse40 (+ c_~get1~0.offset .cse39))))))) (= (select .cse40 .cse7) (select .cse38 .cse30)))))) (forall ((thread1Thread1of1ForFork1_~i~0 Int)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) c_~n2~0) (not (let ((.cse42 (* thread1Thread1of1ForFork1_~i~0 4))) (= (select .cse0 (+ c_~get2~0.offset .cse42)) (select .cse2 (+ c_~get1~0.offset .cse42))))) (not (< thread1Thread1of1ForFork1_~i~0 c_~n2~0)))) (or .cse43 (not .cse24) .cse44) (<= 1 |c_ULTIMATE.start_create_fresh_int_array_~i~2#1|) (or (= .cse45 .cse46) .cse26) (or .cse3 .cse47) (not (= (select .cse2 (+ .cse46 c_~get1~0.offset)) (select .cse0 (+ c_~get2~0.offset .cse46)))) (< c_thread1Thread1of1ForFork1_~i~0 c_~n2~0) (or .cse9 .cse4) (or .cse47 .cse9) (or (< (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~i~2#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (not .cse43) .cse44) (= c_~get1~0.offset 0) (< c_thread1Thread1of1ForFork1_~i~0 c_~n1~0) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= (+ |c_ULTIMATE.start_create_fresh_int_array_~size#1| 1) (+ c_~n2~0 |c_ULTIMATE.start_create_fresh_int_array_~i~2#1|)) (forall ((~get1~0.base Int)) (let ((.cse48 (select |c_#memory_int| ~get1~0.base))) (or (= (select .cse48 .cse35) .cse36) (forall ((thread1Thread1of1ForFork1_~i~0 Int)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) c_~n1~0) (not (< thread1Thread1of1ForFork1_~i~0 c_~n2~0)) (not (let ((.cse49 (* thread1Thread1of1ForFork1_~i~0 4))) (= (select .cse0 (+ c_~get2~0.offset .cse49)) (select .cse48 (+ c_~get1~0.offset .cse49)))))))))) (or .cse4 (< c_thread2Thread1of1ForFork0_~i~1 c_~n2~0)) (<= 2 c_~n2~0) (= c_~get2~0.offset 0) (or (< c_thread2Thread1of1ForFork0_~i~1 c_~n1~0) .cse4))))) is different from false [2022-12-14 14:41:50,586 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse48 (* c_thread2Thread1of1ForFork0_~i~1 4)) (.cse3 (< 1 c_~n2~0)) (.cse9 (< 1 c_~n1~0)) (.cse0 (select |c_#memory_int| c_~get2~0.base)) (.cse28 (+ c_~get2~0.offset 4))) (let ((.cse8 (select .cse0 .cse28)) (.cse7 (+ c_~get1~0.offset 4)) (.cse2 (select |c_#memory_int| c_~get1~0.base)) (.cse24 (< |c_ULTIMATE.start_create_fresh_int_array_~i~2#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse43 (and (forall ((~get1~0.base Int) (v_ArrVal_3363 (Array Int Int)) (thread1Thread1of1ForFork1_~i~0 Int)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) c_~n1~0) (not (< thread1Thread1of1ForFork1_~i~0 c_~n2~0)) (not (let ((.cse49 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3363)) (.cse50 (* thread1Thread1of1ForFork1_~i~0 4))) (= (select (select .cse49 c_~get2~0.base) (+ c_~get2~0.offset .cse50)) (select (select .cse49 ~get1~0.base) (+ c_~get1~0.offset .cse50))))))) (forall ((~get1~0.base Int) (v_ArrVal_3363 (Array Int Int)) (thread1Thread1of1ForFork1_~i~0 Int)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) c_~n2~0) (not (< thread1Thread1of1ForFork1_~i~0 c_~n2~0)) (not (let ((.cse51 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3363)) (.cse52 (* thread1Thread1of1ForFork1_~i~0 4))) (= (select (select .cse51 c_~get2~0.base) (+ c_~get2~0.offset .cse52)) (select (select .cse51 ~get1~0.base) (+ c_~get1~0.offset .cse52))))))))) (.cse41 (< (+ |c_ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse42 (and .cse3 (< c_~n2~0 3) .cse9)) (.cse33 (+ .cse48 c_~get1~0.offset)) (.cse34 (select .cse0 (+ .cse48 c_~get2~0.offset))) (.cse4 (and (forall ((~get1~0.base Int) (thread1Thread1of1ForFork1_~i~0 Int)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) c_~n1~0) (not (< thread1Thread1of1ForFork1_~i~0 c_~n2~0)) (not (let ((.cse46 (* thread1Thread1of1ForFork1_~i~0 4))) (= (select .cse0 (+ c_~get2~0.offset .cse46)) (select (select |c_#memory_int| ~get1~0.base) (+ c_~get1~0.offset .cse46))))))) (forall ((~get1~0.base Int) (thread1Thread1of1ForFork1_~i~0 Int)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) c_~n2~0) (not (< thread1Thread1of1ForFork1_~i~0 c_~n2~0)) (not (let ((.cse47 (* thread1Thread1of1ForFork1_~i~0 4))) (= (select .cse0 (+ c_~get2~0.offset .cse47)) (select (select |c_#memory_int| ~get1~0.base) (+ c_~get1~0.offset .cse47)))))))))) (and (forall ((thread1Thread1of1ForFork1_~i~0 Int)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) c_~n1~0) (not (let ((.cse1 (* thread1Thread1of1ForFork1_~i~0 4))) (= (select .cse0 (+ c_~get2~0.offset .cse1)) (select .cse2 (+ c_~get1~0.offset .cse1))))) (not (< thread1Thread1of1ForFork1_~i~0 c_~n2~0)))) (or .cse3 .cse4) (forall ((~get1~0.base Int)) (let ((.cse6 (select |c_#memory_int| ~get1~0.base))) (or (forall ((thread1Thread1of1ForFork1_~i~0 Int)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) c_~n2~0) (not (< thread1Thread1of1ForFork1_~i~0 c_~n2~0)) (not (let ((.cse5 (* thread1Thread1of1ForFork1_~i~0 4))) (= (select .cse0 (+ c_~get2~0.offset .cse5)) (select .cse6 (+ c_~get1~0.offset .cse5))))))) (= (select .cse6 .cse7) .cse8)))) (<= 2 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (or (let ((.cse10 (and (forall ((v_ArrVal_3362 (Array Int Int)) (~get1~0.base Int) (v_ArrVal_3363 (Array Int Int)) (thread1Thread1of1ForFork1_~i~0 Int)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) c_~n1~0) (not (< thread1Thread1of1ForFork1_~i~0 c_~n2~0)) (not (let ((.cse20 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_3362) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3363)) (.cse21 (* thread1Thread1of1ForFork1_~i~0 4))) (= (select (select .cse20 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse21 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select .cse20 ~get1~0.base) (+ c_~get1~0.offset .cse21))))))) (forall ((v_ArrVal_3362 (Array Int Int)) (~get1~0.base Int) (v_ArrVal_3363 (Array Int Int)) (thread1Thread1of1ForFork1_~i~0 Int)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) c_~n2~0) (not (< thread1Thread1of1ForFork1_~i~0 c_~n2~0)) (not (let ((.cse22 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_3362) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3363)) (.cse23 (* thread1Thread1of1ForFork1_~i~0 4))) (= (select (select .cse22 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse23 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select .cse22 ~get1~0.base) (+ c_~get1~0.offset .cse23))))))))) (.cse14 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (or .cse9 .cse10) (forall ((v_ArrVal_3362 (Array Int Int)) (~get1~0.base Int) (v_ArrVal_3363 (Array Int Int))) (let ((.cse15 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_3362) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3363))) (let ((.cse11 (select .cse15 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse13 (select .cse15 ~get1~0.base))) (or (forall ((thread1Thread1of1ForFork1_~i~0 Int)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) c_~n2~0) (not (< thread1Thread1of1ForFork1_~i~0 c_~n2~0)) (not (let ((.cse12 (* thread1Thread1of1ForFork1_~i~0 4))) (= (select .cse11 (+ .cse12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select .cse13 (+ c_~get1~0.offset .cse12))))))) (= (select .cse11 .cse14) (select .cse13 .cse7)))))) (or .cse3 .cse10) (forall ((v_ArrVal_3362 (Array Int Int)) (~get1~0.base Int) (v_ArrVal_3363 (Array Int Int))) (let ((.cse19 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_3362) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3363))) (let ((.cse16 (select .cse19 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse18 (select .cse19 ~get1~0.base))) (or (forall ((thread1Thread1of1ForFork1_~i~0 Int)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) c_~n1~0) (not (< thread1Thread1of1ForFork1_~i~0 c_~n2~0)) (not (let ((.cse17 (* thread1Thread1of1ForFork1_~i~0 4))) (= (select .cse16 (+ .cse17 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select .cse18 (+ c_~get1~0.offset .cse17))))))) (= (select .cse16 .cse14) (select .cse18 .cse7)))))))) .cse24) (forall ((~get1~0.base Int) (v_ArrVal_3363 (Array Int Int))) (let ((.cse29 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3363))) (let ((.cse27 (select .cse29 ~get1~0.base)) (.cse25 (select .cse29 c_~get2~0.base))) (or (forall ((thread1Thread1of1ForFork1_~i~0 Int)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) c_~n1~0) (not (< thread1Thread1of1ForFork1_~i~0 c_~n2~0)) (not (let ((.cse26 (* thread1Thread1of1ForFork1_~i~0 4))) (= (select .cse25 (+ c_~get2~0.offset .cse26)) (select .cse27 (+ c_~get1~0.offset .cse26))))))) (= (select .cse27 .cse7) (select .cse25 .cse28)))))) (<= 2 c_~n1~0) (forall ((~get1~0.base Int)) (let ((.cse31 (select |c_#memory_int| ~get1~0.base))) (or (forall ((thread1Thread1of1ForFork1_~i~0 Int)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) c_~n1~0) (not (< thread1Thread1of1ForFork1_~i~0 c_~n2~0)) (not (let ((.cse30 (* thread1Thread1of1ForFork1_~i~0 4))) (= (select .cse0 (+ c_~get2~0.offset .cse30)) (select .cse31 (+ c_~get1~0.offset .cse30))))))) (= (select .cse31 .cse7) .cse8)))) (forall ((~get1~0.base Int)) (let ((.cse32 (select |c_#memory_int| ~get1~0.base))) (or (= (select .cse32 .cse33) .cse34) (forall ((thread1Thread1of1ForFork1_~i~0 Int)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) c_~n2~0) (not (< thread1Thread1of1ForFork1_~i~0 c_~n2~0)) (not (let ((.cse35 (* thread1Thread1of1ForFork1_~i~0 4))) (= (select .cse0 (+ c_~get2~0.offset .cse35)) (select .cse32 (+ c_~get1~0.offset .cse35)))))))))) (= |c_ULTIMATE.start_create_fresh_int_array_~size#1| c_~n1~0) (forall ((~get1~0.base Int) (v_ArrVal_3363 (Array Int Int))) (let ((.cse39 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3363))) (let ((.cse38 (select .cse39 ~get1~0.base)) (.cse36 (select .cse39 c_~get2~0.base))) (or (forall ((thread1Thread1of1ForFork1_~i~0 Int)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) c_~n2~0) (not (< thread1Thread1of1ForFork1_~i~0 c_~n2~0)) (not (let ((.cse37 (* thread1Thread1of1ForFork1_~i~0 4))) (= (select .cse36 (+ c_~get2~0.offset .cse37)) (select .cse38 (+ c_~get1~0.offset .cse37))))))) (= (select .cse38 .cse7) (select .cse36 .cse28)))))) (forall ((thread1Thread1of1ForFork1_~i~0 Int)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) c_~n2~0) (not (let ((.cse40 (* thread1Thread1of1ForFork1_~i~0 4))) (= (select .cse0 (+ c_~get2~0.offset .cse40)) (select .cse2 (+ c_~get1~0.offset .cse40))))) (not (< thread1Thread1of1ForFork1_~i~0 c_~n2~0)))) (or .cse41 (not .cse24) .cse42) (<= 1 |c_ULTIMATE.start_create_fresh_int_array_~i~2#1|) (or .cse3 .cse43) (< c_thread1Thread1of1ForFork1_~i~0 c_~n2~0) (or .cse9 .cse4) (or .cse43 .cse9) (or (< (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~i~2#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (not .cse41) .cse42) (= c_~get1~0.offset 0) (< c_thread1Thread1of1ForFork1_~i~0 c_~n1~0) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= (+ |c_ULTIMATE.start_create_fresh_int_array_~size#1| 1) (+ c_~n2~0 |c_ULTIMATE.start_create_fresh_int_array_~i~2#1|)) (forall ((~get1~0.base Int)) (let ((.cse44 (select |c_#memory_int| ~get1~0.base))) (or (= (select .cse44 .cse33) .cse34) (forall ((thread1Thread1of1ForFork1_~i~0 Int)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) c_~n1~0) (not (< thread1Thread1of1ForFork1_~i~0 c_~n2~0)) (not (let ((.cse45 (* thread1Thread1of1ForFork1_~i~0 4))) (= (select .cse0 (+ c_~get2~0.offset .cse45)) (select .cse44 (+ c_~get1~0.offset .cse45)))))))))) (or .cse4 (< c_thread2Thread1of1ForFork0_~i~1 c_~n2~0)) (<= 2 c_~n2~0) (= c_~get2~0.offset 0) (or (< c_thread2Thread1of1ForFork0_~i~1 c_~n1~0) .cse4)))) is different from false [2022-12-14 14:41:54,446 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse49 (* c_thread2Thread1of1ForFork0_~i~1 4)) (.cse3 (< 1 c_~n2~0)) (.cse9 (< 1 c_~n1~0)) (.cse0 (select |c_#memory_int| c_~get2~0.base)) (.cse28 (+ c_~get2~0.offset 4))) (let ((.cse8 (select .cse0 .cse28)) (.cse7 (+ c_~get1~0.offset 4)) (.cse24 (< |c_ULTIMATE.start_create_fresh_int_array_~i~2#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse2 (select |c_#memory_int| c_~get1~0.base)) (.cse43 (and (forall ((~get1~0.base Int) (v_ArrVal_3363 (Array Int Int)) (thread1Thread1of1ForFork1_~i~0 Int)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) c_~n1~0) (not (< thread1Thread1of1ForFork1_~i~0 c_~n2~0)) (not (let ((.cse50 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3363)) (.cse51 (* thread1Thread1of1ForFork1_~i~0 4))) (= (select (select .cse50 c_~get2~0.base) (+ c_~get2~0.offset .cse51)) (select (select .cse50 ~get1~0.base) (+ c_~get1~0.offset .cse51))))))) (forall ((~get1~0.base Int) (v_ArrVal_3363 (Array Int Int)) (thread1Thread1of1ForFork1_~i~0 Int)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) c_~n2~0) (not (< thread1Thread1of1ForFork1_~i~0 c_~n2~0)) (not (let ((.cse52 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3363)) (.cse53 (* thread1Thread1of1ForFork1_~i~0 4))) (= (select (select .cse52 c_~get2~0.base) (+ c_~get2~0.offset .cse53)) (select (select .cse52 ~get1~0.base) (+ c_~get1~0.offset .cse53))))))))) (.cse41 (< (+ |c_ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse42 (and .cse3 (< c_~n2~0 3) .cse9)) (.cse33 (+ .cse49 c_~get1~0.offset)) (.cse34 (select .cse0 (+ .cse49 c_~get2~0.offset))) (.cse4 (and (forall ((~get1~0.base Int) (thread1Thread1of1ForFork1_~i~0 Int)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) c_~n1~0) (not (< thread1Thread1of1ForFork1_~i~0 c_~n2~0)) (not (let ((.cse47 (* thread1Thread1of1ForFork1_~i~0 4))) (= (select .cse0 (+ c_~get2~0.offset .cse47)) (select (select |c_#memory_int| ~get1~0.base) (+ c_~get1~0.offset .cse47))))))) (forall ((~get1~0.base Int) (thread1Thread1of1ForFork1_~i~0 Int)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) c_~n2~0) (not (< thread1Thread1of1ForFork1_~i~0 c_~n2~0)) (not (let ((.cse48 (* thread1Thread1of1ForFork1_~i~0 4))) (= (select .cse0 (+ c_~get2~0.offset .cse48)) (select (select |c_#memory_int| ~get1~0.base) (+ c_~get1~0.offset .cse48)))))))))) (and (forall ((thread1Thread1of1ForFork1_~i~0 Int)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) c_~n1~0) (not (let ((.cse1 (* thread1Thread1of1ForFork1_~i~0 4))) (= (select .cse0 (+ c_~get2~0.offset .cse1)) (select .cse2 (+ c_~get1~0.offset .cse1))))) (not (< thread1Thread1of1ForFork1_~i~0 c_~n2~0)))) (or .cse3 .cse4) (forall ((~get1~0.base Int)) (let ((.cse6 (select |c_#memory_int| ~get1~0.base))) (or (forall ((thread1Thread1of1ForFork1_~i~0 Int)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) c_~n2~0) (not (< thread1Thread1of1ForFork1_~i~0 c_~n2~0)) (not (let ((.cse5 (* thread1Thread1of1ForFork1_~i~0 4))) (= (select .cse0 (+ c_~get2~0.offset .cse5)) (select .cse6 (+ c_~get1~0.offset .cse5))))))) (= (select .cse6 .cse7) .cse8)))) (<= 2 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (or (let ((.cse10 (and (forall ((v_ArrVal_3362 (Array Int Int)) (~get1~0.base Int) (v_ArrVal_3363 (Array Int Int)) (thread1Thread1of1ForFork1_~i~0 Int)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) c_~n1~0) (not (< thread1Thread1of1ForFork1_~i~0 c_~n2~0)) (not (let ((.cse20 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_3362) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3363)) (.cse21 (* thread1Thread1of1ForFork1_~i~0 4))) (= (select (select .cse20 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse21 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select .cse20 ~get1~0.base) (+ c_~get1~0.offset .cse21))))))) (forall ((v_ArrVal_3362 (Array Int Int)) (~get1~0.base Int) (v_ArrVal_3363 (Array Int Int)) (thread1Thread1of1ForFork1_~i~0 Int)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) c_~n2~0) (not (< thread1Thread1of1ForFork1_~i~0 c_~n2~0)) (not (let ((.cse22 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_3362) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3363)) (.cse23 (* thread1Thread1of1ForFork1_~i~0 4))) (= (select (select .cse22 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse23 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select .cse22 ~get1~0.base) (+ c_~get1~0.offset .cse23))))))))) (.cse14 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (or .cse9 .cse10) (forall ((v_ArrVal_3362 (Array Int Int)) (~get1~0.base Int) (v_ArrVal_3363 (Array Int Int))) (let ((.cse15 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_3362) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3363))) (let ((.cse11 (select .cse15 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse13 (select .cse15 ~get1~0.base))) (or (forall ((thread1Thread1of1ForFork1_~i~0 Int)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) c_~n2~0) (not (< thread1Thread1of1ForFork1_~i~0 c_~n2~0)) (not (let ((.cse12 (* thread1Thread1of1ForFork1_~i~0 4))) (= (select .cse11 (+ .cse12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select .cse13 (+ c_~get1~0.offset .cse12))))))) (= (select .cse11 .cse14) (select .cse13 .cse7)))))) (or .cse3 .cse10) (forall ((v_ArrVal_3362 (Array Int Int)) (~get1~0.base Int) (v_ArrVal_3363 (Array Int Int))) (let ((.cse19 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_3362) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3363))) (let ((.cse16 (select .cse19 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse18 (select .cse19 ~get1~0.base))) (or (forall ((thread1Thread1of1ForFork1_~i~0 Int)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) c_~n1~0) (not (< thread1Thread1of1ForFork1_~i~0 c_~n2~0)) (not (let ((.cse17 (* thread1Thread1of1ForFork1_~i~0 4))) (= (select .cse16 (+ .cse17 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select .cse18 (+ c_~get1~0.offset .cse17))))))) (= (select .cse16 .cse14) (select .cse18 .cse7)))))))) .cse24) (forall ((~get1~0.base Int) (v_ArrVal_3363 (Array Int Int))) (let ((.cse29 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3363))) (let ((.cse27 (select .cse29 ~get1~0.base)) (.cse25 (select .cse29 c_~get2~0.base))) (or (forall ((thread1Thread1of1ForFork1_~i~0 Int)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) c_~n1~0) (not (< thread1Thread1of1ForFork1_~i~0 c_~n2~0)) (not (let ((.cse26 (* thread1Thread1of1ForFork1_~i~0 4))) (= (select .cse25 (+ c_~get2~0.offset .cse26)) (select .cse27 (+ c_~get1~0.offset .cse26))))))) (= (select .cse27 .cse7) (select .cse25 .cse28)))))) (<= 2 c_~n1~0) (forall ((~get1~0.base Int)) (let ((.cse31 (select |c_#memory_int| ~get1~0.base))) (or (forall ((thread1Thread1of1ForFork1_~i~0 Int)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) c_~n1~0) (not (< thread1Thread1of1ForFork1_~i~0 c_~n2~0)) (not (let ((.cse30 (* thread1Thread1of1ForFork1_~i~0 4))) (= (select .cse0 (+ c_~get2~0.offset .cse30)) (select .cse31 (+ c_~get1~0.offset .cse30))))))) (= (select .cse31 .cse7) .cse8)))) (forall ((~get1~0.base Int)) (let ((.cse32 (select |c_#memory_int| ~get1~0.base))) (or (= (select .cse32 .cse33) .cse34) (forall ((thread1Thread1of1ForFork1_~i~0 Int)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) c_~n2~0) (not (< thread1Thread1of1ForFork1_~i~0 c_~n2~0)) (not (let ((.cse35 (* thread1Thread1of1ForFork1_~i~0 4))) (= (select .cse0 (+ c_~get2~0.offset .cse35)) (select .cse32 (+ c_~get1~0.offset .cse35)))))))))) (= |c_ULTIMATE.start_create_fresh_int_array_~size#1| c_~n1~0) (forall ((~get1~0.base Int) (v_ArrVal_3363 (Array Int Int))) (let ((.cse39 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3363))) (let ((.cse38 (select .cse39 ~get1~0.base)) (.cse36 (select .cse39 c_~get2~0.base))) (or (forall ((thread1Thread1of1ForFork1_~i~0 Int)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) c_~n2~0) (not (< thread1Thread1of1ForFork1_~i~0 c_~n2~0)) (not (let ((.cse37 (* thread1Thread1of1ForFork1_~i~0 4))) (= (select .cse36 (+ c_~get2~0.offset .cse37)) (select .cse38 (+ c_~get1~0.offset .cse37))))))) (= (select .cse38 .cse7) (select .cse36 .cse28)))))) (forall ((thread1Thread1of1ForFork1_~i~0 Int)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) c_~n2~0) (not (let ((.cse40 (* thread1Thread1of1ForFork1_~i~0 4))) (= (select .cse0 (+ c_~get2~0.offset .cse40)) (select .cse2 (+ c_~get1~0.offset .cse40))))) (not (< thread1Thread1of1ForFork1_~i~0 c_~n2~0)))) (or .cse41 (not .cse24) .cse42) (<= 1 |c_ULTIMATE.start_create_fresh_int_array_~i~2#1|) (or .cse3 .cse43) (not (let ((.cse44 (* c_thread1Thread1of1ForFork1_~i~0 4))) (= (select .cse2 (+ .cse44 c_~get1~0.offset)) (select .cse0 (+ c_~get2~0.offset .cse44))))) (< c_thread1Thread1of1ForFork1_~i~0 c_~n2~0) (or .cse9 .cse4) (or .cse43 .cse9) (or (< (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~i~2#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (not .cse41) .cse42) (= c_~get1~0.offset 0) (< c_thread1Thread1of1ForFork1_~i~0 c_~n1~0) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= (+ |c_ULTIMATE.start_create_fresh_int_array_~size#1| 1) (+ c_~n2~0 |c_ULTIMATE.start_create_fresh_int_array_~i~2#1|)) (forall ((~get1~0.base Int)) (let ((.cse45 (select |c_#memory_int| ~get1~0.base))) (or (= (select .cse45 .cse33) .cse34) (forall ((thread1Thread1of1ForFork1_~i~0 Int)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) c_~n1~0) (not (< thread1Thread1of1ForFork1_~i~0 c_~n2~0)) (not (let ((.cse46 (* thread1Thread1of1ForFork1_~i~0 4))) (= (select .cse0 (+ c_~get2~0.offset .cse46)) (select .cse45 (+ c_~get1~0.offset .cse46)))))))))) (or .cse4 (< c_thread2Thread1of1ForFork0_~i~1 c_~n2~0)) (<= 2 c_~n2~0) (= c_~get2~0.offset 0) (or (< c_thread2Thread1of1ForFork0_~i~1 c_~n1~0) .cse4)))) is different from false [2022-12-14 14:41:57,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:41:57,718 INFO L93 Difference]: Finished difference Result 923 states and 2120 transitions. [2022-12-14 14:41:57,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2022-12-14 14:41:57,719 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.5238095238095237) internal successors, (64), 41 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 14:41:57,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:41:57,720 INFO L225 Difference]: With dead ends: 923 [2022-12-14 14:41:57,720 INFO L226 Difference]: Without dead ends: 923 [2022-12-14 14:41:57,721 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 3786 ImplicationChecksByTransitivity, 101.0s TimeCoverageRelationStatistics Valid=2464, Invalid=11808, Unknown=44, NotChecked=2196, Total=16512 [2022-12-14 14:41:57,721 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 999 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3460 mSolverCounterSat, 38 mSolverCounterUnsat, 75 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 999 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 3460 IncrementalHoareTripleChecker+Invalid, 75 IncrementalHoareTripleChecker+Unknown, 204 IncrementalHoareTripleChecker+Unchecked, 12.7s IncrementalHoareTripleChecker+Time [2022-12-14 14:41:57,721 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [999 Valid, 0 Invalid, 3777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 3460 Invalid, 75 Unknown, 204 Unchecked, 12.7s Time] [2022-12-14 14:41:57,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2022-12-14 14:41:57,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 241. [2022-12-14 14:41:57,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 240 states have (on average 2.6416666666666666) internal successors, (634), 240 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:41:57,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 634 transitions. [2022-12-14 14:41:57,728 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 634 transitions. Word has length 24 [2022-12-14 14:41:57,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:41:57,728 INFO L495 AbstractCegarLoop]: Abstraction has 241 states and 634 transitions. [2022-12-14 14:41:57,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 1.5238095238095237) internal successors, (64), 41 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:41:57,728 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 634 transitions. [2022-12-14 14:41:57,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 14:41:57,729 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:41:57,729 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:41:57,734 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (80)] Ended with exit code 0 [2022-12-14 14:41:57,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90,80 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:41:57,929 INFO L420 AbstractCegarLoop]: === Iteration 92 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:41:57,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:41:57,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1413602482, now seen corresponding path program 27 times [2022-12-14 14:41:57,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:41:57,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426722464] [2022-12-14 14:41:57,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:41:57,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:41:57,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:41:58,613 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:41:58,614 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:41:58,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426722464] [2022-12-14 14:41:58,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426722464] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:41:58,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [732829957] [2022-12-14 14:41:58,614 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 14:41:58,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:41:58,614 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:41:58,615 INFO L229 MonitoredProcess]: Starting monitored process 81 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:41:58,615 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (81)] Waiting until timeout for monitored process [2022-12-14 14:41:58,760 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 14:41:58,760 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:41:58,761 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-14 14:41:58,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:41:58,997 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 14:41:58,997 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:41:59,482 INFO L321 Elim1Store]: treesize reduction 17, result has 92.1 percent of original size [2022-12-14 14:41:59,483 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 89 treesize of output 224 [2022-12-14 14:42:10,823 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-14 14:42:10,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [732829957] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:42:10,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [785409562] [2022-12-14 14:42:10,824 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 14:42:10,824 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:42:10,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8, 7] total 25 [2022-12-14 14:42:10,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663399338] [2022-12-14 14:42:10,824 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:42:10,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-14 14:42:10,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:42:10,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-14 14:42:10,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=532, Unknown=0, NotChecked=0, Total=600 [2022-12-14 14:42:10,825 INFO L87 Difference]: Start difference. First operand 241 states and 634 transitions. Second operand has 25 states, 25 states have (on average 1.96) internal successors, (49), 25 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-12-14 14:42:13,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:42:13,183 INFO L93 Difference]: Finished difference Result 511 states and 1282 transitions. [2022-12-14 14:42:13,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-14 14:42:13,184 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.96) internal successors, (49), 25 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-12-14 14:42:13,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:42:13,185 INFO L225 Difference]: With dead ends: 511 [2022-12-14 14:42:13,185 INFO L226 Difference]: Without dead ends: 511 [2022-12-14 14:42:13,185 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=323, Invalid=1657, Unknown=0, NotChecked=0, Total=1980 [2022-12-14 14:42:13,185 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 200 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1244 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-12-14 14:42:13,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 0 Invalid, 1254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1244 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-12-14 14:42:13,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2022-12-14 14:42:13,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 275. [2022-12-14 14:42:13,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 274 states have (on average 2.8284671532846715) internal successors, (775), 274 states have internal predecessors, (775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:42:13,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 775 transitions. [2022-12-14 14:42:13,190 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 775 transitions. Word has length 24 [2022-12-14 14:42:13,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:42:13,190 INFO L495 AbstractCegarLoop]: Abstraction has 275 states and 775 transitions. [2022-12-14 14:42:13,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.96) internal successors, (49), 25 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-12-14 14:42:13,190 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 775 transitions. [2022-12-14 14:42:13,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 14:42:13,190 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:42:13,190 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:42:13,195 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (81)] Ended with exit code 0 [2022-12-14 14:42:13,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91,81 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:42:13,391 INFO L420 AbstractCegarLoop]: === Iteration 93 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:42:13,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:42:13,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1722968476, now seen corresponding path program 28 times [2022-12-14 14:42:13,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:42:13,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410701958] [2022-12-14 14:42:13,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:42:13,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:42:13,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:42:14,067 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:42:14,067 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:42:14,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410701958] [2022-12-14 14:42:14,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410701958] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:42:14,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1694648058] [2022-12-14 14:42:14,067 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 14:42:14,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:42:14,067 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:42:14,068 INFO L229 MonitoredProcess]: Starting monitored process 82 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:42:14,069 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (82)] Waiting until timeout for monitored process [2022-12-14 14:42:14,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:42:14,243 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 33 conjunts are in the unsatisfiable core [2022-12-14 14:42:14,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:42:14,658 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:42:14,658 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:42:14,928 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-14 14:42:14,929 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 4 [2022-12-14 14:42:14,937 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-14 14:42:14,937 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 4 [2022-12-14 14:42:14,990 INFO L321 Elim1Store]: treesize reduction 34, result has 62.6 percent of original size [2022-12-14 14:42:14,990 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 64 [2022-12-14 14:42:15,406 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:42:15,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1694648058] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:42:15,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [943221617] [2022-12-14 14:42:15,406 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 14:42:15,407 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:42:15,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 13] total 37 [2022-12-14 14:42:15,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226230440] [2022-12-14 14:42:15,407 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:42:15,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-12-14 14:42:15,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:42:15,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-12-14 14:42:15,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=1167, Unknown=0, NotChecked=0, Total=1406 [2022-12-14 14:42:15,408 INFO L87 Difference]: Start difference. First operand 275 states and 775 transitions. Second operand has 38 states, 38 states have (on average 1.631578947368421) internal successors, (62), 37 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:42:17,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:42:17,194 INFO L93 Difference]: Finished difference Result 365 states and 1002 transitions. [2022-12-14 14:42:17,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-14 14:42:17,194 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.631578947368421) internal successors, (62), 37 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 14:42:17,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:42:17,195 INFO L225 Difference]: With dead ends: 365 [2022-12-14 14:42:17,195 INFO L226 Difference]: Without dead ends: 365 [2022-12-14 14:42:17,195 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=506, Invalid=2146, Unknown=0, NotChecked=0, Total=2652 [2022-12-14 14:42:17,195 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 141 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1035 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1046 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1035 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-12-14 14:42:17,195 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 0 Invalid, 1046 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1035 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-12-14 14:42:17,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2022-12-14 14:42:17,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 281. [2022-12-14 14:42:17,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 280 states have (on average 2.8642857142857143) internal successors, (802), 280 states have internal predecessors, (802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:42:17,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 802 transitions. [2022-12-14 14:42:17,199 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 802 transitions. Word has length 24 [2022-12-14 14:42:17,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:42:17,199 INFO L495 AbstractCegarLoop]: Abstraction has 281 states and 802 transitions. [2022-12-14 14:42:17,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 1.631578947368421) internal successors, (62), 37 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:42:17,200 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 802 transitions. [2022-12-14 14:42:17,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 14:42:17,200 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:42:17,200 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:42:17,205 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (82)] Ended with exit code 0 [2022-12-14 14:42:17,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92,82 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:42:17,401 INFO L420 AbstractCegarLoop]: === Iteration 94 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:42:17,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:42:17,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1717286812, now seen corresponding path program 29 times [2022-12-14 14:42:17,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:42:17,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185028533] [2022-12-14 14:42:17,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:42:17,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:42:17,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:42:18,100 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:42:18,100 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:42:18,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185028533] [2022-12-14 14:42:18,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185028533] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:42:18,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [560782599] [2022-12-14 14:42:18,100 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 14:42:18,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:42:18,100 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:42:18,101 INFO L229 MonitoredProcess]: Starting monitored process 83 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:42:18,102 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (83)] Waiting until timeout for monitored process [2022-12-14 14:42:18,350 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-14 14:42:18,350 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:42:18,352 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 48 conjunts are in the unsatisfiable core [2022-12-14 14:42:18,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:42:19,091 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:42:19,091 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:42:19,391 INFO L321 Elim1Store]: treesize reduction 34, result has 62.6 percent of original size [2022-12-14 14:42:19,392 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 64 [2022-12-14 14:42:19,411 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-14 14:42:19,412 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 4 [2022-12-14 14:42:19,420 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-14 14:42:19,421 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 4 [2022-12-14 14:42:19,828 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:42:19,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [560782599] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:42:19,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1701015602] [2022-12-14 14:42:19,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:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 14:42:19,829 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:42:19,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 40 [2022-12-14 14:42:19,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641368917] [2022-12-14 14:42:19,829 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:42:19,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-12-14 14:42:19,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:42:19,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-12-14 14:42:19,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=275, Invalid=1365, Unknown=0, NotChecked=0, Total=1640 [2022-12-14 14:42:19,830 INFO L87 Difference]: Start difference. First operand 281 states and 802 transitions. Second operand has 41 states, 41 states have (on average 1.5121951219512195) internal successors, (62), 40 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:42:23,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:42:23,069 INFO L93 Difference]: Finished difference Result 463 states and 1307 transitions. [2022-12-14 14:42:23,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-12-14 14:42:23,069 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 1.5121951219512195) internal successors, (62), 40 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 14:42:23,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:42:23,070 INFO L225 Difference]: With dead ends: 463 [2022-12-14 14:42:23,070 INFO L226 Difference]: Without dead ends: 463 [2022-12-14 14:42:23,071 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1130 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=929, Invalid=4183, Unknown=0, NotChecked=0, Total=5112 [2022-12-14 14:42:23,071 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 306 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1508 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-12-14 14:42:23,071 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 0 Invalid, 1517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1508 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-12-14 14:42:23,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2022-12-14 14:42:23,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 275. [2022-12-14 14:42:23,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 274 states have (on average 2.8138686131386863) internal successors, (771), 274 states have internal predecessors, (771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:42:23,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 771 transitions. [2022-12-14 14:42:23,075 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 771 transitions. Word has length 24 [2022-12-14 14:42:23,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:42:23,076 INFO L495 AbstractCegarLoop]: Abstraction has 275 states and 771 transitions. [2022-12-14 14:42:23,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 1.5121951219512195) internal successors, (62), 40 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:42:23,076 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 771 transitions. [2022-12-14 14:42:23,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 14:42:23,076 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:42:23,076 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:42:23,080 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (83)] Forceful destruction successful, exit code 0 [2022-12-14 14:42:23,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93,83 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:42:23,277 INFO L420 AbstractCegarLoop]: === Iteration 95 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:42:23,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:42:23,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1192156252, now seen corresponding path program 30 times [2022-12-14 14:42:23,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:42:23,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886517504] [2022-12-14 14:42:23,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:42:23,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:42:23,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:42:24,117 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:42:24,117 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:42:24,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886517504] [2022-12-14 14:42:24,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886517504] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:42:24,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [354182803] [2022-12-14 14:42:24,117 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 14:42:24,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:42:24,117 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:42:24,118 INFO L229 MonitoredProcess]: Starting monitored process 84 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:42:24,119 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (84)] Waiting until timeout for monitored process [2022-12-14 14:42:24,255 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 14:42:24,255 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:42:24,256 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-14 14:42:24,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:42:24,539 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 14:42:24,540 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:42:24,967 INFO L321 Elim1Store]: treesize reduction 19, result has 91.6 percent of original size [2022-12-14 14:42:24,967 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 95 treesize of output 236 [2022-12-14 14:42:30,638 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 14:42:30,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [354182803] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:42:30,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1720603777] [2022-12-14 14:42:30,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:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 14:42:30,639 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:42:30,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 8] total 31 [2022-12-14 14:42:30,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332756853] [2022-12-14 14:42:30,639 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:42:30,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-12-14 14:42:30,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:42:30,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-12-14 14:42:30,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=814, Unknown=0, NotChecked=0, Total=930 [2022-12-14 14:42:30,640 INFO L87 Difference]: Start difference. First operand 275 states and 771 transitions. Second operand has 31 states, 31 states have (on average 1.967741935483871) internal successors, (61), 31 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-12-14 14:42:32,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:42:32,538 INFO L93 Difference]: Finished difference Result 433 states and 1153 transitions. [2022-12-14 14:42:32,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-14 14:42:32,539 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.967741935483871) internal successors, (61), 31 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 24 [2022-12-14 14:42:32,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:42:32,539 INFO L225 Difference]: With dead ends: 433 [2022-12-14 14:42:32,539 INFO L226 Difference]: Without dead ends: 433 [2022-12-14 14:42:32,540 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=287, Invalid=1875, Unknown=0, NotChecked=0, Total=2162 [2022-12-14 14:42:32,540 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 194 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1261 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:42:32,540 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 0 Invalid, 1266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1261 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-12-14 14:42:32,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2022-12-14 14:42:32,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 301. [2022-12-14 14:42:32,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 300 states have (on average 2.8533333333333335) internal successors, (856), 300 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:42:32,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 856 transitions. [2022-12-14 14:42:32,545 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 856 transitions. Word has length 24 [2022-12-14 14:42:32,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:42:32,545 INFO L495 AbstractCegarLoop]: Abstraction has 301 states and 856 transitions. [2022-12-14 14:42:32,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 1.967741935483871) internal successors, (61), 31 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-12-14 14:42:32,545 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 856 transitions. [2022-12-14 14:42:32,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 14:42:32,545 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:42:32,546 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:42:32,550 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (84)] Forceful destruction successful, exit code 0 [2022-12-14 14:42:32,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94,84 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:42:32,747 INFO L420 AbstractCegarLoop]: === Iteration 96 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:42:32,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:42:32,748 INFO L85 PathProgramCache]: Analyzing trace with hash 2030546496, now seen corresponding path program 31 times [2022-12-14 14:42:32,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:42:32,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290268777] [2022-12-14 14:42:32,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:42:32,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:42:32,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:42:33,371 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:42:33,371 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:42:33,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290268777] [2022-12-14 14:42:33,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290268777] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:42:33,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1157183522] [2022-12-14 14:42:33,371 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 14:42:33,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:42:33,371 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:42:33,372 INFO L229 MonitoredProcess]: Starting monitored process 85 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:42:33,373 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (85)] Waiting until timeout for monitored process [2022-12-14 14:42:33,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:42:33,508 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 31 conjunts are in the unsatisfiable core [2022-12-14 14:42:33,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:42:34,014 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:42:34,014 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:42:34,185 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-14 14:42:34,186 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 4 [2022-12-14 14:42:34,194 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-14 14:42:34,195 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 4 [2022-12-14 14:42:34,255 INFO L321 Elim1Store]: treesize reduction 32, result has 62.4 percent of original size [2022-12-14 14:42:34,255 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 60 [2022-12-14 14:42:34,720 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:42:34,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1157183522] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:42:34,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [873164043] [2022-12-14 14:42:34,720 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 14:42:34,721 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:42:34,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 13] total 38 [2022-12-14 14:42:34,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617270424] [2022-12-14 14:42:34,721 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:42:34,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-12-14 14:42:34,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:42:34,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-12-14 14:42:34,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=1236, Unknown=0, NotChecked=0, Total=1482 [2022-12-14 14:42:34,722 INFO L87 Difference]: Start difference. First operand 301 states and 856 transitions. Second operand has 39 states, 39 states have (on average 1.5897435897435896) internal successors, (62), 38 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:42:37,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:42:37,159 INFO L93 Difference]: Finished difference Result 581 states and 1525 transitions. [2022-12-14 14:42:37,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-14 14:42:37,160 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.5897435897435896) internal successors, (62), 38 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 14:42:37,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:42:37,161 INFO L225 Difference]: With dead ends: 581 [2022-12-14 14:42:37,161 INFO L226 Difference]: Without dead ends: 581 [2022-12-14 14:42:37,161 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 606 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=638, Invalid=2442, Unknown=0, NotChecked=0, Total=3080 [2022-12-14 14:42:37,161 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 242 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1630 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-12-14 14:42:37,161 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 0 Invalid, 1643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1630 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-12-14 14:42:37,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2022-12-14 14:42:37,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 327. [2022-12-14 14:42:37,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 326 states have (on average 2.9355828220858897) internal successors, (957), 326 states have internal predecessors, (957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:42:37,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 957 transitions. [2022-12-14 14:42:37,167 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 957 transitions. Word has length 24 [2022-12-14 14:42:37,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:42:37,167 INFO L495 AbstractCegarLoop]: Abstraction has 327 states and 957 transitions. [2022-12-14 14:42:37,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 1.5897435897435896) internal successors, (62), 38 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:42:37,168 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 957 transitions. [2022-12-14 14:42:37,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 14:42:37,168 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:42:37,168 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:42:37,172 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (85)] Ended with exit code 0 [2022-12-14 14:42:37,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95,85 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:42:37,369 INFO L420 AbstractCegarLoop]: === Iteration 97 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:42:37,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:42:37,369 INFO L85 PathProgramCache]: Analyzing trace with hash 815661298, now seen corresponding path program 32 times [2022-12-14 14:42:37,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:42:37,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733357075] [2022-12-14 14:42:37,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:42:37,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:42:37,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:42:37,987 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:42:37,988 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:42:37,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733357075] [2022-12-14 14:42:37,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733357075] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:42:37,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1820854168] [2022-12-14 14:42:37,988 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 14:42:37,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:42:37,988 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:42:37,989 INFO L229 MonitoredProcess]: Starting monitored process 86 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:42:37,989 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (86)] Waiting until timeout for monitored process [2022-12-14 14:42:38,154 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-14 14:42:38,154 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:42:38,155 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 36 conjunts are in the unsatisfiable core [2022-12-14 14:42:38,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:42:38,884 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:42:38,884 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:42:39,053 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-14 14:42:39,053 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 4 [2022-12-14 14:42:39,060 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-14 14:42:39,060 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 4 [2022-12-14 14:42:39,121 INFO L321 Elim1Store]: treesize reduction 32, result has 62.4 percent of original size [2022-12-14 14:42:39,121 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 60 [2022-12-14 14:42:39,777 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:42:39,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1820854168] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:42:39,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [106286467] [2022-12-14 14:42:39,777 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 14:42:39,777 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:42:39,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 40 [2022-12-14 14:42:39,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615579462] [2022-12-14 14:42:39,778 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:42:39,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-12-14 14:42:39,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:42:39,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-12-14 14:42:39,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=1397, Unknown=0, NotChecked=0, Total=1640 [2022-12-14 14:42:39,778 INFO L87 Difference]: Start difference. First operand 327 states and 957 transitions. Second operand has 41 states, 41 states have (on average 1.5609756097560976) internal successors, (64), 40 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:42:43,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:42:43,609 INFO L93 Difference]: Finished difference Result 721 states and 1792 transitions. [2022-12-14 14:42:43,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-12-14 14:42:43,610 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 1.5609756097560976) internal successors, (64), 40 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 14:42:43,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:42:43,611 INFO L225 Difference]: With dead ends: 721 [2022-12-14 14:42:43,611 INFO L226 Difference]: Without dead ends: 717 [2022-12-14 14:42:43,612 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1058 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=858, Invalid=4112, Unknown=0, NotChecked=0, Total=4970 [2022-12-14 14:42:43,612 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 573 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1597 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 573 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-12-14 14:42:43,612 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [573 Valid, 0 Invalid, 1621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1597 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-12-14 14:42:43,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2022-12-14 14:42:43,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 304. [2022-12-14 14:42:43,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 303 states have (on average 2.8118811881188117) internal successors, (852), 303 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:42:43,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 852 transitions. [2022-12-14 14:42:43,619 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 852 transitions. Word has length 24 [2022-12-14 14:42:43,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:42:43,619 INFO L495 AbstractCegarLoop]: Abstraction has 304 states and 852 transitions. [2022-12-14 14:42:43,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 1.5609756097560976) internal successors, (64), 40 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:42:43,619 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 852 transitions. [2022-12-14 14:42:43,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 14:42:43,620 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:42:43,620 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:42:43,624 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (86)] Ended with exit code 0 [2022-12-14 14:42:43,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 86 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable96 [2022-12-14 14:42:43,821 INFO L420 AbstractCegarLoop]: === Iteration 98 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:42:43,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:42:43,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1106024462, now seen corresponding path program 33 times [2022-12-14 14:42:43,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:42:43,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670659565] [2022-12-14 14:42:43,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:42:43,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:42:43,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:42:44,460 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:42:44,460 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:42:44,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670659565] [2022-12-14 14:42:44,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670659565] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:42:44,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [192302452] [2022-12-14 14:42:44,461 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 14:42:44,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:42:44,461 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:42:44,461 INFO L229 MonitoredProcess]: Starting monitored process 87 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:42:44,462 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (87)] Waiting until timeout for monitored process [2022-12-14 14:42:44,603 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 14:42:44,603 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:42:44,604 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-14 14:42:44,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:42:44,874 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 14:42:44,875 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:42:45,417 INFO L321 Elim1Store]: treesize reduction 19, result has 91.6 percent of original size [2022-12-14 14:42:45,417 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 95 treesize of output 236 [2022-12-14 14:42:52,732 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 14:42:52,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [192302452] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:42:52,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [756009504] [2022-12-14 14:42:52,732 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 14:42:52,733 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:42:52,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8, 8] total 25 [2022-12-14 14:42:52,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321380456] [2022-12-14 14:42:52,733 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:42:52,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-14 14:42:52,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:42:52,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-14 14:42:52,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=525, Unknown=0, NotChecked=0, Total=600 [2022-12-14 14:42:52,734 INFO L87 Difference]: Start difference. First operand 304 states and 852 transitions. Second operand has 25 states, 25 states have (on average 1.84) internal successors, (46), 25 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:42:55,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:42:55,092 INFO L93 Difference]: Finished difference Result 432 states and 1160 transitions. [2022-12-14 14:42:55,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-14 14:42:55,093 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.84) internal successors, (46), 25 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 14:42:55,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:42:55,094 INFO L225 Difference]: With dead ends: 432 [2022-12-14 14:42:55,094 INFO L226 Difference]: Without dead ends: 432 [2022-12-14 14:42:55,094 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=233, Invalid=1327, Unknown=0, NotChecked=0, Total=1560 [2022-12-14 14:42:55,094 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 163 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1141 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:42:55,094 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 0 Invalid, 1152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1141 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-12-14 14:42:55,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2022-12-14 14:42:55,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 314. [2022-12-14 14:42:55,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 313 states have (on average 2.840255591054313) internal successors, (889), 313 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:42:55,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 889 transitions. [2022-12-14 14:42:55,100 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 889 transitions. Word has length 24 [2022-12-14 14:42:55,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:42:55,100 INFO L495 AbstractCegarLoop]: Abstraction has 314 states and 889 transitions. [2022-12-14 14:42:55,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.84) internal successors, (46), 25 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:42:55,100 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 889 transitions. [2022-12-14 14:42:55,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 14:42:55,101 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:42:55,101 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:42:55,105 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (87)] Ended with exit code 0 [2022-12-14 14:42:55,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 87 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable97 [2022-12-14 14:42:55,301 INFO L420 AbstractCegarLoop]: === Iteration 99 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:42:55,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:42:55,302 INFO L85 PathProgramCache]: Analyzing trace with hash -575212238, now seen corresponding path program 34 times [2022-12-14 14:42:55,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:42:55,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211728694] [2022-12-14 14:42:55,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:42:55,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:42:55,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:42:55,917 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:42:55,918 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:42:55,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211728694] [2022-12-14 14:42:55,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211728694] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:42:55,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2087141130] [2022-12-14 14:42:55,918 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 14:42:55,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:42:55,918 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:42:55,919 INFO L229 MonitoredProcess]: Starting monitored process 88 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:42:55,919 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (88)] Waiting until timeout for monitored process [2022-12-14 14:42:56,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:42:56,051 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 31 conjunts are in the unsatisfiable core [2022-12-14 14:42:56,052 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:42:56,535 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:42:56,535 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:42:56,755 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-14 14:42:56,756 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 4 [2022-12-14 14:42:56,765 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-14 14:42:56,765 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 4 [2022-12-14 14:42:56,822 INFO L321 Elim1Store]: treesize reduction 34, result has 62.6 percent of original size [2022-12-14 14:42:56,823 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 64 [2022-12-14 14:42:57,205 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:42:57,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2087141130] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:42:57,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1013032530] [2022-12-14 14:42:57,206 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 14:42:57,206 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:42:57,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 13] total 38 [2022-12-14 14:42:57,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791244881] [2022-12-14 14:42:57,206 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:42:57,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-12-14 14:42:57,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:42:57,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-12-14 14:42:57,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=1206, Unknown=0, NotChecked=0, Total=1482 [2022-12-14 14:42:57,207 INFO L87 Difference]: Start difference. First operand 314 states and 889 transitions. Second operand has 39 states, 39 states have (on average 1.641025641025641) internal successors, (64), 38 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:42:58,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:42:58,376 INFO L93 Difference]: Finished difference Result 412 states and 1126 transitions. [2022-12-14 14:42:58,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-14 14:42:58,377 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.641025641025641) internal successors, (64), 38 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 14:42:58,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:42:58,378 INFO L225 Difference]: With dead ends: 412 [2022-12-14 14:42:58,378 INFO L226 Difference]: Without dead ends: 412 [2022-12-14 14:42:58,378 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 562 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=448, Invalid=1808, Unknown=0, NotChecked=0, Total=2256 [2022-12-14 14:42:58,378 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 177 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1053 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1053 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-14 14:42:58,378 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 0 Invalid, 1054 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1053 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-12-14 14:42:58,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2022-12-14 14:42:58,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 310. [2022-12-14 14:42:58,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 309 states have (on average 2.838187702265372) internal successors, (877), 309 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:42:58,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 877 transitions. [2022-12-14 14:42:58,382 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 877 transitions. Word has length 24 [2022-12-14 14:42:58,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:42:58,382 INFO L495 AbstractCegarLoop]: Abstraction has 310 states and 877 transitions. [2022-12-14 14:42:58,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 1.641025641025641) internal successors, (64), 38 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:42:58,382 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 877 transitions. [2022-12-14 14:42:58,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 14:42:58,383 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:42:58,383 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:42:58,387 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (88)] Forceful destruction successful, exit code 0 [2022-12-14 14:42:58,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98,88 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:42:58,584 INFO L420 AbstractCegarLoop]: === Iteration 100 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:42:58,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:42:58,585 INFO L85 PathProgramCache]: Analyzing trace with hash 998133882, now seen corresponding path program 35 times [2022-12-14 14:42:58,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:42:58,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194135784] [2022-12-14 14:42:58,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:42:58,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:42:58,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:42:59,462 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:42:59,462 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:42:59,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194135784] [2022-12-14 14:42:59,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194135784] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:42:59,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [765537851] [2022-12-14 14:42:59,462 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 14:42:59,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:42:59,462 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:42:59,463 INFO L229 MonitoredProcess]: Starting monitored process 89 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:42:59,463 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (89)] Waiting until timeout for monitored process [2022-12-14 14:42:59,675 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-12-14 14:42:59,676 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:42:59,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 44 conjunts are in the unsatisfiable core [2022-12-14 14:42:59,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:43:00,441 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:43:00,441 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:43:00,894 INFO L321 Elim1Store]: treesize reduction 30, result has 61.0 percent of original size [2022-12-14 14:43:00,894 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 54 [2022-12-14 14:43:00,911 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-14 14:43:00,912 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 4 [2022-12-14 14:43:00,919 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-14 14:43:00,919 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 4 [2022-12-14 14:43:01,399 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:43:01,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [765537851] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:43:01,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [923283016] [2022-12-14 14:43:01,400 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 14:43:01,400 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:43:01,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 41 [2022-12-14 14:43:01,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451999875] [2022-12-14 14:43:01,400 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:43:01,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-12-14 14:43:01,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:43:01,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-12-14 14:43:01,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=1427, Unknown=0, NotChecked=0, Total=1722 [2022-12-14 14:43:01,401 INFO L87 Difference]: Start difference. First operand 310 states and 877 transitions. Second operand has 42 states, 42 states have (on average 1.4761904761904763) internal successors, (62), 41 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:43:04,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:43:04,523 INFO L93 Difference]: Finished difference Result 494 states and 1263 transitions. [2022-12-14 14:43:04,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-12-14 14:43:04,523 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.4761904761904763) internal successors, (62), 41 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 14:43:04,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:43:04,524 INFO L225 Difference]: With dead ends: 494 [2022-12-14 14:43:04,524 INFO L226 Difference]: Without dead ends: 494 [2022-12-14 14:43:04,525 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 771 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=795, Invalid=3365, Unknown=0, NotChecked=0, Total=4160 [2022-12-14 14:43:04,525 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 355 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1268 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-12-14 14:43:04,525 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 0 Invalid, 1278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1268 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-12-14 14:43:04,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2022-12-14 14:43:04,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 320. [2022-12-14 14:43:04,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 319 states have (on average 2.8620689655172415) internal successors, (913), 319 states have internal predecessors, (913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:43:04,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 913 transitions. [2022-12-14 14:43:04,529 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 913 transitions. Word has length 24 [2022-12-14 14:43:04,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:43:04,529 INFO L495 AbstractCegarLoop]: Abstraction has 320 states and 913 transitions. [2022-12-14 14:43:04,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 1.4761904761904763) internal successors, (62), 41 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:43:04,530 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 913 transitions. [2022-12-14 14:43:04,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 14:43:04,530 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:43:04,530 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:43:04,535 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (89)] Ended with exit code 0 [2022-12-14 14:43:04,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99,89 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:43:04,731 INFO L420 AbstractCegarLoop]: === Iteration 101 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:43:04,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:43:04,731 INFO L85 PathProgramCache]: Analyzing trace with hash 143421874, now seen corresponding path program 36 times [2022-12-14 14:43:04,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:43:04,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328970736] [2022-12-14 14:43:04,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:43:04,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:43:04,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:43:05,493 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:43:05,493 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:43:05,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328970736] [2022-12-14 14:43:05,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328970736] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:43:05,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [550962574] [2022-12-14 14:43:05,493 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 14:43:05,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:43:05,493 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:43:05,494 INFO L229 MonitoredProcess]: Starting monitored process 90 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:43:05,495 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (90)] Waiting until timeout for monitored process [2022-12-14 14:43:05,652 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 14:43:05,652 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:43:05,653 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-14 14:43:05,654 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:43:05,912 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 14:43:05,912 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:43:07,069 INFO L321 Elim1Store]: treesize reduction 15, result has 92.5 percent of original size [2022-12-14 14:43:07,070 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 85 treesize of output 210 [2022-12-14 14:43:17,155 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 14:43:17,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [550962574] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:43:17,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [462345987] [2022-12-14 14:43:17,156 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 14:43:17,156 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:43:17,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8, 8] total 25 [2022-12-14 14:43:17,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068489688] [2022-12-14 14:43:17,156 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:43:17,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-14 14:43:17,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:43:17,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-14 14:43:17,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=523, Unknown=0, NotChecked=0, Total=600 [2022-12-14 14:43:17,157 INFO L87 Difference]: Start difference. First operand 320 states and 913 transitions. Second operand has 25 states, 25 states have (on average 1.84) internal successors, (46), 25 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:43:18,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:43:18,684 INFO L93 Difference]: Finished difference Result 416 states and 1165 transitions. [2022-12-14 14:43:18,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-14 14:43:18,685 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.84) internal successors, (46), 25 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 14:43:18,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:43:18,685 INFO L225 Difference]: With dead ends: 416 [2022-12-14 14:43:18,686 INFO L226 Difference]: Without dead ends: 416 [2022-12-14 14:43:18,686 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=167, Invalid=955, Unknown=0, NotChecked=0, Total=1122 [2022-12-14 14:43:18,686 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 125 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1021 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1023 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1021 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:43:18,686 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 0 Invalid, 1023 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1021 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-12-14 14:43:18,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2022-12-14 14:43:18,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 330. [2022-12-14 14:43:18,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 329 states have (on average 2.878419452887538) internal successors, (947), 329 states have internal predecessors, (947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:43:18,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 947 transitions. [2022-12-14 14:43:18,690 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 947 transitions. Word has length 24 [2022-12-14 14:43:18,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:43:18,690 INFO L495 AbstractCegarLoop]: Abstraction has 330 states and 947 transitions. [2022-12-14 14:43:18,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.84) internal successors, (46), 25 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:43:18,691 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 947 transitions. [2022-12-14 14:43:18,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 14:43:18,691 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:43:18,691 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:43:18,696 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (90)] Ended with exit code 0 [2022-12-14 14:43:18,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 90 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable100 [2022-12-14 14:43:18,892 INFO L420 AbstractCegarLoop]: === Iteration 102 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:43:18,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:43:18,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1528946106, now seen corresponding path program 37 times [2022-12-14 14:43:18,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:43:18,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964989045] [2022-12-14 14:43:18,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:43:18,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:43:18,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:43:19,551 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:43:19,551 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:43:19,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964989045] [2022-12-14 14:43:19,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964989045] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:43:19,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1681604715] [2022-12-14 14:43:19,551 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 14:43:19,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:43:19,552 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:43:19,552 INFO L229 MonitoredProcess]: Starting monitored process 91 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:43:19,553 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (91)] Waiting until timeout for monitored process [2022-12-14 14:43:19,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:43:19,743 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 31 conjunts are in the unsatisfiable core [2022-12-14 14:43:19,744 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:43:20,200 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:43:20,200 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:43:20,715 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-14 14:43:20,715 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 4 [2022-12-14 14:43:20,769 INFO L321 Elim1Store]: treesize reduction 30, result has 61.0 percent of original size [2022-12-14 14:43:20,769 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 54 [2022-12-14 14:43:20,788 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-14 14:43:20,788 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 4 [2022-12-14 14:43:21,105 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:43:21,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1681604715] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:43:21,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1953358037] [2022-12-14 14:43:21,105 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 14:43:21,105 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:43:21,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 13] total 38 [2022-12-14 14:43:21,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522324303] [2022-12-14 14:43:21,106 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:43:21,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-12-14 14:43:21,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:43:21,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-12-14 14:43:21,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=1206, Unknown=0, NotChecked=0, Total=1482 [2022-12-14 14:43:21,107 INFO L87 Difference]: Start difference. First operand 330 states and 947 transitions. Second operand has 39 states, 39 states have (on average 1.641025641025641) internal successors, (64), 38 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:43:22,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:43:22,575 INFO L93 Difference]: Finished difference Result 424 states and 1180 transitions. [2022-12-14 14:43:22,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-14 14:43:22,575 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.641025641025641) internal successors, (64), 38 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 14:43:22,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:43:22,576 INFO L225 Difference]: With dead ends: 424 [2022-12-14 14:43:22,576 INFO L226 Difference]: Without dead ends: 424 [2022-12-14 14:43:22,576 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 562 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=448, Invalid=1808, Unknown=0, NotChecked=0, Total=2256 [2022-12-14 14:43:22,577 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 152 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1347 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:43:22,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 0 Invalid, 1348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1347 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-12-14 14:43:22,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2022-12-14 14:43:22,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 328. [2022-12-14 14:43:22,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 327 states have (on average 2.874617737003058) internal successors, (940), 327 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:43:22,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 940 transitions. [2022-12-14 14:43:22,582 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 940 transitions. Word has length 24 [2022-12-14 14:43:22,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:43:22,582 INFO L495 AbstractCegarLoop]: Abstraction has 328 states and 940 transitions. [2022-12-14 14:43:22,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 1.641025641025641) internal successors, (64), 38 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:43:22,582 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 940 transitions. [2022-12-14 14:43:22,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 14:43:22,583 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:43:22,583 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:43:22,587 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (91)] Forceful destruction successful, exit code 0 [2022-12-14 14:43:22,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 91 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable101 [2022-12-14 14:43:22,784 INFO L420 AbstractCegarLoop]: === Iteration 103 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:43:22,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:43:22,785 INFO L85 PathProgramCache]: Analyzing trace with hash -808584848, now seen corresponding path program 38 times [2022-12-14 14:43:22,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:43:22,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375972955] [2022-12-14 14:43:22,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:43:22,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:43:22,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:43:23,687 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:43:23,687 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:43:23,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375972955] [2022-12-14 14:43:23,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375972955] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:43:23,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1496594653] [2022-12-14 14:43:23,687 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 14:43:23,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:43:23,688 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:43:23,688 INFO L229 MonitoredProcess]: Starting monitored process 92 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:43:23,689 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (92)] Waiting until timeout for monitored process [2022-12-14 14:43:24,008 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-14 14:43:24,008 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:43:24,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 37 conjunts are in the unsatisfiable core [2022-12-14 14:43:24,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:43:24,639 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:43:24,639 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:43:24,927 INFO L321 Elim1Store]: treesize reduction 30, result has 61.0 percent of original size [2022-12-14 14:43:24,927 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 54 [2022-12-14 14:43:24,945 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-14 14:43:24,946 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 4 [2022-12-14 14:43:24,955 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-14 14:43:24,955 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 4 [2022-12-14 14:43:25,369 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:43:25,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1496594653] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:43:25,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1321283634] [2022-12-14 14:43:25,370 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 14:43:25,370 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:43:25,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 13] total 35 [2022-12-14 14:43:25,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336047875] [2022-12-14 14:43:25,370 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:43:25,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-12-14 14:43:25,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:43:25,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-12-14 14:43:25,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=1029, Unknown=0, NotChecked=0, Total=1260 [2022-12-14 14:43:25,371 INFO L87 Difference]: Start difference. First operand 328 states and 940 transitions. Second operand has 36 states, 36 states have (on average 1.5555555555555556) internal successors, (56), 35 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:43:26,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:43:26,911 INFO L93 Difference]: Finished difference Result 476 states and 1301 transitions. [2022-12-14 14:43:26,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-14 14:43:26,911 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.5555555555555556) internal successors, (56), 35 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 14:43:26,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:43:26,912 INFO L225 Difference]: With dead ends: 476 [2022-12-14 14:43:26,912 INFO L226 Difference]: Without dead ends: 476 [2022-12-14 14:43:26,912 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=387, Invalid=1593, Unknown=0, NotChecked=0, Total=1980 [2022-12-14 14:43:26,912 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 269 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1322 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:43:26,912 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 0 Invalid, 1326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1322 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-12-14 14:43:26,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2022-12-14 14:43:26,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 348. [2022-12-14 14:43:26,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 347 states have (on average 2.85014409221902) internal successors, (989), 347 states have internal predecessors, (989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:43:26,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 989 transitions. [2022-12-14 14:43:26,917 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 989 transitions. Word has length 24 [2022-12-14 14:43:26,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:43:26,917 INFO L495 AbstractCegarLoop]: Abstraction has 348 states and 989 transitions. [2022-12-14 14:43:26,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.5555555555555556) internal successors, (56), 35 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:43:26,917 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 989 transitions. [2022-12-14 14:43:26,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 14:43:26,918 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:43:26,918 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:43:26,922 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (92)] Ended with exit code 0 [2022-12-14 14:43:27,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 92 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable102 [2022-12-14 14:43:27,119 INFO L420 AbstractCegarLoop]: === Iteration 104 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:43:27,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:43:27,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1997206550, now seen corresponding path program 39 times [2022-12-14 14:43:27,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:43:27,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986203818] [2022-12-14 14:43:27,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:43:27,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:43:27,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:43:27,842 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:43:27,842 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:43:27,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986203818] [2022-12-14 14:43:27,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986203818] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:43:27,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [292368431] [2022-12-14 14:43:27,843 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 14:43:27,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:43:27,843 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:43:27,844 INFO L229 MonitoredProcess]: Starting monitored process 93 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:43:27,844 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (93)] Waiting until timeout for monitored process [2022-12-14 14:43:28,038 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 14:43:28,039 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:43:28,040 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-14 14:43:28,041 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:43:28,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:43:28,227 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-14 14:43:28,469 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 14:43:28,469 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:43:29,129 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (* c_thread1Thread1of1ForFork1_~i~0 4))) (let ((.cse0 (forall ((~get2~0.offset Int) (~get2~0.base Int) (v_ArrVal_3962 (Array Int Int))) (not (= |c_thread1Thread1of1ForFork1_#t~mem2| (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3962) ~get2~0.base) (+ .cse2 ~get2~0.offset))))))) (and (or (< 1 c_~n2~0) .cse0) (forall ((~get2~0.offset Int) (~get2~0.base Int) (v_ArrVal_3962 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3962))) (let ((.cse1 (select .cse3 ~get2~0.base))) (or (not (= |c_thread1Thread1of1ForFork1_#t~mem2| (select .cse1 (+ .cse2 ~get2~0.offset)))) (= (select (select .cse3 c_~get1~0.base) (+ c_~get1~0.offset 4)) (select .cse1 (+ ~get2~0.offset 4))))))) (or .cse0 (< 1 c_~n1~0))))) is different from false [2022-12-14 14:43:29,281 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:43:29,281 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 235 treesize of output 339 [2022-12-14 14:43:29,331 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:43:29,332 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 139 treesize of output 150 [2022-12-14 14:43:29,345 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 111 [2022-12-14 14:43:29,358 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 105 [2022-12-14 14:43:31,932 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 14:43:31,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [292368431] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:43:31,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1107342498] [2022-12-14 14:43:31,933 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 14:43:31,933 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:43:31,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 10] total 33 [2022-12-14 14:43:31,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256229979] [2022-12-14 14:43:31,933 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:43:31,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-12-14 14:43:31,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:43:31,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-12-14 14:43:31,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=944, Unknown=1, NotChecked=62, Total=1122 [2022-12-14 14:43:31,934 INFO L87 Difference]: Start difference. First operand 348 states and 989 transitions. Second operand has 34 states, 34 states have (on average 1.7058823529411764) internal successors, (58), 33 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-12-14 14:43:33,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:43:33,821 INFO L93 Difference]: Finished difference Result 440 states and 1219 transitions. [2022-12-14 14:43:33,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-14 14:43:33,821 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.7058823529411764) internal successors, (58), 33 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 24 [2022-12-14 14:43:33,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:43:33,823 INFO L225 Difference]: With dead ends: 440 [2022-12-14 14:43:33,823 INFO L226 Difference]: Without dead ends: 440 [2022-12-14 14:43:33,823 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=269, Invalid=1804, Unknown=1, NotChecked=88, Total=2162 [2022-12-14 14:43:33,823 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 206 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1145 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 69 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:43:33,823 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 0 Invalid, 1220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1145 Invalid, 0 Unknown, 69 Unchecked, 1.1s Time] [2022-12-14 14:43:33,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2022-12-14 14:43:33,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 346. [2022-12-14 14:43:33,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 345 states have (on average 2.8405797101449277) internal successors, (980), 345 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:43:33,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 980 transitions. [2022-12-14 14:43:33,827 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 980 transitions. Word has length 24 [2022-12-14 14:43:33,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:43:33,828 INFO L495 AbstractCegarLoop]: Abstraction has 346 states and 980 transitions. [2022-12-14 14:43:33,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.7058823529411764) internal successors, (58), 33 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-12-14 14:43:33,828 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 980 transitions. [2022-12-14 14:43:33,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 14:43:33,828 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:43:33,828 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:43:33,833 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (93)] Ended with exit code 0 [2022-12-14 14:43:34,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 93 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable103 [2022-12-14 14:43:34,030 INFO L420 AbstractCegarLoop]: === Iteration 105 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:43:34,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:43:34,030 INFO L85 PathProgramCache]: Analyzing trace with hash -930349016, now seen corresponding path program 40 times [2022-12-14 14:43:34,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:43:34,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762174181] [2022-12-14 14:43:34,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:43:34,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:43:34,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:43:34,948 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:43:34,948 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:43:34,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762174181] [2022-12-14 14:43:34,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762174181] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:43:34,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1299570457] [2022-12-14 14:43:34,948 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 14:43:34,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:43:34,948 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:43:34,949 INFO L229 MonitoredProcess]: Starting monitored process 94 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:43:34,950 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (94)] Waiting until timeout for monitored process [2022-12-14 14:43:35,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:43:35,086 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 37 conjunts are in the unsatisfiable core [2022-12-14 14:43:35,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:43:35,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:43:35,612 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-14 14:43:35,910 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:43:35,910 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:43:38,889 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (* c_thread1Thread1of1ForFork1_~i~0 4))) (let ((.cse0 (forall ((~get2~0.offset Int) (~get2~0.base Int) (v_ArrVal_4009 (Array Int Int))) (not (= |c_thread1Thread1of1ForFork1_#t~mem2| (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4009) ~get2~0.base) (+ .cse2 ~get2~0.offset))))))) (and (or (< 1 c_~n2~0) .cse0) (or .cse0 (< 1 c_~n1~0)) (forall ((~get2~0.offset Int) (~get2~0.base Int) (v_ArrVal_4009 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4009))) (let ((.cse1 (select .cse3 ~get2~0.base))) (or (not (= |c_thread1Thread1of1ForFork1_#t~mem2| (select .cse1 (+ .cse2 ~get2~0.offset)))) (= (select (select .cse3 c_~get1~0.base) (+ c_~get1~0.offset 4)) (select .cse1 (+ ~get2~0.offset 4)))))))))) is different from false [2022-12-14 14:43:38,905 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:43:38,905 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 36 [2022-12-14 14:43:38,908 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2022-12-14 14:43:38,925 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:43:38,925 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 36 [2022-12-14 14:43:38,929 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2022-12-14 14:43:39,006 INFO L321 Elim1Store]: treesize reduction 15, result has 80.5 percent of original size [2022-12-14 14:43:39,006 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 130 treesize of output 143 [2022-12-14 14:43:39,033 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:43:39,033 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 82 treesize of output 92 [2022-12-14 14:43:39,891 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:43:39,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1299570457] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:43:39,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [926275967] [2022-12-14 14:43:39,891 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 14:43:39,891 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:43:39,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 14] total 42 [2022-12-14 14:43:39,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272048279] [2022-12-14 14:43:39,892 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:43:39,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-12-14 14:43:39,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:43:39,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-12-14 14:43:39,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=1539, Unknown=1, NotChecked=80, Total=1806 [2022-12-14 14:43:39,893 INFO L87 Difference]: Start difference. First operand 346 states and 980 transitions. Second operand has 43 states, 43 states have (on average 1.4883720930232558) internal successors, (64), 42 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:43:43,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:43:43,261 INFO L93 Difference]: Finished difference Result 929 states and 2529 transitions. [2022-12-14 14:43:43,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-12-14 14:43:43,261 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 1.4883720930232558) internal successors, (64), 42 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 14:43:43,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:43:43,263 INFO L225 Difference]: With dead ends: 929 [2022-12-14 14:43:43,263 INFO L226 Difference]: Without dead ends: 929 [2022-12-14 14:43:43,264 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 66 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 810 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=554, Invalid=3871, Unknown=1, NotChecked=130, Total=4556 [2022-12-14 14:43:43,264 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 481 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1695 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 481 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 113 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-12-14 14:43:43,264 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [481 Valid, 0 Invalid, 1816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1695 Invalid, 0 Unknown, 113 Unchecked, 1.5s Time] [2022-12-14 14:43:43,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2022-12-14 14:43:43,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 336. [2022-12-14 14:43:43,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 335 states have (on average 2.8238805970149254) internal successors, (946), 335 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:43:43,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 946 transitions. [2022-12-14 14:43:43,270 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 946 transitions. Word has length 24 [2022-12-14 14:43:43,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:43:43,270 INFO L495 AbstractCegarLoop]: Abstraction has 336 states and 946 transitions. [2022-12-14 14:43:43,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 1.4883720930232558) internal successors, (64), 42 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:43:43,271 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 946 transitions. [2022-12-14 14:43:43,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 14:43:43,271 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:43:43,271 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:43:43,275 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (94)] Ended with exit code 0 [2022-12-14 14:43:43,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 94 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable104 [2022-12-14 14:43:43,471 INFO L420 AbstractCegarLoop]: === Iteration 106 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:43:43,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:43:43,472 INFO L85 PathProgramCache]: Analyzing trace with hash 757085616, now seen corresponding path program 41 times [2022-12-14 14:43:43,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:43:43,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446949882] [2022-12-14 14:43:43,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:43:43,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:43:43,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:43:44,284 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:43:44,284 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:43:44,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446949882] [2022-12-14 14:43:44,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446949882] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:43:44,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1717662846] [2022-12-14 14:43:44,284 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 14:43:44,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:43:44,285 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:43:44,285 INFO L229 MonitoredProcess]: Starting monitored process 95 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:43:44,286 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (95)] Waiting until timeout for monitored process [2022-12-14 14:43:44,499 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-14 14:43:44,499 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:43:44,501 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 65 conjunts are in the unsatisfiable core [2022-12-14 14:43:44,502 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:43:45,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:43:45,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:43:45,470 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-14 14:43:45,470 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 22 treesize of output 27 [2022-12-14 14:43:45,758 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:43:45,759 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:43:46,718 INFO L321 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2022-12-14 14:43:46,718 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 131 treesize of output 156 [2022-12-14 14:43:46,734 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:43:46,734 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 79 [2022-12-14 14:43:48,451 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:43:48,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1717662846] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:43:48,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2025894089] [2022-12-14 14:43:48,452 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 14:43:48,452 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:43:48,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 16] total 46 [2022-12-14 14:43:48,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360544516] [2022-12-14 14:43:48,452 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:43:48,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-12-14 14:43:48,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:43:48,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-12-14 14:43:48,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=1963, Unknown=4, NotChecked=0, Total=2162 [2022-12-14 14:43:48,453 INFO L87 Difference]: Start difference. First operand 336 states and 946 transitions. Second operand has 47 states, 47 states have (on average 1.425531914893617) internal successors, (67), 46 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:44:03,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:44:03,075 INFO L93 Difference]: Finished difference Result 1099 states and 2806 transitions. [2022-12-14 14:44:03,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2022-12-14 14:44:03,076 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 1.425531914893617) internal successors, (67), 46 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 14:44:03,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:44:03,077 INFO L225 Difference]: With dead ends: 1099 [2022-12-14 14:44:03,077 INFO L226 Difference]: Without dead ends: 1092 [2022-12-14 14:44:03,078 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4318 ImplicationChecksByTransitivity, 14.8s TimeCoverageRelationStatistics Valid=1925, Invalid=12591, Unknown=4, NotChecked=0, Total=14520 [2022-12-14 14:44:03,078 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 2020 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1776 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2020 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 1776 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-12-14 14:44:03,078 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2020 Valid, 0 Invalid, 1896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 1776 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-12-14 14:44:03,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1092 states. [2022-12-14 14:44:03,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1092 to 377. [2022-12-14 14:44:03,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 376 states have (on average 2.7180851063829787) internal successors, (1022), 376 states have internal predecessors, (1022), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:44:03,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1022 transitions. [2022-12-14 14:44:03,089 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1022 transitions. Word has length 24 [2022-12-14 14:44:03,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:44:03,089 INFO L495 AbstractCegarLoop]: Abstraction has 377 states and 1022 transitions. [2022-12-14 14:44:03,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 1.425531914893617) internal successors, (67), 46 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:44:03,089 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1022 transitions. [2022-12-14 14:44:03,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 14:44:03,090 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:44:03,090 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:44:03,094 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (95)] Ended with exit code 0 [2022-12-14 14:44:03,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 95 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable105 [2022-12-14 14:44:03,291 INFO L420 AbstractCegarLoop]: === Iteration 107 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:44:03,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:44:03,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1095339888, now seen corresponding path program 2 times [2022-12-14 14:44:03,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:44:03,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690700433] [2022-12-14 14:44:03,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:44:03,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:44:03,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:44:03,759 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:44:03,760 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:44:03,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690700433] [2022-12-14 14:44:03,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690700433] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:44:03,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [519063029] [2022-12-14 14:44:03,760 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 14:44:03,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:44:03,760 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:44:03,761 INFO L229 MonitoredProcess]: Starting monitored process 96 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:44:03,761 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (96)] Waiting until timeout for monitored process [2022-12-14 14:44:03,954 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 14:44:03,954 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:44:03,955 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 29 conjunts are in the unsatisfiable core [2022-12-14 14:44:03,956 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:44:04,332 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:44:04,332 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:44:04,501 INFO L321 Elim1Store]: treesize reduction 11, result has 84.9 percent of original size [2022-12-14 14:44:04,501 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 76 [2022-12-14 14:44:04,797 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:44:04,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [519063029] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-14 14:44:04,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-14 14:44:04,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [12, 12] total 29 [2022-12-14 14:44:04,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143788174] [2022-12-14 14:44:04,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:44:04,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-14 14:44:04,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:44:04,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-14 14:44:04,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=721, Unknown=0, NotChecked=0, Total=870 [2022-12-14 14:44:04,798 INFO L87 Difference]: Start difference. First operand 377 states and 1022 transitions. Second operand has 12 states, 12 states have (on average 2.0) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:44:05,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:44:05,083 INFO L93 Difference]: Finished difference Result 407 states and 1091 transitions. [2022-12-14 14:44:05,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-14 14:44:05,083 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 14:44:05,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:44:05,084 INFO L225 Difference]: With dead ends: 407 [2022-12-14 14:44:05,084 INFO L226 Difference]: Without dead ends: 395 [2022-12-14 14:44:05,084 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=204, Invalid=918, Unknown=0, NotChecked=0, Total=1122 [2022-12-14 14:44:05,084 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 49 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 14:44:05,084 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 3 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 14:44:05,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2022-12-14 14:44:05,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 367. [2022-12-14 14:44:05,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 366 states have (on average 2.7349726775956285) internal successors, (1001), 366 states have internal predecessors, (1001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:44:05,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 1001 transitions. [2022-12-14 14:44:05,088 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 1001 transitions. Word has length 24 [2022-12-14 14:44:05,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:44:05,088 INFO L495 AbstractCegarLoop]: Abstraction has 367 states and 1001 transitions. [2022-12-14 14:44:05,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:44:05,088 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 1001 transitions. [2022-12-14 14:44:05,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 14:44:05,089 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:44:05,089 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:44:05,093 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (96)] Ended with exit code 0 [2022-12-14 14:44:05,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106,96 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:44:05,289 INFO L420 AbstractCegarLoop]: === Iteration 108 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:44:05,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:44:05,290 INFO L85 PathProgramCache]: Analyzing trace with hash 248401708, now seen corresponding path program 42 times [2022-12-14 14:44:05,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:44:05,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740359734] [2022-12-14 14:44:05,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:44:05,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:44:05,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:44:05,922 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:44:05,922 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:44:05,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740359734] [2022-12-14 14:44:05,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740359734] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:44:05,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [981931818] [2022-12-14 14:44:05,923 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 14:44:05,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:44:05,923 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:44:05,923 INFO L229 MonitoredProcess]: Starting monitored process 97 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:44:05,924 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (97)] Waiting until timeout for monitored process [2022-12-14 14:44:06,084 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 14:44:06,084 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:44:06,085 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-14 14:44:06,086 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:44:06,393 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 14:44:06,393 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:44:06,798 INFO L321 Elim1Store]: treesize reduction 17, result has 92.1 percent of original size [2022-12-14 14:44:06,798 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 89 treesize of output 224 [2022-12-14 14:44:20,546 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 14:44:20,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [981931818] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:44:20,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1553233072] [2022-12-14 14:44:20,547 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 14:44:20,547 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:44:20,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 7] total 29 [2022-12-14 14:44:20,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803235146] [2022-12-14 14:44:20,547 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:44:20,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-12-14 14:44:20,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:44:20,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-12-14 14:44:20,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=712, Unknown=0, NotChecked=0, Total=812 [2022-12-14 14:44:20,548 INFO L87 Difference]: Start difference. First operand 367 states and 1001 transitions. Second operand has 29 states, 29 states have (on average 2.0344827586206895) internal successors, (59), 29 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-12-14 14:44:22,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:44:22,887 INFO L93 Difference]: Finished difference Result 593 states and 1522 transitions. [2022-12-14 14:44:22,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-14 14:44:22,887 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.0344827586206895) internal successors, (59), 29 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 24 [2022-12-14 14:44:22,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:44:22,888 INFO L225 Difference]: With dead ends: 593 [2022-12-14 14:44:22,888 INFO L226 Difference]: Without dead ends: 591 [2022-12-14 14:44:22,888 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 401 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=392, Invalid=2058, Unknown=0, NotChecked=0, Total=2450 [2022-12-14 14:44:22,888 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 196 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1215 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:44:22,889 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 0 Invalid, 1227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1215 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-12-14 14:44:22,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2022-12-14 14:44:22,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 397. [2022-12-14 14:44:22,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 396 states have (on average 2.823232323232323) internal successors, (1118), 396 states have internal predecessors, (1118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:44:22,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 1118 transitions. [2022-12-14 14:44:22,894 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 1118 transitions. Word has length 24 [2022-12-14 14:44:22,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:44:22,894 INFO L495 AbstractCegarLoop]: Abstraction has 397 states and 1118 transitions. [2022-12-14 14:44:22,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.0344827586206895) internal successors, (59), 29 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-12-14 14:44:22,894 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 1118 transitions. [2022-12-14 14:44:22,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 14:44:22,895 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:44:22,895 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:44:22,899 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (97)] Ended with exit code 0 [2022-12-14 14:44:23,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 97 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable107 [2022-12-14 14:44:23,096 INFO L420 AbstractCegarLoop]: === Iteration 109 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:44:23,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:44:23,097 INFO L85 PathProgramCache]: Analyzing trace with hash -966483490, now seen corresponding path program 43 times [2022-12-14 14:44:23,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:44:23,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830955477] [2022-12-14 14:44:23,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:44:23,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:44:23,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:44:23,679 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:44:23,679 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:44:23,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830955477] [2022-12-14 14:44:23,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830955477] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:44:23,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [238846644] [2022-12-14 14:44:23,679 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 14:44:23,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:44:23,679 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:44:23,680 INFO L229 MonitoredProcess]: Starting monitored process 98 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:44:23,681 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (98)] Waiting until timeout for monitored process [2022-12-14 14:44:23,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:44:23,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 31 conjunts are in the unsatisfiable core [2022-12-14 14:44:23,837 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:44:24,398 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:44:24,398 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:44:24,614 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-14 14:44:24,614 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 4 [2022-12-14 14:44:24,623 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-14 14:44:24,623 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 4 [2022-12-14 14:44:24,688 INFO L321 Elim1Store]: treesize reduction 32, result has 62.4 percent of original size [2022-12-14 14:44:24,688 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 60 [2022-12-14 14:44:25,162 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:44:25,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [238846644] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:44:25,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1589285401] [2022-12-14 14:44:25,163 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 14:44:25,163 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:44:25,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 13] total 38 [2022-12-14 14:44:25,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495032669] [2022-12-14 14:44:25,163 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:44:25,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-12-14 14:44:25,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:44:25,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-12-14 14:44:25,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=1243, Unknown=0, NotChecked=0, Total=1482 [2022-12-14 14:44:25,164 INFO L87 Difference]: Start difference. First operand 397 states and 1118 transitions. Second operand has 39 states, 39 states have (on average 1.641025641025641) internal successors, (64), 38 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:44:26,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:44:26,702 INFO L93 Difference]: Finished difference Result 495 states and 1330 transitions. [2022-12-14 14:44:26,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-14 14:44:26,702 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.641025641025641) internal successors, (64), 38 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 14:44:26,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:44:26,703 INFO L225 Difference]: With dead ends: 495 [2022-12-14 14:44:26,703 INFO L226 Difference]: Without dead ends: 495 [2022-12-14 14:44:26,703 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 543 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=465, Invalid=1985, Unknown=0, NotChecked=0, Total=2450 [2022-12-14 14:44:26,703 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 148 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1267 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-12-14 14:44:26,703 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 0 Invalid, 1268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1267 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-12-14 14:44:26,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2022-12-14 14:44:26,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 389. [2022-12-14 14:44:26,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 388 states have (on average 2.814432989690722) internal successors, (1092), 388 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:44:26,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1092 transitions. [2022-12-14 14:44:26,710 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1092 transitions. Word has length 24 [2022-12-14 14:44:26,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:44:26,710 INFO L495 AbstractCegarLoop]: Abstraction has 389 states and 1092 transitions. [2022-12-14 14:44:26,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 1.641025641025641) internal successors, (64), 38 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:44:26,710 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1092 transitions. [2022-12-14 14:44:26,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 14:44:26,711 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:44:26,711 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:44:26,715 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (98)] Ended with exit code 0 [2022-12-14 14:44:26,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 98 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable108 [2022-12-14 14:44:26,912 INFO L420 AbstractCegarLoop]: === Iteration 110 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:44:26,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:44:26,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1650507996, now seen corresponding path program 44 times [2022-12-14 14:44:26,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:44:26,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488944533] [2022-12-14 14:44:26,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:44:26,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:44:26,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:44:27,739 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:44:27,739 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:44:27,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488944533] [2022-12-14 14:44:27,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488944533] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:44:27,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [675960108] [2022-12-14 14:44:27,739 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 14:44:27,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:44:27,739 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:44:27,740 INFO L229 MonitoredProcess]: Starting monitored process 99 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:44:27,741 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (99)] Waiting until timeout for monitored process [2022-12-14 14:44:27,916 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-12-14 14:44:27,916 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:44:27,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 59 conjunts are in the unsatisfiable core [2022-12-14 14:44:27,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:44:28,935 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:44:28,935 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:44:29,590 INFO L321 Elim1Store]: treesize reduction 32, result has 62.4 percent of original size [2022-12-14 14:44:29,591 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 60 [2022-12-14 14:44:29,646 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-14 14:44:29,646 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 4 [2022-12-14 14:44:30,996 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:44:30,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [675960108] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:44:30,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [661668320] [2022-12-14 14:44:30,996 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 14:44:30,996 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:44:30,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 15] total 43 [2022-12-14 14:44:30,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18954595] [2022-12-14 14:44:30,997 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:44:30,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-12-14 14:44:30,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:44:30,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-12-14 14:44:30,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=1592, Unknown=0, NotChecked=0, Total=1892 [2022-12-14 14:44:30,997 INFO L87 Difference]: Start difference. First operand 389 states and 1092 transitions. Second operand has 44 states, 44 states have (on average 1.5227272727272727) internal successors, (67), 43 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:44:40,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:44:40,785 INFO L93 Difference]: Finished difference Result 732 states and 1925 transitions. [2022-12-14 14:44:40,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-12-14 14:44:40,785 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 1.5227272727272727) internal successors, (67), 43 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 14:44:40,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:44:40,786 INFO L225 Difference]: With dead ends: 732 [2022-12-14 14:44:40,786 INFO L226 Difference]: Without dead ends: 723 [2022-12-14 14:44:40,787 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2226 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=1634, Invalid=7872, Unknown=0, NotChecked=0, Total=9506 [2022-12-14 14:44:40,787 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 600 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2146 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 600 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 2146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-12-14 14:44:40,787 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [600 Valid, 0 Invalid, 2201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 2146 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-12-14 14:44:40,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2022-12-14 14:44:40,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 453. [2022-12-14 14:44:40,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 452 states have (on average 2.898230088495575) internal successors, (1310), 452 states have internal predecessors, (1310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:44:40,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 1310 transitions. [2022-12-14 14:44:40,793 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 1310 transitions. Word has length 24 [2022-12-14 14:44:40,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:44:40,793 INFO L495 AbstractCegarLoop]: Abstraction has 453 states and 1310 transitions. [2022-12-14 14:44:40,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 1.5227272727272727) internal successors, (67), 43 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:44:40,793 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 1310 transitions. [2022-12-14 14:44:40,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 14:44:40,794 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:44:40,794 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:44:40,798 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (99)] Forceful destruction successful, exit code 0 [2022-12-14 14:44:40,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109,99 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:44:40,995 INFO L420 AbstractCegarLoop]: === Iteration 111 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:44:40,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:44:40,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1429574102, now seen corresponding path program 45 times [2022-12-14 14:44:40,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:44:40,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436328843] [2022-12-14 14:44:40,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:44:40,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:44:41,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:44:41,865 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:44:41,865 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:44:41,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436328843] [2022-12-14 14:44:41,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436328843] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:44:41,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [901522779] [2022-12-14 14:44:41,866 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 14:44:41,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:44:41,866 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:44:41,866 INFO L229 MonitoredProcess]: Starting monitored process 100 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:44:41,867 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (100)] Waiting until timeout for monitored process [2022-12-14 14:44:42,022 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 14:44:42,022 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:44:42,023 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-14 14:44:42,024 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:44:42,387 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 14:44:42,387 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:44:42,946 INFO L321 Elim1Store]: treesize reduction 17, result has 92.1 percent of original size [2022-12-14 14:44:42,946 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 89 treesize of output 224 [2022-12-14 14:44:47,458 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-14 14:44:47,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [901522779] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:44:47,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [796126273] [2022-12-14 14:44:47,459 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 14:44:47,459 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:44:47,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 7] total 30 [2022-12-14 14:44:47,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371728469] [2022-12-14 14:44:47,459 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:44:47,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-12-14 14:44:47,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:44:47,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-12-14 14:44:47,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=755, Unknown=0, NotChecked=0, Total=870 [2022-12-14 14:44:47,460 INFO L87 Difference]: Start difference. First operand 453 states and 1310 transitions. Second operand has 30 states, 30 states have (on average 2.033333333333333) internal successors, (61), 30 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-12-14 14:44:50,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:44:50,215 INFO L93 Difference]: Finished difference Result 723 states and 1925 transitions. [2022-12-14 14:44:50,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-14 14:44:50,216 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.033333333333333) internal successors, (61), 30 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 24 [2022-12-14 14:44:50,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:44:50,217 INFO L225 Difference]: With dead ends: 723 [2022-12-14 14:44:50,217 INFO L226 Difference]: Without dead ends: 723 [2022-12-14 14:44:50,217 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 455 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=400, Invalid=2050, Unknown=0, NotChecked=0, Total=2450 [2022-12-14 14:44:50,217 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 300 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1322 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-12-14 14:44:50,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 0 Invalid, 1326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1322 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-12-14 14:44:50,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2022-12-14 14:44:50,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 459. [2022-12-14 14:44:50,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 458 states have (on average 2.927947598253275) internal successors, (1341), 458 states have internal predecessors, (1341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:44:50,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 1341 transitions. [2022-12-14 14:44:50,224 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 1341 transitions. Word has length 24 [2022-12-14 14:44:50,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:44:50,224 INFO L495 AbstractCegarLoop]: Abstraction has 459 states and 1341 transitions. [2022-12-14 14:44:50,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.033333333333333) internal successors, (61), 30 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-12-14 14:44:50,224 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 1341 transitions. [2022-12-14 14:44:50,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 14:44:50,225 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:44:50,225 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:44:50,230 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (100)] Forceful destruction successful, exit code 0 [2022-12-14 14:44:50,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 100 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable110 [2022-12-14 14:44:50,426 INFO L420 AbstractCegarLoop]: === Iteration 112 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:44:50,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:44:50,426 INFO L85 PathProgramCache]: Analyzing trace with hash -492111658, now seen corresponding path program 46 times [2022-12-14 14:44:50,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:44:50,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677911275] [2022-12-14 14:44:50,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:44:50,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:44:50,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:44:51,074 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:44:51,074 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:44:51,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677911275] [2022-12-14 14:44:51,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677911275] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:44:51,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1998203144] [2022-12-14 14:44:51,074 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 14:44:51,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:44:51,074 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:44:51,075 INFO L229 MonitoredProcess]: Starting monitored process 101 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:44:51,076 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (101)] Waiting until timeout for monitored process [2022-12-14 14:44:51,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:44:51,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 35 conjunts are in the unsatisfiable core [2022-12-14 14:44:51,253 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:44:51,766 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:44:51,766 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:44:52,123 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-14 14:44:52,124 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 4 [2022-12-14 14:44:52,134 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-14 14:44:52,134 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 4 [2022-12-14 14:44:52,195 INFO L321 Elim1Store]: treesize reduction 34, result has 62.6 percent of original size [2022-12-14 14:44:52,196 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 64 [2022-12-14 14:44:52,652 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:44:52,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1998203144] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:44:52,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1038419006] [2022-12-14 14:44:52,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:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 14:44:52,653 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:44:52,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 13] total 37 [2022-12-14 14:44:52,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652036846] [2022-12-14 14:44:52,654 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:44:52,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-12-14 14:44:52,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:44:52,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-12-14 14:44:52,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=1160, Unknown=0, NotChecked=0, Total=1406 [2022-12-14 14:44:52,654 INFO L87 Difference]: Start difference. First operand 459 states and 1341 transitions. Second operand has 38 states, 38 states have (on average 1.631578947368421) internal successors, (62), 37 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:44:54,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:44:54,281 INFO L93 Difference]: Finished difference Result 539 states and 1550 transitions. [2022-12-14 14:44:54,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-14 14:44:54,281 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.631578947368421) internal successors, (62), 37 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 14:44:54,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:44:54,282 INFO L225 Difference]: With dead ends: 539 [2022-12-14 14:44:54,282 INFO L226 Difference]: Without dead ends: 537 [2022-12-14 14:44:54,283 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 474 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=483, Invalid=2067, Unknown=0, NotChecked=0, Total=2550 [2022-12-14 14:44:54,283 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 190 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1132 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-12-14 14:44:54,283 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 0 Invalid, 1151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1132 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-12-14 14:44:54,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2022-12-14 14:44:54,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 477. [2022-12-14 14:44:54,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 476 states have (on average 2.9747899159663866) internal successors, (1416), 476 states have internal predecessors, (1416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:44:54,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 1416 transitions. [2022-12-14 14:44:54,288 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 1416 transitions. Word has length 24 [2022-12-14 14:44:54,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:44:54,288 INFO L495 AbstractCegarLoop]: Abstraction has 477 states and 1416 transitions. [2022-12-14 14:44:54,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 1.631578947368421) internal successors, (62), 37 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:44:54,288 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 1416 transitions. [2022-12-14 14:44:54,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 14:44:54,289 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:44:54,289 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:44:54,294 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (101)] Ended with exit code 0 [2022-12-14 14:44:54,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable111,101 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:44:54,490 INFO L420 AbstractCegarLoop]: === Iteration 113 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:44:54,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:44:54,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1706996856, now seen corresponding path program 47 times [2022-12-14 14:44:54,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:44:54,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081358590] [2022-12-14 14:44:54,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:44:54,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:44:54,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:44:55,072 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:44:55,073 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:44:55,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081358590] [2022-12-14 14:44:55,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081358590] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:44:55,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1076447233] [2022-12-14 14:44:55,073 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 14:44:55,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:44:55,073 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:44:55,074 INFO L229 MonitoredProcess]: Starting monitored process 102 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:44:55,074 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (102)] Waiting until timeout for monitored process [2022-12-14 14:44:55,319 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-14 14:44:55,319 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:44:55,321 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 43 conjunts are in the unsatisfiable core [2022-12-14 14:44:55,322 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:44:55,973 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:44:55,973 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:44:56,293 INFO L321 Elim1Store]: treesize reduction 34, result has 62.6 percent of original size [2022-12-14 14:44:56,293 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 64 [2022-12-14 14:44:56,313 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-14 14:44:56,314 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 4 [2022-12-14 14:44:56,324 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-14 14:44:56,324 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 4 [2022-12-14 14:44:56,716 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:44:56,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1076447233] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:44:56,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1048278674] [2022-12-14 14:44:56,717 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 14:44:56,717 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:44:56,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 13] total 38 [2022-12-14 14:44:56,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592626220] [2022-12-14 14:44:56,718 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:44:56,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-12-14 14:44:56,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:44:56,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-12-14 14:44:56,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=264, Invalid=1218, Unknown=0, NotChecked=0, Total=1482 [2022-12-14 14:44:56,719 INFO L87 Difference]: Start difference. First operand 477 states and 1416 transitions. Second operand has 39 states, 39 states have (on average 1.6153846153846154) internal successors, (63), 38 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:44:59,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:44:59,274 INFO L93 Difference]: Finished difference Result 881 states and 2561 transitions. [2022-12-14 14:44:59,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-12-14 14:44:59,274 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.6153846153846154) internal successors, (63), 38 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 14:44:59,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:44:59,275 INFO L225 Difference]: With dead ends: 881 [2022-12-14 14:44:59,276 INFO L226 Difference]: Without dead ends: 881 [2022-12-14 14:44:59,276 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 846 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=702, Invalid=2958, Unknown=0, NotChecked=0, Total=3660 [2022-12-14 14:44:59,276 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 279 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1283 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-12-14 14:44:59,276 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 0 Invalid, 1292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1283 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-12-14 14:44:59,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2022-12-14 14:44:59,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 461. [2022-12-14 14:44:59,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 460 states have (on average 2.9304347826086956) internal successors, (1348), 460 states have internal predecessors, (1348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:44:59,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 1348 transitions. [2022-12-14 14:44:59,283 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 1348 transitions. Word has length 24 [2022-12-14 14:44:59,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:44:59,283 INFO L495 AbstractCegarLoop]: Abstraction has 461 states and 1348 transitions. [2022-12-14 14:44:59,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 1.6153846153846154) internal successors, (63), 38 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:44:59,283 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 1348 transitions. [2022-12-14 14:44:59,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 14:44:59,283 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:44:59,284 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:44:59,288 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (102)] Forceful destruction successful, exit code 0 [2022-12-14 14:44:59,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 102 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable112 [2022-12-14 14:44:59,485 INFO L420 AbstractCegarLoop]: === Iteration 114 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:44:59,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:44:59,485 INFO L85 PathProgramCache]: Analyzing trace with hash 38700566, now seen corresponding path program 48 times [2022-12-14 14:44:59,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:44:59,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397792396] [2022-12-14 14:44:59,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:44:59,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:44:59,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:45:00,119 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:45:00,119 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:45:00,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397792396] [2022-12-14 14:45:00,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397792396] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:45:00,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [747584727] [2022-12-14 14:45:00,119 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 14:45:00,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:45:00,120 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:45:00,120 INFO L229 MonitoredProcess]: Starting monitored process 103 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:45:00,121 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (103)] Waiting until timeout for monitored process [2022-12-14 14:45:00,292 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 14:45:00,292 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:45:00,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-14 14:45:00,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:45:00,628 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 14:45:00,628 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:45:01,161 INFO L321 Elim1Store]: treesize reduction 19, result has 91.6 percent of original size [2022-12-14 14:45:01,161 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 95 treesize of output 236 [2022-12-14 14:45:12,350 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 14:45:12,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [747584727] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:45:12,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1843721841] [2022-12-14 14:45:12,351 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 14:45:12,351 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:45:12,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 8] total 30 [2022-12-14 14:45:12,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646529047] [2022-12-14 14:45:12,351 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:45:12,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-12-14 14:45:12,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:45:12,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-12-14 14:45:12,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=741, Unknown=0, NotChecked=0, Total=870 [2022-12-14 14:45:12,352 INFO L87 Difference]: Start difference. First operand 461 states and 1348 transitions. Second operand has 30 states, 30 states have (on average 2.033333333333333) internal successors, (61), 30 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-12-14 14:45:13,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:45:13,812 INFO L93 Difference]: Finished difference Result 641 states and 1781 transitions. [2022-12-14 14:45:13,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-14 14:45:13,812 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.033333333333333) internal successors, (61), 30 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 24 [2022-12-14 14:45:13,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:45:13,813 INFO L225 Difference]: With dead ends: 641 [2022-12-14 14:45:13,813 INFO L226 Difference]: Without dead ends: 641 [2022-12-14 14:45:13,813 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 414 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=312, Invalid=1758, Unknown=0, NotChecked=0, Total=2070 [2022-12-14 14:45:13,813 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 203 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1136 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-12-14 14:45:13,813 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 0 Invalid, 1142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1136 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-12-14 14:45:13,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2022-12-14 14:45:13,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 445. [2022-12-14 14:45:13,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 444 states have (on average 2.936936936936937) internal successors, (1304), 444 states have internal predecessors, (1304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:45:13,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 1304 transitions. [2022-12-14 14:45:13,819 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 1304 transitions. Word has length 24 [2022-12-14 14:45:13,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:45:13,820 INFO L495 AbstractCegarLoop]: Abstraction has 445 states and 1304 transitions. [2022-12-14 14:45:13,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.033333333333333) internal successors, (61), 30 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-12-14 14:45:13,820 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 1304 transitions. [2022-12-14 14:45:13,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 14:45:13,820 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:45:13,820 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:45:13,825 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (103)] Ended with exit code 0 [2022-12-14 14:45:14,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 103 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable113 [2022-12-14 14:45:14,021 INFO L420 AbstractCegarLoop]: === Iteration 115 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:45:14,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:45:14,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1584143412, now seen corresponding path program 49 times [2022-12-14 14:45:14,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:45:14,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335506620] [2022-12-14 14:45:14,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:45:14,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:45:14,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:45:14,786 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:45:14,786 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:45:14,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335506620] [2022-12-14 14:45:14,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335506620] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:45:14,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [483027970] [2022-12-14 14:45:14,787 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 14:45:14,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:45:14,787 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:45:14,787 INFO L229 MonitoredProcess]: Starting monitored process 104 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:45:14,788 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (104)] Waiting until timeout for monitored process [2022-12-14 14:45:14,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:45:14,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 33 conjunts are in the unsatisfiable core [2022-12-14 14:45:14,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:45:15,506 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:45:15,506 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:45:15,829 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-14 14:45:15,829 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 4 [2022-12-14 14:45:15,839 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-14 14:45:15,839 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 4 [2022-12-14 14:45:15,899 INFO L321 Elim1Store]: treesize reduction 32, result has 62.4 percent of original size [2022-12-14 14:45:15,899 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 60 [2022-12-14 14:45:16,487 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:45:16,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [483027970] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:45:16,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1022964638] [2022-12-14 14:45:16,487 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 14:45:16,487 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:45:16,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 13] total 38 [2022-12-14 14:45:16,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644401433] [2022-12-14 14:45:16,488 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:45:16,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-12-14 14:45:16,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:45:16,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-12-14 14:45:16,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=1259, Unknown=0, NotChecked=0, Total=1482 [2022-12-14 14:45:16,488 INFO L87 Difference]: Start difference. First operand 445 states and 1304 transitions. Second operand has 39 states, 39 states have (on average 1.5897435897435896) internal successors, (62), 38 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:45:18,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:45:18,996 INFO L93 Difference]: Finished difference Result 707 states and 1939 transitions. [2022-12-14 14:45:18,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-14 14:45:18,997 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.5897435897435896) internal successors, (62), 38 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 14:45:18,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:45:18,998 INFO L225 Difference]: With dead ends: 707 [2022-12-14 14:45:18,998 INFO L226 Difference]: Without dead ends: 705 [2022-12-14 14:45:18,998 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 486 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=536, Invalid=2326, Unknown=0, NotChecked=0, Total=2862 [2022-12-14 14:45:18,998 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 250 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1465 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-12-14 14:45:18,998 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 0 Invalid, 1481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1465 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-12-14 14:45:18,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2022-12-14 14:45:19,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 463. [2022-12-14 14:45:19,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 462 states have (on average 2.9718614718614718) internal successors, (1373), 462 states have internal predecessors, (1373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:45:19,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 1373 transitions. [2022-12-14 14:45:19,004 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 1373 transitions. Word has length 24 [2022-12-14 14:45:19,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:45:19,005 INFO L495 AbstractCegarLoop]: Abstraction has 463 states and 1373 transitions. [2022-12-14 14:45:19,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 1.5897435897435896) internal successors, (62), 38 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:45:19,005 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 1373 transitions. [2022-12-14 14:45:19,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 14:45:19,005 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:45:19,005 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:45:19,010 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (104)] Ended with exit code 0 [2022-12-14 14:45:19,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 104 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable114 [2022-12-14 14:45:19,206 INFO L420 AbstractCegarLoop]: === Iteration 116 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:45:19,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:45:19,207 INFO L85 PathProgramCache]: Analyzing trace with hash 369258214, now seen corresponding path program 50 times [2022-12-14 14:45:19,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:45:19,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030286835] [2022-12-14 14:45:19,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:45:19,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:45:19,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:45:20,163 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:45:20,163 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:45:20,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030286835] [2022-12-14 14:45:20,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030286835] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:45:20,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1775948346] [2022-12-14 14:45:20,164 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 14:45:20,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:45:20,164 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:45:20,165 INFO L229 MonitoredProcess]: Starting monitored process 105 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:45:20,165 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (105)] Waiting until timeout for monitored process [2022-12-14 14:45:20,416 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-12-14 14:45:20,416 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:45:20,418 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 47 conjunts are in the unsatisfiable core [2022-12-14 14:45:20,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:45:21,393 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 14:45:21,393 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:45:21,912 INFO L321 Elim1Store]: treesize reduction 30, result has 84.9 percent of original size [2022-12-14 14:45:21,913 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 89 treesize of output 194 [2022-12-14 14:45:22,965 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 14:45:22,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1775948346] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:45:22,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1791721769] [2022-12-14 14:45:22,965 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 14:45:22,966 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:45:22,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 38 [2022-12-14 14:45:22,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157875850] [2022-12-14 14:45:22,966 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:45:22,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-12-14 14:45:22,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:45:22,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-12-14 14:45:22,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=1267, Unknown=0, NotChecked=0, Total=1482 [2022-12-14 14:45:22,966 INFO L87 Difference]: Start difference. First operand 463 states and 1373 transitions. Second operand has 39 states, 39 states have (on average 1.641025641025641) internal successors, (64), 38 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:45:30,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:45:30,891 INFO L93 Difference]: Finished difference Result 1260 states and 3106 transitions. [2022-12-14 14:45:30,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-12-14 14:45:30,891 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.641025641025641) internal successors, (64), 38 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 14:45:30,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:45:30,893 INFO L225 Difference]: With dead ends: 1260 [2022-12-14 14:45:30,893 INFO L226 Difference]: Without dead ends: 1260 [2022-12-14 14:45:30,893 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2304 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=1746, Invalid=7184, Unknown=0, NotChecked=0, Total=8930 [2022-12-14 14:45:30,894 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 836 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2190 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 836 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 2190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:45:30,894 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [836 Valid, 0 Invalid, 2229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 2190 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-12-14 14:45:30,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1260 states. [2022-12-14 14:45:30,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1260 to 439. [2022-12-14 14:45:30,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 438 states have (on average 2.9292237442922375) internal successors, (1283), 438 states have internal predecessors, (1283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:45:30,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 1283 transitions. [2022-12-14 14:45:30,902 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 1283 transitions. Word has length 24 [2022-12-14 14:45:30,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:45:30,902 INFO L495 AbstractCegarLoop]: Abstraction has 439 states and 1283 transitions. [2022-12-14 14:45:30,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 1.641025641025641) internal successors, (64), 38 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:45:30,902 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 1283 transitions. [2022-12-14 14:45:30,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 14:45:30,903 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:45:30,903 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:45:30,907 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (105)] Ended with exit code 0 [2022-12-14 14:45:31,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 105 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable115 [2022-12-14 14:45:31,104 INFO L420 AbstractCegarLoop]: === Iteration 117 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:45:31,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:45:31,105 INFO L85 PathProgramCache]: Analyzing trace with hash 782685252, now seen corresponding path program 1 times [2022-12-14 14:45:31,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:45:31,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606438565] [2022-12-14 14:45:31,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:45:31,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:45:31,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:45:31,818 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:45:31,818 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:45:31,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606438565] [2022-12-14 14:45:31,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606438565] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:45:31,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1361567617] [2022-12-14 14:45:31,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:45:31,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:45:31,819 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:45:31,820 INFO L229 MonitoredProcess]: Starting monitored process 106 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:45:31,820 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (106)] Waiting until timeout for monitored process [2022-12-14 14:45:32,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:45:32,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 35 conjunts are in the unsatisfiable core [2022-12-14 14:45:32,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:45:32,745 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:45:32,745 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 97 treesize of output 79 [2022-12-14 14:45:32,876 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:45:32,876 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:45:33,263 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:45:33,264 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 216 treesize of output 222 [2022-12-14 14:45:34,750 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:45:34,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1361567617] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:45:34,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [691952136] [2022-12-14 14:45:34,751 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 14:45:34,751 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:45:34,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 13] total 39 [2022-12-14 14:45:34,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901586560] [2022-12-14 14:45:34,751 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:45:34,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-12-14 14:45:34,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:45:34,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-12-14 14:45:34,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=1411, Unknown=0, NotChecked=0, Total=1640 [2022-12-14 14:45:34,752 INFO L87 Difference]: Start difference. First operand 439 states and 1283 transitions. Second operand has 41 states, 40 states have (on average 1.775) internal successors, (71), 40 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:45:36,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:45:36,342 INFO L93 Difference]: Finished difference Result 472 states and 1353 transitions. [2022-12-14 14:45:36,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-14 14:45:36,343 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 1.775) internal successors, (71), 40 states have internal predecessors, (71), 0 states have call successors, (0), 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-12-14 14:45:36,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:45:36,344 INFO L225 Difference]: With dead ends: 472 [2022-12-14 14:45:36,344 INFO L226 Difference]: Without dead ends: 455 [2022-12-14 14:45:36,344 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 483 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=430, Invalid=2120, Unknown=0, NotChecked=0, Total=2550 [2022-12-14 14:45:36,344 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 128 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 840 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 840 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-14 14:45:36,344 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 0 Invalid, 841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 840 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-12-14 14:45:36,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2022-12-14 14:45:36,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 455. [2022-12-14 14:45:36,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 454 states have (on average 2.905286343612335) internal successors, (1319), 454 states have internal predecessors, (1319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:45:36,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 1319 transitions. [2022-12-14 14:45:36,349 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 1319 transitions. Word has length 25 [2022-12-14 14:45:36,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:45:36,349 INFO L495 AbstractCegarLoop]: Abstraction has 455 states and 1319 transitions. [2022-12-14 14:45:36,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 1.775) internal successors, (71), 40 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:45:36,349 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 1319 transitions. [2022-12-14 14:45:36,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 14:45:36,350 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:45:36,350 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:45:36,354 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (106)] Ended with exit code 0 [2022-12-14 14:45:36,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 106 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable116 [2022-12-14 14:45:36,551 INFO L420 AbstractCegarLoop]: === Iteration 118 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:45:36,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:45:36,551 INFO L85 PathProgramCache]: Analyzing trace with hash 312850570, now seen corresponding path program 51 times [2022-12-14 14:45:36,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:45:36,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947237378] [2022-12-14 14:45:36,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:45:36,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:45:36,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:45:37,056 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 14:45:37,056 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:45:37,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947237378] [2022-12-14 14:45:37,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947237378] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:45:37,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1325503017] [2022-12-14 14:45:37,056 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 14:45:37,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:45:37,056 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:45:37,057 INFO L229 MonitoredProcess]: Starting monitored process 107 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:45:37,058 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (107)] Waiting until timeout for monitored process [2022-12-14 14:45:37,230 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 14:45:37,230 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:45:37,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 32 conjunts are in the unsatisfiable core [2022-12-14 14:45:37,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:45:37,745 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:45:37,745 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 111 treesize of output 76 [2022-12-14 14:45:37,918 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 14:45:37,918 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:45:38,190 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:45:38,191 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 161 treesize of output 125 [2022-12-14 14:45:39,331 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 14:45:39,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1325503017] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:45:39,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1499479754] [2022-12-14 14:45:39,331 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 14:45:39,332 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:45:39,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 37 [2022-12-14 14:45:39,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907623277] [2022-12-14 14:45:39,332 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:45:39,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-12-14 14:45:39,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:45:39,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-12-14 14:45:39,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=1208, Unknown=0, NotChecked=0, Total=1482 [2022-12-14 14:45:39,333 INFO L87 Difference]: Start difference. First operand 455 states and 1319 transitions. Second operand has 39 states, 38 states have (on average 1.605263157894737) internal successors, (61), 38 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-12-14 14:45:43,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:45:43,201 INFO L93 Difference]: Finished difference Result 947 states and 2556 transitions. [2022-12-14 14:45:43,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-12-14 14:45:43,201 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 1.605263157894737) internal successors, (61), 38 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 25 [2022-12-14 14:45:43,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:45:43,203 INFO L225 Difference]: With dead ends: 947 [2022-12-14 14:45:43,203 INFO L226 Difference]: Without dead ends: 869 [2022-12-14 14:45:43,203 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1183 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=992, Invalid=3700, Unknown=0, NotChecked=0, Total=4692 [2022-12-14 14:45:43,203 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 391 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 1447 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 1497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-12-14 14:45:43,203 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 80 Invalid, 1497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1447 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-12-14 14:45:43,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2022-12-14 14:45:43,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 457. [2022-12-14 14:45:43,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 456 states have (on average 2.8684210526315788) internal successors, (1308), 456 states have internal predecessors, (1308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:45:43,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 1308 transitions. [2022-12-14 14:45:43,210 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 1308 transitions. Word has length 25 [2022-12-14 14:45:43,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:45:43,210 INFO L495 AbstractCegarLoop]: Abstraction has 457 states and 1308 transitions. [2022-12-14 14:45:43,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 1.605263157894737) internal successors, (61), 38 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-12-14 14:45:43,210 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 1308 transitions. [2022-12-14 14:45:43,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 14:45:43,211 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:45:43,211 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:45:43,215 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (107)] Forceful destruction successful, exit code 0 [2022-12-14 14:45:43,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117,107 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:45:43,412 INFO L420 AbstractCegarLoop]: === Iteration 119 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:45:43,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:45:43,413 INFO L85 PathProgramCache]: Analyzing trace with hash 495309300, now seen corresponding path program 2 times [2022-12-14 14:45:43,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:45:43,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102722920] [2022-12-14 14:45:43,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:45:43,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:45:43,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:45:44,158 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:45:44,158 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:45:44,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102722920] [2022-12-14 14:45:44,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102722920] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:45:44,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1461885012] [2022-12-14 14:45:44,159 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 14:45:44,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:45:44,159 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:45:44,159 INFO L229 MonitoredProcess]: Starting monitored process 108 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:45:44,160 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (108)] Waiting until timeout for monitored process [2022-12-14 14:45:44,317 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 14:45:44,317 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:45:44,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 33 conjunts are in the unsatisfiable core [2022-12-14 14:45:44,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:45:45,036 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:45:45,036 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 97 treesize of output 79 [2022-12-14 14:45:45,171 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:45:45,171 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:45:45,542 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:45:45,542 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 210 treesize of output 214 [2022-12-14 14:45:46,411 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:45:46,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1461885012] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:45:46,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [425343347] [2022-12-14 14:45:46,411 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 14:45:46,412 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:45:46,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 13] total 40 [2022-12-14 14:45:46,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013511363] [2022-12-14 14:45:46,412 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:45:46,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-12-14 14:45:46,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:45:46,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-12-14 14:45:46,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=1468, Unknown=0, NotChecked=0, Total=1722 [2022-12-14 14:45:46,413 INFO L87 Difference]: Start difference. First operand 457 states and 1308 transitions. Second operand has 42 states, 41 states have (on average 1.829268292682927) internal successors, (75), 41 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:45:48,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:45:48,158 INFO L93 Difference]: Finished difference Result 502 states and 1412 transitions. [2022-12-14 14:45:48,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-14 14:45:48,158 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 1.829268292682927) internal successors, (75), 41 states have internal predecessors, (75), 0 states have call successors, (0), 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-12-14 14:45:48,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:45:48,159 INFO L225 Difference]: With dead ends: 502 [2022-12-14 14:45:48,159 INFO L226 Difference]: Without dead ends: 489 [2022-12-14 14:45:48,159 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 595 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=463, Invalid=2189, Unknown=0, NotChecked=0, Total=2652 [2022-12-14 14:45:48,159 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 162 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 985 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 986 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 985 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-12-14 14:45:48,159 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 0 Invalid, 986 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 985 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-12-14 14:45:48,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2022-12-14 14:45:48,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 469. [2022-12-14 14:45:48,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 468 states have (on average 2.8547008547008548) internal successors, (1336), 468 states have internal predecessors, (1336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:45:48,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 1336 transitions. [2022-12-14 14:45:48,164 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 1336 transitions. Word has length 25 [2022-12-14 14:45:48,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:45:48,164 INFO L495 AbstractCegarLoop]: Abstraction has 469 states and 1336 transitions. [2022-12-14 14:45:48,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 1.829268292682927) internal successors, (75), 41 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:45:48,164 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 1336 transitions. [2022-12-14 14:45:48,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 14:45:48,165 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:45:48,165 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:45:48,169 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (108)] Ended with exit code 0 [2022-12-14 14:45:48,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 108 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable118 [2022-12-14 14:45:48,366 INFO L420 AbstractCegarLoop]: === Iteration 120 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:45:48,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:45:48,367 INFO L85 PathProgramCache]: Analyzing trace with hash 20168132, now seen corresponding path program 3 times [2022-12-14 14:45:48,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:45:48,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138860628] [2022-12-14 14:45:48,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:45:48,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:45:48,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:45:49,472 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:45:49,472 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:45:49,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138860628] [2022-12-14 14:45:49,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138860628] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:45:49,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2085651954] [2022-12-14 14:45:49,472 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 14:45:49,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:45:49,473 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:45:49,473 INFO L229 MonitoredProcess]: Starting monitored process 109 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:45:49,474 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (109)] Waiting until timeout for monitored process [2022-12-14 14:45:49,627 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 14:45:49,627 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:45:49,628 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 29 conjunts are in the unsatisfiable core [2022-12-14 14:45:49,629 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:45:50,097 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:45:50,097 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 97 treesize of output 79 [2022-12-14 14:45:50,193 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 14:45:50,193 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:46:02,614 WARN L233 SmtUtils]: Spent 10.12s on a formula simplification. DAG size of input: 39 DAG size of output: 33 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 14:46:02,683 INFO L321 Elim1Store]: treesize reduction 32, result has 62.4 percent of original size [2022-12-14 14:46:02,683 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 59 [2022-12-14 14:46:02,732 INFO L321 Elim1Store]: treesize reduction 84, result has 1.2 percent of original size [2022-12-14 14:46:02,732 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 1 [2022-12-14 14:46:02,924 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 14:46:02,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2085651954] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:46:02,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1652511375] [2022-12-14 14:46:02,924 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 14:46:02,924 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:46:02,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 8] total 35 [2022-12-14 14:46:02,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385677659] [2022-12-14 14:46:02,925 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:46:02,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-12-14 14:46:02,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:46:02,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-12-14 14:46:02,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1110, Unknown=1, NotChecked=0, Total=1260 [2022-12-14 14:46:02,926 INFO L87 Difference]: Start difference. First operand 469 states and 1336 transitions. Second operand has 36 states, 35 states have (on average 2.057142857142857) internal successors, (72), 36 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:46:05,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:46:05,131 INFO L93 Difference]: Finished difference Result 591 states and 1586 transitions. [2022-12-14 14:46:05,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-14 14:46:05,132 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.057142857142857) internal successors, (72), 36 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-12-14 14:46:05,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:46:05,132 INFO L225 Difference]: With dead ends: 591 [2022-12-14 14:46:05,132 INFO L226 Difference]: Without dead ends: 577 [2022-12-14 14:46:05,133 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 578 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=376, Invalid=2379, Unknown=1, NotChecked=0, Total=2756 [2022-12-14 14:46:05,133 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 121 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1154 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:46:05,133 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 0 Invalid, 1157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1154 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-12-14 14:46:05,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2022-12-14 14:46:05,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 475. [2022-12-14 14:46:05,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 474 states have (on average 2.8544303797468356) internal successors, (1353), 474 states have internal predecessors, (1353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:46:05,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 1353 transitions. [2022-12-14 14:46:05,139 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 1353 transitions. Word has length 25 [2022-12-14 14:46:05,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:46:05,139 INFO L495 AbstractCegarLoop]: Abstraction has 475 states and 1353 transitions. [2022-12-14 14:46:05,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.057142857142857) internal successors, (72), 36 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:46:05,140 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 1353 transitions. [2022-12-14 14:46:05,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 14:46:05,140 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:46:05,140 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:46:05,145 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (109)] Ended with exit code 0 [2022-12-14 14:46:05,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119,109 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:46:05,341 INFO L420 AbstractCegarLoop]: === Iteration 121 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:46:05,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:46:05,342 INFO L85 PathProgramCache]: Analyzing trace with hash -367710688, now seen corresponding path program 4 times [2022-12-14 14:46:05,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:46:05,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020486314] [2022-12-14 14:46:05,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:46:05,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:46:05,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:46:06,531 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:46:06,531 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:46:06,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020486314] [2022-12-14 14:46:06,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020486314] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:46:06,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [987800371] [2022-12-14 14:46:06,532 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 14:46:06,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:46:06,532 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:46:06,533 INFO L229 MonitoredProcess]: Starting monitored process 110 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:46:06,533 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (110)] Waiting until timeout for monitored process [2022-12-14 14:46:06,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:46:06,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 33 conjunts are in the unsatisfiable core [2022-12-14 14:46:06,720 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:46:07,401 INFO L321 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2022-12-14 14:46:07,401 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 50 [2022-12-14 14:46:07,471 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:46:07,471 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:46:31,940 WARN L233 SmtUtils]: Spent 22.10s on a formula simplification. DAG size of input: 39 DAG size of output: 33 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 14:46:32,016 INFO L321 Elim1Store]: treesize reduction 32, result has 62.4 percent of original size [2022-12-14 14:46:32,016 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 60 [2022-12-14 14:46:32,055 INFO L321 Elim1Store]: treesize reduction 84, result has 1.2 percent of original size [2022-12-14 14:46:32,055 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 1 [2022-12-14 14:46:32,532 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:46:32,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [987800371] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:46:32,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [330524610] [2022-12-14 14:46:32,533 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 14:46:32,533 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:46:32,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 13] total 42 [2022-12-14 14:46:32,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597530109] [2022-12-14 14:46:32,533 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:46:32,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-12-14 14:46:32,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:46:32,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-12-14 14:46:32,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=1608, Unknown=1, NotChecked=0, Total=1892 [2022-12-14 14:46:32,534 INFO L87 Difference]: Start difference. First operand 475 states and 1353 transitions. Second operand has 44 states, 43 states have (on average 1.744186046511628) internal successors, (75), 43 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:46:34,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:46:34,178 INFO L93 Difference]: Finished difference Result 490 states and 1384 transitions. [2022-12-14 14:46:34,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-14 14:46:34,179 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 1.744186046511628) internal successors, (75), 43 states have internal predecessors, (75), 0 states have call successors, (0), 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-12-14 14:46:34,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:46:34,179 INFO L225 Difference]: With dead ends: 490 [2022-12-14 14:46:34,179 INFO L226 Difference]: Without dead ends: 485 [2022-12-14 14:46:34,180 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 701 ImplicationChecksByTransitivity, 26.3s TimeCoverageRelationStatistics Valid=492, Invalid=2369, Unknown=1, NotChecked=0, Total=2862 [2022-12-14 14:46:34,180 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 152 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1064 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1065 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1064 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-12-14 14:46:34,180 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 0 Invalid, 1065 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1064 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-12-14 14:46:34,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2022-12-14 14:46:34,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 477. [2022-12-14 14:46:34,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 476 states have (on average 2.846638655462185) internal successors, (1355), 476 states have internal predecessors, (1355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:46:34,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 1355 transitions. [2022-12-14 14:46:34,185 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 1355 transitions. Word has length 25 [2022-12-14 14:46:34,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:46:34,185 INFO L495 AbstractCegarLoop]: Abstraction has 477 states and 1355 transitions. [2022-12-14 14:46:34,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 1.744186046511628) internal successors, (75), 43 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:46:34,186 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 1355 transitions. [2022-12-14 14:46:34,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 14:46:34,186 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:46:34,186 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:46:34,191 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (110)] Ended with exit code 0 [2022-12-14 14:46:34,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120,110 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:46:34,387 INFO L420 AbstractCegarLoop]: === Iteration 122 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:46:34,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:46:34,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1758650620, now seen corresponding path program 5 times [2022-12-14 14:46:34,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:46:34,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283059059] [2022-12-14 14:46:34,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:46:34,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:46:34,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:46:35,135 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:46:35,135 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:46:35,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283059059] [2022-12-14 14:46:35,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283059059] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:46:35,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1707096237] [2022-12-14 14:46:35,136 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 14:46:35,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:46:35,136 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:46:35,137 INFO L229 MonitoredProcess]: Starting monitored process 111 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:46:35,137 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (111)] Waiting until timeout for monitored process [2022-12-14 14:46:35,428 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-14 14:46:35,428 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:46:35,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 34 conjunts are in the unsatisfiable core [2022-12-14 14:46:35,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:46:36,126 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:46:36,126 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 87 treesize of output 71 [2022-12-14 14:46:36,222 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 14:46:36,222 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:46:36,641 INFO L321 Elim1Store]: treesize reduction 32, result has 62.4 percent of original size [2022-12-14 14:46:36,641 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 231 treesize of output 187 [2022-12-14 14:46:36,840 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 14:46:36,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1707096237] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:46:36,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [540316426] [2022-12-14 14:46:36,841 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 14:46:36,841 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:46:36,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 9] total 35 [2022-12-14 14:46:36,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397033713] [2022-12-14 14:46:36,841 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:46:36,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-12-14 14:46:36,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:46:36,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-12-14 14:46:36,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1123, Unknown=0, NotChecked=0, Total=1260 [2022-12-14 14:46:36,842 INFO L87 Difference]: Start difference. First operand 477 states and 1355 transitions. Second operand has 36 states, 35 states have (on average 1.9428571428571428) internal successors, (68), 36 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-12-14 14:46:40,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:46:40,763 INFO L93 Difference]: Finished difference Result 743 states and 1985 transitions. [2022-12-14 14:46:40,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-12-14 14:46:40,764 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.9428571428571428) internal successors, (68), 36 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 25 [2022-12-14 14:46:40,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:46:40,765 INFO L225 Difference]: With dead ends: 743 [2022-12-14 14:46:40,765 INFO L226 Difference]: Without dead ends: 719 [2022-12-14 14:46:40,765 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 854 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=602, Invalid=3558, Unknown=0, NotChecked=0, Total=4160 [2022-12-14 14:46:40,765 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 251 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1679 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1679 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-12-14 14:46:40,765 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 0 Invalid, 1691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1679 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-12-14 14:46:40,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2022-12-14 14:46:40,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 505. [2022-12-14 14:46:40,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 504 states have (on average 2.8234126984126986) internal successors, (1423), 504 states have internal predecessors, (1423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:46:40,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 1423 transitions. [2022-12-14 14:46:40,776 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 1423 transitions. Word has length 25 [2022-12-14 14:46:40,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:46:40,776 INFO L495 AbstractCegarLoop]: Abstraction has 505 states and 1423 transitions. [2022-12-14 14:46:40,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.9428571428571428) internal successors, (68), 36 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-12-14 14:46:40,776 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 1423 transitions. [2022-12-14 14:46:40,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 14:46:40,777 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:46:40,777 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:46:40,782 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (111)] Ended with exit code 0 [2022-12-14 14:46:40,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 111 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable121 [2022-12-14 14:46:40,978 INFO L420 AbstractCegarLoop]: === Iteration 123 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:46:40,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:46:40,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1283509452, now seen corresponding path program 6 times [2022-12-14 14:46:40,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:46:40,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066158101] [2022-12-14 14:46:40,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:46:40,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:46:41,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:46:41,832 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:46:41,832 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:46:41,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066158101] [2022-12-14 14:46:41,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066158101] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:46:41,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1751476043] [2022-12-14 14:46:41,833 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 14:46:41,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:46:41,833 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:46:41,834 INFO L229 MonitoredProcess]: Starting monitored process 112 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:46:41,834 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (112)] Waiting until timeout for monitored process [2022-12-14 14:46:41,991 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 14:46:41,991 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:46:41,992 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-14 14:46:41,993 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:46:42,472 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:46:42,472 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 97 treesize of output 79 [2022-12-14 14:46:42,581 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 14:46:42,581 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:46:51,650 WARN L233 SmtUtils]: Spent 6.75s on a formula simplification. DAG size of input: 39 DAG size of output: 33 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 14:46:51,708 INFO L321 Elim1Store]: treesize reduction 32, result has 62.4 percent of original size [2022-12-14 14:46:51,708 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 59 [2022-12-14 14:46:51,741 INFO L321 Elim1Store]: treesize reduction 84, result has 1.2 percent of original size [2022-12-14 14:46:51,741 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 1 [2022-12-14 14:46:51,884 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-14 14:46:51,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1751476043] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:46:51,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1987359206] [2022-12-14 14:46:51,885 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 14:46:51,885 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:46:51,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 8] total 32 [2022-12-14 14:46:51,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079321611] [2022-12-14 14:46:51,885 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:46:51,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-12-14 14:46:51,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:46:51,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-12-14 14:46:51,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=932, Unknown=1, NotChecked=0, Total=1056 [2022-12-14 14:46:51,886 INFO L87 Difference]: Start difference. First operand 505 states and 1423 transitions. Second operand has 33 states, 32 states have (on average 2.125) internal successors, (68), 33 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-12-14 14:46:54,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:46:54,233 INFO L93 Difference]: Finished difference Result 627 states and 1670 transitions. [2022-12-14 14:46:54,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-14 14:46:54,234 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.125) internal successors, (68), 33 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 25 [2022-12-14 14:46:54,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:46:54,235 INFO L225 Difference]: With dead ends: 627 [2022-12-14 14:46:54,235 INFO L226 Difference]: Without dead ends: 613 [2022-12-14 14:46:54,235 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 469 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=361, Invalid=2188, Unknown=1, NotChecked=0, Total=2550 [2022-12-14 14:46:54,235 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 207 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1152 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-12-14 14:46:54,235 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 0 Invalid, 1156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1152 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-12-14 14:46:54,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2022-12-14 14:46:54,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 507. [2022-12-14 14:46:54,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 506 states have (on average 2.822134387351779) internal successors, (1428), 506 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:46:54,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 1428 transitions. [2022-12-14 14:46:54,241 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 1428 transitions. Word has length 25 [2022-12-14 14:46:54,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:46:54,242 INFO L495 AbstractCegarLoop]: Abstraction has 507 states and 1428 transitions. [2022-12-14 14:46:54,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.125) internal successors, (68), 33 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-12-14 14:46:54,242 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 1428 transitions. [2022-12-14 14:46:54,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 14:46:54,242 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:46:54,242 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:46:54,247 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (112)] Ended with exit code 0 [2022-12-14 14:46:54,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable122,112 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:46:54,443 INFO L420 AbstractCegarLoop]: === Iteration 124 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:46:54,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:46:54,443 INFO L85 PathProgramCache]: Analyzing trace with hash 895630632, now seen corresponding path program 7 times [2022-12-14 14:46:54,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:46:54,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669037784] [2022-12-14 14:46:54,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:46:54,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:46:54,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:46:55,410 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:46:55,410 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:46:55,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669037784] [2022-12-14 14:46:55,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669037784] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:46:55,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1866711773] [2022-12-14 14:46:55,411 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 14:46:55,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:46:55,411 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:46:55,412 INFO L229 MonitoredProcess]: Starting monitored process 113 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:46:55,412 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (113)] Waiting until timeout for monitored process [2022-12-14 14:46:55,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:46:55,578 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 33 conjunts are in the unsatisfiable core [2022-12-14 14:46:55,579 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:46:56,251 INFO L321 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2022-12-14 14:46:56,251 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 50 [2022-12-14 14:46:56,326 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:46:56,326 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:47:22,774 WARN L233 SmtUtils]: Spent 20.09s on a formula simplification. DAG size of input: 39 DAG size of output: 33 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 14:47:22,831 INFO L321 Elim1Store]: treesize reduction 32, result has 62.4 percent of original size [2022-12-14 14:47:22,831 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 60 [2022-12-14 14:47:22,875 INFO L321 Elim1Store]: treesize reduction 84, result has 1.2 percent of original size [2022-12-14 14:47:22,875 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 1 [2022-12-14 14:47:23,451 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:47:23,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1866711773] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:47:23,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [670130761] [2022-12-14 14:47:23,451 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 14:47:23,451 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:47:23,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 13] total 41 [2022-12-14 14:47:23,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307936143] [2022-12-14 14:47:23,451 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:47:23,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-12-14 14:47:23,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:47:23,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-12-14 14:47:23,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=1529, Unknown=3, NotChecked=0, Total=1806 [2022-12-14 14:47:23,452 INFO L87 Difference]: Start difference. First operand 507 states and 1428 transitions. Second operand has 43 states, 42 states have (on average 1.6904761904761905) internal successors, (71), 42 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:47:25,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:47:25,215 INFO L93 Difference]: Finished difference Result 550 states and 1520 transitions. [2022-12-14 14:47:25,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-14 14:47:25,215 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 1.6904761904761905) internal successors, (71), 42 states have internal predecessors, (71), 0 states have call successors, (0), 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-12-14 14:47:25,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:47:25,216 INFO L225 Difference]: With dead ends: 550 [2022-12-14 14:47:25,216 INFO L226 Difference]: Without dead ends: 545 [2022-12-14 14:47:25,217 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 628 ImplicationChecksByTransitivity, 28.3s TimeCoverageRelationStatistics Valid=477, Invalid=2276, Unknown=3, NotChecked=0, Total=2756 [2022-12-14 14:47:25,217 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 221 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1195 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:47:25,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 0 Invalid, 1196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1195 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-12-14 14:47:25,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2022-12-14 14:47:25,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 493. [2022-12-14 14:47:25,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 492 states have (on average 2.8272357723577235) internal successors, (1391), 492 states have internal predecessors, (1391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:47:25,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 1391 transitions. [2022-12-14 14:47:25,222 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 1391 transitions. Word has length 25 [2022-12-14 14:47:25,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:47:25,222 INFO L495 AbstractCegarLoop]: Abstraction has 493 states and 1391 transitions. [2022-12-14 14:47:25,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 1.6904761904761905) internal successors, (71), 42 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:47:25,223 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 1391 transitions. [2022-12-14 14:47:25,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 14:47:25,223 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:47:25,223 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:47:25,228 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (113)] Ended with exit code 0 [2022-12-14 14:47:25,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 113 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable123 [2022-12-14 14:47:25,424 INFO L420 AbstractCegarLoop]: === Iteration 125 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:47:25,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:47:25,425 INFO L85 PathProgramCache]: Analyzing trace with hash -2097212292, now seen corresponding path program 8 times [2022-12-14 14:47:25,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:47:25,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634768850] [2022-12-14 14:47:25,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:47:25,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:47:25,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:47:26,324 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:47:26,324 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:47:26,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634768850] [2022-12-14 14:47:26,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634768850] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:47:26,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1111691080] [2022-12-14 14:47:26,324 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 14:47:26,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:47:26,325 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:47:26,325 INFO L229 MonitoredProcess]: Starting monitored process 114 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:47:26,326 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (114)] Waiting until timeout for monitored process [2022-12-14 14:47:26,544 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 14:47:26,545 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:47:26,546 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 31 conjunts are in the unsatisfiable core [2022-12-14 14:47:26,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:47:27,297 INFO L321 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2022-12-14 14:47:27,298 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 50 [2022-12-14 14:47:27,373 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 14:47:27,374 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:47:57,880 WARN L233 SmtUtils]: Spent 29.78s on a formula simplification. DAG size of input: 57 DAG size of output: 55 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 14:47:57,952 INFO L321 Elim1Store]: treesize reduction 34, result has 62.6 percent of original size [2022-12-14 14:47:57,952 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 62 treesize of output 66 [2022-12-14 14:47:57,993 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:47:57,994 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 15 [2022-12-14 14:47:58,049 INFO L321 Elim1Store]: treesize reduction 34, result has 62.6 percent of original size [2022-12-14 14:47:58,049 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 64 [2022-12-14 14:47:58,095 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-12-14 14:47:58,095 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 12 [2022-12-14 14:47:58,454 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 14:47:58,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1111691080] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:47:58,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1280049426] [2022-12-14 14:47:58,454 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 14:47:58,455 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:47:58,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 11] total 38 [2022-12-14 14:47:58,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952317513] [2022-12-14 14:47:58,455 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:47:58,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-12-14 14:47:58,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:47:58,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-12-14 14:47:58,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=1366, Unknown=0, NotChecked=0, Total=1560 [2022-12-14 14:47:58,456 INFO L87 Difference]: Start difference. First operand 493 states and 1391 transitions. Second operand has 40 states, 39 states have (on average 1.7692307692307692) internal successors, (69), 39 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-12-14 14:48:00,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:48:00,386 INFO L93 Difference]: Finished difference Result 510 states and 1423 transitions. [2022-12-14 14:48:00,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-14 14:48:00,386 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 1.7692307692307692) internal successors, (69), 39 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 25 [2022-12-14 14:48:00,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:48:00,387 INFO L225 Difference]: With dead ends: 510 [2022-12-14 14:48:00,387 INFO L226 Difference]: Without dead ends: 505 [2022-12-14 14:48:00,387 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 562 ImplicationChecksByTransitivity, 32.3s TimeCoverageRelationStatistics Valid=404, Invalid=2676, Unknown=0, NotChecked=0, Total=3080 [2022-12-14 14:48:00,387 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 165 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1134 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-12-14 14:48:00,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 0 Invalid, 1137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1134 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-12-14 14:48:00,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2022-12-14 14:48:00,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 497. [2022-12-14 14:48:00,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 496 states have (on average 2.8245967741935485) internal successors, (1401), 496 states have internal predecessors, (1401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:48:00,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 1401 transitions. [2022-12-14 14:48:00,393 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 1401 transitions. Word has length 25 [2022-12-14 14:48:00,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:48:00,393 INFO L495 AbstractCegarLoop]: Abstraction has 497 states and 1401 transitions. [2022-12-14 14:48:00,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 1.7692307692307692) internal successors, (69), 39 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-12-14 14:48:00,393 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 1401 transitions. [2022-12-14 14:48:00,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 14:48:00,393 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:48:00,393 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:48:00,398 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (114)] Ended with exit code 0 [2022-12-14 14:48:00,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 114 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable124 [2022-12-14 14:48:00,595 INFO L420 AbstractCegarLoop]: === Iteration 126 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:48:00,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:48:00,596 INFO L85 PathProgramCache]: Analyzing trace with hash -848675004, now seen corresponding path program 9 times [2022-12-14 14:48:00,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:48:00,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687364427] [2022-12-14 14:48:00,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:48:00,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:48:00,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:48:01,279 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:48:01,280 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:48:01,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687364427] [2022-12-14 14:48:01,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687364427] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:48:01,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1901762031] [2022-12-14 14:48:01,280 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 14:48:01,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:48:01,280 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:48:01,281 INFO L229 MonitoredProcess]: Starting monitored process 115 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:48:01,281 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (115)] Waiting until timeout for monitored process [2022-12-14 14:48:01,446 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 14:48:01,447 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:48:01,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-14 14:48:01,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:48:01,899 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:48:01,900 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 97 treesize of output 79 [2022-12-14 14:48:02,011 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 14:48:02,011 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:48:12,464 WARN L233 SmtUtils]: Spent 10.17s on a formula simplification. DAG size of input: 39 DAG size of output: 33 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 14:48:18,674 INFO L321 Elim1Store]: treesize reduction 34, result has 62.6 percent of original size [2022-12-14 14:48:18,674 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 63 [2022-12-14 14:48:18,714 INFO L321 Elim1Store]: treesize reduction 90, result has 1.1 percent of original size [2022-12-14 14:48:18,715 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 62 treesize of output 1 [2022-12-14 14:48:18,915 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 14:48:18,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1901762031] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:48:18,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1292510051] [2022-12-14 14:48:18,916 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 14:48:18,916 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:48:18,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 9] total 33 [2022-12-14 14:48:18,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40017177] [2022-12-14 14:48:18,916 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:48:18,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-12-14 14:48:18,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:48:18,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-12-14 14:48:18,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=990, Unknown=2, NotChecked=0, Total=1122 [2022-12-14 14:48:18,917 INFO L87 Difference]: Start difference. First operand 497 states and 1401 transitions. Second operand has 34 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 34 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-12-14 14:48:21,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:48:21,437 INFO L93 Difference]: Finished difference Result 625 states and 1667 transitions. [2022-12-14 14:48:21,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-14 14:48:21,437 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 34 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 25 [2022-12-14 14:48:21,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:48:21,438 INFO L225 Difference]: With dead ends: 625 [2022-12-14 14:48:21,438 INFO L226 Difference]: Without dead ends: 611 [2022-12-14 14:48:21,439 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 534 ImplicationChecksByTransitivity, 18.3s TimeCoverageRelationStatistics Valid=361, Invalid=2393, Unknown=2, NotChecked=0, Total=2756 [2022-12-14 14:48:21,439 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 139 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1091 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1091 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-12-14 14:48:21,439 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 0 Invalid, 1096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1091 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-12-14 14:48:21,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2022-12-14 14:48:21,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 507. [2022-12-14 14:48:21,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 506 states have (on average 2.8260869565217392) internal successors, (1430), 506 states have internal predecessors, (1430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:48:21,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 1430 transitions. [2022-12-14 14:48:21,448 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 1430 transitions. Word has length 25 [2022-12-14 14:48:21,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:48:21,448 INFO L495 AbstractCegarLoop]: Abstraction has 507 states and 1430 transitions. [2022-12-14 14:48:21,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 34 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-12-14 14:48:21,449 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 1430 transitions. [2022-12-14 14:48:21,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 14:48:21,449 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:48:21,449 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:48:21,454 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (115)] Ended with exit code 0 [2022-12-14 14:48:21,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 115 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable125 [2022-12-14 14:48:21,651 INFO L420 AbstractCegarLoop]: === Iteration 127 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-14 14:48:21,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:48:21,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1236553824, now seen corresponding path program 10 times [2022-12-14 14:48:21,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:48:21,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549257403] [2022-12-14 14:48:21,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:48:21,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:48:21,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:48:22,415 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:48:22,415 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:48:22,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549257403] [2022-12-14 14:48:22,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549257403] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:48:22,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [332254038] [2022-12-14 14:48:22,415 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 14:48:22,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:48:22,415 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:48:22,416 INFO L229 MonitoredProcess]: Starting monitored process 116 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:48:22,417 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43d41bf-125c-463c-80d0-58373abb8a4d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (116)] Waiting until timeout for monitored process [2022-12-14 14:48:22,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:48:22,647 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 36 conjunts are in the unsatisfiable core [2022-12-14 14:48:22,648 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:48:23,399 INFO L321 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2022-12-14 14:48:23,399 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 50 [2022-12-14 14:48:23,495 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:48:23,495 INFO L328 TraceCheckSpWp]: Computing backward predicates...