./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/popl20-more-array-sum2.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/config/TaipanReach.xml -i ../../sv-benchmarks/c/weaver/popl20-more-array-sum2.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E --witnessprinter.witness.filename witness --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 6d47c8696b49948f6f8f53dd9eda6f4e0281717fd9a29e264a19ded5493fa577 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 03:00:44,366 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 03:00:44,450 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Default.epf [2024-11-14 03:00:44,458 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 03:00:44,458 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 03:00:44,490 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 03:00:44,490 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 03:00:44,490 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 03:00:44,491 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 03:00:44,491 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 03:00:44,491 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 03:00:44,491 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 03:00:44,491 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 03:00:44,491 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-14 03:00:44,491 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 03:00:44,491 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 03:00:44,493 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-14 03:00:44,493 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-14 03:00:44,494 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 03:00:44,494 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-14 03:00:44,495 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-14 03:00:44,495 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-14 03:00:44,495 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 03:00:44,496 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-14 03:00:44,496 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 03:00:44,496 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 03:00:44,496 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 03:00:44,496 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 03:00:44,497 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-14 03:00:44,497 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 03:00:44,497 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-14 03:00:44,497 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 03:00:44,497 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 03:00:44,497 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-14 03:00:44,498 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 03:00:44,498 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 03:00:44,498 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 03:00:44,498 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 03:00:44,498 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 03:00:44,499 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 03:00:44,499 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 03:00:44,499 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-14 03:00:44,499 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-14 03:00:44,499 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-14 03:00:44,499 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 03:00:44,500 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 03:00:44,500 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-14 03:00:44,500 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 6d47c8696b49948f6f8f53dd9eda6f4e0281717fd9a29e264a19ded5493fa577 [2024-11-14 03:00:44,780 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 03:00:44,788 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 03:00:44,790 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 03:00:44,792 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 03:00:44,792 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 03:00:44,793 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/weaver/popl20-more-array-sum2.wvr.c Unable to find full path for "g++" [2024-11-14 03:00:46,578 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 03:00:46,830 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 03:00:46,832 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/sv-benchmarks/c/weaver/popl20-more-array-sum2.wvr.c [2024-11-14 03:00:46,852 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/data/842a65a84/bf3d48b56f0242fe94d5819ff578a84a/FLAG0896367fa [2024-11-14 03:00:46,866 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/data/842a65a84/bf3d48b56f0242fe94d5819ff578a84a [2024-11-14 03:00:46,869 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 03:00:46,870 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 03:00:46,872 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 03:00:46,872 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 03:00:46,876 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 03:00:46,877 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 03:00:46" (1/1) ... [2024-11-14 03:00:46,878 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@603e6c59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:00:46, skipping insertion in model container [2024-11-14 03:00:46,878 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 03:00:46" (1/1) ... [2024-11-14 03:00:46,895 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 03:00:47,059 WARN L250 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_3ea337b7-da8b-4508-8168-522ba8abd5ac/sv-benchmarks/c/weaver/popl20-more-array-sum2.wvr.c[2638,2651] [2024-11-14 03:00:47,068 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 03:00:47,076 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 03:00:47,100 WARN L250 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_3ea337b7-da8b-4508-8168-522ba8abd5ac/sv-benchmarks/c/weaver/popl20-more-array-sum2.wvr.c[2638,2651] [2024-11-14 03:00:47,105 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 03:00:47,123 INFO L204 MainTranslator]: Completed translation [2024-11-14 03:00:47,123 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:00:47 WrapperNode [2024-11-14 03:00:47,124 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 03:00:47,125 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 03:00:47,125 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 03:00:47,125 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 03:00:47,131 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:00:47" (1/1) ... [2024-11-14 03:00:47,139 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:00:47" (1/1) ... [2024-11-14 03:00:47,175 INFO L138 Inliner]: procedures = 24, calls = 37, calls flagged for inlining = 16, calls inlined = 28, statements flattened = 259 [2024-11-14 03:00:47,179 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 03:00:47,180 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 03:00:47,180 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 03:00:47,180 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 03:00:47,188 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:00:47" (1/1) ... [2024-11-14 03:00:47,189 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:00:47" (1/1) ... [2024-11-14 03:00:47,193 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:00:47" (1/1) ... [2024-11-14 03:00:47,197 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:00:47" (1/1) ... [2024-11-14 03:00:47,208 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:00:47" (1/1) ... [2024-11-14 03:00:47,219 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:00:47" (1/1) ... [2024-11-14 03:00:47,225 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:00:47" (1/1) ... [2024-11-14 03:00:47,226 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:00:47" (1/1) ... [2024-11-14 03:00:47,229 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 03:00:47,229 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 03:00:47,230 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 03:00:47,230 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 03:00:47,231 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:00:47" (1/1) ... [2024-11-14 03:00:47,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 03:00:47,248 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:00:47,262 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 03:00:47,270 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 03:00:47,292 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 03:00:47,292 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-14 03:00:47,293 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-14 03:00:47,293 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-14 03:00:47,293 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-14 03:00:47,293 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-14 03:00:47,293 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-14 03:00:47,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-14 03:00:47,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-14 03:00:47,294 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-14 03:00:47,294 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-14 03:00:47,294 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-14 03:00:47,294 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 03:00:47,294 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 03:00:47,294 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-14 03:00:47,296 WARN L207 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-14 03:00:47,437 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 03:00:47,439 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 03:00:47,912 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-14 03:00:47,912 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 03:00:48,468 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 03:00:48,469 INFO L316 CfgBuilder]: Removed 5 assume(true) statements. [2024-11-14 03:00:48,469 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:00:48 BoogieIcfgContainer [2024-11-14 03:00:48,469 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 03:00:48,471 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 03:00:48,472 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 03:00:48,477 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 03:00:48,477 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 03:00:46" (1/3) ... [2024-11-14 03:00:48,478 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@141ea756 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 03:00:48, skipping insertion in model container [2024-11-14 03:00:48,478 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:00:47" (2/3) ... [2024-11-14 03:00:48,478 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@141ea756 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 03:00:48, skipping insertion in model container [2024-11-14 03:00:48,478 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:00:48" (3/3) ... [2024-11-14 03:00:48,479 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-array-sum2.wvr.c [2024-11-14 03:00:48,496 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 03:00:48,499 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-array-sum2.wvr.c that has 4 procedures, 31 locations, 1 initial locations, 5 loop locations, and 1 error locations. [2024-11-14 03:00:48,499 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-14 03:00:48,580 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-14 03:00:48,616 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 40 places, 35 transitions, 91 flow [2024-11-14 03:00:48,699 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 347 states, 346 states have (on average 3.291907514450867) internal successors, (1139), 346 states have internal predecessors, (1139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:00:48,729 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 03:00:48,745 INFO L333 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, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@6089885, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 03:00:48,745 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-14 03:00:48,750 INFO L276 IsEmpty]: Start isEmpty. Operand has 347 states, 346 states have (on average 3.291907514450867) internal successors, (1139), 346 states have internal predecessors, (1139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:00:48,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-14 03:00:48,767 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:00:48,767 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:00:48,770 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-14 03:00:48,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:00:48,776 INFO L85 PathProgramCache]: Analyzing trace with hash -721140722, now seen corresponding path program 1 times [2024-11-14 03:00:48,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:00:48,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311270510] [2024-11-14 03:00:48,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:00:48,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:00:48,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:00:49,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:00:49,230 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:00:49,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311270510] [2024-11-14 03:00:49,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311270510] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:00:49,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:00:49,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 03:00:49,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867897784] [2024-11-14 03:00:49,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:00:49,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 03:00:49,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:00:49,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 03:00:49,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:00:49,267 INFO L87 Difference]: Start difference. First operand has 347 states, 346 states have (on average 3.291907514450867) internal successors, (1139), 346 states have internal predecessors, (1139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:00:49,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:00:49,449 INFO L93 Difference]: Finished difference Result 532 states and 1741 transitions. [2024-11-14 03:00:49,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 03:00:49,452 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-14 03:00:49,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:00:49,469 INFO L225 Difference]: With dead ends: 532 [2024-11-14 03:00:49,470 INFO L226 Difference]: Without dead ends: 525 [2024-11-14 03:00:49,472 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:00:49,475 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 5 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:00:49,475 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 8 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:00:49,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2024-11-14 03:00:49,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 427. [2024-11-14 03:00:49,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 426 states have (on average 3.2816901408450705) internal successors, (1398), 426 states have internal predecessors, (1398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:00:49,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 1398 transitions. [2024-11-14 03:00:49,576 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 1398 transitions. Word has length 20 [2024-11-14 03:00:49,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:00:49,576 INFO L471 AbstractCegarLoop]: Abstraction has 427 states and 1398 transitions. [2024-11-14 03:00:49,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:00:49,577 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 1398 transitions. [2024-11-14 03:00:49,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-14 03:00:49,582 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:00:49,583 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:00:49,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-14 03:00:49,584 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-14 03:00:49,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:00:49,584 INFO L85 PathProgramCache]: Analyzing trace with hash -957331170, now seen corresponding path program 1 times [2024-11-14 03:00:49,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:00:49,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048622467] [2024-11-14 03:00:49,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:00:49,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:00:49,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:00:49,936 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:00:49,936 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:00:49,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048622467] [2024-11-14 03:00:49,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048622467] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:00:49,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:00:49,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 03:00:49,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711176685] [2024-11-14 03:00:49,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:00:49,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 03:00:49,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:00:49,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 03:00:49,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:00:49,939 INFO L87 Difference]: Start difference. First operand 427 states and 1398 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:00:50,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:00:50,068 INFO L93 Difference]: Finished difference Result 855 states and 2799 transitions. [2024-11-14 03:00:50,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 03:00:50,068 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-14 03:00:50,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:00:50,074 INFO L225 Difference]: With dead ends: 855 [2024-11-14 03:00:50,077 INFO L226 Difference]: Without dead ends: 429 [2024-11-14 03:00:50,079 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-14 03:00:50,080 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:00:50,081 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:00:50,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2024-11-14 03:00:50,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 429. [2024-11-14 03:00:50,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 428 states have (on average 3.2710280373831777) internal successors, (1400), 428 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:00:50,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 1400 transitions. [2024-11-14 03:00:50,129 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 1400 transitions. Word has length 23 [2024-11-14 03:00:50,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:00:50,129 INFO L471 AbstractCegarLoop]: Abstraction has 429 states and 1400 transitions. [2024-11-14 03:00:50,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:00:50,130 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 1400 transitions. [2024-11-14 03:00:50,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-14 03:00:50,131 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:00:50,131 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:00:50,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-14 03:00:50,133 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-14 03:00:50,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:00:50,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1115862375, now seen corresponding path program 1 times [2024-11-14 03:00:50,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:00:50,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291979808] [2024-11-14 03:00:50,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:00:50,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:00:50,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:00:50,326 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 03:00:50,326 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:00:50,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291979808] [2024-11-14 03:00:50,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291979808] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:00:50,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:00:50,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 03:00:50,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410403166] [2024-11-14 03:00:50,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:00:50,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 03:00:50,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:00:50,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 03:00:50,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:00:50,327 INFO L87 Difference]: Start difference. First operand 429 states and 1400 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:00:50,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:00:50,490 INFO L93 Difference]: Finished difference Result 540 states and 1773 transitions. [2024-11-14 03:00:50,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 03:00:50,491 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have 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 [2024-11-14 03:00:50,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:00:50,497 INFO L225 Difference]: With dead ends: 540 [2024-11-14 03:00:50,497 INFO L226 Difference]: Without dead ends: 465 [2024-11-14 03:00:50,498 INFO L431 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 [2024-11-14 03:00:50,499 INFO L432 NwaCegarLoop]: 1 mSDtfsCounter, 30 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:00:50,499 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 2 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:00:50,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2024-11-14 03:00:50,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 405. [2024-11-14 03:00:50,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 404 states have (on average 3.2995049504950495) internal successors, (1333), 404 states have internal predecessors, (1333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:00:50,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 1333 transitions. [2024-11-14 03:00:50,549 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 1333 transitions. Word has length 25 [2024-11-14 03:00:50,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:00:50,549 INFO L471 AbstractCegarLoop]: Abstraction has 405 states and 1333 transitions. [2024-11-14 03:00:50,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:00:50,550 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 1333 transitions. [2024-11-14 03:00:50,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-14 03:00:50,553 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:00:50,553 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:00:50,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-14 03:00:50,553 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-14 03:00:50,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:00:50,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1690433801, now seen corresponding path program 1 times [2024-11-14 03:00:50,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:00:50,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17412966] [2024-11-14 03:00:50,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:00:50,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:00:50,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:00:50,806 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 03:00:50,807 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:00:50,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17412966] [2024-11-14 03:00:50,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17412966] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:00:50,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [516516669] [2024-11-14 03:00:50,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:00:50,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:00:50,817 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:00:50,819 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:00:50,821 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-14 03:00:50,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:00:50,949 INFO L255 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-14 03:00:50,953 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:00:51,021 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 03:00:51,021 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:00:51,082 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 03:00:51,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [516516669] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-14 03:00:51,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-14 03:00:51,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2024-11-14 03:00:51,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450839899] [2024-11-14 03:00:51,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:00:51,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 03:00:51,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:00:51,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 03:00:51,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-14 03:00:51,084 INFO L87 Difference]: Start difference. First operand 405 states and 1333 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:00:51,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:00:51,264 INFO L93 Difference]: Finished difference Result 588 states and 1926 transitions. [2024-11-14 03:00:51,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 03:00:51,265 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have 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 [2024-11-14 03:00:51,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:00:51,270 INFO L225 Difference]: With dead ends: 588 [2024-11-14 03:00:51,270 INFO L226 Difference]: Without dead ends: 477 [2024-11-14 03:00:51,273 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-11-14 03:00:51,275 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 69 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:00:51,275 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 5 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:00:51,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2024-11-14 03:00:51,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 477. [2024-11-14 03:00:51,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 476 states have (on average 3.313025210084034) internal successors, (1577), 476 states have internal predecessors, (1577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:00:51,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 1577 transitions. [2024-11-14 03:00:51,339 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 1577 transitions. Word has length 25 [2024-11-14 03:00:51,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:00:51,339 INFO L471 AbstractCegarLoop]: Abstraction has 477 states and 1577 transitions. [2024-11-14 03:00:51,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:00:51,339 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 1577 transitions. [2024-11-14 03:00:51,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-14 03:00:51,342 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:00:51,343 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:00:51,363 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-14 03:00:51,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:00:51,543 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-14 03:00:51,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:00:51,544 INFO L85 PathProgramCache]: Analyzing trace with hash 217317045, now seen corresponding path program 1 times [2024-11-14 03:00:51,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:00:51,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001899122] [2024-11-14 03:00:51,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:00:51,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:00:51,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:00:53,150 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:00:53,151 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:00:53,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001899122] [2024-11-14 03:00:53,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001899122] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:00:53,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [622696607] [2024-11-14 03:00:53,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:00:53,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:00:53,152 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:00:53,154 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:00:53,157 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-14 03:00:53,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:00:53,282 INFO L255 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-14 03:00:53,289 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:00:53,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 03:00:53,921 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:00:53,921 INFO L378 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 27 treesize of output 19 [2024-11-14 03:00:53,937 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:00:53,937 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:00:54,283 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 03:00:54,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [622696607] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:00:54,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [375028797] [2024-11-14 03:00:54,293 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2024-11-14 03:00:54,297 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:00:54,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 8] total 26 [2024-11-14 03:00:54,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547855929] [2024-11-14 03:00:54,297 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:00:54,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-14 03:00:54,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:00:54,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-14 03:00:54,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=600, Unknown=0, NotChecked=0, Total=702 [2024-11-14 03:00:54,299 INFO L87 Difference]: Start difference. First operand 477 states and 1577 transitions. Second operand has 27 states, 27 states have (on average 2.4814814814814814) internal successors, (67), 26 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) [2024-11-14 03:00:57,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:00:57,805 INFO L93 Difference]: Finished difference Result 1709 states and 5630 transitions. [2024-11-14 03:00:57,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-11-14 03:00:57,806 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.4814814814814814) internal successors, (67), 26 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 28 [2024-11-14 03:00:57,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:00:57,823 INFO L225 Difference]: With dead ends: 1709 [2024-11-14 03:00:57,824 INFO L226 Difference]: Without dead ends: 1702 [2024-11-14 03:00:57,826 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1055 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=548, Invalid=3358, Unknown=0, NotChecked=0, Total=3906 [2024-11-14 03:00:57,831 INFO L432 NwaCegarLoop]: 1 mSDtfsCounter, 436 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 1530 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 436 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 1546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-14 03:00:57,832 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [436 Valid, 16 Invalid, 1546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1530 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-14 03:00:57,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1702 states. [2024-11-14 03:00:57,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1702 to 708. [2024-11-14 03:00:57,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 708 states, 707 states have (on average 3.292786421499293) internal successors, (2328), 707 states have internal predecessors, (2328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:00:57,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 2328 transitions. [2024-11-14 03:00:57,991 INFO L78 Accepts]: Start accepts. Automaton has 708 states and 2328 transitions. Word has length 28 [2024-11-14 03:00:57,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:00:57,992 INFO L471 AbstractCegarLoop]: Abstraction has 708 states and 2328 transitions. [2024-11-14 03:00:57,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.4814814814814814) internal successors, (67), 26 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) [2024-11-14 03:00:57,992 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 2328 transitions. [2024-11-14 03:00:57,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-14 03:00:57,994 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:00:57,994 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:00:58,020 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-14 03:00:58,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:00:58,199 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-14 03:00:58,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:00:58,200 INFO L85 PathProgramCache]: Analyzing trace with hash -556073859, now seen corresponding path program 2 times [2024-11-14 03:00:58,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:00:58,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896310026] [2024-11-14 03:00:58,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:00:58,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:00:58,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:00:59,544 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:00:59,545 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:00:59,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896310026] [2024-11-14 03:00:59,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896310026] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:00:59,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1046305075] [2024-11-14 03:00:59,545 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 03:00:59,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:00:59,545 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:00:59,548 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:00:59,550 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-14 03:00:59,675 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-14 03:00:59,675 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 03:00:59,677 INFO L255 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-14 03:00:59,680 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:00:59,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 03:01:00,233 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:01:00,233 INFO L378 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 27 treesize of output 19 [2024-11-14 03:01:00,250 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:01:00,250 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:01:00,616 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 03:01:00,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1046305075] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:01:00,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [739218585] [2024-11-14 03:01:00,617 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2024-11-14 03:01:00,618 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:01:00,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 8] total 26 [2024-11-14 03:01:00,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332646691] [2024-11-14 03:01:00,618 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:01:00,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-14 03:01:00,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:01:00,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-14 03:01:00,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=609, Unknown=0, NotChecked=0, Total=702 [2024-11-14 03:01:00,620 INFO L87 Difference]: Start difference. First operand 708 states and 2328 transitions. Second operand has 27 states, 27 states have (on average 2.4814814814814814) internal successors, (67), 26 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) [2024-11-14 03:01:02,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:01:02,453 INFO L93 Difference]: Finished difference Result 1376 states and 4631 transitions. [2024-11-14 03:01:02,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-14 03:01:02,454 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.4814814814814814) internal successors, (67), 26 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 28 [2024-11-14 03:01:02,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:01:02,463 INFO L225 Difference]: With dead ends: 1376 [2024-11-14 03:01:02,464 INFO L226 Difference]: Without dead ends: 1369 [2024-11-14 03:01:02,465 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=215, Invalid=1345, Unknown=0, NotChecked=0, Total=1560 [2024-11-14 03:01:02,467 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 219 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 1096 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 1122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1096 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:01:02,468 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 34 Invalid, 1122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1096 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-14 03:01:02,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1369 states. [2024-11-14 03:01:02,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1369 to 804. [2024-11-14 03:01:02,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 804 states, 803 states have (on average 3.3250311332503113) internal successors, (2670), 803 states have internal predecessors, (2670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:01:02,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 2670 transitions. [2024-11-14 03:01:02,615 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 2670 transitions. Word has length 28 [2024-11-14 03:01:02,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:01:02,616 INFO L471 AbstractCegarLoop]: Abstraction has 804 states and 2670 transitions. [2024-11-14 03:01:02,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.4814814814814814) internal successors, (67), 26 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) [2024-11-14 03:01:02,617 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 2670 transitions. [2024-11-14 03:01:02,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-14 03:01:02,621 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:01:02,622 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:01:02,641 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-14 03:01:02,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:01:02,822 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-14 03:01:02,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:01:02,823 INFO L85 PathProgramCache]: Analyzing trace with hash 539219641, now seen corresponding path program 3 times [2024-11-14 03:01:02,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:01:02,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382348250] [2024-11-14 03:01:02,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:01:02,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:01:02,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:01:03,990 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:01:03,990 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:01:03,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382348250] [2024-11-14 03:01:03,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382348250] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:01:03,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1716719567] [2024-11-14 03:01:03,991 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-14 03:01:03,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:01:03,991 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:01:03,993 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:01:03,995 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-14 03:01:04,106 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-14 03:01:04,106 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 03:01:04,109 INFO L255 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-14 03:01:04,112 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:01:04,117 INFO L378 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 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 03:01:04,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 03:01:04,191 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 03:01:04,191 INFO L378 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 11 treesize of output 11 [2024-11-14 03:01:04,240 INFO L378 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 15 treesize of output 1 [2024-11-14 03:01:04,557 INFO L378 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 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-14 03:01:04,573 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:01:04,573 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:01:07,022 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:01:07,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1716719567] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:01:07,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [747014782] [2024-11-14 03:01:07,023 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2024-11-14 03:01:07,025 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:01:07,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 9] total 27 [2024-11-14 03:01:07,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712621727] [2024-11-14 03:01:07,025 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:01:07,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-14 03:01:07,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:01:07,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-14 03:01:07,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=631, Unknown=1, NotChecked=0, Total=756 [2024-11-14 03:01:07,027 INFO L87 Difference]: Start difference. First operand 804 states and 2670 transitions. Second operand has 28 states, 28 states have (on average 2.3214285714285716) internal successors, (65), 27 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:01:09,782 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] [2024-11-14 03:01:12,279 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] [2024-11-14 03:01:14,387 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] [2024-11-14 03:01:16,419 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:01:19,193 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] [2024-11-14 03:01:21,227 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] [2024-11-14 03:01:23,282 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] [2024-11-14 03:01:25,294 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] [2024-11-14 03:01:27,385 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] [2024-11-14 03:01:29,395 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] [2024-11-14 03:01:31,456 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] [2024-11-14 03:01:33,472 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] [2024-11-14 03:01:35,495 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] [2024-11-14 03:01:37,526 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] [2024-11-14 03:01:39,648 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] [2024-11-14 03:01:40,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:01:40,347 INFO L93 Difference]: Finished difference Result 1637 states and 5514 transitions. [2024-11-14 03:01:40,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-14 03:01:40,347 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.3214285714285716) internal successors, (65), 27 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-14 03:01:40,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:01:40,357 INFO L225 Difference]: With dead ends: 1637 [2024-11-14 03:01:40,357 INFO L226 Difference]: Without dead ends: 1319 [2024-11-14 03:01:40,358 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=313, Invalid=1408, Unknown=1, NotChecked=0, Total=1722 [2024-11-14 03:01:40,359 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 203 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 1221 mSolverCounterSat, 22 mSolverCounterUnsat, 15 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 31.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 1258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1221 IncrementalHoareTripleChecker+Invalid, 15 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 31.9s IncrementalHoareTripleChecker+Time [2024-11-14 03:01:40,359 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 50 Invalid, 1258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1221 Invalid, 15 Unknown, 0 Unchecked, 31.9s Time] [2024-11-14 03:01:40,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1319 states. [2024-11-14 03:01:40,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1319 to 903. [2024-11-14 03:01:40,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 903 states, 902 states have (on average 3.3259423503325944) internal successors, (3000), 902 states have internal predecessors, (3000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:01:40,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 903 states to 903 states and 3000 transitions. [2024-11-14 03:01:40,615 INFO L78 Accepts]: Start accepts. Automaton has 903 states and 3000 transitions. Word has length 28 [2024-11-14 03:01:40,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:01:40,616 INFO L471 AbstractCegarLoop]: Abstraction has 903 states and 3000 transitions. [2024-11-14 03:01:40,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.3214285714285716) internal successors, (65), 27 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:01:40,616 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 3000 transitions. [2024-11-14 03:01:40,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-14 03:01:40,618 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:01:40,619 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:01:40,638 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-14 03:01:40,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:01:40,819 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-14 03:01:40,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:01:40,820 INFO L85 PathProgramCache]: Analyzing trace with hash 60115931, now seen corresponding path program 4 times [2024-11-14 03:01:40,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:01:40,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590828990] [2024-11-14 03:01:40,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:01:40,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:01:40,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:01:42,352 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:01:42,352 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:01:42,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590828990] [2024-11-14 03:01:42,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590828990] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:01:42,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [824676800] [2024-11-14 03:01:42,353 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-14 03:01:42,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:01:42,353 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:01:42,355 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:01:42,357 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-14 03:01:42,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:01:42,460 INFO L255 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-14 03:01:42,462 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:01:42,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 03:01:43,074 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:01:43,074 INFO L378 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 27 treesize of output 19 [2024-11-14 03:01:43,098 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:01:43,098 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:01:43,519 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 03:01:43,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [824676800] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:01:43,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [786899647] [2024-11-14 03:01:43,520 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2024-11-14 03:01:43,521 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:01:43,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 8] total 27 [2024-11-14 03:01:43,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265147610] [2024-11-14 03:01:43,521 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:01:43,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-14 03:01:43,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:01:43,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-14 03:01:43,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=655, Unknown=0, NotChecked=0, Total=756 [2024-11-14 03:01:43,522 INFO L87 Difference]: Start difference. First operand 903 states and 3000 transitions. Second operand has 28 states, 28 states have (on average 2.4285714285714284) internal successors, (68), 27 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) [2024-11-14 03:01:46,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:01:46,739 INFO L93 Difference]: Finished difference Result 1404 states and 4689 transitions. [2024-11-14 03:01:46,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-14 03:01:46,740 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.4285714285714284) internal successors, (68), 27 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 28 [2024-11-14 03:01:46,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:01:46,749 INFO L225 Difference]: With dead ends: 1404 [2024-11-14 03:01:46,749 INFO L226 Difference]: Without dead ends: 1397 [2024-11-14 03:01:46,750 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 539 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=326, Invalid=1836, Unknown=0, NotChecked=0, Total=2162 [2024-11-14 03:01:46,751 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 159 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 1797 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 1810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-14 03:01:46,751 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 91 Invalid, 1810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1797 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-14 03:01:46,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1397 states. [2024-11-14 03:01:47,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1397 to 939. [2024-11-14 03:01:47,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 939 states, 938 states have (on average 3.3326226012793176) internal successors, (3126), 938 states have internal predecessors, (3126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:01:47,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 939 states to 939 states and 3126 transitions. [2024-11-14 03:01:47,022 INFO L78 Accepts]: Start accepts. Automaton has 939 states and 3126 transitions. Word has length 28 [2024-11-14 03:01:47,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:01:47,022 INFO L471 AbstractCegarLoop]: Abstraction has 939 states and 3126 transitions. [2024-11-14 03:01:47,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.4285714285714284) internal successors, (68), 27 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) [2024-11-14 03:01:47,022 INFO L276 IsEmpty]: Start isEmpty. Operand 939 states and 3126 transitions. [2024-11-14 03:01:47,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-14 03:01:47,025 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:01:47,025 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:01:47,045 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-14 03:01:47,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:01:47,226 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-14 03:01:47,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:01:47,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1155409431, now seen corresponding path program 5 times [2024-11-14 03:01:47,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:01:47,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467303095] [2024-11-14 03:01:47,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:01:47,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:01:47,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:01:48,443 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:01:48,444 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:01:48,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467303095] [2024-11-14 03:01:48,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467303095] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:01:48,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1310208540] [2024-11-14 03:01:48,444 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 03:01:48,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:01:48,445 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:01:48,446 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:01:48,465 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-14 03:01:48,577 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-14 03:01:48,577 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 03:01:48,579 INFO L255 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-14 03:01:48,581 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:01:48,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 03:01:49,092 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:01:49,093 INFO L378 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 27 treesize of output 19 [2024-11-14 03:01:49,120 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:01:49,120 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:01:49,481 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:01:49,481 INFO L378 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 256 treesize of output 240 [2024-11-14 03:01:50,021 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:01:50,022 INFO L378 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 369 treesize of output 313 [2024-11-14 03:01:50,044 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:01:50,044 INFO L378 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 252 treesize of output 196 [2024-11-14 03:01:50,399 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:01:50,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1310208540] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:01:50,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [244299852] [2024-11-14 03:01:50,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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2024-11-14 03:01:50,400 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:01:50,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 26 [2024-11-14 03:01:50,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836219663] [2024-11-14 03:01:50,401 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:01:50,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-14 03:01:50,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:01:50,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-14 03:01:50,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=592, Unknown=0, NotChecked=0, Total=702 [2024-11-14 03:01:50,402 INFO L87 Difference]: Start difference. First operand 939 states and 3126 transitions. Second operand has 27 states, 27 states have (on average 2.4074074074074074) internal successors, (65), 26 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:01:52,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:01:52,530 INFO L93 Difference]: Finished difference Result 1591 states and 5346 transitions. [2024-11-14 03:01:52,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-14 03:01:52,531 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.4074074074074074) internal successors, (65), 26 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-14 03:01:52,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:01:52,540 INFO L225 Difference]: With dead ends: 1591 [2024-11-14 03:01:52,541 INFO L226 Difference]: Without dead ends: 1584 [2024-11-14 03:01:52,542 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=306, Invalid=1334, Unknown=0, NotChecked=0, Total=1640 [2024-11-14 03:01:52,542 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 208 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 1021 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 1043 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1021 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:01:52,542 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 48 Invalid, 1043 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1021 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-14 03:01:52,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1584 states. [2024-11-14 03:01:52,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1584 to 911. [2024-11-14 03:01:52,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 911 states, 910 states have (on average 3.3142857142857145) internal successors, (3016), 910 states have internal predecessors, (3016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:01:52,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 911 states to 911 states and 3016 transitions. [2024-11-14 03:01:52,768 INFO L78 Accepts]: Start accepts. Automaton has 911 states and 3016 transitions. Word has length 28 [2024-11-14 03:01:52,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:01:52,769 INFO L471 AbstractCegarLoop]: Abstraction has 911 states and 3016 transitions. [2024-11-14 03:01:52,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.4074074074074074) internal successors, (65), 26 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:01:52,769 INFO L276 IsEmpty]: Start isEmpty. Operand 911 states and 3016 transitions. [2024-11-14 03:01:52,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-14 03:01:52,772 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:01:52,772 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:01:52,792 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-14 03:01:52,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:01:52,976 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-14 03:01:52,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:01:52,976 INFO L85 PathProgramCache]: Analyzing trace with hash 465314391, now seen corresponding path program 6 times [2024-11-14 03:01:52,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:01:52,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285343457] [2024-11-14 03:01:52,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:01:52,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:01:53,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:01:54,170 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:01:54,170 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:01:54,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285343457] [2024-11-14 03:01:54,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285343457] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:01:54,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [530341836] [2024-11-14 03:01:54,171 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-14 03:01:54,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:01:54,171 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:01:54,173 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:01:54,175 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-14 03:01:54,295 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-14 03:01:54,296 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 03:01:54,298 INFO L255 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-14 03:01:54,303 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:01:54,309 INFO L378 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 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 03:01:54,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 03:01:54,444 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 03:01:54,444 INFO L378 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 11 treesize of output 11 [2024-11-14 03:01:54,510 INFO L378 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 15 treesize of output 1 [2024-11-14 03:01:54,943 INFO L378 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 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-14 03:01:54,965 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:01:54,966 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:01:57,533 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:01:57,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [530341836] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:01:57,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1387664514] [2024-11-14 03:01:57,534 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2024-11-14 03:01:57,534 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:01:57,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 9] total 27 [2024-11-14 03:01:57,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000274842] [2024-11-14 03:01:57,535 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:01:57,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-14 03:01:57,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:01:57,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-14 03:01:57,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=651, Unknown=1, NotChecked=0, Total=756 [2024-11-14 03:01:57,536 INFO L87 Difference]: Start difference. First operand 911 states and 3016 transitions. Second operand has 28 states, 28 states have (on average 2.3214285714285716) internal successors, (65), 27 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:02:00,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:02:00,587 INFO L93 Difference]: Finished difference Result 1467 states and 4912 transitions. [2024-11-14 03:02:00,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-14 03:02:00,588 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.3214285714285716) internal successors, (65), 27 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-14 03:02:00,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:02:00,595 INFO L225 Difference]: With dead ends: 1467 [2024-11-14 03:02:00,595 INFO L226 Difference]: Without dead ends: 1460 [2024-11-14 03:02:00,596 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=288, Invalid=1603, Unknown=1, NotChecked=0, Total=1892 [2024-11-14 03:02:00,597 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 187 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 1405 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 1431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-14 03:02:00,597 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 70 Invalid, 1431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1405 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-14 03:02:00,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1460 states. [2024-11-14 03:02:00,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1460 to 929. [2024-11-14 03:02:00,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 929 states, 928 states have (on average 3.3178879310344827) internal successors, (3079), 928 states have internal predecessors, (3079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:02:00,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 3079 transitions. [2024-11-14 03:02:00,801 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 3079 transitions. Word has length 28 [2024-11-14 03:02:00,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:02:00,801 INFO L471 AbstractCegarLoop]: Abstraction has 929 states and 3079 transitions. [2024-11-14 03:02:00,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.3214285714285716) internal successors, (65), 27 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:02:00,801 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 3079 transitions. [2024-11-14 03:02:00,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-14 03:02:00,803 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:02:00,804 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:02:00,823 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-14 03:02:01,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-14 03:02:01,004 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-14 03:02:01,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:02:01,005 INFO L85 PathProgramCache]: Analyzing trace with hash 442734082, now seen corresponding path program 7 times [2024-11-14 03:02:01,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:02:01,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782160051] [2024-11-14 03:02:01,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:02:01,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:02:01,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:02:01,209 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-14 03:02:01,209 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:02:01,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782160051] [2024-11-14 03:02:01,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782160051] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:02:01,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [681046516] [2024-11-14 03:02:01,209 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-14 03:02:01,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:02:01,210 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:02:01,212 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:02:01,213 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-14 03:02:01,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:02:01,333 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-14 03:02:01,334 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:02:01,457 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-14 03:02:01,458 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:02:01,570 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-14 03:02:01,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [681046516] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:02:01,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [660569705] [2024-11-14 03:02:01,571 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2024-11-14 03:02:01,572 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:02:01,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2024-11-14 03:02:01,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425686251] [2024-11-14 03:02:01,572 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:02:01,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-14 03:02:01,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:02:01,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-14 03:02:01,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2024-11-14 03:02:01,573 INFO L87 Difference]: Start difference. First operand 929 states and 3079 transitions. Second operand has 15 states, 15 states have (on average 3.0) internal successors, (45), 14 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) [2024-11-14 03:02:02,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:02:02,895 INFO L93 Difference]: Finished difference Result 2128 states and 7090 transitions. [2024-11-14 03:02:02,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-14 03:02:02,895 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.0) internal successors, (45), 14 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 30 [2024-11-14 03:02:02,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:02:02,903 INFO L225 Difference]: With dead ends: 2128 [2024-11-14 03:02:02,903 INFO L226 Difference]: Without dead ends: 1952 [2024-11-14 03:02:02,903 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2024-11-14 03:02:02,904 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 91 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 659 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-14 03:02:02,904 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 49 Invalid, 666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 659 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-14 03:02:02,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1952 states. [2024-11-14 03:02:03,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1952 to 1095. [2024-11-14 03:02:03,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1095 states, 1094 states have (on average 3.3446069469835464) internal successors, (3659), 1094 states have internal predecessors, (3659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:02:03,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1095 states to 1095 states and 3659 transitions. [2024-11-14 03:02:03,236 INFO L78 Accepts]: Start accepts. Automaton has 1095 states and 3659 transitions. Word has length 30 [2024-11-14 03:02:03,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:02:03,236 INFO L471 AbstractCegarLoop]: Abstraction has 1095 states and 3659 transitions. [2024-11-14 03:02:03,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.0) internal successors, (45), 14 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) [2024-11-14 03:02:03,236 INFO L276 IsEmpty]: Start isEmpty. Operand 1095 states and 3659 transitions. [2024-11-14 03:02:03,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-14 03:02:03,239 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:02:03,239 INFO L215 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, 1, 1, 1, 1, 1, 1] [2024-11-14 03:02:03,255 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-14 03:02:03,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:02:03,444 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-14 03:02:03,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:02:03,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1279457737, now seen corresponding path program 8 times [2024-11-14 03:02:03,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:02:03,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312700374] [2024-11-14 03:02:03,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:02:03,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:02:03,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:02:03,591 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 03:02:03,591 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:02:03,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312700374] [2024-11-14 03:02:03,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312700374] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:02:03,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1710286471] [2024-11-14 03:02:03,591 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 03:02:03,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:02:03,593 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:02:03,594 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:02:03,597 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-14 03:02:03,716 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-14 03:02:03,716 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 03:02:03,717 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-14 03:02:03,719 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:02:03,837 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 03:02:03,838 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:02:03,940 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 03:02:03,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1710286471] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:02:03,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1518349459] [2024-11-14 03:02:03,941 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2024-11-14 03:02:03,941 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:02:03,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2024-11-14 03:02:03,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093445482] [2024-11-14 03:02:03,941 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:02:03,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-14 03:02:03,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:02:03,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-14 03:02:03,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2024-11-14 03:02:03,942 INFO L87 Difference]: Start difference. First operand 1095 states and 3659 transitions. Second operand has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 13 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) [2024-11-14 03:02:04,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:02:04,850 INFO L93 Difference]: Finished difference Result 2141 states and 7162 transitions. [2024-11-14 03:02:04,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-14 03:02:04,851 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 13 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 31 [2024-11-14 03:02:04,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:02:04,861 INFO L225 Difference]: With dead ends: 2141 [2024-11-14 03:02:04,861 INFO L226 Difference]: Without dead ends: 1405 [2024-11-14 03:02:04,863 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2024-11-14 03:02:04,863 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 153 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 03:02:04,863 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 16 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 03:02:04,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1405 states. [2024-11-14 03:02:05,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1405 to 1294. [2024-11-14 03:02:05,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1294 states, 1293 states have (on average 3.3271461716937356) internal successors, (4302), 1293 states have internal predecessors, (4302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:02:05,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1294 states to 1294 states and 4302 transitions. [2024-11-14 03:02:05,296 INFO L78 Accepts]: Start accepts. Automaton has 1294 states and 4302 transitions. Word has length 31 [2024-11-14 03:02:05,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:02:05,296 INFO L471 AbstractCegarLoop]: Abstraction has 1294 states and 4302 transitions. [2024-11-14 03:02:05,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 13 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) [2024-11-14 03:02:05,296 INFO L276 IsEmpty]: Start isEmpty. Operand 1294 states and 4302 transitions. [2024-11-14 03:02:05,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-14 03:02:05,299 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:02:05,299 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:02:05,313 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-14 03:02:05,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-14 03:02:05,503 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-14 03:02:05,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:02:05,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1187922562, now seen corresponding path program 1 times [2024-11-14 03:02:05,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:02:05,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594041189] [2024-11-14 03:02:05,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:02:05,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:02:05,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:02:05,662 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 03:02:05,662 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:02:05,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594041189] [2024-11-14 03:02:05,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594041189] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:02:05,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [740696446] [2024-11-14 03:02:05,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:02:05,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:02:05,663 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:02:05,665 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:02:05,667 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-14 03:02:05,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:02:05,778 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-14 03:02:05,780 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:02:05,900 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 03:02:05,900 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:02:06,025 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 03:02:06,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [740696446] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:02:06,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1760340922] [2024-11-14 03:02:06,026 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2024-11-14 03:02:06,026 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:02:06,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2024-11-14 03:02:06,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946367249] [2024-11-14 03:02:06,026 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:02:06,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-14 03:02:06,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:02:06,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-14 03:02:06,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2024-11-14 03:02:06,027 INFO L87 Difference]: Start difference. First operand 1294 states and 4302 transitions. Second operand has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 13 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:02:06,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:02:06,647 INFO L93 Difference]: Finished difference Result 1520 states and 4944 transitions. [2024-11-14 03:02:06,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 03:02:06,647 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 13 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-14 03:02:06,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:02:06,654 INFO L225 Difference]: With dead ends: 1520 [2024-11-14 03:02:06,654 INFO L226 Difference]: Without dead ends: 1125 [2024-11-14 03:02:06,656 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2024-11-14 03:02:06,656 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 80 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:02:06,656 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 13 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 03:02:06,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2024-11-14 03:02:06,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 1086. [2024-11-14 03:02:06,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1086 states, 1085 states have (on average 3.1834101382488478) internal successors, (3454), 1085 states have internal predecessors, (3454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:02:06,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1086 states to 1086 states and 3454 transitions. [2024-11-14 03:02:06,924 INFO L78 Accepts]: Start accepts. Automaton has 1086 states and 3454 transitions. Word has length 31 [2024-11-14 03:02:06,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:02:06,924 INFO L471 AbstractCegarLoop]: Abstraction has 1086 states and 3454 transitions. [2024-11-14 03:02:06,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 13 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:02:06,925 INFO L276 IsEmpty]: Start isEmpty. Operand 1086 states and 3454 transitions. [2024-11-14 03:02:06,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-14 03:02:06,927 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:02:06,927 INFO L215 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, 1, 1, 1, 1, 1, 1] [2024-11-14 03:02:06,947 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-14 03:02:07,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-14 03:02:07,128 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-14 03:02:07,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:02:07,128 INFO L85 PathProgramCache]: Analyzing trace with hash 432308455, now seen corresponding path program 9 times [2024-11-14 03:02:07,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:02:07,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837022558] [2024-11-14 03:02:07,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:02:07,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:02:07,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:02:07,290 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 03:02:07,291 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:02:07,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837022558] [2024-11-14 03:02:07,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837022558] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:02:07,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [360887383] [2024-11-14 03:02:07,291 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-14 03:02:07,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:02:07,291 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:02:07,293 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:02:07,294 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-14 03:02:07,386 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-14 03:02:07,387 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 03:02:07,388 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-14 03:02:07,389 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:02:07,684 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 03:02:07,684 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:02:07,864 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 03:02:07,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [360887383] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:02:07,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1392638653] [2024-11-14 03:02:07,865 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2024-11-14 03:02:07,867 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:02:07,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 17 [2024-11-14 03:02:07,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927736662] [2024-11-14 03:02:07,867 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:02:07,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-14 03:02:07,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:02:07,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-14 03:02:07,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2024-11-14 03:02:07,868 INFO L87 Difference]: Start difference. First operand 1086 states and 3454 transitions. Second operand has 17 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 17 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) [2024-11-14 03:02:09,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:02:09,095 INFO L93 Difference]: Finished difference Result 1253 states and 3980 transitions. [2024-11-14 03:02:09,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-14 03:02:09,096 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 17 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 31 [2024-11-14 03:02:09,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:02:09,100 INFO L225 Difference]: With dead ends: 1253 [2024-11-14 03:02:09,100 INFO L226 Difference]: Without dead ends: 839 [2024-11-14 03:02:09,101 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=202, Invalid=554, Unknown=0, NotChecked=0, Total=756 [2024-11-14 03:02:09,102 INFO L432 NwaCegarLoop]: 1 mSDtfsCounter, 183 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-14 03:02:09,102 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 9 Invalid, 606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 600 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-14 03:02:09,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2024-11-14 03:02:09,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 695. [2024-11-14 03:02:09,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 695 states, 694 states have (on average 3.329971181556196) internal successors, (2311), 694 states have internal predecessors, (2311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:02:09,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 2311 transitions. [2024-11-14 03:02:09,272 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 2311 transitions. Word has length 31 [2024-11-14 03:02:09,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:02:09,272 INFO L471 AbstractCegarLoop]: Abstraction has 695 states and 2311 transitions. [2024-11-14 03:02:09,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 17 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) [2024-11-14 03:02:09,272 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 2311 transitions. [2024-11-14 03:02:09,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-14 03:02:09,273 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:02:09,273 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:02:09,287 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-14 03:02:09,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:02:09,478 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-14 03:02:09,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:02:09,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1589137934, now seen corresponding path program 10 times [2024-11-14 03:02:09,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:02:09,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127361150] [2024-11-14 03:02:09,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:02:09,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:02:09,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:02:09,773 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-14 03:02:09,773 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:02:09,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127361150] [2024-11-14 03:02:09,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127361150] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:02:09,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1335496252] [2024-11-14 03:02:09,773 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-14 03:02:09,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:02:09,773 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:02:09,775 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:02:09,776 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-14 03:02:09,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:02:09,882 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-14 03:02:09,884 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:02:10,064 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-14 03:02:10,064 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:02:10,207 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-14 03:02:10,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1335496252] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:02:10,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [60570042] [2024-11-14 03:02:10,207 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2024-11-14 03:02:10,208 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:02:10,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2024-11-14 03:02:10,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850830290] [2024-11-14 03:02:10,208 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:02:10,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-14 03:02:10,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:02:10,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-14 03:02:10,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2024-11-14 03:02:10,209 INFO L87 Difference]: Start difference. First operand 695 states and 2311 transitions. Second operand has 19 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 18 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:02:11,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:02:11,396 INFO L93 Difference]: Finished difference Result 1375 states and 4472 transitions. [2024-11-14 03:02:11,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-14 03:02:11,397 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 18 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2024-11-14 03:02:11,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:02:11,404 INFO L225 Difference]: With dead ends: 1375 [2024-11-14 03:02:11,404 INFO L226 Difference]: Without dead ends: 1352 [2024-11-14 03:02:11,406 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 52 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=144, Invalid=506, Unknown=0, NotChecked=0, Total=650 [2024-11-14 03:02:11,408 INFO L432 NwaCegarLoop]: 1 mSDtfsCounter, 124 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 774 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-14 03:02:11,409 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 10 Invalid, 783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 774 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-14 03:02:11,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2024-11-14 03:02:11,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 830. [2024-11-14 03:02:11,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 830 states, 829 states have (on average 3.2569360675512664) internal successors, (2700), 829 states have internal predecessors, (2700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:02:11,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 2700 transitions. [2024-11-14 03:02:11,625 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 2700 transitions. Word has length 33 [2024-11-14 03:02:11,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:02:11,625 INFO L471 AbstractCegarLoop]: Abstraction has 830 states and 2700 transitions. [2024-11-14 03:02:11,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 18 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:02:11,625 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 2700 transitions. [2024-11-14 03:02:11,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-14 03:02:11,627 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:02:11,627 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:02:11,643 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-14 03:02:11,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:02:11,827 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-14 03:02:11,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:02:11,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1623274030, now seen corresponding path program 11 times [2024-11-14 03:02:11,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:02:11,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750591499] [2024-11-14 03:02:11,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:02:11,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:02:11,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:02:12,055 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-14 03:02:12,055 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:02:12,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750591499] [2024-11-14 03:02:12,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750591499] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:02:12,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [165442653] [2024-11-14 03:02:12,055 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 03:02:12,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:02:12,056 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:02:12,058 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:02:12,060 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-14 03:02:12,178 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-14 03:02:12,179 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 03:02:12,180 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-14 03:02:12,182 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:02:12,360 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-14 03:02:12,360 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:02:12,558 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-14 03:02:12,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [165442653] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:02:12,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2002268814] [2024-11-14 03:02:12,559 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2024-11-14 03:02:12,559 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:02:12,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 19 [2024-11-14 03:02:12,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855078552] [2024-11-14 03:02:12,559 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:02:12,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-14 03:02:12,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:02:12,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-14 03:02:12,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2024-11-14 03:02:12,560 INFO L87 Difference]: Start difference. First operand 830 states and 2700 transitions. Second operand has 20 states, 20 states have (on average 2.65) internal successors, (53), 19 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) [2024-11-14 03:02:14,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:02:14,427 INFO L93 Difference]: Finished difference Result 1997 states and 6738 transitions. [2024-11-14 03:02:14,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-14 03:02:14,427 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.65) internal successors, (53), 19 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 33 [2024-11-14 03:02:14,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:02:14,436 INFO L225 Difference]: With dead ends: 1997 [2024-11-14 03:02:14,436 INFO L226 Difference]: Without dead ends: 1974 [2024-11-14 03:02:14,437 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 52 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=210, Invalid=720, Unknown=0, NotChecked=0, Total=930 [2024-11-14 03:02:14,437 INFO L432 NwaCegarLoop]: 1 mSDtfsCounter, 188 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 1095 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 1106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1095 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-14 03:02:14,438 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 12 Invalid, 1106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1095 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-14 03:02:14,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1974 states. [2024-11-14 03:02:14,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1974 to 887. [2024-11-14 03:02:14,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 887 states, 886 states have (on average 3.335214446952596) internal successors, (2955), 886 states have internal predecessors, (2955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:02:14,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 887 states and 2955 transitions. [2024-11-14 03:02:14,734 INFO L78 Accepts]: Start accepts. Automaton has 887 states and 2955 transitions. Word has length 33 [2024-11-14 03:02:14,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:02:14,734 INFO L471 AbstractCegarLoop]: Abstraction has 887 states and 2955 transitions. [2024-11-14 03:02:14,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.65) internal successors, (53), 19 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) [2024-11-14 03:02:14,734 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 2955 transitions. [2024-11-14 03:02:14,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-14 03:02:14,736 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:02:14,736 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:02:14,756 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-14 03:02:14,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-14 03:02:14,941 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-14 03:02:14,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:02:14,941 INFO L85 PathProgramCache]: Analyzing trace with hash 43125180, now seen corresponding path program 12 times [2024-11-14 03:02:14,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:02:14,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765148605] [2024-11-14 03:02:14,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:02:14,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:02:14,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:02:15,174 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-14 03:02:15,174 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:02:15,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765148605] [2024-11-14 03:02:15,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765148605] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:02:15,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [453297745] [2024-11-14 03:02:15,175 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-14 03:02:15,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:02:15,175 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:02:15,177 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:02:15,187 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-14 03:02:15,283 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-14 03:02:15,284 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 03:02:15,284 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-14 03:02:15,286 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:02:15,517 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 03:02:15,517 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:02:15,689 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 03:02:15,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [453297745] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:02:15,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1081131096] [2024-11-14 03:02:15,690 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2024-11-14 03:02:15,690 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:02:15,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2024-11-14 03:02:15,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476305064] [2024-11-14 03:02:15,690 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:02:15,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-14 03:02:15,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:02:15,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-14 03:02:15,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2024-11-14 03:02:15,691 INFO L87 Difference]: Start difference. First operand 887 states and 2955 transitions. Second operand has 19 states, 19 states have (on average 3.263157894736842) internal successors, (62), 19 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) [2024-11-14 03:02:20,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:02:20,195 INFO L93 Difference]: Finished difference Result 2649 states and 9199 transitions. [2024-11-14 03:02:20,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2024-11-14 03:02:20,195 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.263157894736842) internal successors, (62), 19 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 33 [2024-11-14 03:02:20,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:02:20,203 INFO L225 Difference]: With dead ends: 2649 [2024-11-14 03:02:20,203 INFO L226 Difference]: Without dead ends: 2626 [2024-11-14 03:02:20,205 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 52 SyntacticMatches, 4 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1958 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1490, Invalid=5482, Unknown=0, NotChecked=0, Total=6972 [2024-11-14 03:02:20,205 INFO L432 NwaCegarLoop]: 1 mSDtfsCounter, 295 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 1920 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 1943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1920 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-14 03:02:20,205 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 9 Invalid, 1943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1920 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-14 03:02:20,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2626 states. [2024-11-14 03:02:20,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2626 to 906. [2024-11-14 03:02:20,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 906 states, 905 states have (on average 3.380110497237569) internal successors, (3059), 905 states have internal predecessors, (3059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:02:20,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 3059 transitions. [2024-11-14 03:02:20,502 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 3059 transitions. Word has length 33 [2024-11-14 03:02:20,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:02:20,502 INFO L471 AbstractCegarLoop]: Abstraction has 906 states and 3059 transitions. [2024-11-14 03:02:20,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.263157894736842) internal successors, (62), 19 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) [2024-11-14 03:02:20,503 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 3059 transitions. [2024-11-14 03:02:20,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-14 03:02:20,504 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:02:20,504 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:02:20,521 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-11-14 03:02:20,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-14 03:02:20,705 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-14 03:02:20,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:02:20,705 INFO L85 PathProgramCache]: Analyzing trace with hash 172716030, now seen corresponding path program 13 times [2024-11-14 03:02:20,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:02:20,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318633996] [2024-11-14 03:02:20,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:02:20,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:02:20,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:02:20,971 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-14 03:02:20,971 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:02:20,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318633996] [2024-11-14 03:02:20,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318633996] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:02:20,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [143830244] [2024-11-14 03:02:20,972 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-14 03:02:20,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:02:20,972 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:02:20,974 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:02:20,975 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-14 03:02:21,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:02:21,084 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-14 03:02:21,085 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:02:21,271 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-14 03:02:21,271 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:02:21,530 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-14 03:02:21,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [143830244] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:02:21,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1775246655] [2024-11-14 03:02:21,531 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2024-11-14 03:02:21,531 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:02:21,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 21 [2024-11-14 03:02:21,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623175420] [2024-11-14 03:02:21,532 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:02:21,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-14 03:02:21,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:02:21,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-14 03:02:21,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=368, Unknown=0, NotChecked=0, Total=462 [2024-11-14 03:02:21,532 INFO L87 Difference]: Start difference. First operand 906 states and 3059 transitions. Second operand has 22 states, 22 states have (on average 2.6363636363636362) internal successors, (58), 21 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) [2024-11-14 03:02:23,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:02:23,509 INFO L93 Difference]: Finished difference Result 1978 states and 6899 transitions. [2024-11-14 03:02:23,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-14 03:02:23,510 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.6363636363636362) internal successors, (58), 21 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 33 [2024-11-14 03:02:23,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:02:23,517 INFO L225 Difference]: With dead ends: 1978 [2024-11-14 03:02:23,517 INFO L226 Difference]: Without dead ends: 1955 [2024-11-14 03:02:23,518 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=311, Invalid=949, Unknown=0, NotChecked=0, Total=1260 [2024-11-14 03:02:23,519 INFO L432 NwaCegarLoop]: 1 mSDtfsCounter, 185 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 841 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 841 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-14 03:02:23,519 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 10 Invalid, 862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 841 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-14 03:02:23,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1955 states. [2024-11-14 03:02:23,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1955 to 925. [2024-11-14 03:02:23,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 925 states, 924 states have (on average 3.3614718614718613) internal successors, (3106), 924 states have internal predecessors, (3106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:02:23,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 925 states to 925 states and 3106 transitions. [2024-11-14 03:02:23,935 INFO L78 Accepts]: Start accepts. Automaton has 925 states and 3106 transitions. Word has length 33 [2024-11-14 03:02:23,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:02:23,935 INFO L471 AbstractCegarLoop]: Abstraction has 925 states and 3106 transitions. [2024-11-14 03:02:23,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.6363636363636362) internal successors, (58), 21 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) [2024-11-14 03:02:23,936 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 3106 transitions. [2024-11-14 03:02:23,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-14 03:02:23,937 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:02:23,937 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:02:23,957 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-14 03:02:24,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-14 03:02:24,138 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-14 03:02:24,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:02:24,138 INFO L85 PathProgramCache]: Analyzing trace with hash 333141074, now seen corresponding path program 14 times [2024-11-14 03:02:24,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:02:24,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76358719] [2024-11-14 03:02:24,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:02:24,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:02:24,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:02:24,358 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-14 03:02:24,358 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:02:24,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76358719] [2024-11-14 03:02:24,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76358719] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:02:24,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [982599474] [2024-11-14 03:02:24,358 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 03:02:24,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:02:24,359 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:02:24,360 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:02:24,363 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-14 03:02:24,482 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-14 03:02:24,483 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 03:02:24,484 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-14 03:02:24,485 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:02:24,705 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-14 03:02:24,705 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:02:24,860 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-14 03:02:24,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [982599474] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:02:24,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [611759439] [2024-11-14 03:02:24,861 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2024-11-14 03:02:24,861 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:02:24,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 19 [2024-11-14 03:02:24,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575032840] [2024-11-14 03:02:24,861 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:02:24,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-14 03:02:24,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:02:24,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-14 03:02:24,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2024-11-14 03:02:24,862 INFO L87 Difference]: Start difference. First operand 925 states and 3106 transitions. Second operand has 20 states, 20 states have (on average 2.45) internal successors, (49), 19 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) [2024-11-14 03:02:26,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:02:26,644 INFO L93 Difference]: Finished difference Result 1755 states and 5872 transitions. [2024-11-14 03:02:26,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-14 03:02:26,644 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.45) internal successors, (49), 19 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 33 [2024-11-14 03:02:26,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:02:26,651 INFO L225 Difference]: With dead ends: 1755 [2024-11-14 03:02:26,651 INFO L226 Difference]: Without dead ends: 1732 [2024-11-14 03:02:26,652 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 52 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=214, Invalid=716, Unknown=0, NotChecked=0, Total=930 [2024-11-14 03:02:26,652 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 134 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 928 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 941 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 928 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-14 03:02:26,653 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 15 Invalid, 941 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 928 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-14 03:02:26,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1732 states. [2024-11-14 03:02:27,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1732 to 1020. [2024-11-14 03:02:27,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1020 states, 1019 states have (on average 3.4278704612365063) internal successors, (3493), 1019 states have internal predecessors, (3493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:02:27,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 1020 states and 3493 transitions. [2024-11-14 03:02:27,051 INFO L78 Accepts]: Start accepts. Automaton has 1020 states and 3493 transitions. Word has length 33 [2024-11-14 03:02:27,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:02:27,051 INFO L471 AbstractCegarLoop]: Abstraction has 1020 states and 3493 transitions. [2024-11-14 03:02:27,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.45) internal successors, (49), 19 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) [2024-11-14 03:02:27,051 INFO L276 IsEmpty]: Start isEmpty. Operand 1020 states and 3493 transitions. [2024-11-14 03:02:27,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-14 03:02:27,054 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:02:27,054 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:02:27,074 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-11-14 03:02:27,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:02:27,258 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-14 03:02:27,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:02:27,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1999540284, now seen corresponding path program 15 times [2024-11-14 03:02:27,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:02:27,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95662299] [2024-11-14 03:02:27,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:02:27,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:02:27,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:02:27,474 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-14 03:02:27,474 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:02:27,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95662299] [2024-11-14 03:02:27,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95662299] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:02:27,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1486449135] [2024-11-14 03:02:27,475 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-14 03:02:27,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:02:27,475 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:02:27,477 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:02:27,479 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-14 03:02:27,584 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-14 03:02:27,584 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 03:02:27,585 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-14 03:02:27,586 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:02:27,806 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 03:02:27,806 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:02:27,959 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 03:02:27,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1486449135] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:02:27,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [547570392] [2024-11-14 03:02:27,960 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2024-11-14 03:02:27,960 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:02:27,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2024-11-14 03:02:27,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381076310] [2024-11-14 03:02:27,961 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:02:27,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-14 03:02:27,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:02:27,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-14 03:02:27,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2024-11-14 03:02:27,961 INFO L87 Difference]: Start difference. First operand 1020 states and 3493 transitions. Second operand has 19 states, 19 states have (on average 3.0526315789473686) internal successors, (58), 19 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) [2024-11-14 03:02:34,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:02:34,106 INFO L93 Difference]: Finished difference Result 2834 states and 9762 transitions. [2024-11-14 03:02:34,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2024-11-14 03:02:34,107 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.0526315789473686) internal successors, (58), 19 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 33 [2024-11-14 03:02:34,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:02:34,119 INFO L225 Difference]: With dead ends: 2834 [2024-11-14 03:02:34,119 INFO L226 Difference]: Without dead ends: 2811 [2024-11-14 03:02:34,122 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 52 SyntacticMatches, 4 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3276 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1803, Invalid=7899, Unknown=0, NotChecked=0, Total=9702 [2024-11-14 03:02:34,122 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 312 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 2746 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 2769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 2746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-14 03:02:34,122 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 33 Invalid, 2769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 2746 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-14 03:02:34,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2811 states. [2024-11-14 03:02:34,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2811 to 1039. [2024-11-14 03:02:34,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1039 states, 1038 states have (on average 3.4653179190751446) internal successors, (3597), 1038 states have internal predecessors, (3597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:02:34,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1039 states to 1039 states and 3597 transitions. [2024-11-14 03:02:34,583 INFO L78 Accepts]: Start accepts. Automaton has 1039 states and 3597 transitions. Word has length 33 [2024-11-14 03:02:34,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:02:34,583 INFO L471 AbstractCegarLoop]: Abstraction has 1039 states and 3597 transitions. [2024-11-14 03:02:34,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.0526315789473686) internal successors, (58), 19 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) [2024-11-14 03:02:34,583 INFO L276 IsEmpty]: Start isEmpty. Operand 1039 states and 3597 transitions. [2024-11-14 03:02:34,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-14 03:02:34,585 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:02:34,585 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:02:34,602 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-11-14 03:02:34,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:02:34,785 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-14 03:02:34,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:02:34,786 INFO L85 PathProgramCache]: Analyzing trace with hash 2129131134, now seen corresponding path program 16 times [2024-11-14 03:02:34,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:02:34,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973244087] [2024-11-14 03:02:34,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:02:34,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:02:34,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:02:35,014 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-14 03:02:35,015 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:02:35,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973244087] [2024-11-14 03:02:35,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973244087] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:02:35,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2112383389] [2024-11-14 03:02:35,015 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-14 03:02:35,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:02:35,015 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:02:35,017 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:02:35,019 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-14 03:02:35,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:02:35,140 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-14 03:02:35,141 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:02:35,346 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-14 03:02:35,346 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:02:35,612 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-14 03:02:35,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2112383389] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:02:35,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [174963044] [2024-11-14 03:02:35,612 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2024-11-14 03:02:35,613 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:02:35,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 21 [2024-11-14 03:02:35,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881022364] [2024-11-14 03:02:35,613 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:02:35,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-14 03:02:35,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:02:35,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-14 03:02:35,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=368, Unknown=0, NotChecked=0, Total=462 [2024-11-14 03:02:35,614 INFO L87 Difference]: Start difference. First operand 1039 states and 3597 transitions. Second operand has 22 states, 22 states have (on average 2.4545454545454546) internal successors, (54), 21 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) [2024-11-14 03:02:38,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:02:38,130 INFO L93 Difference]: Finished difference Result 2683 states and 9239 transitions. [2024-11-14 03:02:38,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-14 03:02:38,131 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.4545454545454546) internal successors, (54), 21 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 33 [2024-11-14 03:02:38,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:02:38,138 INFO L225 Difference]: With dead ends: 2683 [2024-11-14 03:02:38,138 INFO L226 Difference]: Without dead ends: 2660 [2024-11-14 03:02:38,139 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 394 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=425, Invalid=1381, Unknown=0, NotChecked=0, Total=1806 [2024-11-14 03:02:38,140 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 312 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 868 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 901 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 868 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-14 03:02:38,140 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 18 Invalid, 901 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 868 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-14 03:02:38,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2660 states. [2024-11-14 03:02:38,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2660 to 963. [2024-11-14 03:02:38,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 963 states, 962 states have (on average 3.365904365904366) internal successors, (3238), 962 states have internal predecessors, (3238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:02:38,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 3238 transitions. [2024-11-14 03:02:38,525 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 3238 transitions. Word has length 33 [2024-11-14 03:02:38,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:02:38,526 INFO L471 AbstractCegarLoop]: Abstraction has 963 states and 3238 transitions. [2024-11-14 03:02:38,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.4545454545454546) internal successors, (54), 21 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) [2024-11-14 03:02:38,526 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 3238 transitions. [2024-11-14 03:02:38,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-14 03:02:38,527 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:02:38,527 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:02:38,542 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2024-11-14 03:02:38,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-11-14 03:02:38,728 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-14 03:02:38,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:02:38,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1117472034, now seen corresponding path program 17 times [2024-11-14 03:02:38,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:02:38,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357997989] [2024-11-14 03:02:38,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:02:38,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:02:38,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:02:38,945 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-14 03:02:38,946 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:02:38,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357997989] [2024-11-14 03:02:38,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357997989] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:02:38,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2395152] [2024-11-14 03:02:38,946 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 03:02:38,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:02:38,946 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:02:38,948 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:02:38,949 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-11-14 03:02:39,068 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-14 03:02:39,068 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 03:02:39,069 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-14 03:02:39,070 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:02:39,238 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-14 03:02:39,238 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:02:39,405 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-14 03:02:39,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2395152] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:02:39,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1282630966] [2024-11-14 03:02:39,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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2024-11-14 03:02:39,406 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:02:39,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 20 [2024-11-14 03:02:39,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112977088] [2024-11-14 03:02:39,406 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:02:39,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-14 03:02:39,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:02:39,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-14 03:02:39,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2024-11-14 03:02:39,407 INFO L87 Difference]: Start difference. First operand 963 states and 3238 transitions. Second operand has 21 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 20 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) [2024-11-14 03:02:42,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:02:42,825 INFO L93 Difference]: Finished difference Result 3449 states and 12176 transitions. [2024-11-14 03:02:42,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-11-14 03:02:42,826 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 20 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 33 [2024-11-14 03:02:42,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:02:42,834 INFO L225 Difference]: With dead ends: 3449 [2024-11-14 03:02:42,834 INFO L226 Difference]: Without dead ends: 3426 [2024-11-14 03:02:42,835 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 743 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=682, Invalid=1970, Unknown=0, NotChecked=0, Total=2652 [2024-11-14 03:02:42,837 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 287 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 1080 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 1107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1080 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:02:42,837 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 18 Invalid, 1107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1080 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-14 03:02:42,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3426 states. [2024-11-14 03:02:43,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3426 to 1001. [2024-11-14 03:02:43,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1001 states, 1000 states have (on average 3.427) internal successors, (3427), 1000 states have internal predecessors, (3427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:02:43,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1001 states to 1001 states and 3427 transitions. [2024-11-14 03:02:43,179 INFO L78 Accepts]: Start accepts. Automaton has 1001 states and 3427 transitions. Word has length 33 [2024-11-14 03:02:43,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:02:43,179 INFO L471 AbstractCegarLoop]: Abstraction has 1001 states and 3427 transitions. [2024-11-14 03:02:43,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 20 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) [2024-11-14 03:02:43,179 INFO L276 IsEmpty]: Start isEmpty. Operand 1001 states and 3427 transitions. [2024-11-14 03:02:43,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-14 03:02:43,181 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:02:43,181 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:02:43,195 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2024-11-14 03:02:43,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-14 03:02:43,381 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-14 03:02:43,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:02:43,382 INFO L85 PathProgramCache]: Analyzing trace with hash -987881184, now seen corresponding path program 18 times [2024-11-14 03:02:43,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:02:43,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786448702] [2024-11-14 03:02:43,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:02:43,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:02:43,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:02:43,574 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-14 03:02:43,574 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:02:43,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786448702] [2024-11-14 03:02:43,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786448702] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:02:43,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [354042983] [2024-11-14 03:02:43,575 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-14 03:02:43,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:02:43,575 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:02:43,576 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:02:43,577 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-11-14 03:02:43,676 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-14 03:02:43,676 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 03:02:43,677 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-14 03:02:43,678 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:02:43,821 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 03:02:43,821 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:02:44,016 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 03:02:44,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [354042983] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:02:44,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1487157337] [2024-11-14 03:02:44,017 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2024-11-14 03:02:44,017 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:02:44,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2024-11-14 03:02:44,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616753207] [2024-11-14 03:02:44,018 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:02:44,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-14 03:02:44,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:02:44,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-14 03:02:44,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2024-11-14 03:02:44,019 INFO L87 Difference]: Start difference. First operand 1001 states and 3427 transitions. Second operand has 20 states, 20 states have (on average 2.9) internal successors, (58), 20 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) [2024-11-14 03:02:51,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:02:51,772 INFO L93 Difference]: Finished difference Result 4344 states and 15369 transitions. [2024-11-14 03:02:51,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2024-11-14 03:02:51,772 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.9) internal successors, (58), 20 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 33 [2024-11-14 03:02:51,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:02:51,785 INFO L225 Difference]: With dead ends: 4344 [2024-11-14 03:02:51,785 INFO L226 Difference]: Without dead ends: 4321 [2024-11-14 03:02:51,790 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 52 SyntacticMatches, 3 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6305 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3473, Invalid=13297, Unknown=0, NotChecked=0, Total=16770 [2024-11-14 03:02:51,790 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 421 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 2307 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 2343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 2307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:02:51,790 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 28 Invalid, 2343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 2307 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-14 03:02:51,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4321 states. [2024-11-14 03:02:52,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4321 to 982. [2024-11-14 03:02:52,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 982 states, 981 states have (on average 3.3873598369011213) internal successors, (3323), 981 states have internal predecessors, (3323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:02:52,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 3323 transitions. [2024-11-14 03:02:52,187 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 3323 transitions. Word has length 33 [2024-11-14 03:02:52,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:02:52,187 INFO L471 AbstractCegarLoop]: Abstraction has 982 states and 3323 transitions. [2024-11-14 03:02:52,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.9) internal successors, (58), 20 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) [2024-11-14 03:02:52,187 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 3323 transitions. [2024-11-14 03:02:52,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-14 03:02:52,188 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:02:52,188 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:02:52,201 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2024-11-14 03:02:52,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:02:52,389 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-14 03:02:52,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:02:52,389 INFO L85 PathProgramCache]: Analyzing trace with hash 729273230, now seen corresponding path program 19 times [2024-11-14 03:02:52,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:02:52,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108931967] [2024-11-14 03:02:52,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:02:52,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:02:52,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:02:52,604 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-14 03:02:52,604 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:02:52,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108931967] [2024-11-14 03:02:52,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108931967] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:02:52,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [472078341] [2024-11-14 03:02:52,604 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-14 03:02:52,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:02:52,604 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:02:52,606 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:02:52,607 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-11-14 03:02:52,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:02:52,725 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-14 03:02:52,726 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:02:52,896 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-14 03:02:52,896 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:02:53,099 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-14 03:02:53,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [472078341] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:02:53,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1282548481] [2024-11-14 03:02:53,100 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2024-11-14 03:02:53,100 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:02:53,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 19 [2024-11-14 03:02:53,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713810096] [2024-11-14 03:02:53,100 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:02:53,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-14 03:02:53,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:02:53,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-14 03:02:53,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2024-11-14 03:02:53,101 INFO L87 Difference]: Start difference. First operand 982 states and 3323 transitions. Second operand has 20 states, 20 states have (on average 2.7) internal successors, (54), 19 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) [2024-11-14 03:02:54,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:02:54,894 INFO L93 Difference]: Finished difference Result 1604 states and 5342 transitions. [2024-11-14 03:02:54,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-14 03:02:54,895 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.7) internal successors, (54), 19 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 33 [2024-11-14 03:02:54,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:02:54,898 INFO L225 Difference]: With dead ends: 1604 [2024-11-14 03:02:54,898 INFO L226 Difference]: Without dead ends: 1581 [2024-11-14 03:02:54,899 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=188, Invalid=682, Unknown=0, NotChecked=0, Total=870 [2024-11-14 03:02:54,899 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 145 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 982 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 989 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 982 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-14 03:02:54,900 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 19 Invalid, 989 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 982 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-14 03:02:54,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1581 states. [2024-11-14 03:02:55,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1581 to 1001. [2024-11-14 03:02:55,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1001 states, 1000 states have (on average 3.37) internal successors, (3370), 1000 states have internal predecessors, (3370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:02:55,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1001 states to 1001 states and 3370 transitions. [2024-11-14 03:02:55,248 INFO L78 Accepts]: Start accepts. Automaton has 1001 states and 3370 transitions. Word has length 33 [2024-11-14 03:02:55,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:02:55,248 INFO L471 AbstractCegarLoop]: Abstraction has 1001 states and 3370 transitions. [2024-11-14 03:02:55,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.7) internal successors, (54), 19 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) [2024-11-14 03:02:55,248 INFO L276 IsEmpty]: Start isEmpty. Operand 1001 states and 3370 transitions. [2024-11-14 03:02:55,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-14 03:02:55,249 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:02:55,250 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:02:55,262 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2024-11-14 03:02:55,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:02:55,450 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-14 03:02:55,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:02:55,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1804761975, now seen corresponding path program 2 times [2024-11-14 03:02:55,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:02:55,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85005655] [2024-11-14 03:02:55,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:02:55,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:02:55,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:02:57,682 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:02:57,682 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:02:57,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85005655] [2024-11-14 03:02:57,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85005655] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:02:57,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [935392981] [2024-11-14 03:02:57,683 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 03:02:57,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:02:57,683 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:02:57,686 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:02:57,687 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2024-11-14 03:02:57,816 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-14 03:02:57,817 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 03:02:57,818 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-14 03:02:57,820 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:02:58,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 03:02:59,316 INFO L349 Elim1Store]: treesize reduction 48, result has 54.3 percent of original size [2024-11-14 03:02:59,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 51 treesize of output 71 [2024-11-14 03:02:59,661 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:02:59,661 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:03:05,887 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:03:05,888 INFO L378 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 272 treesize of output 256 [2024-11-14 03:03:06,335 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:03:06,336 INFO L378 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 401 treesize of output 329 [2024-11-14 03:03:06,360 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:03:06,360 INFO L378 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 252 treesize of output 192 [2024-11-14 03:03:06,918 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:03:06,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [935392981] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:03:06,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [288192791] [2024-11-14 03:03:06,919 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2024-11-14 03:03:06,919 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:03:06,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 18] total 54 [2024-11-14 03:03:06,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251002215] [2024-11-14 03:03:06,920 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:03:06,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2024-11-14 03:03:06,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:03:06,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2024-11-14 03:03:06,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=2750, Unknown=1, NotChecked=0, Total=2970 [2024-11-14 03:03:06,921 INFO L87 Difference]: Start difference. First operand 1001 states and 3370 transitions. Second operand has 55 states, 55 states have (on average 1.8545454545454545) internal successors, (102), 54 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:03:13,268 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:03:39,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:03:39,754 INFO L93 Difference]: Finished difference Result 3464 states and 11346 transitions. [2024-11-14 03:03:39,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2024-11-14 03:03:39,755 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 1.8545454545454545) internal successors, (102), 54 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2024-11-14 03:03:39,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:03:39,762 INFO L225 Difference]: With dead ends: 3464 [2024-11-14 03:03:39,762 INFO L226 Difference]: Without dead ends: 3457 [2024-11-14 03:03:39,765 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7408 ImplicationChecksByTransitivity, 18.3s TimeCoverageRelationStatistics Valid=1631, Invalid=23490, Unknown=1, NotChecked=0, Total=25122 [2024-11-14 03:03:39,766 INFO L432 NwaCegarLoop]: 1 mSDtfsCounter, 818 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 12193 mSolverCounterSat, 80 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 818 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 12274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 12193 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.0s IncrementalHoareTripleChecker+Time [2024-11-14 03:03:39,766 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [818 Valid, 44 Invalid, 12274 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [80 Valid, 12193 Invalid, 1 Unknown, 0 Unchecked, 20.0s Time] [2024-11-14 03:03:39,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3457 states. [2024-11-14 03:03:40,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3457 to 1312. [2024-11-14 03:03:40,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1312 states, 1311 states have (on average 3.3920671243325704) internal successors, (4447), 1311 states have internal predecessors, (4447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:03:40,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1312 states to 1312 states and 4447 transitions. [2024-11-14 03:03:40,278 INFO L78 Accepts]: Start accepts. Automaton has 1312 states and 4447 transitions. Word has length 36 [2024-11-14 03:03:40,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:03:40,278 INFO L471 AbstractCegarLoop]: Abstraction has 1312 states and 4447 transitions. [2024-11-14 03:03:40,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 1.8545454545454545) internal successors, (102), 54 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:03:40,279 INFO L276 IsEmpty]: Start isEmpty. Operand 1312 states and 4447 transitions. [2024-11-14 03:03:40,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-14 03:03:40,280 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:03:40,280 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:03:40,294 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2024-11-14 03:03:40,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-11-14 03:03:40,481 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-14 03:03:40,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:03:40,481 INFO L85 PathProgramCache]: Analyzing trace with hash -920765133, now seen corresponding path program 3 times [2024-11-14 03:03:40,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:03:40,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847075901] [2024-11-14 03:03:40,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:03:40,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:03:40,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:03:42,688 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:03:42,688 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:03:42,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847075901] [2024-11-14 03:03:42,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847075901] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:03:42,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [764347334] [2024-11-14 03:03:42,689 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-14 03:03:42,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:03:42,689 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:03:42,691 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:03:42,692 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2024-11-14 03:03:42,817 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-14 03:03:42,817 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 03:03:42,819 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 65 conjuncts are in the unsatisfiable core [2024-11-14 03:03:42,821 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:03:42,828 INFO L378 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 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 03:03:42,923 INFO L378 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 19 treesize of output 1 [2024-11-14 03:03:42,979 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 03:03:42,979 INFO L378 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 11 treesize of output 11 [2024-11-14 03:03:43,041 INFO L378 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 8 treesize of output 1 [2024-11-14 03:03:43,100 INFO L378 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 19 treesize of output 1 [2024-11-14 03:03:44,022 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:03:44,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 15 [2024-11-14 03:03:44,033 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:03:44,034 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:03:47,197 INFO L349 Elim1Store]: treesize reduction 28, result has 64.1 percent of original size [2024-11-14 03:03:47,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 232 treesize of output 197 [2024-11-14 03:03:48,089 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 03:03:48,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [764347334] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:03:48,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [780113543] [2024-11-14 03:03:48,090 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2024-11-14 03:03:48,090 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:03:48,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17, 15] total 48 [2024-11-14 03:03:48,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789370142] [2024-11-14 03:03:48,090 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:03:48,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-11-14 03:03:48,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:03:48,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-11-14 03:03:48,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=2170, Unknown=1, NotChecked=0, Total=2352 [2024-11-14 03:03:48,091 INFO L87 Difference]: Start difference. First operand 1312 states and 4447 transitions. Second operand has 49 states, 49 states have (on average 1.8571428571428572) internal successors, (91), 48 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:03:58,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:03:58,032 INFO L93 Difference]: Finished difference Result 2642 states and 8705 transitions. [2024-11-14 03:03:58,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-11-14 03:03:58,033 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.8571428571428572) internal successors, (91), 48 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2024-11-14 03:03:58,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:03:58,038 INFO L225 Difference]: With dead ends: 2642 [2024-11-14 03:03:58,038 INFO L226 Difference]: Without dead ends: 2635 [2024-11-14 03:03:58,039 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1309 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=479, Invalid=5372, Unknown=1, NotChecked=0, Total=5852 [2024-11-14 03:03:58,039 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 616 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 4216 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 616 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 4253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 4216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:03:58,039 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [616 Valid, 60 Invalid, 4253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 4216 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2024-11-14 03:03:58,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2635 states. [2024-11-14 03:03:58,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2635 to 1326. [2024-11-14 03:03:58,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1326 states, 1325 states have (on average 3.392452830188679) internal successors, (4495), 1325 states have internal predecessors, (4495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:03:58,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1326 states to 1326 states and 4495 transitions. [2024-11-14 03:03:58,633 INFO L78 Accepts]: Start accepts. Automaton has 1326 states and 4495 transitions. Word has length 36 [2024-11-14 03:03:58,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:03:58,633 INFO L471 AbstractCegarLoop]: Abstraction has 1326 states and 4495 transitions. [2024-11-14 03:03:58,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 1.8571428571428572) internal successors, (91), 48 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:03:58,633 INFO L276 IsEmpty]: Start isEmpty. Operand 1326 states and 4495 transitions. [2024-11-14 03:03:58,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-14 03:03:58,635 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:03:58,635 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:03:58,649 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2024-11-14 03:03:58,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-14 03:03:58,836 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-14 03:03:58,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:03:58,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1673008679, now seen corresponding path program 4 times [2024-11-14 03:03:58,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:03:58,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069894918] [2024-11-14 03:03:58,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:03:58,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:03:58,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:04:01,084 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:04:01,084 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:04:01,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069894918] [2024-11-14 03:04:01,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069894918] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:04:01,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [414176077] [2024-11-14 03:04:01,085 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-14 03:04:01,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:04:01,085 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:04:01,087 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:04:01,088 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2024-11-14 03:04:01,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:04:01,241 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-14 03:04:01,242 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:04:01,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 03:04:02,805 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:04:02,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 31 [2024-11-14 03:04:02,837 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:04:02,837 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:04:03,957 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:04:03,958 INFO L378 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 272 treesize of output 256 [2024-11-14 03:04:04,388 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:04:04,409 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:04:04,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 99 treesize of output 85 [2024-11-14 03:04:04,500 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:04:04,500 INFO L378 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 124 treesize of output 112 [2024-11-14 03:04:04,532 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:04:04,532 INFO L378 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 104 treesize of output 72 [2024-11-14 03:04:04,676 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-14 03:04:04,676 INFO L378 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 328 treesize of output 271 [2024-11-14 03:04:04,688 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:04:04,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 268 treesize of output 188 [2024-11-14 03:04:05,141 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:04:05,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [414176077] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:04:05,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [672963676] [2024-11-14 03:04:05,141 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2024-11-14 03:04:05,142 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:04:05,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 17, 16] total 51 [2024-11-14 03:04:05,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950633472] [2024-11-14 03:04:05,142 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:04:05,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-14 03:04:05,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:04:05,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-14 03:04:05,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=2422, Unknown=0, NotChecked=0, Total=2652 [2024-11-14 03:04:05,143 INFO L87 Difference]: Start difference. First operand 1326 states and 4495 transitions. Second operand has 52 states, 52 states have (on average 1.8269230769230769) internal successors, (95), 51 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:04:43,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:04:43,895 INFO L93 Difference]: Finished difference Result 4221 states and 13929 transitions. [2024-11-14 03:04:43,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 188 states. [2024-11-14 03:04:43,895 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 1.8269230769230769) internal successors, (95), 51 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2024-11-14 03:04:43,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:04:43,904 INFO L225 Difference]: With dead ends: 4221 [2024-11-14 03:04:43,904 INFO L226 Difference]: Without dead ends: 4204 [2024-11-14 03:04:43,909 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 222 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17782 ImplicationChecksByTransitivity, 23.3s TimeCoverageRelationStatistics Valid=4157, Invalid=45795, Unknown=0, NotChecked=0, Total=49952 [2024-11-14 03:04:43,909 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 995 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 10990 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 995 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 11179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 10990 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.7s IncrementalHoareTripleChecker+Time [2024-11-14 03:04:43,909 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [995 Valid, 84 Invalid, 11179 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [189 Valid, 10990 Invalid, 0 Unknown, 0 Unchecked, 14.7s Time] [2024-11-14 03:04:43,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4204 states. [2024-11-14 03:04:44,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4204 to 1603. [2024-11-14 03:04:44,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1603 states, 1602 states have (on average 3.411985018726592) internal successors, (5466), 1602 states have internal predecessors, (5466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:04:44,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1603 states to 1603 states and 5466 transitions. [2024-11-14 03:04:44,652 INFO L78 Accepts]: Start accepts. Automaton has 1603 states and 5466 transitions. Word has length 36 [2024-11-14 03:04:44,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:04:44,652 INFO L471 AbstractCegarLoop]: Abstraction has 1603 states and 5466 transitions. [2024-11-14 03:04:44,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 1.8269230769230769) internal successors, (95), 51 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:04:44,652 INFO L276 IsEmpty]: Start isEmpty. Operand 1603 states and 5466 transitions. [2024-11-14 03:04:44,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-14 03:04:44,656 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:04:44,656 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:04:44,676 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2024-11-14 03:04:44,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-14 03:04:44,857 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-14 03:04:44,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:04:44,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1734591214, now seen corresponding path program 20 times [2024-11-14 03:04:44,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:04:44,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291344795] [2024-11-14 03:04:44,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:04:44,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:04:44,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:04:47,088 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:04:47,089 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:04:47,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291344795] [2024-11-14 03:04:47,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291344795] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:04:47,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [318527648] [2024-11-14 03:04:47,089 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 03:04:47,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:04:47,089 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:04:47,091 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:04:47,091 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2024-11-14 03:04:47,237 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-14 03:04:47,237 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 03:04:47,240 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-11-14 03:04:47,243 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:04:47,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 03:04:48,894 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:04:48,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 31 [2024-11-14 03:04:48,911 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:04:48,911 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:04:50,473 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:04:50,473 INFO L378 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 268 treesize of output 252 [2024-11-14 03:04:50,919 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:04:50,919 INFO L378 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 401 treesize of output 329 [2024-11-14 03:04:50,936 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:04:50,937 INFO L378 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 268 treesize of output 196 [2024-11-14 03:04:51,408 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:04:51,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [318527648] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:04:51,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1598902846] [2024-11-14 03:04:51,409 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2024-11-14 03:04:51,409 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:04:51,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 18] total 51 [2024-11-14 03:04:51,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932078997] [2024-11-14 03:04:51,410 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:04:51,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-14 03:04:51,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:04:51,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-14 03:04:51,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=277, Invalid=2375, Unknown=0, NotChecked=0, Total=2652 [2024-11-14 03:04:51,411 INFO L87 Difference]: Start difference. First operand 1603 states and 5466 transitions. Second operand has 52 states, 52 states have (on average 1.8076923076923077) internal successors, (94), 51 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:04:59,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:04:59,873 INFO L93 Difference]: Finished difference Result 2748 states and 9233 transitions. [2024-11-14 03:04:59,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-11-14 03:04:59,874 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 1.8076923076923077) internal successors, (94), 51 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2024-11-14 03:04:59,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:04:59,880 INFO L225 Difference]: With dead ends: 2748 [2024-11-14 03:04:59,880 INFO L226 Difference]: Without dead ends: 2741 [2024-11-14 03:04:59,880 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1363 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=512, Invalid=4318, Unknown=0, NotChecked=0, Total=4830 [2024-11-14 03:04:59,881 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 301 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 3984 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 4030 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 3984 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2024-11-14 03:04:59,881 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 32 Invalid, 4030 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 3984 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2024-11-14 03:04:59,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2741 states. [2024-11-14 03:05:00,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2741 to 1631. [2024-11-14 03:05:00,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1631 states, 1630 states have (on average 3.392638036809816) internal successors, (5530), 1630 states have internal predecessors, (5530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:05:00,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1631 states to 1631 states and 5530 transitions. [2024-11-14 03:05:00,739 INFO L78 Accepts]: Start accepts. Automaton has 1631 states and 5530 transitions. Word has length 36 [2024-11-14 03:05:00,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:05:00,739 INFO L471 AbstractCegarLoop]: Abstraction has 1631 states and 5530 transitions. [2024-11-14 03:05:00,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 1.8076923076923077) internal successors, (94), 51 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:05:00,740 INFO L276 IsEmpty]: Start isEmpty. Operand 1631 states and 5530 transitions. [2024-11-14 03:05:00,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-14 03:05:00,745 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:05:00,745 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:05:00,765 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2024-11-14 03:05:00,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-14 03:05:00,949 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-14 03:05:00,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:05:00,950 INFO L85 PathProgramCache]: Analyzing trace with hash 434573137, now seen corresponding path program 5 times [2024-11-14 03:05:00,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:05:00,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946994969] [2024-11-14 03:05:00,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:05:00,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:05:00,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:05:02,789 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:05:02,789 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:05:02,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946994969] [2024-11-14 03:05:02,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946994969] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:05:02,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [539177531] [2024-11-14 03:05:02,790 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 03:05:02,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:05:02,790 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:05:02,791 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:05:02,792 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2024-11-14 03:05:02,939 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-14 03:05:02,939 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 03:05:02,942 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-14 03:05:02,944 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:05:03,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 03:05:04,500 INFO L349 Elim1Store]: treesize reduction 48, result has 54.3 percent of original size [2024-11-14 03:05:04,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 51 treesize of output 71 [2024-11-14 03:05:04,771 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:05:04,771 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:05:09,525 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:05:09,525 INFO L378 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 268 treesize of output 252 [2024-11-14 03:05:09,918 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:05:09,918 INFO L378 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 303 treesize of output 251 [2024-11-14 03:05:09,939 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:05:09,939 INFO L378 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 174 treesize of output 130 [2024-11-14 03:05:10,079 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:05:10,079 INFO L378 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 328 treesize of output 276 [2024-11-14 03:05:10,100 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:05:10,101 INFO L378 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 252 treesize of output 192 [2024-11-14 03:05:10,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:05:10,285 INFO L378 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 230 treesize of output 186 [2024-11-14 03:05:10,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:05:10,299 INFO L378 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 170 treesize of output 110 [2024-11-14 03:05:10,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:05:10,356 INFO L378 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 222 treesize of output 178 [2024-11-14 03:05:10,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:05:10,365 INFO L378 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 178 treesize of output 110 [2024-11-14 03:05:10,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:05:10,406 INFO L378 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 102 [2024-11-14 03:05:10,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:05:10,413 INFO L378 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 50 [2024-11-14 03:05:10,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:05:10,444 INFO L378 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 401 treesize of output 311 [2024-11-14 03:05:10,454 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-14 03:05:10,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:05:10,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:05:10,478 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-14 03:05:10,478 INFO L378 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 230 treesize of output 1 [2024-11-14 03:05:10,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:05:10,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:05:10,501 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-14 03:05:10,501 INFO L378 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 328 treesize of output 1 [2024-11-14 03:05:10,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:05:10,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:05:10,524 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-14 03:05:10,524 INFO L378 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 230 treesize of output 1 [2024-11-14 03:05:10,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:05:10,543 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-14 03:05:10,543 INFO L378 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 180 treesize of output 1 [2024-11-14 03:05:10,547 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:05:10,548 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:05:10,551 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-14 03:05:10,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:05:10,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:05:10,574 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-14 03:05:10,574 INFO L378 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 124 treesize of output 1 [2024-11-14 03:05:10,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:05:10,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:05:10,597 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-14 03:05:10,597 INFO L378 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 401 treesize of output 1 [2024-11-14 03:05:10,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:05:10,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:05:10,615 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-14 03:05:10,615 INFO L378 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 222 treesize of output 1 [2024-11-14 03:05:10,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:05:10,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:05:10,632 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-14 03:05:10,633 INFO L378 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 124 treesize of output 1 [2024-11-14 03:05:10,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:05:10,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:05:10,650 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-14 03:05:10,650 INFO L378 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 303 treesize of output 1 [2024-11-14 03:05:10,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:05:10,668 INFO L349 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2024-11-14 03:05:10,668 INFO L378 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 172 treesize of output 1 [2024-11-14 03:05:10,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:05:10,684 INFO L378 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 50 [2024-11-14 03:05:11,122 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:05:11,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [539177531] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:05:11,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1350052872] [2024-11-14 03:05:11,123 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2024-11-14 03:05:11,123 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:05:11,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 18] total 55 [2024-11-14 03:05:11,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559988202] [2024-11-14 03:05:11,123 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:05:11,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2024-11-14 03:05:11,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:05:11,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2024-11-14 03:05:11,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=2848, Unknown=1, NotChecked=0, Total=3080 [2024-11-14 03:05:11,125 INFO L87 Difference]: Start difference. First operand 1631 states and 5530 transitions. Second operand has 56 states, 56 states have (on average 1.8214285714285714) internal successors, (102), 55 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:05:46,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:05:46,743 INFO L93 Difference]: Finished difference Result 4705 states and 15943 transitions. [2024-11-14 03:05:46,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 164 states. [2024-11-14 03:05:46,743 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 56 states have (on average 1.8214285714285714) internal successors, (102), 55 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2024-11-14 03:05:46,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:05:46,754 INFO L225 Difference]: With dead ends: 4705 [2024-11-14 03:05:46,754 INFO L226 Difference]: Without dead ends: 4693 [2024-11-14 03:05:46,757 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11990 ImplicationChecksByTransitivity, 20.6s TimeCoverageRelationStatistics Valid=3174, Invalid=34655, Unknown=1, NotChecked=0, Total=37830 [2024-11-14 03:05:46,757 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 810 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 13418 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 810 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 13567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 13418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.3s IncrementalHoareTripleChecker+Time [2024-11-14 03:05:46,758 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [810 Valid, 221 Invalid, 13567 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [149 Valid, 13418 Invalid, 0 Unknown, 0 Unchecked, 16.3s Time] [2024-11-14 03:05:46,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4693 states. [2024-11-14 03:05:47,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4693 to 1894. [2024-11-14 03:05:47,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1894 states, 1893 states have (on average 3.438985736925515) internal successors, (6510), 1893 states have internal predecessors, (6510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:05:47,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1894 states to 1894 states and 6510 transitions. [2024-11-14 03:05:47,818 INFO L78 Accepts]: Start accepts. Automaton has 1894 states and 6510 transitions. Word has length 36 [2024-11-14 03:05:47,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:05:47,819 INFO L471 AbstractCegarLoop]: Abstraction has 1894 states and 6510 transitions. [2024-11-14 03:05:47,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 1.8214285714285714) internal successors, (102), 55 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:05:47,819 INFO L276 IsEmpty]: Start isEmpty. Operand 1894 states and 6510 transitions. [2024-11-14 03:05:47,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-14 03:05:47,822 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:05:47,822 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:05:47,836 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2024-11-14 03:05:48,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-14 03:05:48,022 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-14 03:05:48,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:05:48,023 INFO L85 PathProgramCache]: Analyzing trace with hash -200072025, now seen corresponding path program 6 times [2024-11-14 03:05:48,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:05:48,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178502968] [2024-11-14 03:05:48,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:05:48,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:05:48,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:05:50,162 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:05:50,162 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:05:50,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178502968] [2024-11-14 03:05:50,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178502968] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:05:50,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2081115] [2024-11-14 03:05:50,162 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-14 03:05:50,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:05:50,162 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:05:50,164 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:05:50,165 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2024-11-14 03:05:50,303 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-14 03:05:50,303 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 03:05:50,305 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 65 conjuncts are in the unsatisfiable core [2024-11-14 03:05:50,308 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:05:50,318 INFO L378 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 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 03:05:50,427 INFO L378 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 19 treesize of output 1 [2024-11-14 03:05:50,495 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 03:05:50,495 INFO L378 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 11 treesize of output 11 [2024-11-14 03:05:50,570 INFO L378 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 8 treesize of output 1 [2024-11-14 03:05:50,634 INFO L378 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 19 treesize of output 1 [2024-11-14 03:05:51,714 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:05:51,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 15 [2024-11-14 03:05:51,731 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:05:51,731 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:05:55,114 INFO L349 Elim1Store]: treesize reduction 28, result has 64.1 percent of original size [2024-11-14 03:05:55,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 236 treesize of output 201 [2024-11-14 03:05:57,842 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 03:05:57,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2081115] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:05:57,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1413555445] [2024-11-14 03:05:57,842 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2024-11-14 03:05:57,843 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:05:57,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17, 15] total 48 [2024-11-14 03:05:57,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116763453] [2024-11-14 03:05:57,843 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:05:57,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-11-14 03:05:57,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:05:57,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-11-14 03:05:57,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=2164, Unknown=1, NotChecked=0, Total=2352 [2024-11-14 03:05:57,844 INFO L87 Difference]: Start difference. First operand 1894 states and 6510 transitions. Second operand has 49 states, 49 states have (on average 1.816326530612245) internal successors, (89), 48 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:06:10,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:06:10,419 INFO L93 Difference]: Finished difference Result 3275 states and 10972 transitions. [2024-11-14 03:06:10,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-11-14 03:06:10,419 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.816326530612245) internal successors, (89), 48 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2024-11-14 03:06:10,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:06:10,428 INFO L225 Difference]: With dead ends: 3275 [2024-11-14 03:06:10,428 INFO L226 Difference]: Without dead ends: 3268 [2024-11-14 03:06:10,429 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1382 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=486, Invalid=5365, Unknown=1, NotChecked=0, Total=5852 [2024-11-14 03:06:10,430 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 637 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 3048 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 637 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 3092 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 3048 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2024-11-14 03:06:10,430 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [637 Valid, 48 Invalid, 3092 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 3048 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2024-11-14 03:06:10,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3268 states. [2024-11-14 03:06:11,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3268 to 1918. [2024-11-14 03:06:11,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1918 states, 1917 states have (on average 3.444966092853417) internal successors, (6604), 1917 states have internal predecessors, (6604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:06:11,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1918 states to 1918 states and 6604 transitions. [2024-11-14 03:06:11,502 INFO L78 Accepts]: Start accepts. Automaton has 1918 states and 6604 transitions. Word has length 36 [2024-11-14 03:06:11,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:06:11,502 INFO L471 AbstractCegarLoop]: Abstraction has 1918 states and 6604 transitions. [2024-11-14 03:06:11,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 1.816326530612245) internal successors, (89), 48 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:06:11,502 INFO L276 IsEmpty]: Start isEmpty. Operand 1918 states and 6604 transitions. [2024-11-14 03:06:11,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-14 03:06:11,505 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:06:11,506 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:06:11,519 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2024-11-14 03:06:11,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:06:11,706 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-14 03:06:11,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:06:11,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1266620347, now seen corresponding path program 7 times [2024-11-14 03:06:11,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:06:11,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909213002] [2024-11-14 03:06:11,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:06:11,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:06:11,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:06:13,993 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:06:13,993 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:06:13,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909213002] [2024-11-14 03:06:13,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909213002] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:06:13,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [693216346] [2024-11-14 03:06:13,993 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-14 03:06:13,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:06:13,993 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:06:13,995 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:06:13,996 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2024-11-14 03:06:14,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:06:14,135 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-14 03:06:14,136 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:06:14,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 03:06:15,846 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:06:15,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 31 [2024-11-14 03:06:15,883 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:06:15,883 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:06:16,969 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:06:16,969 INFO L378 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 272 treesize of output 256 [2024-11-14 03:06:17,337 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:06:17,338 INFO L378 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 303 treesize of output 251 [2024-11-14 03:06:17,354 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:06:17,354 INFO L378 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 174 treesize of output 130 [2024-11-14 03:06:17,955 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:06:17,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [693216346] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:06:17,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1690101548] [2024-11-14 03:06:17,956 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2024-11-14 03:06:17,956 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:06:17,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 17, 16] total 51 [2024-11-14 03:06:17,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604231854] [2024-11-14 03:06:17,957 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:06:17,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-14 03:06:17,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:06:17,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-14 03:06:17,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=2424, Unknown=0, NotChecked=0, Total=2652 [2024-11-14 03:06:17,958 INFO L87 Difference]: Start difference. First operand 1918 states and 6604 transitions. Second operand has 52 states, 52 states have (on average 1.8269230769230769) internal successors, (95), 51 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:06:40,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:06:40,137 INFO L93 Difference]: Finished difference Result 3717 states and 12417 transitions. [2024-11-14 03:06:40,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2024-11-14 03:06:40,137 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 1.8269230769230769) internal successors, (95), 51 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2024-11-14 03:06:40,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:06:40,145 INFO L225 Difference]: With dead ends: 3717 [2024-11-14 03:06:40,146 INFO L226 Difference]: Without dead ends: 3710 [2024-11-14 03:06:40,147 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4306 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=1238, Invalid=13524, Unknown=0, NotChecked=0, Total=14762 [2024-11-14 03:06:40,147 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 738 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 8186 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 738 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 8269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 8186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.0s IncrementalHoareTripleChecker+Time [2024-11-14 03:06:40,147 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [738 Valid, 58 Invalid, 8269 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [83 Valid, 8186 Invalid, 0 Unknown, 0 Unchecked, 11.0s Time] [2024-11-14 03:06:40,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3710 states. [2024-11-14 03:06:41,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3710 to 1926. [2024-11-14 03:06:41,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1926 states, 1925 states have (on average 3.4545454545454546) internal successors, (6650), 1925 states have internal predecessors, (6650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:06:41,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1926 states to 1926 states and 6650 transitions. [2024-11-14 03:06:41,352 INFO L78 Accepts]: Start accepts. Automaton has 1926 states and 6650 transitions. Word has length 36 [2024-11-14 03:06:41,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:06:41,352 INFO L471 AbstractCegarLoop]: Abstraction has 1926 states and 6650 transitions. [2024-11-14 03:06:41,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 1.8269230769230769) internal successors, (95), 51 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:06:41,352 INFO L276 IsEmpty]: Start isEmpty. Operand 1926 states and 6650 transitions. [2024-11-14 03:06:41,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-14 03:06:41,355 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:06:41,355 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:06:41,376 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2024-11-14 03:06:41,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:06:41,556 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-14 03:06:41,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:06:41,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1231061162, now seen corresponding path program 21 times [2024-11-14 03:06:41,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:06:41,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278791075] [2024-11-14 03:06:41,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:06:41,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:06:41,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:06:43,826 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:06:43,826 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:06:43,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278791075] [2024-11-14 03:06:43,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278791075] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:06:43,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1239904478] [2024-11-14 03:06:43,826 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-14 03:06:43,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:06:43,827 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:06:43,829 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:06:43,830 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2024-11-14 03:06:43,977 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-14 03:06:43,977 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 03:06:43,979 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-11-14 03:06:43,981 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:06:44,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 03:06:45,237 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:06:45,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 31 [2024-11-14 03:06:45,257 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:06:45,257 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:06:46,160 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 03:06:46,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1239904478] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:06:46,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1484115951] [2024-11-14 03:06:46,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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2024-11-14 03:06:46,160 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:06:46,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 12] total 43 [2024-11-14 03:06:46,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755949565] [2024-11-14 03:06:46,161 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:06:46,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-11-14 03:06:46,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:06:46,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-11-14 03:06:46,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1736, Unknown=0, NotChecked=0, Total=1892 [2024-11-14 03:06:46,162 INFO L87 Difference]: Start difference. First operand 1926 states and 6650 transitions. Second operand has 44 states, 44 states have (on average 2.159090909090909) internal successors, (95), 43 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:07:01,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:07:01,618 INFO L93 Difference]: Finished difference Result 3969 states and 13485 transitions. [2024-11-14 03:07:01,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2024-11-14 03:07:01,619 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 2.159090909090909) internal successors, (95), 43 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2024-11-14 03:07:01,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:07:01,629 INFO L225 Difference]: With dead ends: 3969 [2024-11-14 03:07:01,629 INFO L226 Difference]: Without dead ends: 3962 [2024-11-14 03:07:01,631 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2699 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=1051, Invalid=8651, Unknown=0, NotChecked=0, Total=9702 [2024-11-14 03:07:01,631 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 577 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 4634 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 577 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 4710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 4634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2024-11-14 03:07:01,632 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [577 Valid, 74 Invalid, 4710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 4634 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2024-11-14 03:07:01,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3962 states. [2024-11-14 03:07:02,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3962 to 1941. [2024-11-14 03:07:02,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1941 states, 1940 states have (on average 3.4520618556701033) internal successors, (6697), 1940 states have internal predecessors, (6697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:07:02,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1941 states to 1941 states and 6697 transitions. [2024-11-14 03:07:02,963 INFO L78 Accepts]: Start accepts. Automaton has 1941 states and 6697 transitions. Word has length 36 [2024-11-14 03:07:02,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:07:02,963 INFO L471 AbstractCegarLoop]: Abstraction has 1941 states and 6697 transitions. [2024-11-14 03:07:02,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 2.159090909090909) internal successors, (95), 43 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:07:02,963 INFO L276 IsEmpty]: Start isEmpty. Operand 1941 states and 6697 transitions. [2024-11-14 03:07:02,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-14 03:07:02,966 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:07:02,966 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:07:02,979 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2024-11-14 03:07:03,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:07:03,167 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-14 03:07:03,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:07:03,167 INFO L85 PathProgramCache]: Analyzing trace with hash -989831223, now seen corresponding path program 8 times [2024-11-14 03:07:03,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:07:03,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599485917] [2024-11-14 03:07:03,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:07:03,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:07:03,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:07:05,379 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:07:05,379 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:07:05,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599485917] [2024-11-14 03:07:05,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599485917] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:07:05,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1552858662] [2024-11-14 03:07:05,380 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 03:07:05,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:07:05,380 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:07:05,381 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:07:05,382 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2024-11-14 03:07:05,528 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-14 03:07:05,528 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 03:07:05,530 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-14 03:07:05,531 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:07:05,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 03:07:07,224 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:07:07,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 31 [2024-11-14 03:07:07,257 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:07:07,257 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:07:08,399 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:07:08,399 INFO L378 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 272 treesize of output 256 [2024-11-14 03:07:08,827 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:07:08,828 INFO L378 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 230 treesize of output 198 [2024-11-14 03:07:08,846 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:07:08,846 INFO L378 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 190 treesize of output 134 [2024-11-14 03:07:08,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:07:08,987 INFO L378 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 303 treesize of output 235 [2024-11-14 03:07:08,995 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-14 03:07:09,022 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:07:09,022 INFO L378 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 303 treesize of output 251 [2024-11-14 03:07:09,043 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:07:09,043 INFO L378 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 190 treesize of output 134 [2024-11-14 03:07:09,529 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:07:09,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1552858662] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:07:09,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [449856362] [2024-11-14 03:07:09,530 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2024-11-14 03:07:09,530 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:07:09,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 17, 16] total 52 [2024-11-14 03:07:09,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974340881] [2024-11-14 03:07:09,530 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:07:09,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2024-11-14 03:07:09,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:07:09,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2024-11-14 03:07:09,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=2525, Unknown=0, NotChecked=0, Total=2756 [2024-11-14 03:07:09,531 INFO L87 Difference]: Start difference. First operand 1941 states and 6697 transitions. Second operand has 53 states, 53 states have (on average 1.7924528301886793) internal successors, (95), 52 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:08:07,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:08:07,049 INFO L93 Difference]: Finished difference Result 5886 states and 19865 transitions. [2024-11-14 03:08:07,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 229 states. [2024-11-14 03:08:07,050 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 1.7924528301886793) internal successors, (95), 52 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2024-11-14 03:08:07,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:08:07,065 INFO L225 Difference]: With dead ends: 5886 [2024-11-14 03:08:07,065 INFO L226 Difference]: Without dead ends: 5874 [2024-11-14 03:08:07,068 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 261 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25975 ImplicationChecksByTransitivity, 31.0s TimeCoverageRelationStatistics Valid=4770, Invalid=64136, Unknown=0, NotChecked=0, Total=68906 [2024-11-14 03:08:07,069 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 1077 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 14501 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1077 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 14707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 14501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.7s IncrementalHoareTripleChecker+Time [2024-11-14 03:08:07,069 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1077 Valid, 154 Invalid, 14707 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [206 Valid, 14501 Invalid, 0 Unknown, 0 Unchecked, 20.7s Time] [2024-11-14 03:08:07,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5874 states. [2024-11-14 03:08:08,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5874 to 2053. [2024-11-14 03:08:08,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2053 states, 2052 states have (on average 3.4975633528265107) internal successors, (7177), 2052 states have internal predecessors, (7177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:08:08,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2053 states to 2053 states and 7177 transitions. [2024-11-14 03:08:08,697 INFO L78 Accepts]: Start accepts. Automaton has 2053 states and 7177 transitions. Word has length 36 [2024-11-14 03:08:08,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:08:08,697 INFO L471 AbstractCegarLoop]: Abstraction has 2053 states and 7177 transitions. [2024-11-14 03:08:08,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 1.7924528301886793) internal successors, (95), 52 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:08:08,697 INFO L276 IsEmpty]: Start isEmpty. Operand 2053 states and 7177 transitions. [2024-11-14 03:08:08,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-14 03:08:08,701 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:08:08,701 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:08:08,717 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2024-11-14 03:08:08,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:08:08,902 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-14 03:08:08,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:08:08,902 INFO L85 PathProgramCache]: Analyzing trace with hash 2142491630, now seen corresponding path program 22 times [2024-11-14 03:08:08,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:08:08,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046331559] [2024-11-14 03:08:08,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:08:08,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:08:08,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:08:10,752 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 03:08:10,752 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:08:10,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046331559] [2024-11-14 03:08:10,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046331559] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:08:10,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1592881404] [2024-11-14 03:08:10,753 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-14 03:08:10,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:08:10,753 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:08:10,755 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:08:10,756 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2024-11-14 03:08:10,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:08:10,919 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-11-14 03:08:10,922 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:08:11,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 03:08:12,575 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:08:12,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 31 [2024-11-14 03:08:12,592 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:08:12,592 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:08:13,665 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 03:08:13,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1592881404] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:08:13,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [607999627] [2024-11-14 03:08:13,665 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2024-11-14 03:08:13,666 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:08:13,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 12] total 43 [2024-11-14 03:08:13,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447723341] [2024-11-14 03:08:13,666 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:08:13,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-11-14 03:08:13,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:08:13,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-11-14 03:08:13,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1728, Unknown=0, NotChecked=0, Total=1892 [2024-11-14 03:08:13,668 INFO L87 Difference]: Start difference. First operand 2053 states and 7177 transitions. Second operand has 44 states, 44 states have (on average 2.159090909090909) internal successors, (95), 43 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:08:42,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:08:42,138 INFO L93 Difference]: Finished difference Result 5255 states and 18183 transitions. [2024-11-14 03:08:42,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2024-11-14 03:08:42,139 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 2.159090909090909) internal successors, (95), 43 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2024-11-14 03:08:42,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:08:42,155 INFO L225 Difference]: With dead ends: 5255 [2024-11-14 03:08:42,155 INFO L226 Difference]: Without dead ends: 5248 [2024-11-14 03:08:42,156 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4617 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=1759, Invalid=13493, Unknown=0, NotChecked=0, Total=15252 [2024-11-14 03:08:42,157 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 807 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 5521 mSolverCounterSat, 223 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 807 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 5744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 223 IncrementalHoareTripleChecker+Valid, 5521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.4s IncrementalHoareTripleChecker+Time [2024-11-14 03:08:42,157 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [807 Valid, 144 Invalid, 5744 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [223 Valid, 5521 Invalid, 0 Unknown, 0 Unchecked, 9.4s Time] [2024-11-14 03:08:42,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5248 states. [2024-11-14 03:08:43,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5248 to 2067. [2024-11-14 03:08:43,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2067 states, 2066 states have (on average 3.5038722168441434) internal successors, (7239), 2066 states have internal predecessors, (7239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:08:43,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2067 states to 2067 states and 7239 transitions. [2024-11-14 03:08:43,935 INFO L78 Accepts]: Start accepts. Automaton has 2067 states and 7239 transitions. Word has length 36 [2024-11-14 03:08:43,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:08:43,935 INFO L471 AbstractCegarLoop]: Abstraction has 2067 states and 7239 transitions. [2024-11-14 03:08:43,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 2.159090909090909) internal successors, (95), 43 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:08:43,935 INFO L276 IsEmpty]: Start isEmpty. Operand 2067 states and 7239 transitions. [2024-11-14 03:08:43,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-14 03:08:43,938 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:08:43,938 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:08:43,955 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2024-11-14 03:08:44,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2024-11-14 03:08:44,139 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-14 03:08:44,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:08:44,139 INFO L85 PathProgramCache]: Analyzing trace with hash -597048192, now seen corresponding path program 23 times [2024-11-14 03:08:44,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:08:44,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592373856] [2024-11-14 03:08:44,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:08:44,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:08:44,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:08:46,026 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 03:08:46,027 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:08:46,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592373856] [2024-11-14 03:08:46,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592373856] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:08:46,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1747226388] [2024-11-14 03:08:46,027 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 03:08:46,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:08:46,027 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:08:46,029 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:08:46,031 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2024-11-14 03:08:46,205 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-14 03:08:46,206 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 03:08:46,208 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-11-14 03:08:46,210 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:08:46,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 03:08:48,232 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:08:48,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 31 [2024-11-14 03:08:48,252 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:08:48,252 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:08:51,965 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:08:51,965 INFO L378 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 268 treesize of output 252 [2024-11-14 03:08:52,364 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:08:52,364 INFO L378 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 124 treesize of output 112 [2024-11-14 03:08:52,386 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:08:52,386 INFO L378 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 90 treesize of output 68 [2024-11-14 03:08:52,530 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-14 03:08:52,530 INFO L378 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 222 treesize of output 185 [2024-11-14 03:08:52,540 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:08:52,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 182 treesize of output 126 [2024-11-14 03:08:52,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:08:52,602 INFO L378 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 328 treesize of output 262 [2024-11-14 03:08:52,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:08:52,619 INFO L378 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 262 treesize of output 170 [2024-11-14 03:08:52,685 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:08:52,686 INFO L378 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 230 treesize of output 198 [2024-11-14 03:08:52,709 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:08:52,710 INFO L378 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 174 treesize of output 130 [2024-11-14 03:08:53,191 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:08:53,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1747226388] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:08:53,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [155357651] [2024-11-14 03:08:53,192 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2024-11-14 03:08:53,192 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:08:53,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 20, 18] total 51 [2024-11-14 03:08:53,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292489483] [2024-11-14 03:08:53,192 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:08:53,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-14 03:08:53,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:08:53,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-14 03:08:53,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=2388, Unknown=1, NotChecked=0, Total=2652 [2024-11-14 03:08:53,195 INFO L87 Difference]: Start difference. First operand 2067 states and 7239 transitions. Second operand has 52 states, 52 states have (on average 1.8653846153846154) internal successors, (97), 51 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:09:28,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:09:28,068 INFO L93 Difference]: Finished difference Result 4519 states and 15162 transitions. [2024-11-14 03:09:28,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2024-11-14 03:09:28,068 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 1.8653846153846154) internal successors, (97), 51 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2024-11-14 03:09:28,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:09:28,079 INFO L225 Difference]: With dead ends: 4519 [2024-11-14 03:09:28,079 INFO L226 Difference]: Without dead ends: 4502 [2024-11-14 03:09:28,080 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6196 ImplicationChecksByTransitivity, 20.8s TimeCoverageRelationStatistics Valid=2416, Invalid=17605, Unknown=1, NotChecked=0, Total=20022 [2024-11-14 03:09:28,080 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 771 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 5886 mSolverCounterSat, 175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 771 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 6061 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 5886 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.5s IncrementalHoareTripleChecker+Time [2024-11-14 03:09:28,081 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [771 Valid, 46 Invalid, 6061 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [175 Valid, 5886 Invalid, 0 Unknown, 0 Unchecked, 12.5s Time] [2024-11-14 03:09:28,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4502 states. [2024-11-14 03:09:30,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4502 to 2100. [2024-11-14 03:09:30,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2100 states, 2099 states have (on average 3.5064316341114816) internal successors, (7360), 2099 states have internal predecessors, (7360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:09:30,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2100 states to 2100 states and 7360 transitions. [2024-11-14 03:09:30,018 INFO L78 Accepts]: Start accepts. Automaton has 2100 states and 7360 transitions. Word has length 36 [2024-11-14 03:09:30,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:09:30,018 INFO L471 AbstractCegarLoop]: Abstraction has 2100 states and 7360 transitions. [2024-11-14 03:09:30,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 1.8653846153846154) internal successors, (97), 51 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:09:30,018 INFO L276 IsEmpty]: Start isEmpty. Operand 2100 states and 7360 transitions. [2024-11-14 03:09:30,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-14 03:09:30,021 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:09:30,021 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:09:30,036 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2024-11-14 03:09:30,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2024-11-14 03:09:30,222 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-14 03:09:30,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:09:30,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1034707648, now seen corresponding path program 24 times [2024-11-14 03:09:30,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:09:30,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976438513] [2024-11-14 03:09:30,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:09:30,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:09:30,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:09:33,002 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:09:33,002 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:09:33,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976438513] [2024-11-14 03:09:33,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976438513] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:09:33,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [486818323] [2024-11-14 03:09:33,002 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-14 03:09:33,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:09:33,002 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:09:33,004 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:09:33,005 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ea337b7-da8b-4508-8168-522ba8abd5ac/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2024-11-14 03:09:33,157 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-14 03:09:33,157 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 03:09:33,159 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-14 03:09:33,161 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:09:33,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 03:09:35,007 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:09:35,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 31 [2024-11-14 03:09:35,029 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:09:35,029 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:09:36,538 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:09:36,539 INFO L378 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 1776 treesize of output 1592 [2024-11-14 03:09:47,416 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:09:47,419 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:09:47,429 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:09:47,434 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:09:47,873 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:09:47,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 6 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 22 case distinctions, treesize of input 3352 treesize of output 1966 [2024-11-14 03:09:54,489 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:09:54,614 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:09:54,697 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:09:55,154 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:09:55,250 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:09:55,926 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:09:55,956 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:09:56,127 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:09:56,469 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:09:56,582 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:09:56,763 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:09:56,886 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:09:57,093 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:09:57,128 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:09:57,247 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:09:57,369 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:09:57,482 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2024-11-14 03:09:57,845 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:09:57,894 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:09:57,955 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:09:58,094 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:09:58,213 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:09:58,387 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:09:58,472 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:09:58,701 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:09:58,794 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:09:58,992 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:09:59,107 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:09:59,440 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:09:59,705 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:10:00,116 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:10:00,212 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:10:00,320 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:10:00,434 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:10:01,118 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:10:01,219 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:10:01,327 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:10:02,631 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:10:02,719 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:10:03,239 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:10:03,677 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:10:03,688 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:10:03,783 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:10:03,802 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:10:03,843 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:10:03,889 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:10:03,921 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:10:04,003 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:10:04,021 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:10:04,059 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:10:04,078 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:10:04,112 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:10:04,151 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:10:04,184 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:10:04,212 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:10:04,228 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:10:04,269 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:10:04,322 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:10:04,537 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:10:04,695 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:10:05,242 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:10:05,264 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:10:05,389 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:10:05,459 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:10:05,531 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:10:05,643 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2024-11-14 03:10:05,868 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:10:05,977 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:10:06,011 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:10:06,071 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:10:06,088 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:10:06,156 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:10:06,182 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:10:06,214 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:10:06,248 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:10:06,329 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:10:06,362 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:10:06,577 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:10:06,689 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:10:06,873 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:10:07,108 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:10:07,236 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:10:07,344 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:10:07,430 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:10:07,679 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:10:07,701 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:10:07,728 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:10:07,772 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:10:07,797 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:10:07,874 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:10:07,886 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:10:07,960 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:10:08,016 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:10:08,054 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:10:08,071 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:10:08,123 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:10:08,204 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:10:08,243 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:10:08,293 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:10:08,310 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:10:08,322 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:10:08,409 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:10:08,423 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:10:08,434 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:10:08,497 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:10:08,514 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:10:08,558 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:10:08,586 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:10:08,928 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:10:09,032 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:10:09,145 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2024-11-14 03:10:09,316 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:10:09,460 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:10:09,597 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:10:10,019 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:10:10,132 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:10:10,257 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2024-11-14 03:10:10,384 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:10:10,507 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:10:10,622 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:10:10,926 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:10:11,043 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:10:11,112 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2024-11-14 03:10:11,250 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2024-11-14 03:10:11,372 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:10:11,481 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:10:11,625 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:10:12,096 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:10:12,181 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:10:12,471 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:10:12,649 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2024-11-14 03:10:12,799 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:10:12,933 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2024-11-14 03:10:13,033 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2024-11-14 03:10:13,199 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2024-11-14 03:10:13,343 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:10:13,371 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:10:13,463 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:10:13,574 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2024-11-14 03:10:13,702 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2024-11-14 03:10:13,929 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:10:13,949 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:10:13,971 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:10:14,112 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:10:14,265 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2024-11-14 03:10:14,425 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2024-11-14 03:10:14,545 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:10:14,663 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2024-11-14 03:10:14,809 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2024-11-14 03:10:15,148 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2024-11-14 03:10:15,306 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:10:15,387 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2024-11-14 03:10:15,478 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2024-11-14 03:10:15,623 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2024-11-14 03:10:15,781 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:10:15,814 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:10:15,921 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2024-11-14 03:10:16,062 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2024-11-14 03:10:16,186 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:10:16,506 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2024-11-14 03:10:16,625 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2024-11-14 03:10:16,731 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2024-11-14 03:10:16,945 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:10:16,980 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:10:17,108 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:10:17,224 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:10:17,334 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:10:17,823 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:10:17,953 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2024-11-14 03:10:18,070 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:10:18,263 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:10:18,407 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:10:18,487 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2024-11-14 03:10:18,616 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2024-11-14 03:10:18,757 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2024-11-14 03:10:18,916 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2024-11-14 03:10:19,020 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2024-11-14 03:10:19,175 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2024-11-14 03:10:19,318 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2024-11-14 03:10:19,465 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:10:19,631 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:10:19,755 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:10:20,022 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:10:20,142 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:10:20,716 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:10:20,793 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2024-11-14 03:10:20,949 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2024-11-14 03:10:21,104 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2024-11-14 03:10:21,271 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2024-11-14 03:10:21,404 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:10:21,555 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:10:21,742 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:10:21,796 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2024-11-14 03:10:21,966 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2024-11-14 03:10:22,113 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2024-11-14 03:10:22,257 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2024-11-14 03:10:22,366 WARN L672 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2024-11-14 03:10:22,515 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2024-11-14 03:10:22,635 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2024-11-14 03:10:22,751 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2024-11-14 03:10:22,903 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2024-11-14 03:10:23,231 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2024-11-14 03:10:23,375 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2024-11-14 03:10:23,526 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2024-11-14 03:10:23,642 WARN L672 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2024-11-14 03:10:23,785 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2024-11-14 03:10:23,951 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2024-11-14 03:10:24,103 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2024-11-14 03:10:24,230 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2024-11-14 03:10:24,398 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:10:24,453 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2024-11-14 03:10:24,799 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:10:24,923 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2024-11-14 03:10:25,048 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2024-11-14 03:10:25,186 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:10:25,395 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2024-11-14 03:10:25,513 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2024-11-14 03:10:25,628 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:10:25,883 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:10:26,011 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:10:26,140 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2024-11-14 03:10:26,236 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2024-11-14 03:10:26,358 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2024-11-14 03:10:26,490 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:10:26,558 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:10:26,680 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:10:27,030 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:10:27,144 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:10:27,263 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2024-11-14 03:10:27,363 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2024-11-14 03:10:27,485 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2024-11-14 03:10:27,609 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:10:27,663 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:10:27,769 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:10:28,231 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:10:28,677 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:10:28,786 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:10:28,888 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:10:28,977 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:10:29,061 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:10:29,121 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:10:29,544 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:10:29,560 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:10:29,585 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:10:29,618 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:10:29,655 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:10:29,686 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:10:29,737 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:10:29,766 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:10:29,780 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:10:29,857 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:10:29,963 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:10:29,992 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:10:30,007 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:10:30,053 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:10:30,780 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:10:30,848 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:10:31,413 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2024-11-14 03:10:31,644 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2024-11-14 03:10:31,833 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2024-11-14 03:10:31,993 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2024-11-14 03:10:32,211 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2024-11-14 03:10:32,375 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2024-11-14 03:10:32,780 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2024-11-14 03:10:32,912 WARN L672 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2024-11-14 03:10:33,146 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:10:33,285 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2024-11-14 03:10:33,384 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2024-11-14 03:10:33,532 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2024-11-14 03:10:33,621 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2024-11-14 03:10:33,754 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2024-11-14 03:10:33,892 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2024-11-14 03:10:34,025 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2024-11-14 03:10:34,469 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:10:34,658 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2024-11-14 03:10:34,843 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2024-11-14 03:10:35,014 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2024-11-14 03:10:35,167 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2024-11-14 03:10:35,295 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2024-11-14 03:10:35,492 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2024-11-14 03:10:35,636 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2024-11-14 03:10:35,824 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2024-11-14 03:10:35,993 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:10:36,115 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:10:36,231 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2024-11-14 03:10:36,352 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:10:36,469 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2024-11-14 03:10:36,585 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2024-11-14 03:10:36,712 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:10:37,416 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:10:37,525 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:10:37,649 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:10:37,728 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:10:37,789 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:10:37,914 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:10:38,063 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:10:38,874 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:10:39,078 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:10:39,194 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:10:39,306 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:10:39,389 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:10:39,503 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:10:39,583 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:10:39,778 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:10:39,824 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:10:39,919 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:10:40,053 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:10:40,146 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2024-11-14 03:10:40,251 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2024-11-14 03:10:40,376 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2024-11-14 03:10:40,490 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2024-11-14 03:10:40,590 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:10:40,757 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:10:40,862 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:10:40,950 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:10:41,043 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:10:41,141 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:10:41,254 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2024-11-14 03:10:41,365 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:10:41,468 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:10:41,479 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:10:41,619 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:10:41,659 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:10:41,725 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:10:42,177 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:10:42,191 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:10:42,215 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:10:42,243 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:10:42,282 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:10:42,313 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:10:42,366 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:10:42,398 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:10:42,409 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:10:42,466 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:10:42,542 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:10:42,561 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:10:42,571 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:10:42,600 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:10:43,028 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:10:43,045 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:10:45,849 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:10:45,897 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:10:45,954 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:10:46,187 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:10:46,257 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:10:46,331 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:10:46,415 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:10:46,485 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:10:46,557 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:10:46,626 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:10:46,707 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:10:46,768 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:10:46,850 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:10:46,922 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:10:46,978 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:10:47,054 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:10:47,112 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:10:47,183 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:10:47,261 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:10:47,358 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:10:47,439 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:10:47,497 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:10:47,568 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:10:47,695 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:10:47,758 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:10:48,311 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:10:48,434 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:10:48,507 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:10:48,588 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:10:48,667 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:10:48,753 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:10:48,831 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:10:48,912 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:10:48,997 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:10:49,079 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:10:49,150 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:10:49,226 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:10:49,290 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:10:49,353 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:10:49,410 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:10:49,544 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:10:49,635 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:10:49,729 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:10:49,810 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:10:49,900 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:10:49,962 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:10:50,262 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:10:50,334 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:10:50,395 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:10:50,486 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:10:50,569 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:10:50,640 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:10:50,735 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:10:50,833 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:10:50,926 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:10:51,019 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2024-11-14 03:10:51,116 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2024-11-14 03:10:51,212 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:10:51,297 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:10:51,377 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2024-11-14 03:10:51,487 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:10:51,678 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2024-11-14 03:10:51,777 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:10:51,855 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2024-11-14 03:10:51,958 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2024-11-14 03:10:52,054 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2024-11-14 03:10:52,166 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:10:52,284 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:10:52,393 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2024-11-14 03:10:52,495 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:10:52,583 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2024-11-14 03:10:52,691 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2024-11-14 03:10:52,792 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2024-11-14 03:10:52,890 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:10:53,027 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:10:53,105 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:10:53,186 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:10:53,287 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:10:53,374 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2024-11-14 03:10:53,470 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2024-11-14 03:10:53,604 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:10:53,680 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:10:53,753 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:10:53,843 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:10:53,927 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2024-11-14 03:10:54,014 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2024-11-14 03:10:54,244 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:10:54,318 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:10:54,381 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:10:54,446 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:10:54,569 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:10:54,664 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:10:54,748 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:10:54,838 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2024-11-14 03:10:54,935 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2024-11-14 03:10:55,019 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:10:55,098 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:10:55,180 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2024-11-14 03:10:55,266 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:10:55,345 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:10:55,424 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2024-11-14 03:10:55,597 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:10:55,673 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:10:55,778 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:10:55,855 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:10:55,950 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:10:56,027 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:10:56,110 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:10:56,204 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:10:56,284 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:10:56,375 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:10:56,455 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:10:56,562 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:10:56,644 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:10:56,758 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:10:56,809 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:10:56,977 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:10:57,040 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:10:57,112 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:10:57,219 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:10:57,293 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:10:57,378 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:10:57,479 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:10:57,552 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:10:57,632 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2024-11-14 03:10:57,721 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:10:57,804 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2024-11-14 03:10:57,896 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:10:58,015 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:10:58,099 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:10:58,183 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2024-11-14 03:10:58,279 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:10:58,362 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2024-11-14 03:10:58,452 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:10:58,570 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:10:58,651 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:10:58,724 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:10:58,824 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:10:58,897 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:10:58,962 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:10:59,077 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:10:59,143 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:10:59,216 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:10:59,292 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:10:59,437 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:10:59,518 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:10:59,597 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:10:59,673 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:10:59,728 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:10:59,823 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:10:59,899 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:03,777 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:03,869 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:11:03,940 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:11:04,042 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:04,136 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:04,217 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:04,382 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:11:04,456 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:11:04,520 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:04,703 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:04,779 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:11:04,872 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:05,029 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:05,125 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:05,226 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:05,340 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:05,436 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:11:05,506 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:11:05,620 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:05,721 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:05,805 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:05,952 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:11:06,040 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:11:06,117 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:06,209 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:11:06,355 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:06,458 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2024-11-14 03:11:06,587 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2024-11-14 03:11:06,719 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:11:06,868 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:06,962 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:07,054 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:07,161 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:11:07,294 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2024-11-14 03:11:07,425 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:11:07,530 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2024-11-14 03:11:07,668 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:07,760 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:07,852 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:07,970 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2024-11-14 03:11:08,088 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2024-11-14 03:11:08,226 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:11:08,349 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2024-11-14 03:11:08,469 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2024-11-14 03:11:08,601 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:11:08,725 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:08,830 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:11:08,940 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:09,059 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2024-11-14 03:11:09,175 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:11:09,329 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:09,454 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:09,595 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:09,697 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:11:09,811 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:09,895 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:09,974 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:10,066 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:10,204 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:10,297 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:10,371 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:11:10,468 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:10,566 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:10,652 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:11:10,778 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2024-11-14 03:11:10,909 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:11,001 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:11:11,106 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2024-11-14 03:11:11,232 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:11:11,340 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:11,445 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:11,523 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:11,680 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:11,776 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:11:11,881 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2024-11-14 03:11:12,046 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:11:12,149 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:12,243 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2024-11-14 03:11:12,439 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:11:12,551 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:12,642 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:12,760 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:12,867 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:11:13,068 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:13,651 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:11:13,724 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:13,864 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:11:13,932 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:14,018 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:14,100 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:14,179 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:14,277 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:14,385 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:11:14,495 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:14,607 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:11:14,666 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:14,745 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:14,828 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:14,953 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:11:15,018 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:11:15,082 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:17,612 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:11:17,714 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2024-11-14 03:11:17,835 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:17,923 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2024-11-14 03:11:18,033 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2024-11-14 03:11:18,151 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:11:18,266 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:11:18,378 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:18,488 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:18,612 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:18,698 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:18,781 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:18,885 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:19,008 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:19,107 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:11:19,234 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:19,411 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:19,504 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:19,604 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:19,702 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:11:19,817 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:19,924 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:11:20,068 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:20,150 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:20,232 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:20,328 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:11:20,493 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:20,576 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:11:20,686 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:20,766 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:20,846 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:20,983 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:11:21,046 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:21,126 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:11:21,249 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:11:21,363 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:21,460 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:21,560 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:21,632 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:21,708 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:21,809 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:21,968 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2024-11-14 03:11:22,085 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2024-11-14 03:11:22,219 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:11:22,345 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:22,429 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:11:22,543 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:22,648 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2024-11-14 03:11:22,768 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2024-11-14 03:11:22,904 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:11:23,028 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:23,110 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:23,192 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:23,347 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2024-11-14 03:11:23,455 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:11:23,552 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:23,641 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2024-11-14 03:11:23,745 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:23,835 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:11:23,947 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:24,064 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:24,161 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2024-11-14 03:11:24,282 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:11:24,392 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2024-11-14 03:11:24,502 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:24,596 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:11:24,778 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:24,873 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:24,956 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:11:25,027 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:25,111 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:11:25,207 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:25,368 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:11:25,524 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:25,595 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:11:25,843 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:25,919 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:11:25,986 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:26,075 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:26,162 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:26,251 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:26,342 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:11:26,439 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:26,511 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:26,602 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:26,695 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:11:26,804 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:26,922 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2024-11-14 03:11:27,027 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:11:27,129 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:11:27,232 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:27,327 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:27,442 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:27,523 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:11:27,633 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:27,736 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:27,834 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:27,926 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:27,998 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:28,112 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:28,189 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:28,268 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:28,365 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:28,484 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:11:28,553 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:28,626 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:11:28,728 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:28,997 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:29,099 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:29,193 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:11:29,288 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:11:29,397 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:11:29,501 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:29,600 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:29,720 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:29,811 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:29,899 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:29,982 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:30,104 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:30,199 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:30,274 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:11:30,342 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:30,419 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:11:30,516 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:30,615 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:30,717 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:11:30,780 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:30,946 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:11:31,502 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:11:31,567 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:31,743 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:11:31,815 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:31,912 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:31,990 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:11:32,087 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:32,179 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:32,268 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:11:32,339 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:32,436 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:32,520 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:32,619 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:32,699 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:32,813 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:11:32,887 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:33,048 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:33,124 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:11:33,188 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:33,280 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:33,439 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:11:33,507 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:33,578 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:11:34,751 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:34,923 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:11:34,989 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:35,068 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:11:35,252 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:35,329 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:35,402 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:11:35,469 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:35,598 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:11:35,672 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:35,775 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:35,864 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:35,961 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:36,042 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:11:36,205 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:11:36,291 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:36,373 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:36,452 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:11:36,515 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:36,599 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:36,683 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:36,766 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:11:36,862 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:37,020 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:11:37,092 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:37,643 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:11:37,809 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:37,892 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:11:37,986 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:11:38,131 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:11:38,227 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:38,296 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:38,380 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:38,475 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:38,559 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:11:38,644 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:11:38,733 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:38,821 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:38,909 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:11:38,984 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:11:39,085 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:39,180 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:39,267 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:39,357 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:39,520 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:39,961 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:40,049 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:40,124 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:40,201 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:40,308 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:40,392 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:11:40,495 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:40,616 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:40,699 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:40,769 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:40,909 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:40,985 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:11:41,077 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2024-11-14 03:11:41,180 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:41,262 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:11:41,369 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:41,476 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:11:41,573 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:41,657 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:41,757 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:41,831 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:11:41,925 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2024-11-14 03:11:42,028 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:42,112 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:42,196 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:11:42,461 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:42,541 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:11:42,635 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:42,758 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:11:42,848 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2024-11-14 03:11:42,952 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2024-11-14 03:11:43,076 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:43,165 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:11:43,256 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:43,349 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:11:43,437 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2024-11-14 03:11:43,542 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2024-11-14 03:11:43,709 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2024-11-14 03:11:43,814 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:43,900 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2024-11-14 03:11:44,017 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2024-11-14 03:11:44,123 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:11:44,230 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:11:44,362 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:11:44,461 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2024-11-14 03:11:44,563 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:44,648 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2024-11-14 03:11:44,762 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2024-11-14 03:11:44,866 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:11:44,958 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:11:45,107 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:11:45,180 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:45,261 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:11:45,356 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:45,499 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:45,574 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:11:45,708 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:45,810 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:45,895 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:45,990 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:46,073 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:46,154 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:11:46,250 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:11:46,349 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:46,429 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:46,522 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:46,591 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:46,659 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:46,740 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:11:46,800 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:46,892 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:11:47,000 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:47,073 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:47,156 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:47,237 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:11:47,325 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:11:47,435 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:11:47,529 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2024-11-14 03:11:47,714 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2024-11-14 03:11:47,816 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:11:47,920 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:48,000 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:48,079 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:48,148 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:48,285 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:48,375 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:48,454 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:48,548 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:48,651 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:48,743 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:11:48,837 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:48,972 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:49,056 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:11:49,148 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:49,232 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:11:49,326 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2024-11-14 03:11:49,435 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:49,537 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:11:49,674 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:49,804 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:49,916 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:11:50,006 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:50,076 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:50,162 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:50,243 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:50,317 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:11:50,392 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:11:55,901 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:11:55,958 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:11:56,028 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:11:56,087 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:11:56,141 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:11:56,200 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:11:56,260 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:56,328 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:56,397 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:56,465 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:56,591 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:11:56,647 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:56,717 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:56,846 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:11:57,075 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:11:57,131 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:57,268 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:57,346 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:11:57,408 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:57,486 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:11:57,553 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:57,622 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:11:57,683 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:57,749 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:11:57,806 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:57,872 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:57,965 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:11:58,077 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:11:58,147 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:58,217 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:11:58,298 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:58,370 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:58,442 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:58,529 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:11:58,589 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:58,676 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:58,764 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:58,851 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:58,923 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:58,998 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:59,079 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:11:59,136 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:59,224 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:11:59,309 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:59,398 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:59,466 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:59,528 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:11:59,595 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:59,677 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:11:59,789 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:11:59,979 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:00,035 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:00,140 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:00,202 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:00,307 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:00,392 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:00,464 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:00,536 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:00,617 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:00,690 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:12:00,759 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:12:00,837 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:00,909 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:12:00,987 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:12:01,103 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:01,176 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:12:01,260 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:12:01,343 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:12:01,422 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:01,483 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:12:01,627 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:12:01,711 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:12:01,805 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:01,891 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:01,963 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:12:02,041 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:12:02,118 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:02,188 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:12:02,270 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:12:02,362 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:02,707 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:02,808 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:02,877 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:02,946 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:12:03,029 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:12:03,108 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:03,168 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:03,237 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:03,306 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:03,384 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:03,449 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:03,542 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:03,611 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:04,859 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:04,917 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:05,013 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:05,174 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:05,267 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:05,325 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:05,377 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:05,437 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:05,496 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:05,548 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:05,663 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:05,767 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:05,835 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:05,905 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:06,012 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:06,079 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:06,147 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:06,199 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:06,249 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:06,320 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:06,457 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:06,535 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:06,602 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:06,860 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:06,954 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:07,014 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:07,298 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:07,348 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:07,510 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:07,570 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:07,660 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:07,713 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:07,764 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:07,818 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:07,895 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:12:07,965 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:08,038 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:08,099 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:08,169 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:08,233 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:08,295 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:08,350 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:12:08,415 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:08,476 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:12:08,539 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:08,596 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:08,662 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:08,721 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:09,136 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:09,220 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:09,274 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:09,348 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:12:09,441 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:12:09,526 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:12:09,613 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:09,870 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:12:09,943 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:12:10,020 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2024-11-14 03:12:10,132 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:12:10,208 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:12:10,294 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:12:10,396 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:12:10,480 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:12:10,554 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:12:10,639 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:10,701 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:12:10,763 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:10,820 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:12:10,900 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:12:10,981 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:12:11,052 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:11,105 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:12:11,225 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:11,281 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:11,345 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:11,435 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2024-11-14 03:12:11,521 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2024-11-14 03:12:11,617 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:12:11,700 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:11,749 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:11,818 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2024-11-14 03:12:11,916 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2024-11-14 03:12:12,010 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:12:12,109 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:12:12,185 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:12:12,270 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2024-11-14 03:12:12,388 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:12,450 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:12,512 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:12:12,593 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2024-11-14 03:12:12,695 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2024-11-14 03:12:12,789 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:12:12,930 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:12:13,016 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:12:13,093 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:12:13,172 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:13,223 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:13,283 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:12:13,354 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:12:13,467 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:13,537 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:12:13,614 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:12:13,701 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:12:13,779 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2024-11-14 03:12:13,868 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:13,934 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:12:14,017 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:12:14,102 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:12:14,184 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:12:14,260 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:12:14,336 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2024-11-14 03:12:14,539 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:12:14,615 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:12:14,701 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2024-11-14 03:12:14,808 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:14,908 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2024-11-14 03:12:15,001 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2024-11-14 03:12:15,111 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:12:15,205 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:12:15,547 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:15,589 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:15,636 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:15,702 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:15,749 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:15,828 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:15,881 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:15,931 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:15,992 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:12:16,085 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:16,145 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:12:16,211 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:12:16,292 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:12:16,364 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:16,418 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:16,479 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:16,537 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:12:17,045 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:17,149 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:17,257 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:17,680 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:17,731 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:17,783 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:17,828 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:17,887 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:17,945 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:18,075 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:18,137 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:18,188 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:18,372 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:18,515 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:18,577 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:18,637 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:18,780 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:18,881 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:18,998 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:19,048 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:19,120 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:19,172 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:19,229 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:19,282 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:19,413 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:19,504 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:19,579 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:19,667 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:19,732 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:19,795 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:19,867 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:19,932 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:20,004 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:20,054 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:20,121 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:20,171 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:20,263 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:20,317 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:20,375 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:20,487 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:20,553 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:20,706 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:20,823 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:20,896 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:20,954 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:21,013 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:21,074 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:21,147 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:21,201 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:21,253 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:21,343 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:21,399 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:21,540 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:21,593 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:21,652 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:21,705 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:21,761 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:21,833 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:21,918 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:21,977 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:22,029 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:22,079 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:22,153 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:22,203 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:25,279 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:12:25,337 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:25,383 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:25,443 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:25,509 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:12:25,615 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:25,701 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:25,768 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:12:25,839 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:25,922 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:12:25,996 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:26,073 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:12:26,147 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:26,212 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:26,264 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:26,325 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:12:26,395 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:26,455 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:26,505 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:26,557 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:26,636 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:28,872 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:28,959 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:29,025 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:29,094 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:29,171 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:29,245 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:29,327 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:29,461 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:29,537 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:29,616 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:29,687 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:29,749 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:29,821 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:29,898 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:30,245 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:30,315 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:30,372 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:30,438 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:30,516 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:30,594 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:30,713 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:12:30,806 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:12:30,897 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:31,011 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:31,082 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:12:31,167 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:12:31,256 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:31,312 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:31,390 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:31,455 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:12:31,532 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:31,605 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:31,671 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:31,736 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:31,790 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:31,855 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:31,927 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:32,033 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:32,099 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:32,179 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:12:32,272 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:32,351 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:12:32,442 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:12:32,535 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:12:32,627 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:12:32,719 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:12:32,842 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:32,906 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:32,994 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:33,068 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:33,148 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:33,227 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:33,299 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:12:33,392 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:33,471 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:12:33,566 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:12:33,655 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:33,735 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:12:33,827 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:33,929 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:34,058 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:34,259 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:34,325 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:34,405 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:34,496 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:34,588 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:12:34,677 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:12:34,773 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:34,851 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:12:34,943 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:12:35,067 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:35,133 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:35,231 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:35,301 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:35,379 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:35,470 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:35,540 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:35,607 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:35,673 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:35,797 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:36,268 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:36,336 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:36,551 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:36,627 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:36,723 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:36,805 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:36,883 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:12:36,976 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:37,067 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:37,145 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:37,212 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:37,289 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:12:37,392 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:37,476 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:37,668 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:38,447 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:38,513 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:38,581 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:38,642 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:39,262 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:39,330 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:39,426 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:39,520 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:39,616 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:39,685 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:39,755 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:39,812 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:39,915 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:39,976 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:40,172 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:40,233 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:40,318 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:40,388 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:40,466 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:40,587 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:40,659 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:40,716 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:40,860 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:40,928 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:40,988 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:41,072 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:41,193 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:41,266 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:41,331 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:41,401 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:41,473 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:41,568 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:41,873 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:41,949 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:42,018 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:42,151 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:42,281 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:42,358 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:42,436 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:42,564 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:42,732 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:42,791 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:42,872 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:42,933 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:43,100 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:43,326 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:43,657 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:43,799 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:43,870 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:44,591 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:44,665 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:44,739 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:44,813 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:44,891 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:45,103 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:45,177 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:45,394 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:45,463 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:45,543 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:45,616 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:45,689 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:45,760 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:45,845 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:45,905 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:45,967 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:46,025 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:46,201 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:46,273 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:46,357 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:46,428 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:46,499 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:46,569 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:46,692 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:46,769 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:46,832 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:46,901 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:46,978 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:47,053 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:47,128 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:47,189 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:47,300 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:47,362 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:47,661 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:47,727 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:47,777 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:47,870 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:47,921 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:48,033 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:48,100 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:48,167 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:48,496 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:48,550 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:48,836 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:48,893 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:49,016 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:12:49,092 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:49,158 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:12:49,244 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:49,319 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:49,395 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:49,458 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:49,524 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:49,608 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:49,672 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:49,748 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:12:49,830 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:49,911 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:49,984 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:50,073 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:50,136 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:50,202 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:50,267 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:50,933 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:12:51,013 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:12:51,093 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:12:51,168 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:51,294 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:12:51,368 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:54,842 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:54,885 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:54,897 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:55,322 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:55,505 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:12:58,817 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:58,858 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:58,868 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:58,909 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:58,921 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:59,052 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:59,068 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:59,076 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:59,085 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:59,124 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:59,141 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:12:59,156 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:12:59,164 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:13:02,156 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:13:02,256 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:13:02,270 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:13:02,285 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:13:02,386 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:13:02,395 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:13:02,420 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:13:02,449 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:13:02,476 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:13:02,488 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:13:02,495 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:13:02,511 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:13:02,523 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:13:02,545 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:13:02,568 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:13:02,581 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:13:03,069 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:13:03,077 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:13:03,098 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:13:03,125 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:13:03,154 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:13:03,169 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:13:03,177 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:13:03,194 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:13:03,206 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:13:03,229 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:13:03,253 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:13:03,266 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:13:03,563 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:13:03,583 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:13:03,593 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:13:03,604 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:13:03,643 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:13:03,658 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:13:03,670 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:13:03,677 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:13:06,809 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:13:06,811 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:13:06,813 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:13:06,815 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:13:06,820 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-14 03:13:06,858 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:13:06,862 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:13:06,883 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:13:06,895 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:13:06,896 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:13:06,905 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:13:07,335 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:13:07,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 8 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 20 case distinctions, treesize of input 2717 treesize of output 1611 [2024-11-14 03:13:14,719 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:13:15,044 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:13:15,280 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:13:16,984 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:13:17,552 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:13:17,658 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:13:17,771 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:13:18,345 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:13:18,487 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:13:18,583 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:13:18,936 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:13:18,972 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:13:19,017 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:13:19,154 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:13:19,185 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:13:19,335 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:13:19,460 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:13:19,590 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:13:19,805 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:13:20,149 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:13:20,505 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:13:20,820 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:13:21,211 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:13:21,463 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:13:22,322 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:13:22,467 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:13:22,616 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:13:22,868 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:13:23,207 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:13:23,478 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:13:23,522 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:13:23,808 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:13:23,893 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:13:23,985 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:13:24,172 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:13:24,196 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:13:24,223 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:13:24,448 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:13:24,729 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:13:25,101 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:13:25,138 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-14 03:13:25,297 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2024-11-14 03:13:25,678 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:13:28,299 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:13:28,443 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:13:28,460 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:13:28,471 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-14 03:13:28,573 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:13:28,589 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-14 03:13:28,721 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:13:28,847 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:13:28,935 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 03:13:32,610 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:13:32,611 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:13:32,612 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:13:32,613 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:13:32,616 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-14 03:13:32,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:13:32,641 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:13:32,642 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:13:32,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:13:32,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 1399 treesize of output 1063 [2024-11-14 03:13:32,673 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:13:32,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:13:32,676 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:13:32,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:13:32,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 578 treesize of output 135 [2024-11-14 03:13:32,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:13:32,880 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:13:32,880 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:13:32,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:13:32,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 2202 treesize of output 1698 [2024-11-14 03:13:32,912 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:13:32,913 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:13:32,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:13:32,915 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:13:32,915 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:13:32,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:13:32,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 662 treesize of output 302 [2024-11-14 03:13:33,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:13:33,003 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:13:33,003 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:13:33,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:13:33,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 2837 treesize of output 2165 [2024-11-14 03:13:33,049 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:13:33,050 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:13:33,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:13:33,052 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:13:33,052 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:13:33,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:13:33,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 864 treesize of output 441 [2024-11-14 03:13:33,187 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:13:33,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:13:33,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:13:33,199 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:13:33,200 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:13:33,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:13:33,221 INFO L349 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2024-11-14 03:13:33,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 2 disjoint index pairs (out of 21 index pairs), introduced 4 new quantified variables, introduced 12 case distinctions, treesize of input 2010 treesize of output 1 [2024-11-14 03:13:33,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:13:33,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:13:33,261 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:13:33,262 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:13:33,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:13:33,272 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2024-11-14 03:13:33,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 604 treesize of output 1 [2024-11-14 03:13:33,302 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:13:33,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:13:33,304 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:13:33,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:13:33,316 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:13:33,316 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:13:33,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:13:33,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:13:33,336 INFO L349 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2024-11-14 03:13:33,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 2 disjoint index pairs (out of 28 index pairs), introduced 4 new quantified variables, introduced 16 case distinctions, treesize of input 1399 treesize of output 1 [2024-11-14 03:13:33,370 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:13:33,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:13:33,373 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:13:33,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:13:33,384 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:13:33,384 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:13:33,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:13:33,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:13:33,408 INFO L349 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2024-11-14 03:13:33,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 2 disjoint index pairs (out of 28 index pairs), introduced 4 new quantified variables, introduced 16 case distinctions, treesize of input 2837 treesize of output 1 [2024-11-14 03:13:33,437 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:13:33,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:13:33,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:13:33,448 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:13:33,448 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:13:33,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:13:33,467 INFO L349 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2024-11-14 03:13:33,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 4 disjoint index pairs (out of 21 index pairs), introduced 4 new quantified variables, introduced 12 case distinctions, treesize of input 1375 treesize of output 1 [2024-11-14 03:13:33,497 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:13:33,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:13:33,500 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:13:33,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:13:33,511 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:13:33,512 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:13:33,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:13:33,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:13:33,532 INFO L349 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2024-11-14 03:13:33,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 4 disjoint index pairs (out of 28 index pairs), introduced 4 new quantified variables, introduced 16 case distinctions, treesize of input 2130 treesize of output 1 [2024-11-14 03:13:33,562 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:13:33,623 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:13:33,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 2082 treesize of output 1650 [2024-11-14 03:13:33,656 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:13:33,713 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:13:33,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 908 treesize of output 581 [2024-11-14 03:13:34,702 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 03:13:34,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [486818323] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:13:34,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [465539370] [2024-11-14 03:13:34,703 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2024-11-14 03:13:34,703 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:13:34,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 16, 14] total 47 [2024-11-14 03:13:34,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120203272] [2024-11-14 03:13:34,704 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:13:34,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2024-11-14 03:13:34,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:13:34,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-11-14 03:13:34,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=2044, Unknown=0, NotChecked=0, Total=2256 [2024-11-14 03:13:34,705 INFO L87 Difference]: Start difference. First operand 2100 states and 7360 transitions. Second operand has 48 states, 48 states have (on average 1.9583333333333333) internal successors, (94), 47 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)