./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/popl20-more-max-array-hom.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9bd2c7ff Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f9d9837-d7c8-4c7b-8420-5be704a1fe73/bin/utaipan-verify-t7M7D8N6sZ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f9d9837-d7c8-4c7b-8420-5be704a1fe73/bin/utaipan-verify-t7M7D8N6sZ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f9d9837-d7c8-4c7b-8420-5be704a1fe73/bin/utaipan-verify-t7M7D8N6sZ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f9d9837-d7c8-4c7b-8420-5be704a1fe73/bin/utaipan-verify-t7M7D8N6sZ/config/TaipanReach.xml -i ../../sv-benchmarks/c/weaver/popl20-more-max-array-hom.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f9d9837-d7c8-4c7b-8420-5be704a1fe73/bin/utaipan-verify-t7M7D8N6sZ/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f9d9837-d7c8-4c7b-8420-5be704a1fe73/bin/utaipan-verify-t7M7D8N6sZ --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 25cf9c0a16564c460f6e824f90a2df4185d2e5d2c682a221258efaf06dec8ca4 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 04:46:44,558 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 04:46:44,686 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f9d9837-d7c8-4c7b-8420-5be704a1fe73/bin/utaipan-verify-t7M7D8N6sZ/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-11-19 04:46:44,695 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 04:46:44,696 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 04:46:44,741 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 04:46:44,742 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 04:46:44,743 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 04:46:44,746 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 04:46:44,751 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 04:46:44,752 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-19 04:46:44,753 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-19 04:46:44,754 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-19 04:46:44,755 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-19 04:46:44,756 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-19 04:46:44,756 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-19 04:46:44,757 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-19 04:46:44,757 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-19 04:46:44,758 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-19 04:46:44,758 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-19 04:46:44,760 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-19 04:46:44,761 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-19 04:46:44,762 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 04:46:44,762 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 04:46:44,763 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 04:46:44,763 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 04:46:44,763 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 04:46:44,764 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 04:46:44,764 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 04:46:44,765 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 04:46:44,765 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 04:46:44,766 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 04:46:44,766 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 04:46:44,766 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 04:46:44,767 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 04:46:44,767 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 04:46:44,767 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 04:46:44,767 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 04:46:44,768 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 04:46:44,768 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 04:46:44,768 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-19 04:46:44,769 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 04:46:44,769 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 04:46:44,769 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-19 04:46:44,769 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 04:46:44,770 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f9d9837-d7c8-4c7b-8420-5be704a1fe73/bin/utaipan-verify-t7M7D8N6sZ/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f9d9837-d7c8-4c7b-8420-5be704a1fe73/bin/utaipan-verify-t7M7D8N6sZ 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 -> 25cf9c0a16564c460f6e824f90a2df4185d2e5d2c682a221258efaf06dec8ca4 [2023-11-19 04:46:45,017 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 04:46:45,039 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 04:46:45,041 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 04:46:45,043 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 04:46:45,043 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 04:46:45,045 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f9d9837-d7c8-4c7b-8420-5be704a1fe73/bin/utaipan-verify-t7M7D8N6sZ/../../sv-benchmarks/c/weaver/popl20-more-max-array-hom.wvr.c [2023-11-19 04:46:48,488 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 04:46:48,821 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 04:46:48,822 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f9d9837-d7c8-4c7b-8420-5be704a1fe73/sv-benchmarks/c/weaver/popl20-more-max-array-hom.wvr.c [2023-11-19 04:46:48,833 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f9d9837-d7c8-4c7b-8420-5be704a1fe73/bin/utaipan-verify-t7M7D8N6sZ/data/2f7cc6780/27188b5aa8b54b42893d29cb8cd7c94a/FLAGaec04f29a [2023-11-19 04:46:48,851 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f9d9837-d7c8-4c7b-8420-5be704a1fe73/bin/utaipan-verify-t7M7D8N6sZ/data/2f7cc6780/27188b5aa8b54b42893d29cb8cd7c94a [2023-11-19 04:46:48,855 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 04:46:48,857 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 04:46:48,859 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 04:46:48,860 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 04:46:48,867 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 04:46:48,868 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 04:46:48" (1/1) ... [2023-11-19 04:46:48,870 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69400ee2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:46:48, skipping insertion in model container [2023-11-19 04:46:48,871 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 04:46:48" (1/1) ... [2023-11-19 04:46:48,909 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 04:46:49,190 WARN L240 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_1f9d9837-d7c8-4c7b-8420-5be704a1fe73/sv-benchmarks/c/weaver/popl20-more-max-array-hom.wvr.c[2625,2638] [2023-11-19 04:46:49,203 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 04:46:49,226 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 04:46:49,255 WARN L240 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_1f9d9837-d7c8-4c7b-8420-5be704a1fe73/sv-benchmarks/c/weaver/popl20-more-max-array-hom.wvr.c[2625,2638] [2023-11-19 04:46:49,260 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 04:46:49,272 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 04:46:49,272 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 04:46:49,281 INFO L206 MainTranslator]: Completed translation [2023-11-19 04:46:49,282 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:46:49 WrapperNode [2023-11-19 04:46:49,282 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 04:46:49,284 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 04:46:49,284 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 04:46:49,285 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 04:46:49,294 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:46:49" (1/1) ... [2023-11-19 04:46:49,305 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:46:49" (1/1) ... [2023-11-19 04:46:49,345 INFO L138 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 105 [2023-11-19 04:46:49,347 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 04:46:49,350 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 04:46:49,350 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 04:46:49,351 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 04:46:49,364 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:46:49" (1/1) ... [2023-11-19 04:46:49,364 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:46:49" (1/1) ... [2023-11-19 04:46:49,369 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:46:49" (1/1) ... [2023-11-19 04:46:49,370 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:46:49" (1/1) ... [2023-11-19 04:46:49,380 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:46:49" (1/1) ... [2023-11-19 04:46:49,386 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:46:49" (1/1) ... [2023-11-19 04:46:49,389 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:46:49" (1/1) ... [2023-11-19 04:46:49,391 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:46:49" (1/1) ... [2023-11-19 04:46:49,396 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 04:46:49,397 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 04:46:49,398 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 04:46:49,398 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 04:46:49,399 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:46:49" (1/1) ... [2023-11-19 04:46:49,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 04:46:49,437 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f9d9837-d7c8-4c7b-8420-5be704a1fe73/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 04:46:49,456 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f9d9837-d7c8-4c7b-8420-5be704a1fe73/bin/utaipan-verify-t7M7D8N6sZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 04:46:49,481 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f9d9837-d7c8-4c7b-8420-5be704a1fe73/bin/utaipan-verify-t7M7D8N6sZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 04:46:49,525 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 04:46:49,526 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-19 04:46:49,526 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-19 04:46:49,526 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-19 04:46:49,527 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-19 04:46:49,529 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-19 04:46:49,530 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-19 04:46:49,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 04:46:49,532 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 04:46:49,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 04:46:49,532 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-19 04:46:49,533 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-19 04:46:49,533 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-19 04:46:49,533 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 04:46:49,533 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 04:46:49,534 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-19 04:46:49,534 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 04:46:49,537 WARN L210 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-19 04:46:49,760 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 04:46:49,764 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 04:46:50,348 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 04:46:50,438 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 04:46:50,438 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-19 04:46:50,451 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 04:46:50 BoogieIcfgContainer [2023-11-19 04:46:50,451 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 04:46:50,455 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 04:46:50,455 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 04:46:50,460 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 04:46:50,463 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 04:46:48" (1/3) ... [2023-11-19 04:46:50,465 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b64bc38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 04:46:50, skipping insertion in model container [2023-11-19 04:46:50,465 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:46:49" (2/3) ... [2023-11-19 04:46:50,467 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b64bc38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 04:46:50, skipping insertion in model container [2023-11-19 04:46:50,467 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 04:46:50" (3/3) ... [2023-11-19 04:46:50,469 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-max-array-hom.wvr.c [2023-11-19 04:46:50,482 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-19 04:46:50,497 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 04:46:50,497 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-19 04:46:50,498 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-19 04:46:50,631 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-11-19 04:46:50,682 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-19 04:46:50,707 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 158 places, 160 transitions, 341 flow [2023-11-19 04:46:50,710 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 158 places, 160 transitions, 341 flow [2023-11-19 04:46:50,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 158 places, 160 transitions, 341 flow [2023-11-19 04:46:50,821 INFO L124 PetriNetUnfolderBase]: 12/157 cut-off events. [2023-11-19 04:46:50,821 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-19 04:46:50,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 157 events. 12/157 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 105 event pairs, 0 based on Foata normal form. 0/144 useless extension candidates. Maximal degree in co-relation 117. Up to 2 conditions per place. [2023-11-19 04:46:50,834 INFO L119 LiptonReduction]: Number of co-enabled transitions 1728 [2023-11-19 04:46:58,988 INFO L134 LiptonReduction]: Checked pairs total: 1876 [2023-11-19 04:46:58,989 INFO L136 LiptonReduction]: Total number of compositions: 152 [2023-11-19 04:46:58,999 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 34 places, 28 transitions, 77 flow [2023-11-19 04:46:59,043 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 107 states, 106 states have (on average 3.0849056603773586) internal successors, (327), 106 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:46:59,067 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 04:46:59,076 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=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;@9f6a5b8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-19 04:46:59,076 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-11-19 04:46:59,080 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 106 states have (on average 3.0849056603773586) internal successors, (327), 106 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:46:59,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-19 04:46:59,092 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:46:59,092 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:46:59,093 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-19 04:46:59,099 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:46:59,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1982561335, now seen corresponding path program 1 times [2023-11-19 04:46:59,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:46:59,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714896422] [2023-11-19 04:46:59,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:46:59,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:46:59,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:47:00,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:47:00,332 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:47:00,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714896422] [2023-11-19 04:47:00,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714896422] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:47:00,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:47:00,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 04:47:00,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038320239] [2023-11-19 04:47:00,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:47:00,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 04:47:00,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:47:00,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 04:47:00,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 04:47:00,379 INFO L87 Difference]: Start difference. First operand has 107 states, 106 states have (on average 3.0849056603773586) internal successors, (327), 106 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 10.0) 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) [2023-11-19 04:47:00,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:47:00,521 INFO L93 Difference]: Finished difference Result 204 states and 632 transitions. [2023-11-19 04:47:00,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 04:47:00,525 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) 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 [2023-11-19 04:47:00,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:47:00,551 INFO L225 Difference]: With dead ends: 204 [2023-11-19 04:47:00,551 INFO L226 Difference]: Without dead ends: 197 [2023-11-19 04:47:00,553 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 04:47:00,561 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 1 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:47:00,563 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 0 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:47:00,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2023-11-19 04:47:00,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2023-11-19 04:47:00,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 196 states have (on average 3.13265306122449) internal successors, (614), 196 states have internal predecessors, (614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:47:00,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 614 transitions. [2023-11-19 04:47:00,670 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 614 transitions. Word has length 20 [2023-11-19 04:47:00,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:47:00,672 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 614 transitions. [2023-11-19 04:47:00,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) 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) [2023-11-19 04:47:00,674 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 614 transitions. [2023-11-19 04:47:00,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-19 04:47:00,679 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:47:00,680 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:47:00,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 04:47:00,681 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-19 04:47:00,681 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:47:00,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1288998521, now seen corresponding path program 1 times [2023-11-19 04:47:00,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:47:00,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387918015] [2023-11-19 04:47:00,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:47:00,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:47:00,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:47:00,975 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-19 04:47:00,976 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:47:00,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387918015] [2023-11-19 04:47:00,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387918015] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:47:00,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:47:00,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 04:47:00,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213251321] [2023-11-19 04:47:00,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:47:00,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 04:47:00,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:47:00,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 04:47:00,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 04:47:00,983 INFO L87 Difference]: Start difference. First operand 197 states and 614 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:47:01,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:47:01,073 INFO L93 Difference]: Finished difference Result 198 states and 615 transitions. [2023-11-19 04:47:01,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 04:47:01,074 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-11-19 04:47:01,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:47:01,078 INFO L225 Difference]: With dead ends: 198 [2023-11-19 04:47:01,079 INFO L226 Difference]: Without dead ends: 198 [2023-11-19 04:47:01,080 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 04:47:01,083 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:47:01,085 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:47:01,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2023-11-19 04:47:01,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2023-11-19 04:47:01,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 197 states have (on average 3.1218274111675126) internal successors, (615), 197 states have internal predecessors, (615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:47:01,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 615 transitions. [2023-11-19 04:47:01,127 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 615 transitions. Word has length 21 [2023-11-19 04:47:01,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:47:01,127 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 615 transitions. [2023-11-19 04:47:01,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:47:01,128 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 615 transitions. [2023-11-19 04:47:01,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-19 04:47:01,138 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:47:01,139 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:47:01,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 04:47:01,143 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-19 04:47:01,144 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:47:01,145 INFO L85 PathProgramCache]: Analyzing trace with hash -205390346, now seen corresponding path program 1 times [2023-11-19 04:47:01,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:47:01,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621633943] [2023-11-19 04:47:01,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:47:01,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:47:01,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:47:01,294 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-19 04:47:01,295 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:47:01,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621633943] [2023-11-19 04:47:01,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621633943] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:47:01,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:47:01,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 04:47:01,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942583704] [2023-11-19 04:47:01,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:47:01,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 04:47:01,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:47:01,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 04:47:01,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 04:47:01,299 INFO L87 Difference]: Start difference. First operand 198 states and 615 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:47:01,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:47:01,405 INFO L93 Difference]: Finished difference Result 202 states and 625 transitions. [2023-11-19 04:47:01,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 04:47:01,406 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2023-11-19 04:47:01,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:47:01,409 INFO L225 Difference]: With dead ends: 202 [2023-11-19 04:47:01,409 INFO L226 Difference]: Without dead ends: 202 [2023-11-19 04:47:01,409 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-19 04:47:01,411 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 20 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:47:01,411 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 0 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:47:01,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2023-11-19 04:47:01,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 134. [2023-11-19 04:47:01,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 133 states have (on average 3.1052631578947367) internal successors, (413), 133 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:47:01,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 413 transitions. [2023-11-19 04:47:01,425 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 413 transitions. Word has length 22 [2023-11-19 04:47:01,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:47:01,426 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 413 transitions. [2023-11-19 04:47:01,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:47:01,426 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 413 transitions. [2023-11-19 04:47:01,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-19 04:47:01,427 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:47:01,427 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:47:01,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 04:47:01,428 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-19 04:47:01,428 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:47:01,429 INFO L85 PathProgramCache]: Analyzing trace with hash 815685518, now seen corresponding path program 1 times [2023-11-19 04:47:01,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:47:01,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519029793] [2023-11-19 04:47:01,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:47:01,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:47:01,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:47:01,599 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-19 04:47:01,599 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:47:01,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519029793] [2023-11-19 04:47:01,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519029793] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 04:47:01,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [571993697] [2023-11-19 04:47:01,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:47:01,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 04:47:01,609 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f9d9837-d7c8-4c7b-8420-5be704a1fe73/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 04:47:01,616 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f9d9837-d7c8-4c7b-8420-5be704a1fe73/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 04:47:01,628 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f9d9837-d7c8-4c7b-8420-5be704a1fe73/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-19 04:47:01,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:47:01,773 INFO L262 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-19 04:47:01,779 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 04:47:01,860 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-19 04:47:01,860 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 04:47:01,908 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-19 04:47:01,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [571993697] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-19 04:47:01,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-19 04:47:01,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2023-11-19 04:47:01,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920678639] [2023-11-19 04:47:01,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:47:01,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 04:47:01,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:47:01,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 04:47:01,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-19 04:47:01,912 INFO L87 Difference]: Start difference. First operand 134 states and 413 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:47:02,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:47:02,026 INFO L93 Difference]: Finished difference Result 166 states and 519 transitions. [2023-11-19 04:47:02,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 04:47:02,027 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2023-11-19 04:47:02,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:47:02,030 INFO L225 Difference]: With dead ends: 166 [2023-11-19 04:47:02,030 INFO L226 Difference]: Without dead ends: 166 [2023-11-19 04:47:02,030 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2023-11-19 04:47:02,032 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 51 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:47:02,032 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 0 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:47:02,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2023-11-19 04:47:02,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2023-11-19 04:47:02,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 165 states have (on average 3.1454545454545455) internal successors, (519), 165 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:47:02,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 519 transitions. [2023-11-19 04:47:02,067 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 519 transitions. Word has length 22 [2023-11-19 04:47:02,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:47:02,068 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 519 transitions. [2023-11-19 04:47:02,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:47:02,068 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 519 transitions. [2023-11-19 04:47:02,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-19 04:47:02,070 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:47:02,070 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:47:02,097 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f9d9837-d7c8-4c7b-8420-5be704a1fe73/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-19 04:47:02,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f9d9837-d7c8-4c7b-8420-5be704a1fe73/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 04:47:02,285 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-19 04:47:02,285 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:47:02,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1567800196, now seen corresponding path program 1 times [2023-11-19 04:47:02,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:47:02,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526136288] [2023-11-19 04:47:02,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:47:02,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:47:02,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:47:03,647 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:47:03,648 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:47:03,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526136288] [2023-11-19 04:47:03,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526136288] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 04:47:03,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [891370284] [2023-11-19 04:47:03,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:47:03,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 04:47:03,649 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f9d9837-d7c8-4c7b-8420-5be704a1fe73/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 04:47:03,650 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f9d9837-d7c8-4c7b-8420-5be704a1fe73/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 04:47:03,656 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f9d9837-d7c8-4c7b-8420-5be704a1fe73/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-19 04:47:03,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:47:03,793 INFO L262 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 40 conjunts are in the unsatisfiable core [2023-11-19 04:47:03,798 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 04:47:03,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 04:47:03,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 04:47:03,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-11-19 04:47:03,980 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 [2023-11-19 04:47:04,099 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 8 treesize of output 1 [2023-11-19 04:47:04,250 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 [2023-11-19 04:47:04,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 04:47:04,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2023-11-19 04:47:04,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 31 [2023-11-19 04:47:05,003 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:47:05,004 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 04:47:05,710 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~max3~0 1)) (.cse2 (+ c_~max2~0 1)) (.cse3 (+ c_~A~0.offset (* 4 c_~M~0))) (.cse6 (= c_~max1~0 c_~max2~0))) (and (forall ((v_ArrVal_116 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_116) c_~A~0.base) .cse3))) (or (< .cse0 .cse1) (< .cse0 .cse2) (= c_~max1~0 .cse0)))) (or (and (forall ((v_ArrVal_116 (Array Int Int))) (let ((.cse4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_116) c_~A~0.base) .cse3))) (or (< .cse4 .cse1) (= c_~max1~0 .cse4)))) (forall ((v_ArrVal_116 (Array Int Int))) (let ((.cse5 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_116) c_~A~0.base) .cse3))) (or (< c_~max2~0 .cse5) (< .cse5 .cse1))))) .cse6) (or (and (= c_~max1~0 c_~max3~0) (<= .cse2 c_~max3~0)) (forall ((v_ArrVal_116 (Array Int Int))) (< c_~max3~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_116) c_~A~0.base) .cse3))) (and .cse6 (<= c_~max3~0 c_~max2~0))))) is different from false [2023-11-19 04:47:06,258 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse10 (+ c_~max2~0 1)) (.cse6 (+ c_~max3~0 1)) (.cse7 (+ c_~A~0.offset (* 4 c_~M~0)))) (let ((.cse1 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4)))) (.cse8 (forall ((v_ArrVal_116 (Array Int Int))) (let ((.cse14 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_116) c_~A~0.base) .cse7))) (or (< c_~max2~0 .cse14) (< .cse14 .cse6))))) (.cse0 (<= .cse10 c_~max3~0)) (.cse2 (forall ((v_ArrVal_116 (Array Int Int))) (< c_~max3~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_116) c_~A~0.base) .cse7)))) (.cse3 (<= c_~max3~0 c_~max2~0))) (and (or (let ((.cse4 (= .cse1 c_~max2~0))) (and (or (and .cse0 (= .cse1 c_~max3~0)) .cse2 (and .cse3 .cse4)) (or (and (forall ((v_ArrVal_116 (Array Int Int))) (let ((.cse5 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_116) c_~A~0.base) .cse7))) (or (< .cse5 .cse6) (= .cse1 .cse5)))) .cse8) .cse4) (forall ((v_ArrVal_116 (Array Int Int))) (let ((.cse9 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_116) c_~A~0.base) .cse7))) (or (< .cse9 .cse6) (< .cse9 .cse10) (= .cse1 .cse9)))))) (< .cse1 (+ c_~max1~0 1))) (or (< c_~max1~0 .cse1) (let ((.cse13 (= c_~max1~0 c_~max2~0))) (and (forall ((v_ArrVal_116 (Array Int Int))) (let ((.cse11 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_116) c_~A~0.base) .cse7))) (or (< .cse11 .cse6) (< .cse11 .cse10) (= c_~max1~0 .cse11)))) (or (and (forall ((v_ArrVal_116 (Array Int Int))) (let ((.cse12 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_116) c_~A~0.base) .cse7))) (or (< .cse12 .cse6) (= c_~max1~0 .cse12)))) .cse8) .cse13) (or (and (= c_~max1~0 c_~max3~0) .cse0) .cse2 (and .cse13 .cse3)))))))) is different from false [2023-11-19 04:47:06,911 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse16 (= c_~max1~0 c_~max2~0)) (.cse2 (+ c_~max3~0 1)) (.cse5 (+ c_~max1~0 1)) (.cse4 (+ c_~A~0.offset (* 4 c_~M~0))) (.cse6 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4))) (.cse9 (+ c_~max2~0 1))) (and (forall ((v_ArrVal_115 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_115))) (let ((.cse1 (select (select .cse3 c_~A~0.base) .cse6))) (or (forall ((v_ArrVal_116 (Array Int Int))) (let ((.cse0 (select (select (store .cse3 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_116) c_~A~0.base) .cse4))) (or (= .cse0 .cse1) (< .cse0 .cse2)))) (< .cse1 .cse5) (= .cse1 c_~max2~0))))) (forall ((v_ArrVal_115 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_115))) (let ((.cse7 (select (select .cse10 c_~A~0.base) .cse6))) (or (< .cse7 .cse5) (forall ((v_ArrVal_116 (Array Int Int))) (let ((.cse8 (select (select (store .cse10 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_116) c_~A~0.base) .cse4))) (or (= .cse8 .cse7) (< .cse8 .cse9) (< .cse8 .cse2)))))))) (or (forall ((v_ArrVal_116 (Array Int Int)) (v_ArrVal_115 (Array Int Int))) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_115))) (let ((.cse11 (select (select .cse12 c_~A~0.base) .cse6))) (or (< .cse11 .cse5) (< c_~max3~0 (select (select (store .cse12 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_116) c_~A~0.base) .cse4)) (= .cse11 c_~max2~0))))) (< c_~max2~0 c_~max3~0)) (forall ((v_ArrVal_115 (Array Int Int))) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_115))) (or (< c_~max1~0 (select (select .cse13 c_~A~0.base) .cse6)) (forall ((v_ArrVal_116 (Array Int Int))) (let ((.cse14 (select (select (store .cse13 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_116) c_~A~0.base) .cse4))) (or (< .cse14 .cse9) (= .cse14 c_~max1~0) (< .cse14 .cse2))))))) (or (forall ((v_ArrVal_116 (Array Int Int)) (v_ArrVal_115 (Array Int Int))) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_115))) (or (< c_~max3~0 (select (select (store .cse15 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_116) c_~A~0.base) .cse4)) (< c_~max1~0 (select (select .cse15 c_~A~0.base) .cse6))))) (and (= c_~max1~0 c_~max3~0) (<= .cse9 c_~max3~0)) (and .cse16 (<= c_~max3~0 c_~max2~0))) (forall ((v_ArrVal_115 (Array Int Int))) (let ((.cse19 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_115))) (let ((.cse17 (select (select .cse19 c_~A~0.base) .cse6))) (or (< .cse17 .cse5) (= .cse17 c_~max2~0) (forall ((v_ArrVal_116 (Array Int Int))) (let ((.cse18 (select (select (store .cse19 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_116) c_~A~0.base) .cse4))) (or (< c_~max2~0 .cse18) (< .cse18 .cse2)))))))) (or .cse16 (and (forall ((v_ArrVal_115 (Array Int Int))) (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_115))) (or (< c_~max1~0 (select (select .cse20 c_~A~0.base) .cse6)) (forall ((v_ArrVal_116 (Array Int Int))) (let ((.cse21 (select (select (store .cse20 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_116) c_~A~0.base) .cse4))) (or (< c_~max2~0 .cse21) (< .cse21 .cse2))))))) (forall ((v_ArrVal_115 (Array Int Int))) (let ((.cse23 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_115))) (or (forall ((v_ArrVal_116 (Array Int Int))) (let ((.cse22 (select (select (store .cse23 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_116) c_~A~0.base) .cse4))) (or (= .cse22 c_~max1~0) (< .cse22 .cse2)))) (< c_~max1~0 (select (select .cse23 c_~A~0.base) .cse6))))))) (forall ((v_ArrVal_116 (Array Int Int)) (v_ArrVal_115 (Array Int Int))) (let ((.cse25 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_115))) (let ((.cse24 (select (select .cse25 c_~A~0.base) .cse6))) (or (= .cse24 c_~max3~0) (< .cse24 .cse5) (< c_~max3~0 (select (select (store .cse25 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_116) c_~A~0.base) .cse4)) (= .cse24 c_~max2~0))))) (or (forall ((v_ArrVal_116 (Array Int Int)) (v_ArrVal_115 (Array Int Int))) (let ((.cse27 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_115))) (let ((.cse26 (select (select .cse27 c_~A~0.base) .cse6))) (or (= .cse26 c_~max3~0) (< .cse26 .cse5) (< c_~max3~0 (select (select (store .cse27 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_116) c_~A~0.base) .cse4)))))) (< c_~max3~0 .cse9)))) is different from false [2023-11-19 04:47:07,286 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (= c_~max1~0 c_~max2~0)) (.cse7 (+ c_~max2~0 1)) (.cse1 (+ c_~max3~0 1)) (.cse3 (+ c_~A~0.offset (* 4 c_~M~0))) (.cse12 (+ c_~max1~0 1))) (and (or (and (forall ((v_ArrVal_115 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_115))) (or (forall ((v_ArrVal_116 (Array Int Int))) (let ((.cse0 (select (select (store .cse2 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_116) c_~A~0.base) .cse3))) (or (= .cse0 c_~max1~0) (< .cse0 .cse1)))) (< c_~max1~0 (select (select .cse2 c_~A~0.base) c_~A~0.offset))))) (forall ((v_ArrVal_115 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_115))) (or (< c_~max1~0 (select (select .cse4 c_~A~0.base) c_~A~0.offset)) (forall ((v_ArrVal_116 (Array Int Int))) (let ((.cse5 (select (select (store .cse4 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_116) c_~A~0.base) .cse3))) (or (< c_~max2~0 .cse5) (< .cse5 .cse1)))))))) .cse6) (or (and (= c_~max1~0 c_~max3~0) (<= .cse7 c_~max3~0)) (forall ((v_ArrVal_116 (Array Int Int)) (v_ArrVal_115 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_115))) (or (< c_~max3~0 (select (select (store .cse8 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_116) c_~A~0.base) .cse3)) (< c_~max1~0 (select (select .cse8 c_~A~0.base) c_~A~0.offset))))) (and .cse6 (<= c_~max3~0 c_~max2~0))) (forall ((v_ArrVal_115 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_115))) (or (< c_~max1~0 (select (select .cse9 c_~A~0.base) c_~A~0.offset)) (forall ((v_ArrVal_116 (Array Int Int))) (let ((.cse10 (select (select (store .cse9 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_116) c_~A~0.base) .cse3))) (or (< .cse10 .cse7) (= .cse10 c_~max1~0) (< .cse10 .cse1))))))) (forall ((v_ArrVal_115 (Array Int Int))) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_115))) (let ((.cse11 (select (select .cse14 c_~A~0.base) c_~A~0.offset))) (or (= .cse11 c_~max2~0) (< .cse11 .cse12) (forall ((v_ArrVal_116 (Array Int Int))) (let ((.cse13 (select (select (store .cse14 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_116) c_~A~0.base) .cse3))) (or (< c_~max2~0 .cse13) (< .cse13 .cse1)))))))) (or (forall ((v_ArrVal_116 (Array Int Int)) (v_ArrVal_115 (Array Int Int))) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_115))) (let ((.cse16 (select (select .cse15 c_~A~0.base) c_~A~0.offset))) (or (< c_~max3~0 (select (select (store .cse15 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_116) c_~A~0.base) .cse3)) (= .cse16 c_~max3~0) (< .cse16 .cse12))))) (< c_~max3~0 .cse7)) (forall ((v_ArrVal_115 (Array Int Int))) (let ((.cse19 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_115))) (let ((.cse18 (select (select .cse19 c_~A~0.base) c_~A~0.offset))) (or (forall ((v_ArrVal_116 (Array Int Int))) (let ((.cse17 (select (select (store .cse19 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_116) c_~A~0.base) .cse3))) (or (< .cse17 .cse7) (= .cse17 .cse18) (< .cse17 .cse1)))) (< .cse18 .cse12))))) (or (forall ((v_ArrVal_116 (Array Int Int)) (v_ArrVal_115 (Array Int Int))) (let ((.cse21 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_115))) (let ((.cse20 (select (select .cse21 c_~A~0.base) c_~A~0.offset))) (or (= .cse20 c_~max2~0) (< c_~max3~0 (select (select (store .cse21 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_116) c_~A~0.base) .cse3)) (< .cse20 .cse12))))) (< c_~max2~0 c_~max3~0)) (forall ((v_ArrVal_115 (Array Int Int))) (let ((.cse24 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_115))) (let ((.cse22 (select (select .cse24 c_~A~0.base) c_~A~0.offset))) (or (= .cse22 c_~max2~0) (< .cse22 .cse12) (forall ((v_ArrVal_116 (Array Int Int))) (let ((.cse23 (select (select (store .cse24 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_116) c_~A~0.base) .cse3))) (or (= .cse23 .cse22) (< .cse23 .cse1)))))))) (forall ((v_ArrVal_116 (Array Int Int)) (v_ArrVal_115 (Array Int Int))) (let ((.cse26 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_115))) (let ((.cse25 (select (select .cse26 c_~A~0.base) c_~A~0.offset))) (or (= .cse25 c_~max2~0) (< c_~max3~0 (select (select (store .cse26 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_116) c_~A~0.base) .cse3)) (= .cse25 c_~max3~0) (< .cse25 .cse12))))))) is different from false [2023-11-19 04:47:09,147 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 04:47:09,148 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 150 treesize of output 102 [2023-11-19 04:47:09,201 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 04:47:09,204 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 27809 treesize of output 25505 [2023-11-19 04:47:09,375 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 04:47:09,376 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 223 treesize of output 207 [2023-11-19 04:47:09,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 278 treesize of output 206 [2023-11-19 04:47:09,468 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 04:47:09,469 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 209 treesize of output 169 [2023-11-19 04:47:10,272 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 04:47:10,273 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 46 [2023-11-19 04:47:10,278 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-19 04:47:10,294 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-19 04:47:10,295 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 259 treesize of output 239 [2023-11-19 04:47:10,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 04:47:10,318 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 59 treesize of output 51 [2023-11-19 04:47:10,343 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-19 04:47:10,343 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 65 treesize of output 53 [2023-11-19 04:47:10,380 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-19 04:47:10,381 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 110 treesize of output 1 [2023-11-19 04:47:10,394 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-19 04:47:10,395 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 119 treesize of output 1 [2023-11-19 04:47:10,409 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-19 04:47:10,410 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 126 treesize of output 1 [2023-11-19 04:47:10,425 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-19 04:47:10,426 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 1 [2023-11-19 04:47:10,443 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-19 04:47:10,444 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 1 [2023-11-19 04:47:10,458 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-19 04:47:10,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 141 treesize of output 1 [2023-11-19 04:47:10,473 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-19 04:47:10,474 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 92 treesize of output 1 [2023-11-19 04:47:10,492 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-19 04:47:10,492 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 92 treesize of output 1 [2023-11-19 04:47:10,635 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-11-19 04:47:10,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [891370284] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 04:47:10,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1928342703] [2023-11-19 04:47:10,644 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java: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:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java: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) [2023-11-19 04:47:10,647 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 04:47:10,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 26 [2023-11-19 04:47:10,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048914520] [2023-11-19 04:47:10,647 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 04:47:10,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-11-19 04:47:10,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:47:10,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-11-19 04:47:10,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=459, Unknown=4, NotChecked=188, Total=756 [2023-11-19 04:47:10,650 INFO L87 Difference]: Start difference. First operand 166 states and 519 transitions. Second operand has 28 states, 27 states have (on average 2.5555555555555554) internal successors, (69), 27 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:47:12,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:47:12,776 INFO L93 Difference]: Finished difference Result 349 states and 1095 transitions. [2023-11-19 04:47:12,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-19 04:47:12,777 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.5555555555555554) internal successors, (69), 27 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-11-19 04:47:12,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:47:12,782 INFO L225 Difference]: With dead ends: 349 [2023-11-19 04:47:12,782 INFO L226 Difference]: Without dead ends: 342 [2023-11-19 04:47:12,783 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 26 SyntacticMatches, 4 SemanticMatches, 33 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=167, Invalid=775, Unknown=4, NotChecked=244, Total=1190 [2023-11-19 04:47:12,785 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 113 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 742 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 399 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-11-19 04:47:12,785 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 0 Invalid, 1144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 742 Invalid, 0 Unknown, 399 Unchecked, 1.4s Time] [2023-11-19 04:47:12,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2023-11-19 04:47:12,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 276. [2023-11-19 04:47:12,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 275 states have (on average 3.1745454545454543) internal successors, (873), 275 states have internal predecessors, (873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:47:12,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 873 transitions. [2023-11-19 04:47:12,806 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 873 transitions. Word has length 23 [2023-11-19 04:47:12,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:47:12,807 INFO L495 AbstractCegarLoop]: Abstraction has 276 states and 873 transitions. [2023-11-19 04:47:12,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.5555555555555554) internal successors, (69), 27 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:47:12,808 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 873 transitions. [2023-11-19 04:47:12,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-19 04:47:12,810 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:47:12,811 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:47:12,844 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f9d9837-d7c8-4c7b-8420-5be704a1fe73/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-19 04:47:13,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f9d9837-d7c8-4c7b-8420-5be704a1fe73/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 04:47:13,037 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-19 04:47:13,037 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:47:13,038 INFO L85 PathProgramCache]: Analyzing trace with hash 221886816, now seen corresponding path program 2 times [2023-11-19 04:47:13,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:47:13,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356582737] [2023-11-19 04:47:13,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:47:13,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:47:13,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:47:14,083 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:47:14,084 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:47:14,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356582737] [2023-11-19 04:47:14,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356582737] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 04:47:14,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1998461600] [2023-11-19 04:47:14,084 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-19 04:47:14,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 04:47:14,085 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f9d9837-d7c8-4c7b-8420-5be704a1fe73/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 04:47:14,086 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f9d9837-d7c8-4c7b-8420-5be704a1fe73/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 04:47:14,104 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f9d9837-d7c8-4c7b-8420-5be704a1fe73/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-19 04:47:14,227 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-19 04:47:14,227 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-19 04:47:14,229 INFO L262 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 26 conjunts are in the unsatisfiable core [2023-11-19 04:47:14,232 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 04:47:14,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 30 [2023-11-19 04:47:14,798 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:47:14,798 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 04:47:15,045 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 04:47:15,046 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 123 treesize of output 75 [2023-11-19 04:47:15,717 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:47:15,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1998461600] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 04:47:15,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [842181196] [2023-11-19 04:47:15,720 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java: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:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java: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) [2023-11-19 04:47:15,722 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 04:47:15,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2023-11-19 04:47:15,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168852017] [2023-11-19 04:47:15,722 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 04:47:15,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-19 04:47:15,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:47:15,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-19 04:47:15,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2023-11-19 04:47:15,725 INFO L87 Difference]: Start difference. First operand 276 states and 873 transitions. Second operand has 21 states, 20 states have (on average 3.0) internal successors, (60), 20 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:47:16,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:47:16,689 INFO L93 Difference]: Finished difference Result 383 states and 1229 transitions. [2023-11-19 04:47:16,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-19 04:47:16,690 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.0) internal successors, (60), 20 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-11-19 04:47:16,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:47:16,694 INFO L225 Difference]: With dead ends: 383 [2023-11-19 04:47:16,695 INFO L226 Difference]: Without dead ends: 376 [2023-11-19 04:47:16,695 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=135, Invalid=515, Unknown=0, NotChecked=0, Total=650 [2023-11-19 04:47:16,697 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 61 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 792 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 792 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-19 04:47:16,697 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 0 Invalid, 795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 792 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-19 04:47:16,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2023-11-19 04:47:16,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 300. [2023-11-19 04:47:16,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 299 states have (on average 3.220735785953177) internal successors, (963), 299 states have internal predecessors, (963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:47:16,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 963 transitions. [2023-11-19 04:47:16,715 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 963 transitions. Word has length 23 [2023-11-19 04:47:16,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:47:16,715 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 963 transitions. [2023-11-19 04:47:16,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.0) internal successors, (60), 20 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:47:16,716 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 963 transitions. [2023-11-19 04:47:16,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-19 04:47:16,718 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:47:16,718 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:47:16,744 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f9d9837-d7c8-4c7b-8420-5be704a1fe73/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-19 04:47:16,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f9d9837-d7c8-4c7b-8420-5be704a1fe73/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 04:47:16,933 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-19 04:47:16,933 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:47:16,933 INFO L85 PathProgramCache]: Analyzing trace with hash 219261040, now seen corresponding path program 3 times [2023-11-19 04:47:16,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:47:16,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768275224] [2023-11-19 04:47:16,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:47:16,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:47:16,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:47:17,910 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:47:17,910 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:47:17,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768275224] [2023-11-19 04:47:17,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768275224] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 04:47:17,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2069511100] [2023-11-19 04:47:17,911 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-19 04:47:17,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 04:47:17,911 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f9d9837-d7c8-4c7b-8420-5be704a1fe73/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 04:47:17,912 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f9d9837-d7c8-4c7b-8420-5be704a1fe73/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 04:47:17,916 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f9d9837-d7c8-4c7b-8420-5be704a1fe73/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-19 04:47:18,017 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-19 04:47:18,017 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-19 04:47:18,019 INFO L262 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 26 conjunts are in the unsatisfiable core [2023-11-19 04:47:18,022 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 04:47:18,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 31 [2023-11-19 04:47:18,569 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:47:18,569 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 04:47:18,793 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 04:47:18,793 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 131 treesize of output 75 [2023-11-19 04:47:19,276 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:47:19,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2069511100] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 04:47:19,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [840512615] [2023-11-19 04:47:19,277 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java: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:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java: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) [2023-11-19 04:47:19,278 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 04:47:19,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2023-11-19 04:47:19,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206302458] [2023-11-19 04:47:19,278 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 04:47:19,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-19 04:47:19,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:47:19,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-19 04:47:19,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2023-11-19 04:47:19,280 INFO L87 Difference]: Start difference. First operand 300 states and 963 transitions. Second operand has 23 states, 22 states have (on average 3.1363636363636362) internal successors, (69), 22 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:47:20,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:47:20,151 INFO L93 Difference]: Finished difference Result 423 states and 1371 transitions. [2023-11-19 04:47:20,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-19 04:47:20,152 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 3.1363636363636362) internal successors, (69), 22 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-11-19 04:47:20,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:47:20,156 INFO L225 Difference]: With dead ends: 423 [2023-11-19 04:47:20,156 INFO L226 Difference]: Without dead ends: 416 [2023-11-19 04:47:20,157 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=159, Invalid=653, Unknown=0, NotChecked=0, Total=812 [2023-11-19 04:47:20,157 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 86 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 772 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 772 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-19 04:47:20,158 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 0 Invalid, 776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 772 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-19 04:47:20,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2023-11-19 04:47:20,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 314. [2023-11-19 04:47:20,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 313 states have (on average 3.29073482428115) internal successors, (1030), 313 states have internal predecessors, (1030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:47:20,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 1030 transitions. [2023-11-19 04:47:20,178 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 1030 transitions. Word has length 23 [2023-11-19 04:47:20,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:47:20,180 INFO L495 AbstractCegarLoop]: Abstraction has 314 states and 1030 transitions. [2023-11-19 04:47:20,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 3.1363636363636362) internal successors, (69), 22 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:47:20,180 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 1030 transitions. [2023-11-19 04:47:20,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-19 04:47:20,183 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:47:20,183 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:47:20,208 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f9d9837-d7c8-4c7b-8420-5be704a1fe73/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-19 04:47:20,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f9d9837-d7c8-4c7b-8420-5be704a1fe73/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 04:47:20,401 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-19 04:47:20,401 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:47:20,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1351428860, now seen corresponding path program 4 times [2023-11-19 04:47:20,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:47:20,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822054051] [2023-11-19 04:47:20,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:47:20,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:47:20,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:47:21,675 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:47:21,675 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:47:21,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822054051] [2023-11-19 04:47:21,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822054051] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 04:47:21,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1440123887] [2023-11-19 04:47:21,676 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-11-19 04:47:21,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 04:47:21,676 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f9d9837-d7c8-4c7b-8420-5be704a1fe73/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 04:47:21,677 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f9d9837-d7c8-4c7b-8420-5be704a1fe73/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 04:47:21,696 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f9d9837-d7c8-4c7b-8420-5be704a1fe73/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-19 04:47:21,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:47:21,795 INFO L262 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 37 conjunts are in the unsatisfiable core [2023-11-19 04:47:21,798 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 04:47:21,871 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 [2023-11-19 04:47:21,938 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 8 treesize of output 1 [2023-11-19 04:47:22,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 04:47:22,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2023-11-19 04:47:22,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 04:47:22,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2023-11-19 04:47:22,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 31 [2023-11-19 04:47:22,564 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:47:22,565 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 04:47:23,349 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~max3~0 1)) (.cse3 (+ c_~A~0.offset (* 4 c_~M~0))) (.cse6 (+ c_~max2~0 1)) (.cse0 (= c_~max1~0 c_~max2~0))) (and (or .cse0 (forall ((v_ArrVal_216 (Array Int Int)) (v_ArrVal_217 (Array Int Int))) (let ((.cse1 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_216) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_217) c_~A~0.base) .cse3))) (or (< .cse1 .cse2) (= .cse1 c_~max1~0))))) (or (forall ((v_ArrVal_216 (Array Int Int)) (v_ArrVal_217 (Array Int Int))) (let ((.cse4 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_216) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_217) c_~A~0.base) .cse3))) (or (< .cse4 .cse2) (< c_~max2~0 .cse4)))) .cse0) (forall ((v_ArrVal_216 (Array Int Int)) (v_ArrVal_217 (Array Int Int))) (let ((.cse5 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_216) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_217) c_~A~0.base) .cse3))) (or (< .cse5 .cse2) (< .cse5 .cse6) (= .cse5 c_~max1~0)))) (or (forall ((v_ArrVal_216 (Array Int Int)) (v_ArrVal_217 (Array Int Int))) (< c_~max3~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_216) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_217) c_~A~0.base) .cse3))) (and (= c_~max1~0 c_~max3~0) (<= .cse6 c_~max3~0)) (and .cse0 (<= c_~max3~0 c_~max2~0))))) is different from false [2023-11-19 04:47:25,429 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 04:47:25,429 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 65 [2023-11-19 04:47:25,443 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 04:47:25,444 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 365 treesize of output 345 [2023-11-19 04:47:25,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 128 [2023-11-19 04:47:25,483 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 04:47:25,484 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 89 treesize of output 85 [2023-11-19 04:47:25,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 54 [2023-11-19 04:47:26,086 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-19 04:47:26,086 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 144 treesize of output 1 [2023-11-19 04:47:26,099 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 04:47:26,099 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 55 [2023-11-19 04:47:26,111 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-19 04:47:26,111 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-19 04:47:26,122 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-19 04:47:26,122 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 76 treesize of output 64 [2023-11-19 04:47:26,148 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-19 04:47:26,148 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 34 treesize of output 28 [2023-11-19 04:47:26,184 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 04:47:26,184 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 65 [2023-11-19 04:47:26,192 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-19 04:47:26,193 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-19 04:47:26,204 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-19 04:47:26,205 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 84 treesize of output 68 [2023-11-19 04:47:26,233 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-19 04:47:26,233 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 38 treesize of output 28 [2023-11-19 04:47:26,262 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 04:47:26,262 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 113 treesize of output 77 [2023-11-19 04:47:26,270 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-19 04:47:26,271 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-19 04:47:26,283 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-19 04:47:26,284 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 109 treesize of output 89 [2023-11-19 04:47:26,303 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-19 04:47:26,304 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 47 treesize of output 35 [2023-11-19 04:47:26,354 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 04:47:26,354 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 55 [2023-11-19 04:47:26,361 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-19 04:47:26,362 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-19 04:47:26,374 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-19 04:47:26,374 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 76 treesize of output 64 [2023-11-19 04:47:26,411 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-19 04:47:26,411 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 34 treesize of output 28 [2023-11-19 04:47:26,451 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-19 04:47:26,451 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 123 treesize of output 1 [2023-11-19 04:47:26,469 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 04:47:26,470 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 65 [2023-11-19 04:47:26,478 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-19 04:47:26,478 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-19 04:47:26,492 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-19 04:47:26,492 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 84 treesize of output 68 [2023-11-19 04:47:26,511 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-19 04:47:26,511 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 40 treesize of output 30 [2023-11-19 04:47:26,568 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 04:47:26,568 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 43 [2023-11-19 04:47:26,576 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-19 04:47:26,577 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-19 04:47:26,589 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-19 04:47:26,589 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 51 treesize of output 43 [2023-11-19 04:47:26,606 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-19 04:47:26,607 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 27 treesize of output 23 [2023-11-19 04:47:26,646 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-19 04:47:26,646 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 132 treesize of output 1 [2023-11-19 04:47:26,842 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:47:26,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1440123887] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 04:47:26,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [864164201] [2023-11-19 04:47:26,843 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java: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:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java: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) [2023-11-19 04:47:26,844 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 04:47:26,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 25 [2023-11-19 04:47:26,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819163649] [2023-11-19 04:47:26,844 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 04:47:26,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-11-19 04:47:26,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:47:26,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-11-19 04:47:26,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=540, Unknown=10, NotChecked=48, Total=702 [2023-11-19 04:47:26,846 INFO L87 Difference]: Start difference. First operand 314 states and 1030 transitions. Second operand has 27 states, 26 states have (on average 2.3846153846153846) internal successors, (62), 26 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) [2023-11-19 04:47:29,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:47:29,408 INFO L93 Difference]: Finished difference Result 527 states and 1703 transitions. [2023-11-19 04:47:29,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-19 04:47:29,409 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.3846153846153846) internal successors, (62), 26 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 23 [2023-11-19 04:47:29,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:47:29,415 INFO L225 Difference]: With dead ends: 527 [2023-11-19 04:47:29,415 INFO L226 Difference]: Without dead ends: 520 [2023-11-19 04:47:29,416 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=171, Invalid=875, Unknown=14, NotChecked=62, Total=1122 [2023-11-19 04:47:29,420 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 120 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 692 mSolverCounterSat, 6 mSolverCounterUnsat, 119 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 692 IncrementalHoareTripleChecker+Invalid, 119 IncrementalHoareTripleChecker+Unknown, 101 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-11-19 04:47:29,421 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 0 Invalid, 918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 692 Invalid, 119 Unknown, 101 Unchecked, 1.8s Time] [2023-11-19 04:47:29,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2023-11-19 04:47:29,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 316. [2023-11-19 04:47:29,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 315 states have (on average 3.2825396825396824) internal successors, (1034), 315 states have internal predecessors, (1034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:47:29,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 1034 transitions. [2023-11-19 04:47:29,444 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 1034 transitions. Word has length 23 [2023-11-19 04:47:29,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:47:29,444 INFO L495 AbstractCegarLoop]: Abstraction has 316 states and 1034 transitions. [2023-11-19 04:47:29,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.3846153846153846) internal successors, (62), 26 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) [2023-11-19 04:47:29,445 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 1034 transitions. [2023-11-19 04:47:29,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-19 04:47:29,448 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:47:29,448 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:47:29,475 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f9d9837-d7c8-4c7b-8420-5be704a1fe73/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-19 04:47:29,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f9d9837-d7c8-4c7b-8420-5be704a1fe73/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 04:47:29,670 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-19 04:47:29,671 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:47:29,671 INFO L85 PathProgramCache]: Analyzing trace with hash -110092862, now seen corresponding path program 5 times [2023-11-19 04:47:29,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:47:29,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367534650] [2023-11-19 04:47:29,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:47:29,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:47:29,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:47:30,581 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:47:30,582 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:47:30,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367534650] [2023-11-19 04:47:30,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367534650] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 04:47:30,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1875565971] [2023-11-19 04:47:30,582 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-19 04:47:30,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 04:47:30,582 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f9d9837-d7c8-4c7b-8420-5be704a1fe73/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 04:47:30,584 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f9d9837-d7c8-4c7b-8420-5be704a1fe73/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 04:47:30,611 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f9d9837-d7c8-4c7b-8420-5be704a1fe73/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-19 04:47:30,707 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-19 04:47:30,708 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-19 04:47:30,710 INFO L262 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 26 conjunts are in the unsatisfiable core [2023-11-19 04:47:30,713 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 04:47:31,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 31 [2023-11-19 04:47:31,273 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:47:31,274 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 04:47:31,579 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 04:47:31,579 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 107 treesize of output 75 [2023-11-19 04:47:32,098 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:47:32,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1875565971] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 04:47:32,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [651949615] [2023-11-19 04:47:32,099 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java: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:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java: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) [2023-11-19 04:47:32,100 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 04:47:32,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2023-11-19 04:47:32,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797993005] [2023-11-19 04:47:32,100 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 04:47:32,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-19 04:47:32,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:47:32,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-19 04:47:32,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2023-11-19 04:47:32,102 INFO L87 Difference]: Start difference. First operand 316 states and 1034 transitions. Second operand has 23 states, 22 states have (on average 3.1363636363636362) internal successors, (69), 22 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)