./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-theta/unwind2-100.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713cfcd-317a-4f2b-95a3-12aba5097cb6/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713cfcd-317a-4f2b-95a3-12aba5097cb6/bin/utaipan-verify-sOmjnqqW8E/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713cfcd-317a-4f2b-95a3-12aba5097cb6/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713cfcd-317a-4f2b-95a3-12aba5097cb6/bin/utaipan-verify-sOmjnqqW8E/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-theta/unwind2-100.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713cfcd-317a-4f2b-95a3-12aba5097cb6/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713cfcd-317a-4f2b-95a3-12aba5097cb6/bin/utaipan-verify-sOmjnqqW8E --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7857262d4d8d027aa598d94064d6edf426fece06c8ec09601338aa41711d7f37 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 04:08:43,520 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 04:08:43,580 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713cfcd-317a-4f2b-95a3-12aba5097cb6/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Default.epf [2024-11-14 04:08:43,585 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 04:08:43,585 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 04:08:43,609 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 04:08:43,610 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 04:08:43,610 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 04:08:43,610 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 04:08:43,610 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 04:08:43,610 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 04:08:43,610 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 04:08:43,611 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 04:08:43,611 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-14 04:08:43,611 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 04:08:43,611 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 04:08:43,611 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-14 04:08:43,611 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-14 04:08:43,611 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 04:08:43,611 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-14 04:08:43,611 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-14 04:08:43,611 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-14 04:08:43,612 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 04:08:43,612 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-14 04:08:43,612 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 04:08:43,612 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 04:08:43,612 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 04:08:43,612 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 04:08:43,612 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-14 04:08:43,612 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 04:08:43,612 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-14 04:08:43,613 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 04:08:43,613 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 04:08:43,613 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-14 04:08:43,613 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 04:08:43,614 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 04:08:43,614 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 04:08:43,614 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 04:08:43,614 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 04:08:43,614 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 04:08:43,614 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 04:08:43,615 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-14 04:08:43,615 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-14 04:08:43,615 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-14 04:08:43,615 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 04:08:43,615 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 04:08:43,615 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-14 04:08:43,615 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713cfcd-317a-4f2b-95a3-12aba5097cb6/bin/utaipan-verify-sOmjnqqW8E Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7857262d4d8d027aa598d94064d6edf426fece06c8ec09601338aa41711d7f37 [2024-11-14 04:08:43,909 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 04:08:43,920 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 04:08:43,923 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 04:08:43,924 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 04:08:43,924 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 04:08:43,926 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713cfcd-317a-4f2b-95a3-12aba5097cb6/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/pthread-theta/unwind2-100.i Unable to find full path for "g++" [2024-11-14 04:08:45,885 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 04:08:46,258 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 04:08:46,262 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713cfcd-317a-4f2b-95a3-12aba5097cb6/sv-benchmarks/c/pthread-theta/unwind2-100.i [2024-11-14 04:08:46,275 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713cfcd-317a-4f2b-95a3-12aba5097cb6/bin/utaipan-verify-sOmjnqqW8E/data/11002eb4d/b31c7a43c02049b1b3face06eab50bbf/FLAG9c39d2f98 [2024-11-14 04:08:46,289 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713cfcd-317a-4f2b-95a3-12aba5097cb6/bin/utaipan-verify-sOmjnqqW8E/data/11002eb4d/b31c7a43c02049b1b3face06eab50bbf [2024-11-14 04:08:46,292 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 04:08:46,293 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 04:08:46,295 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 04:08:46,295 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 04:08:46,300 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 04:08:46,301 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:08:46" (1/1) ... [2024-11-14 04:08:46,302 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5dad7b22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:08:46, skipping insertion in model container [2024-11-14 04:08:46,302 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:08:46" (1/1) ... [2024-11-14 04:08:46,337 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 04:08:46,658 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713cfcd-317a-4f2b-95a3-12aba5097cb6/sv-benchmarks/c/pthread-theta/unwind2-100.i[33026,33039] [2024-11-14 04:08:46,683 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 04:08:46,695 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 04:08:46,756 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713cfcd-317a-4f2b-95a3-12aba5097cb6/sv-benchmarks/c/pthread-theta/unwind2-100.i[33026,33039] [2024-11-14 04:08:46,767 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 04:08:46,815 INFO L204 MainTranslator]: Completed translation [2024-11-14 04:08:46,816 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:08:46 WrapperNode [2024-11-14 04:08:46,816 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 04:08:46,818 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 04:08:46,818 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 04:08:46,818 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 04:08:46,826 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:08:46" (1/1) ... [2024-11-14 04:08:46,843 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:08:46" (1/1) ... [2024-11-14 04:08:46,868 INFO L138 Inliner]: procedures = 169, calls = 11, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 79 [2024-11-14 04:08:46,870 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 04:08:46,871 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 04:08:46,871 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 04:08:46,871 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 04:08:46,878 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:08:46" (1/1) ... [2024-11-14 04:08:46,879 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:08:46" (1/1) ... [2024-11-14 04:08:46,881 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:08:46" (1/1) ... [2024-11-14 04:08:46,883 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:08:46" (1/1) ... [2024-11-14 04:08:46,892 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:08:46" (1/1) ... [2024-11-14 04:08:46,899 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:08:46" (1/1) ... [2024-11-14 04:08:46,900 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:08:46" (1/1) ... [2024-11-14 04:08:46,901 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:08:46" (1/1) ... [2024-11-14 04:08:46,903 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 04:08:46,907 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 04:08:46,907 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 04:08:46,907 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 04:08:46,910 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:08:46" (1/1) ... [2024-11-14 04:08:46,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 04:08:46,940 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713cfcd-317a-4f2b-95a3-12aba5097cb6/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:08:46,955 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713cfcd-317a-4f2b-95a3-12aba5097cb6/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 04:08:46,959 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713cfcd-317a-4f2b-95a3-12aba5097cb6/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 04:08:46,981 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 04:08:46,981 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2024-11-14 04:08:46,982 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2024-11-14 04:08:46,982 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2024-11-14 04:08:46,982 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2024-11-14 04:08:46,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-14 04:08:46,982 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 04:08:46,982 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 04:08:46,983 WARN L207 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-14 04:08:47,121 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 04:08:47,123 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 04:08:47,280 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-14 04:08:47,281 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 04:08:47,403 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 04:08:47,404 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-14 04:08:47,404 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:08:47 BoogieIcfgContainer [2024-11-14 04:08:47,404 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 04:08:47,407 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 04:08:47,407 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 04:08:47,414 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 04:08:47,414 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 04:08:46" (1/3) ... [2024-11-14 04:08:47,415 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7359a9dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:08:47, skipping insertion in model container [2024-11-14 04:08:47,415 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:08:46" (2/3) ... [2024-11-14 04:08:47,415 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7359a9dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:08:47, skipping insertion in model container [2024-11-14 04:08:47,415 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:08:47" (3/3) ... [2024-11-14 04:08:47,416 INFO L112 eAbstractionObserver]: Analyzing ICFG unwind2-100.i [2024-11-14 04:08:47,438 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 04:08:47,440 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG unwind2-100.i that has 3 procedures, 27 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2024-11-14 04:08:47,440 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-14 04:08:47,499 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-14 04:08:47,530 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 33 places, 30 transitions, 74 flow [2024-11-14 04:08:47,576 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 181 states, 178 states have (on average 2.6235955056179776) internal successors, (467), 180 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:08:47,626 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 04:08:47,637 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@70154a8e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 04:08:47,637 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-14 04:08:47,644 INFO L276 IsEmpty]: Start isEmpty. Operand has 181 states, 178 states have (on average 2.6235955056179776) internal successors, (467), 180 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:08:47,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-14 04:08:47,651 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:08:47,652 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:08:47,654 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting f1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-14 04:08:47,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:08:47,659 INFO L85 PathProgramCache]: Analyzing trace with hash 816868995, now seen corresponding path program 1 times [2024-11-14 04:08:47,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:08:47,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610298921] [2024-11-14 04:08:47,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:08:47,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:08:47,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:08:48,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:08:48,122 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:08:48,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610298921] [2024-11-14 04:08:48,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610298921] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:08:48,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:08:48,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 04:08:48,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227464061] [2024-11-14 04:08:48,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:08:48,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 04:08:48,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:08:48,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 04:08:48,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 04:08:48,160 INFO L87 Difference]: Start difference. First operand has 181 states, 178 states have (on average 2.6235955056179776) internal successors, (467), 180 states have internal predecessors, (467), 0 states have call successors, (0), 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 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:08:48,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:08:48,482 INFO L93 Difference]: Finished difference Result 425 states and 1121 transitions. [2024-11-14 04:08:48,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 04:08:48,486 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2024-11-14 04:08:48,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:08:48,501 INFO L225 Difference]: With dead ends: 425 [2024-11-14 04:08:48,501 INFO L226 Difference]: Without dead ends: 310 [2024-11-14 04:08:48,504 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2024-11-14 04:08:48,510 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 96 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 04:08:48,511 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 53 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 04:08:48,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2024-11-14 04:08:48,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 215. [2024-11-14 04:08:48,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 212 states have (on average 2.457547169811321) internal successors, (521), 214 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:08:48,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 521 transitions. [2024-11-14 04:08:48,584 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 521 transitions. Word has length 8 [2024-11-14 04:08:48,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:08:48,584 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 521 transitions. [2024-11-14 04:08:48,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:08:48,584 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 521 transitions. [2024-11-14 04:08:48,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-14 04:08:48,585 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:08:48,585 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:08:48,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-14 04:08:48,586 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting f1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-14 04:08:48,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:08:48,586 INFO L85 PathProgramCache]: Analyzing trace with hash -446895526, now seen corresponding path program 1 times [2024-11-14 04:08:48,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:08:48,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768213690] [2024-11-14 04:08:48,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:08:48,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:08:48,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:08:48,799 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:08:48,799 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:08:48,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768213690] [2024-11-14 04:08:48,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768213690] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:08:48,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1994595275] [2024-11-14 04:08:48,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:08:48,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:08:48,800 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713cfcd-317a-4f2b-95a3-12aba5097cb6/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:08:48,805 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713cfcd-317a-4f2b-95a3-12aba5097cb6/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:08:48,807 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713cfcd-317a-4f2b-95a3-12aba5097cb6/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-14 04:08:48,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:08:48,900 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-14 04:08:48,904 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:08:49,005 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:08:49,006 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:08:49,134 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:08:49,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1994595275] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 04:08:49,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1832442798] [2024-11-14 04:08:49,145 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-14 04:08:49,150 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 04:08:49,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2024-11-14 04:08:49,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756614281] [2024-11-14 04:08:49,151 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 04:08:49,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-14 04:08:49,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:08:49,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-14 04:08:49,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2024-11-14 04:08:49,153 INFO L87 Difference]: Start difference. First operand 215 states and 521 transitions. Second operand has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:08:49,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:08:49,697 INFO L93 Difference]: Finished difference Result 511 states and 1329 transitions. [2024-11-14 04:08:49,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-14 04:08:49,698 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-14 04:08:49,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:08:49,702 INFO L225 Difference]: With dead ends: 511 [2024-11-14 04:08:49,702 INFO L226 Difference]: Without dead ends: 412 [2024-11-14 04:08:49,703 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=174, Invalid=378, Unknown=0, NotChecked=0, Total=552 [2024-11-14 04:08:49,704 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 196 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 04:08:49,704 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 117 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 04:08:49,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2024-11-14 04:08:49,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 275. [2024-11-14 04:08:49,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 272 states have (on average 2.4558823529411766) internal successors, (668), 274 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:08:49,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 668 transitions. [2024-11-14 04:08:49,772 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 668 transitions. Word has length 9 [2024-11-14 04:08:49,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:08:49,772 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 668 transitions. [2024-11-14 04:08:49,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:08:49,773 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 668 transitions. [2024-11-14 04:08:49,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-14 04:08:49,775 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:08:49,775 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:08:49,796 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713cfcd-317a-4f2b-95a3-12aba5097cb6/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-14 04:08:49,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713cfcd-317a-4f2b-95a3-12aba5097cb6/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:08:49,979 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-14 04:08:49,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:08:49,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1904796487, now seen corresponding path program 1 times [2024-11-14 04:08:49,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:08:49,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529042222] [2024-11-14 04:08:49,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:08:49,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:08:50,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:08:50,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:08:50,185 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:08:50,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529042222] [2024-11-14 04:08:50,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529042222] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:08:50,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:08:50,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 04:08:50,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306720358] [2024-11-14 04:08:50,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:08:50,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 04:08:50,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:08:50,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 04:08:50,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 04:08:50,187 INFO L87 Difference]: Start difference. First operand 275 states and 668 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:08:50,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:08:50,464 INFO L93 Difference]: Finished difference Result 597 states and 1489 transitions. [2024-11-14 04:08:50,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 04:08:50,465 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2024-11-14 04:08:50,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:08:50,468 INFO L225 Difference]: With dead ends: 597 [2024-11-14 04:08:50,468 INFO L226 Difference]: Without dead ends: 462 [2024-11-14 04:08:50,469 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2024-11-14 04:08:50,470 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 107 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 04:08:50,470 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 38 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 04:08:50,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2024-11-14 04:08:50,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 325. [2024-11-14 04:08:50,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 322 states have (on average 2.459627329192547) internal successors, (792), 324 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:08:50,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 792 transitions. [2024-11-14 04:08:50,522 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 792 transitions. Word has length 10 [2024-11-14 04:08:50,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:08:50,522 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 792 transitions. [2024-11-14 04:08:50,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:08:50,522 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 792 transitions. [2024-11-14 04:08:50,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-14 04:08:50,523 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:08:50,523 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:08:50,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-14 04:08:50,524 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-14 04:08:50,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:08:50,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1080820462, now seen corresponding path program 1 times [2024-11-14 04:08:50,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:08:50,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717822352] [2024-11-14 04:08:50,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:08:50,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:08:50,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:08:50,635 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:08:50,636 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:08:50,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717822352] [2024-11-14 04:08:50,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717822352] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:08:50,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [730865588] [2024-11-14 04:08:50,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:08:50,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:08:50,636 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713cfcd-317a-4f2b-95a3-12aba5097cb6/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:08:50,638 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713cfcd-317a-4f2b-95a3-12aba5097cb6/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:08:50,639 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713cfcd-317a-4f2b-95a3-12aba5097cb6/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-14 04:08:50,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:08:50,721 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-14 04:08:50,722 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:08:50,807 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:08:50,808 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:08:50,886 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:08:50,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [730865588] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 04:08:50,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [321105071] [2024-11-14 04:08:50,887 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-14 04:08:50,888 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 04:08:50,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2024-11-14 04:08:50,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940205600] [2024-11-14 04:08:50,889 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 04:08:50,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-14 04:08:50,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:08:50,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-14 04:08:50,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2024-11-14 04:08:50,890 INFO L87 Difference]: Start difference. First operand 325 states and 792 transitions. Second operand has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:08:51,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:08:51,395 INFO L93 Difference]: Finished difference Result 747 states and 1961 transitions. [2024-11-14 04:08:51,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-14 04:08:51,395 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-14 04:08:51,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:08:51,400 INFO L225 Difference]: With dead ends: 747 [2024-11-14 04:08:51,400 INFO L226 Difference]: Without dead ends: 612 [2024-11-14 04:08:51,401 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=174, Invalid=378, Unknown=0, NotChecked=0, Total=552 [2024-11-14 04:08:51,402 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 291 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 04:08:51,402 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 76 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 04:08:51,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2024-11-14 04:08:51,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 412. [2024-11-14 04:08:51,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 409 states have (on average 2.4645476772616135) internal successors, (1008), 411 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:08:51,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 1008 transitions. [2024-11-14 04:08:51,486 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 1008 transitions. Word has length 11 [2024-11-14 04:08:51,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:08:51,486 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 1008 transitions. [2024-11-14 04:08:51,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:08:51,487 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 1008 transitions. [2024-11-14 04:08:51,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-14 04:08:51,488 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:08:51,488 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:08:51,510 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713cfcd-317a-4f2b-95a3-12aba5097cb6/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-14 04:08:51,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713cfcd-317a-4f2b-95a3-12aba5097cb6/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:08:51,694 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting f1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-14 04:08:51,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:08:51,695 INFO L85 PathProgramCache]: Analyzing trace with hash 167738840, now seen corresponding path program 1 times [2024-11-14 04:08:51,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:08:51,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166629638] [2024-11-14 04:08:51,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:08:51,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:08:51,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:08:51,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:08:51,830 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:08:51,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166629638] [2024-11-14 04:08:51,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166629638] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:08:51,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:08:51,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 04:08:51,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441279806] [2024-11-14 04:08:51,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:08:51,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 04:08:51,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:08:51,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 04:08:51,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 04:08:51,831 INFO L87 Difference]: Start difference. First operand 412 states and 1008 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:08:52,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:08:52,097 INFO L93 Difference]: Finished difference Result 745 states and 1832 transitions. [2024-11-14 04:08:52,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 04:08:52,098 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-14 04:08:52,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:08:52,105 INFO L225 Difference]: With dead ends: 745 [2024-11-14 04:08:52,105 INFO L226 Difference]: Without dead ends: 634 [2024-11-14 04:08:52,106 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-14 04:08:52,106 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 73 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 04:08:52,107 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 46 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 04:08:52,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2024-11-14 04:08:52,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 412. [2024-11-14 04:08:52,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 409 states have (on average 2.4645476772616135) internal successors, (1008), 411 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:08:52,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 1008 transitions. [2024-11-14 04:08:52,185 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 1008 transitions. Word has length 12 [2024-11-14 04:08:52,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:08:52,185 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 1008 transitions. [2024-11-14 04:08:52,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:08:52,186 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 1008 transitions. [2024-11-14 04:08:52,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-14 04:08:52,190 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:08:52,190 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:08:52,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-14 04:08:52,190 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-14 04:08:52,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:08:52,190 INFO L85 PathProgramCache]: Analyzing trace with hash -488696946, now seen corresponding path program 1 times [2024-11-14 04:08:52,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:08:52,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030064810] [2024-11-14 04:08:52,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:08:52,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:08:52,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:08:52,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:08:52,323 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:08:52,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030064810] [2024-11-14 04:08:52,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030064810] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:08:52,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:08:52,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 04:08:52,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674474063] [2024-11-14 04:08:52,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:08:52,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 04:08:52,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:08:52,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 04:08:52,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 04:08:52,324 INFO L87 Difference]: Start difference. First operand 412 states and 1008 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:08:52,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:08:52,578 INFO L93 Difference]: Finished difference Result 740 states and 1822 transitions. [2024-11-14 04:08:52,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 04:08:52,579 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-14 04:08:52,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:08:52,592 INFO L225 Difference]: With dead ends: 740 [2024-11-14 04:08:52,593 INFO L226 Difference]: Without dead ends: 635 [2024-11-14 04:08:52,593 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-14 04:08:52,594 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 91 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 04:08:52,594 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 34 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 04:08:52,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2024-11-14 04:08:52,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 412. [2024-11-14 04:08:52,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 409 states have (on average 2.4645476772616135) internal successors, (1008), 411 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:08:52,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 1008 transitions. [2024-11-14 04:08:52,668 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 1008 transitions. Word has length 12 [2024-11-14 04:08:52,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:08:52,669 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 1008 transitions. [2024-11-14 04:08:52,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:08:52,669 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 1008 transitions. [2024-11-14 04:08:52,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-14 04:08:52,670 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:08:52,670 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:08:52,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-14 04:08:52,671 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting f1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-14 04:08:52,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:08:52,671 INFO L85 PathProgramCache]: Analyzing trace with hash 903621699, now seen corresponding path program 2 times [2024-11-14 04:08:52,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:08:52,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822214614] [2024-11-14 04:08:52,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:08:52,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:08:52,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:08:52,851 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:08:52,852 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:08:52,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822214614] [2024-11-14 04:08:52,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822214614] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:08:52,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [504787042] [2024-11-14 04:08:52,852 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 04:08:52,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:08:52,852 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713cfcd-317a-4f2b-95a3-12aba5097cb6/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:08:52,854 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713cfcd-317a-4f2b-95a3-12aba5097cb6/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:08:52,855 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713cfcd-317a-4f2b-95a3-12aba5097cb6/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-14 04:08:52,925 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-14 04:08:52,925 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 04:08:52,926 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-14 04:08:52,927 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:08:53,009 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 04:08:53,009 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:08:53,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [504787042] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:08:53,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 04:08:53,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 14 [2024-11-14 04:08:53,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706956843] [2024-11-14 04:08:53,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:08:53,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 04:08:53,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:08:53,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 04:08:53,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2024-11-14 04:08:53,011 INFO L87 Difference]: Start difference. First operand 412 states and 1008 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:08:53,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:08:53,377 INFO L93 Difference]: Finished difference Result 727 states and 1807 transitions. [2024-11-14 04:08:53,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-14 04:08:53,377 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-14 04:08:53,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:08:53,382 INFO L225 Difference]: With dead ends: 727 [2024-11-14 04:08:53,382 INFO L226 Difference]: Without dead ends: 607 [2024-11-14 04:08:53,383 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2024-11-14 04:08:53,384 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 89 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 04:08:53,384 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 62 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 04:08:53,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2024-11-14 04:08:53,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 426. [2024-11-14 04:08:53,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 423 states have (on average 2.513002364066194) internal successors, (1063), 425 states have internal predecessors, (1063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:08:53,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 1063 transitions. [2024-11-14 04:08:53,468 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 1063 transitions. Word has length 12 [2024-11-14 04:08:53,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:08:53,468 INFO L471 AbstractCegarLoop]: Abstraction has 426 states and 1063 transitions. [2024-11-14 04:08:53,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:08:53,468 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 1063 transitions. [2024-11-14 04:08:53,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-14 04:08:53,469 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:08:53,469 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:08:53,489 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713cfcd-317a-4f2b-95a3-12aba5097cb6/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-14 04:08:53,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713cfcd-317a-4f2b-95a3-12aba5097cb6/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-14 04:08:53,673 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting f1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-14 04:08:53,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:08:53,674 INFO L85 PathProgramCache]: Analyzing trace with hash 904906149, now seen corresponding path program 1 times [2024-11-14 04:08:53,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:08:53,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614870468] [2024-11-14 04:08:53,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:08:53,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:08:53,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:08:53,774 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:08:53,774 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:08:53,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614870468] [2024-11-14 04:08:53,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614870468] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:08:53,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1763255957] [2024-11-14 04:08:53,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:08:53,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:08:53,775 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713cfcd-317a-4f2b-95a3-12aba5097cb6/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:08:53,778 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713cfcd-317a-4f2b-95a3-12aba5097cb6/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:08:53,781 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713cfcd-317a-4f2b-95a3-12aba5097cb6/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-14 04:08:53,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:08:53,850 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-14 04:08:53,851 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:08:53,911 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:08:53,912 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:08:53,987 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:08:53,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1763255957] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 04:08:53,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1806120677] [2024-11-14 04:08:53,988 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-14 04:08:53,988 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 04:08:53,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2024-11-14 04:08:53,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185369374] [2024-11-14 04:08:53,988 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 04:08:53,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-14 04:08:53,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:08:53,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-14 04:08:53,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2024-11-14 04:08:53,989 INFO L87 Difference]: Start difference. First operand 426 states and 1063 transitions. Second operand has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:08:54,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:08:54,352 INFO L93 Difference]: Finished difference Result 739 states and 1881 transitions. [2024-11-14 04:08:54,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-14 04:08:54,353 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-14 04:08:54,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:08:54,358 INFO L225 Difference]: With dead ends: 739 [2024-11-14 04:08:54,358 INFO L226 Difference]: Without dead ends: 628 [2024-11-14 04:08:54,358 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=263, Unknown=0, NotChecked=0, Total=380 [2024-11-14 04:08:54,359 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 204 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 04:08:54,359 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 47 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 04:08:54,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2024-11-14 04:08:54,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 492. [2024-11-14 04:08:54,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 489 states have (on average 2.511247443762781) internal successors, (1228), 491 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:08:54,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 1228 transitions. [2024-11-14 04:08:54,452 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 1228 transitions. Word has length 13 [2024-11-14 04:08:54,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:08:54,453 INFO L471 AbstractCegarLoop]: Abstraction has 492 states and 1228 transitions. [2024-11-14 04:08:54,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:08:54,453 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 1228 transitions. [2024-11-14 04:08:54,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-14 04:08:54,454 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:08:54,454 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:08:54,473 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713cfcd-317a-4f2b-95a3-12aba5097cb6/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-14 04:08:54,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713cfcd-317a-4f2b-95a3-12aba5097cb6/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-11-14 04:08:54,658 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-14 04:08:54,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:08:54,658 INFO L85 PathProgramCache]: Analyzing trace with hash 2030233273, now seen corresponding path program 1 times [2024-11-14 04:08:54,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:08:54,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703382429] [2024-11-14 04:08:54,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:08:54,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:08:54,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:08:54,745 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:08:54,746 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:08:54,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703382429] [2024-11-14 04:08:54,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703382429] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:08:54,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1626189723] [2024-11-14 04:08:54,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:08:54,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:08:54,747 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713cfcd-317a-4f2b-95a3-12aba5097cb6/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:08:54,748 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713cfcd-317a-4f2b-95a3-12aba5097cb6/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:08:54,750 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713cfcd-317a-4f2b-95a3-12aba5097cb6/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-14 04:08:54,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:08:54,814 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-14 04:08:54,815 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:08:54,871 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:08:54,872 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:08:54,945 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:08:54,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1626189723] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 04:08:54,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [701499643] [2024-11-14 04:08:54,945 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-14 04:08:54,946 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 04:08:54,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2024-11-14 04:08:54,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115216667] [2024-11-14 04:08:54,946 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 04:08:54,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-14 04:08:54,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:08:54,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-14 04:08:54,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2024-11-14 04:08:54,947 INFO L87 Difference]: Start difference. First operand 492 states and 1228 transitions. Second operand has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:08:55,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:08:55,405 INFO L93 Difference]: Finished difference Result 761 states and 1931 transitions. [2024-11-14 04:08:55,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-14 04:08:55,406 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-14 04:08:55,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:08:55,411 INFO L225 Difference]: With dead ends: 761 [2024-11-14 04:08:55,411 INFO L226 Difference]: Without dead ends: 704 [2024-11-14 04:08:55,412 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=263, Unknown=0, NotChecked=0, Total=380 [2024-11-14 04:08:55,413 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 157 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 04:08:55,413 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 70 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 04:08:55,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2024-11-14 04:08:55,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 475. [2024-11-14 04:08:55,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 472 states have (on average 2.51271186440678) internal successors, (1186), 474 states have internal predecessors, (1186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:08:55,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 1186 transitions. [2024-11-14 04:08:55,511 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 1186 transitions. Word has length 13 [2024-11-14 04:08:55,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:08:55,511 INFO L471 AbstractCegarLoop]: Abstraction has 475 states and 1186 transitions. [2024-11-14 04:08:55,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:08:55,511 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 1186 transitions. [2024-11-14 04:08:55,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-14 04:08:55,512 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:08:55,512 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:08:55,533 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713cfcd-317a-4f2b-95a3-12aba5097cb6/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-14 04:08:55,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713cfcd-317a-4f2b-95a3-12aba5097cb6/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:08:55,717 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-14 04:08:55,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:08:55,717 INFO L85 PathProgramCache]: Analyzing trace with hash -677805575, now seen corresponding path program 2 times [2024-11-14 04:08:55,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:08:55,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760018937] [2024-11-14 04:08:55,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:08:55,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:08:55,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:08:55,860 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:08:55,861 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:08:55,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760018937] [2024-11-14 04:08:55,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760018937] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:08:55,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1341550180] [2024-11-14 04:08:55,861 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 04:08:55,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:08:55,861 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713cfcd-317a-4f2b-95a3-12aba5097cb6/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:08:55,863 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713cfcd-317a-4f2b-95a3-12aba5097cb6/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:08:55,864 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713cfcd-317a-4f2b-95a3-12aba5097cb6/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-14 04:08:55,928 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-14 04:08:55,929 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 04:08:55,930 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-14 04:08:55,930 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:08:55,996 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 04:08:55,996 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:08:55,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1341550180] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:08:55,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 04:08:55,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 14 [2024-11-14 04:08:55,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585899615] [2024-11-14 04:08:55,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:08:55,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 04:08:55,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:08:55,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 04:08:55,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2024-11-14 04:08:55,997 INFO L87 Difference]: Start difference. First operand 475 states and 1186 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:08:56,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:08:56,410 INFO L93 Difference]: Finished difference Result 746 states and 1873 transitions. [2024-11-14 04:08:56,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-14 04:08:56,410 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-14 04:08:56,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:08:56,413 INFO L225 Difference]: With dead ends: 746 [2024-11-14 04:08:56,413 INFO L226 Difference]: Without dead ends: 357 [2024-11-14 04:08:56,414 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2024-11-14 04:08:56,415 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 74 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 04:08:56,420 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 63 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 04:08:56,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2024-11-14 04:08:56,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 357. [2024-11-14 04:08:56,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 355 states have (on average 2.456338028169014) internal successors, (872), 356 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:08:56,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 872 transitions. [2024-11-14 04:08:56,503 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 872 transitions. Word has length 14 [2024-11-14 04:08:56,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:08:56,503 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 872 transitions. [2024-11-14 04:08:56,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:08:56,503 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 872 transitions. [2024-11-14 04:08:56,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-14 04:08:56,504 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:08:56,504 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:08:56,523 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713cfcd-317a-4f2b-95a3-12aba5097cb6/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-14 04:08:56,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713cfcd-317a-4f2b-95a3-12aba5097cb6/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-14 04:08:56,708 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting f1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-14 04:08:56,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:08:56,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1481012968, now seen corresponding path program 2 times [2024-11-14 04:08:56,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:08:56,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202018110] [2024-11-14 04:08:56,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:08:56,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:08:56,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:08:56,863 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:08:56,863 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:08:56,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202018110] [2024-11-14 04:08:56,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202018110] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:08:56,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2052940654] [2024-11-14 04:08:56,863 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 04:08:56,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:08:56,864 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713cfcd-317a-4f2b-95a3-12aba5097cb6/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:08:56,866 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713cfcd-317a-4f2b-95a3-12aba5097cb6/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:08:56,867 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713cfcd-317a-4f2b-95a3-12aba5097cb6/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-14 04:08:56,932 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-14 04:08:56,933 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 04:08:56,934 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-14 04:08:56,934 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:08:57,044 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:08:57,045 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:08:57,189 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:08:57,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2052940654] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 04:08:57,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [288241078] [2024-11-14 04:08:57,189 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-14 04:08:57,190 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 04:08:57,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2024-11-14 04:08:57,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300954966] [2024-11-14 04:08:57,190 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 04:08:57,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-14 04:08:57,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:08:57,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-14 04:08:57,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=361, Unknown=0, NotChecked=0, Total=506 [2024-11-14 04:08:57,191 INFO L87 Difference]: Start difference. First operand 357 states and 872 transitions. Second operand has 23 states, 23 states have (on average 1.565217391304348) internal successors, (36), 22 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:08:57,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:08:57,734 INFO L93 Difference]: Finished difference Result 519 states and 1367 transitions. [2024-11-14 04:08:57,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-14 04:08:57,735 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.565217391304348) internal successors, (36), 22 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-14 04:08:57,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:08:57,739 INFO L225 Difference]: With dead ends: 519 [2024-11-14 04:08:57,739 INFO L226 Difference]: Without dead ends: 465 [2024-11-14 04:08:57,740 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=375, Invalid=815, Unknown=0, NotChecked=0, Total=1190 [2024-11-14 04:08:57,741 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 241 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 04:08:57,741 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 54 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 04:08:57,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2024-11-14 04:08:57,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 465. [2024-11-14 04:08:57,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 463 states have (on average 2.466522678185745) internal successors, (1142), 464 states have internal predecessors, (1142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:08:57,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 1142 transitions. [2024-11-14 04:08:57,830 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 1142 transitions. Word has length 16 [2024-11-14 04:08:57,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:08:57,830 INFO L471 AbstractCegarLoop]: Abstraction has 465 states and 1142 transitions. [2024-11-14 04:08:57,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.565217391304348) internal successors, (36), 22 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:08:57,830 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 1142 transitions. [2024-11-14 04:08:57,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-14 04:08:57,832 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:08:57,832 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:08:57,850 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713cfcd-317a-4f2b-95a3-12aba5097cb6/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-14 04:08:58,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713cfcd-317a-4f2b-95a3-12aba5097cb6/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-14 04:08:58,036 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-14 04:08:58,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:08:58,036 INFO L85 PathProgramCache]: Analyzing trace with hash 919602766, now seen corresponding path program 2 times [2024-11-14 04:08:58,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:08:58,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825724617] [2024-11-14 04:08:58,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:08:58,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:08:58,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:08:58,172 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:08:58,172 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:08:58,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825724617] [2024-11-14 04:08:58,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825724617] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:08:58,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1754747760] [2024-11-14 04:08:58,173 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 04:08:58,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:08:58,173 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713cfcd-317a-4f2b-95a3-12aba5097cb6/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:08:58,176 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713cfcd-317a-4f2b-95a3-12aba5097cb6/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:08:58,180 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713cfcd-317a-4f2b-95a3-12aba5097cb6/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-14 04:08:58,243 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-14 04:08:58,243 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 04:08:58,245 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-14 04:08:58,246 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:08:58,362 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:08:58,362 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:08:58,510 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:08:58,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1754747760] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 04:08:58,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1393955740] [2024-11-14 04:08:58,511 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-14 04:08:58,512 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 04:08:58,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2024-11-14 04:08:58,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797618336] [2024-11-14 04:08:58,512 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 04:08:58,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-14 04:08:58,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:08:58,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-14 04:08:58,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=361, Unknown=0, NotChecked=0, Total=506 [2024-11-14 04:08:58,513 INFO L87 Difference]: Start difference. First operand 465 states and 1142 transitions. Second operand has 23 states, 23 states have (on average 1.565217391304348) internal successors, (36), 22 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:08:59,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:08:59,165 INFO L93 Difference]: Finished difference Result 636 states and 1660 transitions. [2024-11-14 04:08:59,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-14 04:08:59,166 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.565217391304348) internal successors, (36), 22 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-14 04:08:59,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:08:59,170 INFO L225 Difference]: With dead ends: 636 [2024-11-14 04:08:59,170 INFO L226 Difference]: Without dead ends: 579 [2024-11-14 04:08:59,171 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=375, Invalid=815, Unknown=0, NotChecked=0, Total=1190 [2024-11-14 04:08:59,171 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 253 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 04:08:59,172 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 48 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 04:08:59,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2024-11-14 04:08:59,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 579. [2024-11-14 04:08:59,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 579 states, 577 states have (on average 2.467937608318891) internal successors, (1424), 578 states have internal predecessors, (1424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:08:59,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 1424 transitions. [2024-11-14 04:08:59,284 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 1424 transitions. Word has length 16 [2024-11-14 04:08:59,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:08:59,285 INFO L471 AbstractCegarLoop]: Abstraction has 579 states and 1424 transitions. [2024-11-14 04:08:59,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.565217391304348) internal successors, (36), 22 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:08:59,285 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 1424 transitions. [2024-11-14 04:08:59,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-14 04:08:59,286 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:08:59,287 INFO L215 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:08:59,306 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713cfcd-317a-4f2b-95a3-12aba5097cb6/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-14 04:08:59,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713cfcd-317a-4f2b-95a3-12aba5097cb6/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-14 04:08:59,488 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting f1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-14 04:08:59,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:08:59,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1480503816, now seen corresponding path program 3 times [2024-11-14 04:08:59,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:08:59,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710011890] [2024-11-14 04:08:59,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:08:59,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:08:59,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:08:59,788 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:08:59,788 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:08:59,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710011890] [2024-11-14 04:08:59,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710011890] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:08:59,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [795716054] [2024-11-14 04:08:59,788 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-14 04:08:59,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:08:59,789 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713cfcd-317a-4f2b-95a3-12aba5097cb6/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:08:59,791 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713cfcd-317a-4f2b-95a3-12aba5097cb6/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:08:59,794 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713cfcd-317a-4f2b-95a3-12aba5097cb6/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-14 04:08:59,867 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-14 04:08:59,868 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 04:08:59,869 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-14 04:08:59,870 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:09:00,123 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:09:00,123 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:09:00,486 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:09:00,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [795716054] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 04:09:00,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [796061182] [2024-11-14 04:09:00,487 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-14 04:09:00,487 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 04:09:00,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 40 [2024-11-14 04:09:00,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075930728] [2024-11-14 04:09:00,487 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 04:09:00,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-11-14 04:09:00,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:09:00,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-11-14 04:09:00,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=565, Invalid=1075, Unknown=0, NotChecked=0, Total=1640 [2024-11-14 04:09:00,489 INFO L87 Difference]: Start difference. First operand 579 states and 1424 transitions. Second operand has 41 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 40 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:09:01,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:09:01,603 INFO L93 Difference]: Finished difference Result 849 states and 2297 transitions. [2024-11-14 04:09:01,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-14 04:09:01,603 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 40 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-14 04:09:01,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:09:01,609 INFO L225 Difference]: With dead ends: 849 [2024-11-14 04:09:01,609 INFO L226 Difference]: Without dead ends: 795 [2024-11-14 04:09:01,610 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1104 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1350, Invalid=2810, Unknown=0, NotChecked=0, Total=4160 [2024-11-14 04:09:01,611 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 505 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 505 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 04:09:01,612 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [505 Valid, 87 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 04:09:01,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2024-11-14 04:09:01,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 795. [2024-11-14 04:09:01,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 795 states, 793 states have (on average 2.476670870113493) internal successors, (1964), 794 states have internal predecessors, (1964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:09:01,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 1964 transitions. [2024-11-14 04:09:01,785 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 1964 transitions. Word has length 22 [2024-11-14 04:09:01,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:09:01,785 INFO L471 AbstractCegarLoop]: Abstraction has 795 states and 1964 transitions. [2024-11-14 04:09:01,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 40 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:09:01,785 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1964 transitions. [2024-11-14 04:09:01,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-14 04:09:01,787 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:09:01,787 INFO L215 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:09:01,807 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713cfcd-317a-4f2b-95a3-12aba5097cb6/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-14 04:09:01,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713cfcd-317a-4f2b-95a3-12aba5097cb6/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-14 04:09:01,988 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-14 04:09:01,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:09:01,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1283940754, now seen corresponding path program 3 times [2024-11-14 04:09:01,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:09:01,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52770263] [2024-11-14 04:09:01,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:09:01,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:09:01,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:09:02,258 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:09:02,258 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:09:02,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52770263] [2024-11-14 04:09:02,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52770263] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:09:02,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1656375736] [2024-11-14 04:09:02,258 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-14 04:09:02,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:09:02,259 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713cfcd-317a-4f2b-95a3-12aba5097cb6/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:09:02,262 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713cfcd-317a-4f2b-95a3-12aba5097cb6/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:09:02,263 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713cfcd-317a-4f2b-95a3-12aba5097cb6/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-14 04:09:02,326 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-14 04:09:02,327 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 04:09:02,328 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-14 04:09:02,330 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:09:02,550 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:09:02,550 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:09:02,848 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:09:02,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1656375736] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 04:09:02,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1431254611] [2024-11-14 04:09:02,849 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-14 04:09:02,849 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 04:09:02,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 40 [2024-11-14 04:09:02,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245167342] [2024-11-14 04:09:02,850 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 04:09:02,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-11-14 04:09:02,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:09:02,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-11-14 04:09:02,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=565, Invalid=1075, Unknown=0, NotChecked=0, Total=1640 [2024-11-14 04:09:02,851 INFO L87 Difference]: Start difference. First operand 795 states and 1964 transitions. Second operand has 41 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 40 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:09:03,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:09:03,972 INFO L93 Difference]: Finished difference Result 1080 states and 2878 transitions. [2024-11-14 04:09:03,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-14 04:09:03,973 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 40 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-14 04:09:03,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:09:03,979 INFO L225 Difference]: With dead ends: 1080 [2024-11-14 04:09:03,980 INFO L226 Difference]: Without dead ends: 1023 [2024-11-14 04:09:03,981 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1104 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1350, Invalid=2810, Unknown=0, NotChecked=0, Total=4160 [2024-11-14 04:09:03,982 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 580 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 580 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-14 04:09:03,982 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [580 Valid, 87 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-14 04:09:03,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1023 states. [2024-11-14 04:09:04,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1023 to 1023. [2024-11-14 04:09:04,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1023 states, 1021 states have (on average 2.4760039177277178) internal successors, (2528), 1022 states have internal predecessors, (2528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:09:04,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 2528 transitions. [2024-11-14 04:09:04,234 INFO L78 Accepts]: Start accepts. Automaton has 1023 states and 2528 transitions. Word has length 22 [2024-11-14 04:09:04,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:09:04,235 INFO L471 AbstractCegarLoop]: Abstraction has 1023 states and 2528 transitions. [2024-11-14 04:09:04,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 40 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:09:04,235 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 2528 transitions. [2024-11-14 04:09:04,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-14 04:09:04,238 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:09:04,238 INFO L215 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:09:04,253 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713cfcd-317a-4f2b-95a3-12aba5097cb6/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-14 04:09:04,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713cfcd-317a-4f2b-95a3-12aba5097cb6/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-14 04:09:04,439 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting f1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-14 04:09:04,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:09:04,439 INFO L85 PathProgramCache]: Analyzing trace with hash 109141944, now seen corresponding path program 4 times [2024-11-14 04:09:04,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:09:04,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420283904] [2024-11-14 04:09:04,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:09:04,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:09:04,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:09:05,139 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:09:05,139 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:09:05,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420283904] [2024-11-14 04:09:05,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420283904] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:09:05,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [50925229] [2024-11-14 04:09:05,139 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-14 04:09:05,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:09:05,140 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713cfcd-317a-4f2b-95a3-12aba5097cb6/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:09:05,141 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713cfcd-317a-4f2b-95a3-12aba5097cb6/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:09:05,142 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713cfcd-317a-4f2b-95a3-12aba5097cb6/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-14 04:09:05,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:09:05,212 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-14 04:09:05,214 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:09:05,793 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:09:05,793 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:09:06,743 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:09:06,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [50925229] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 04:09:06,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [708201268] [2024-11-14 04:09:06,743 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-14 04:09:06,744 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 04:09:06,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 76 [2024-11-14 04:09:06,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147668689] [2024-11-14 04:09:06,744 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 04:09:06,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2024-11-14 04:09:06,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:09:06,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2024-11-14 04:09:06,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2269, Invalid=3583, Unknown=0, NotChecked=0, Total=5852 [2024-11-14 04:09:06,749 INFO L87 Difference]: Start difference. First operand 1023 states and 2528 transitions. Second operand has 77 states, 77 states have (on average 1.1688311688311688) internal successors, (90), 76 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:09:09,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:09:09,677 INFO L93 Difference]: Finished difference Result 1509 states and 4157 transitions. [2024-11-14 04:09:09,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-11-14 04:09:09,678 INFO L78 Accepts]: Start accepts. Automaton has has 77 states, 77 states have (on average 1.1688311688311688) internal successors, (90), 76 states have internal predecessors, (90), 0 states have call successors, (0), 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 34 [2024-11-14 04:09:09,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:09:09,684 INFO L225 Difference]: With dead ends: 1509 [2024-11-14 04:09:09,685 INFO L226 Difference]: Without dead ends: 1455 [2024-11-14 04:09:09,690 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4524 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=5136, Invalid=10364, Unknown=0, NotChecked=0, Total=15500 [2024-11-14 04:09:09,691 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 1251 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1251 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-14 04:09:09,692 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1251 Valid, 118 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 520 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-14 04:09:09,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1455 states. [2024-11-14 04:09:10,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1455 to 1455. [2024-11-14 04:09:10,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1455 states, 1453 states have (on average 2.4831383344803855) internal successors, (3608), 1454 states have internal predecessors, (3608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:09:10,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1455 states to 1455 states and 3608 transitions. [2024-11-14 04:09:10,023 INFO L78 Accepts]: Start accepts. Automaton has 1455 states and 3608 transitions. Word has length 34 [2024-11-14 04:09:10,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:09:10,023 INFO L471 AbstractCegarLoop]: Abstraction has 1455 states and 3608 transitions. [2024-11-14 04:09:10,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 77 states have (on average 1.1688311688311688) internal successors, (90), 76 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:09:10,023 INFO L276 IsEmpty]: Start isEmpty. Operand 1455 states and 3608 transitions. [2024-11-14 04:09:10,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-14 04:09:10,029 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:09:10,029 INFO L215 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:09:10,049 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713cfcd-317a-4f2b-95a3-12aba5097cb6/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-14 04:09:10,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713cfcd-317a-4f2b-95a3-12aba5097cb6/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-14 04:09:10,230 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-14 04:09:10,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:09:10,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1090779474, now seen corresponding path program 4 times [2024-11-14 04:09:10,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:09:10,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403333823] [2024-11-14 04:09:10,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:09:10,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:09:10,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:09:10,922 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:09:10,922 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:09:10,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403333823] [2024-11-14 04:09:10,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403333823] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:09:10,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [286967007] [2024-11-14 04:09:10,923 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-14 04:09:10,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:09:10,923 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713cfcd-317a-4f2b-95a3-12aba5097cb6/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:09:10,925 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713cfcd-317a-4f2b-95a3-12aba5097cb6/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:09:10,927 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713cfcd-317a-4f2b-95a3-12aba5097cb6/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-14 04:09:11,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:09:11,002 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-14 04:09:11,004 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:09:11,533 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:09:11,533 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:09:12,447 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:09:12,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [286967007] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 04:09:12,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1379092995] [2024-11-14 04:09:12,448 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-14 04:09:12,448 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 04:09:12,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 76 [2024-11-14 04:09:12,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600860620] [2024-11-14 04:09:12,449 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 04:09:12,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2024-11-14 04:09:12,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:09:12,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2024-11-14 04:09:12,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2269, Invalid=3583, Unknown=0, NotChecked=0, Total=5852 [2024-11-14 04:09:12,452 INFO L87 Difference]: Start difference. First operand 1455 states and 3608 transitions. Second operand has 77 states, 77 states have (on average 1.1688311688311688) internal successors, (90), 76 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:09:15,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:09:15,081 INFO L93 Difference]: Finished difference Result 1968 states and 5314 transitions. [2024-11-14 04:09:15,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-11-14 04:09:15,082 INFO L78 Accepts]: Start accepts. Automaton has has 77 states, 77 states have (on average 1.1688311688311688) internal successors, (90), 76 states have internal predecessors, (90), 0 states have call successors, (0), 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 34 [2024-11-14 04:09:15,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:09:15,088 INFO L225 Difference]: With dead ends: 1968 [2024-11-14 04:09:15,088 INFO L226 Difference]: Without dead ends: 1911 [2024-11-14 04:09:15,091 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4524 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=5136, Invalid=10364, Unknown=0, NotChecked=0, Total=15500 [2024-11-14 04:09:15,092 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 1386 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 652 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1386 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-14 04:09:15,092 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1386 Valid, 133 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 652 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-14 04:09:15,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1911 states. [2024-11-14 04:09:15,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1911 to 1911. [2024-11-14 04:09:15,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1911 states, 1909 states have (on average 2.4808800419067576) internal successors, (4736), 1910 states have internal predecessors, (4736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:09:15,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1911 states to 1911 states and 4736 transitions. [2024-11-14 04:09:15,488 INFO L78 Accepts]: Start accepts. Automaton has 1911 states and 4736 transitions. Word has length 34 [2024-11-14 04:09:15,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:09:15,488 INFO L471 AbstractCegarLoop]: Abstraction has 1911 states and 4736 transitions. [2024-11-14 04:09:15,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 77 states have (on average 1.1688311688311688) internal successors, (90), 76 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:09:15,489 INFO L276 IsEmpty]: Start isEmpty. Operand 1911 states and 4736 transitions. [2024-11-14 04:09:15,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-14 04:09:15,493 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:09:15,493 INFO L215 NwaCegarLoop]: trace histogram [46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:09:15,506 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713cfcd-317a-4f2b-95a3-12aba5097cb6/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-14 04:09:15,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713cfcd-317a-4f2b-95a3-12aba5097cb6/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-14 04:09:15,695 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting f1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-14 04:09:15,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:09:15,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1393271608, now seen corresponding path program 5 times [2024-11-14 04:09:15,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:09:15,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889552524] [2024-11-14 04:09:15,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:09:15,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:09:15,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:09:17,437 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:09:17,437 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:09:17,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889552524] [2024-11-14 04:09:17,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889552524] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:09:17,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [105796680] [2024-11-14 04:09:17,438 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 04:09:17,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:09:17,438 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713cfcd-317a-4f2b-95a3-12aba5097cb6/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:09:17,440 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713cfcd-317a-4f2b-95a3-12aba5097cb6/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:09:17,441 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713cfcd-317a-4f2b-95a3-12aba5097cb6/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-14 04:09:17,548 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2024-11-14 04:09:17,549 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 04:09:17,550 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-11-14 04:09:17,553 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:09:19,025 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:09:19,025 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:09:22,396 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:09:22,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [105796680] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 04:09:22,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1638854449] [2024-11-14 04:09:22,396 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-14 04:09:22,397 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 04:09:22,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 148 [2024-11-14 04:09:22,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902293582] [2024-11-14 04:09:22,397 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 04:09:22,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 149 states [2024-11-14 04:09:22,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:09:22,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 149 interpolants. [2024-11-14 04:09:22,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9133, Invalid=12919, Unknown=0, NotChecked=0, Total=22052 [2024-11-14 04:09:22,404 INFO L87 Difference]: Start difference. First operand 1911 states and 4736 transitions. Second operand has 149 states, 149 states have (on average 1.087248322147651) internal successors, (162), 148 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:09:31,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:09:31,732 INFO L93 Difference]: Finished difference Result 2829 states and 7877 transitions. [2024-11-14 04:09:31,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2024-11-14 04:09:31,735 INFO L78 Accepts]: Start accepts. Automaton has has 149 states, 149 states have (on average 1.087248322147651) internal successors, (162), 148 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2024-11-14 04:09:31,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:09:31,750 INFO L225 Difference]: With dead ends: 2829 [2024-11-14 04:09:31,750 INFO L226 Difference]: Without dead ends: 2775 [2024-11-14 04:09:31,758 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 243 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18276 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=20052, Invalid=39728, Unknown=0, NotChecked=0, Total=59780 [2024-11-14 04:09:31,759 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 2814 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 911 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2814 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 912 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 911 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-14 04:09:31,759 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2814 Valid, 189 Invalid, 912 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 911 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-14 04:09:31,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2775 states. [2024-11-14 04:09:32,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2775 to 2775. [2024-11-14 04:09:32,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2775 states, 2773 states have (on average 2.4868373602596465) internal successors, (6896), 2774 states have internal predecessors, (6896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:09:32,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2775 states to 2775 states and 6896 transitions. [2024-11-14 04:09:32,129 INFO L78 Accepts]: Start accepts. Automaton has 2775 states and 6896 transitions. Word has length 58 [2024-11-14 04:09:32,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:09:32,130 INFO L471 AbstractCegarLoop]: Abstraction has 2775 states and 6896 transitions. [2024-11-14 04:09:32,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 149 states, 149 states have (on average 1.087248322147651) internal successors, (162), 148 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:09:32,130 INFO L276 IsEmpty]: Start isEmpty. Operand 2775 states and 6896 transitions. [2024-11-14 04:09:32,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-14 04:09:32,134 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:09:32,134 INFO L215 NwaCegarLoop]: trace histogram [46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:09:32,155 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713cfcd-317a-4f2b-95a3-12aba5097cb6/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-14 04:09:32,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713cfcd-317a-4f2b-95a3-12aba5097cb6/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-14 04:09:32,335 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-14 04:09:32,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:09:32,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1757169874, now seen corresponding path program 5 times [2024-11-14 04:09:32,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:09:32,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122956657] [2024-11-14 04:09:32,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:09:32,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:09:32,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:09:34,107 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:09:34,107 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:09:34,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122956657] [2024-11-14 04:09:34,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122956657] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:09:34,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1017309275] [2024-11-14 04:09:34,108 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 04:09:34,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:09:34,108 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713cfcd-317a-4f2b-95a3-12aba5097cb6/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:09:34,112 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713cfcd-317a-4f2b-95a3-12aba5097cb6/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:09:34,115 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713cfcd-317a-4f2b-95a3-12aba5097cb6/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-14 04:09:34,229 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2024-11-14 04:09:34,229 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 04:09:34,231 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-11-14 04:09:34,234 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:09:35,734 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:09:35,734 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:09:39,206 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:09:39,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1017309275] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 04:09:39,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2043534442] [2024-11-14 04:09:39,206 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-14 04:09:39,207 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 04:09:39,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 148 [2024-11-14 04:09:39,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272220070] [2024-11-14 04:09:39,207 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 04:09:39,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 149 states [2024-11-14 04:09:39,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:09:39,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 149 interpolants. [2024-11-14 04:09:39,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9133, Invalid=12919, Unknown=0, NotChecked=0, Total=22052 [2024-11-14 04:09:39,213 INFO L87 Difference]: Start difference. First operand 2775 states and 6896 transitions. Second operand has 149 states, 149 states have (on average 1.087248322147651) internal successors, (162), 148 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:09:48,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:09:48,741 INFO L93 Difference]: Finished difference Result 3744 states and 10186 transitions. [2024-11-14 04:09:48,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2024-11-14 04:09:48,741 INFO L78 Accepts]: Start accepts. Automaton has has 149 states, 149 states have (on average 1.087248322147651) internal successors, (162), 148 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2024-11-14 04:09:48,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:09:48,757 INFO L225 Difference]: With dead ends: 3744 [2024-11-14 04:09:48,757 INFO L226 Difference]: Without dead ends: 3687 [2024-11-14 04:09:48,759 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 243 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18276 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=20052, Invalid=39728, Unknown=0, NotChecked=0, Total=59780 [2024-11-14 04:09:48,760 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 3545 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 987 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3545 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 988 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 987 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-14 04:09:48,760 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3545 Valid, 161 Invalid, 988 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 987 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-14 04:09:48,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3687 states. [2024-11-14 04:09:49,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3687 to 3687. [2024-11-14 04:09:49,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3687 states, 3685 states have (on average 2.4835820895522387) internal successors, (9152), 3686 states have internal predecessors, (9152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:09:49,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3687 states to 3687 states and 9152 transitions. [2024-11-14 04:09:49,286 INFO L78 Accepts]: Start accepts. Automaton has 3687 states and 9152 transitions. Word has length 58 [2024-11-14 04:09:49,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:09:49,287 INFO L471 AbstractCegarLoop]: Abstraction has 3687 states and 9152 transitions. [2024-11-14 04:09:49,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 149 states, 149 states have (on average 1.087248322147651) internal successors, (162), 148 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:09:49,287 INFO L276 IsEmpty]: Start isEmpty. Operand 3687 states and 9152 transitions. [2024-11-14 04:09:49,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-14 04:09:49,295 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:09:49,295 INFO L215 NwaCegarLoop]: trace histogram [94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:09:49,316 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713cfcd-317a-4f2b-95a3-12aba5097cb6/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-14 04:09:49,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713cfcd-317a-4f2b-95a3-12aba5097cb6/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:09:49,499 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting f1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-14 04:09:49,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:09:49,500 INFO L85 PathProgramCache]: Analyzing trace with hash -158815688, now seen corresponding path program 6 times [2024-11-14 04:09:49,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:09:49,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552558718] [2024-11-14 04:09:49,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:09:49,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:09:49,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:09:55,618 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:09:55,618 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:09:55,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552558718] [2024-11-14 04:09:55,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552558718] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:09:55,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [711656617] [2024-11-14 04:09:55,618 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-14 04:09:55,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:09:55,618 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713cfcd-317a-4f2b-95a3-12aba5097cb6/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:09:55,620 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713cfcd-317a-4f2b-95a3-12aba5097cb6/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:09:55,621 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713cfcd-317a-4f2b-95a3-12aba5097cb6/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-14 04:09:55,727 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-14 04:09:55,727 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 04:09:55,732 INFO L255 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 100 conjuncts are in the unsatisfiable core [2024-11-14 04:09:55,740 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:10:00,766 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:10:00,766 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:10:06,221 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:10:06,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [711656617] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 04:10:06,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [485575810] [2024-11-14 04:10:06,222 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-14 04:10:06,222 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 04:10:06,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99, 99] total 203 [2024-11-14 04:10:06,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210459643] [2024-11-14 04:10:06,222 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 04:10:06,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 204 states [2024-11-14 04:10:06,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:10:06,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 204 interpolants. [2024-11-14 04:10:06,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15147, Invalid=26265, Unknown=0, NotChecked=0, Total=41412 [2024-11-14 04:10:06,230 INFO L87 Difference]: Start difference. First operand 3687 states and 9152 transitions. Second operand has 204 states, 204 states have (on average 1.0686274509803921) internal successors, (218), 203 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:10:20,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:10:20,518 INFO L93 Difference]: Finished difference Result 3867 states and 9710 transitions. [2024-11-14 04:10:20,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2024-11-14 04:10:20,518 INFO L78 Accepts]: Start accepts. Automaton has has 204 states, 204 states have (on average 1.0686274509803921) internal successors, (218), 203 states have internal predecessors, (218), 0 states have call successors, (0), 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 106 [2024-11-14 04:10:20,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:10:20,539 INFO L225 Difference]: With dead ends: 3867 [2024-11-14 04:10:20,539 INFO L226 Difference]: Without dead ends: 3813 [2024-11-14 04:10:20,546 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 18 SyntacticMatches, 89 SemanticMatches, 305 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43524 ImplicationChecksByTransitivity, 20.8s TimeCoverageRelationStatistics Valid=30933, Invalid=63009, Unknown=0, NotChecked=0, Total=93942 [2024-11-14 04:10:20,547 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 3297 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 1190 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3297 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 1190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-14 04:10:20,547 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3297 Valid, 251 Invalid, 1190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1190 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-14 04:10:20,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3813 states. [2024-11-14 04:10:21,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3813 to 3813. [2024-11-14 04:10:21,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3813 states, 3811 states have (on average 2.4841249016006297) internal successors, (9467), 3812 states have internal predecessors, (9467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:10:21,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3813 states to 3813 states and 9467 transitions. [2024-11-14 04:10:21,184 INFO L78 Accepts]: Start accepts. Automaton has 3813 states and 9467 transitions. Word has length 106 [2024-11-14 04:10:21,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:10:21,185 INFO L471 AbstractCegarLoop]: Abstraction has 3813 states and 9467 transitions. [2024-11-14 04:10:21,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 204 states, 204 states have (on average 1.0686274509803921) internal successors, (218), 203 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:10:21,185 INFO L276 IsEmpty]: Start isEmpty. Operand 3813 states and 9467 transitions. [2024-11-14 04:10:21,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-14 04:10:21,192 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:10:21,192 INFO L215 NwaCegarLoop]: trace histogram [94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:10:21,211 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713cfcd-317a-4f2b-95a3-12aba5097cb6/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-14 04:10:21,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713cfcd-317a-4f2b-95a3-12aba5097cb6/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:10:21,392 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-14 04:10:21,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:10:21,393 INFO L85 PathProgramCache]: Analyzing trace with hash 76978222, now seen corresponding path program 6 times [2024-11-14 04:10:21,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:10:21,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377821478] [2024-11-14 04:10:21,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:10:21,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:10:21,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:10:27,460 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:10:27,460 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:10:27,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377821478] [2024-11-14 04:10:27,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377821478] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:10:27,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [228565187] [2024-11-14 04:10:27,460 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-14 04:10:27,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:10:27,460 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713cfcd-317a-4f2b-95a3-12aba5097cb6/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:10:27,462 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713cfcd-317a-4f2b-95a3-12aba5097cb6/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:10:27,463 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713cfcd-317a-4f2b-95a3-12aba5097cb6/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-14 04:10:27,569 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-14 04:10:27,569 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 04:10:27,572 INFO L255 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 100 conjuncts are in the unsatisfiable core [2024-11-14 04:10:27,574 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:10:32,803 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:10:32,804 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:10:37,933 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:10:37,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [228565187] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 04:10:37,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [482495281] [2024-11-14 04:10:37,933 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-14 04:10:37,934 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 04:10:37,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99, 99] total 202 [2024-11-14 04:10:37,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927866102] [2024-11-14 04:10:37,934 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 04:10:37,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 203 states [2024-11-14 04:10:37,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:10:37,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 203 interpolants. [2024-11-14 04:10:37,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14950, Invalid=26056, Unknown=0, NotChecked=0, Total=41006 [2024-11-14 04:10:37,942 INFO L87 Difference]: Start difference. First operand 3813 states and 9467 transitions. Second operand has 203 states, 203 states have (on average 1.0689655172413792) internal successors, (217), 202 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:10:52,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:10:52,439 INFO L93 Difference]: Finished difference Result 3984 states and 9985 transitions. [2024-11-14 04:10:52,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2024-11-14 04:10:52,439 INFO L78 Accepts]: Start accepts. Automaton has has 203 states, 203 states have (on average 1.0689655172413792) internal successors, (217), 202 states have internal predecessors, (217), 0 states have call successors, (0), 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 106 [2024-11-14 04:10:52,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:10:52,449 INFO L225 Difference]: With dead ends: 3984 [2024-11-14 04:10:52,449 INFO L226 Difference]: Without dead ends: 3927 [2024-11-14 04:10:52,454 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 18 SyntacticMatches, 90 SemanticMatches, 303 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43143 ImplicationChecksByTransitivity, 20.8s TimeCoverageRelationStatistics Valid=30525, Invalid=62195, Unknown=0, NotChecked=0, Total=92720 [2024-11-14 04:10:52,454 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 4903 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 1218 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4903 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 1218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-14 04:10:52,454 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4903 Valid, 199 Invalid, 1218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1218 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-14 04:10:52,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3927 states. [2024-11-14 04:10:52,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3927 to 3927. [2024-11-14 04:10:52,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3927 states, 3925 states have (on average 2.4838216560509556) internal successors, (9749), 3926 states have internal predecessors, (9749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:10:52,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3927 states to 3927 states and 9749 transitions. [2024-11-14 04:10:52,997 INFO L78 Accepts]: Start accepts. Automaton has 3927 states and 9749 transitions. Word has length 106 [2024-11-14 04:10:52,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:10:52,998 INFO L471 AbstractCegarLoop]: Abstraction has 3927 states and 9749 transitions. [2024-11-14 04:10:52,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 203 states, 203 states have (on average 1.0689655172413792) internal successors, (217), 202 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:10:52,998 INFO L276 IsEmpty]: Start isEmpty. Operand 3927 states and 9749 transitions. [2024-11-14 04:10:53,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-14 04:10:53,002 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:10:53,002 INFO L215 NwaCegarLoop]: trace histogram [100, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:10:53,015 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713cfcd-317a-4f2b-95a3-12aba5097cb6/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-11-14 04:10:53,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713cfcd-317a-4f2b-95a3-12aba5097cb6/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:10:53,203 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-14 04:10:53,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:10:53,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1170360398, now seen corresponding path program 7 times [2024-11-14 04:10:53,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:10:53,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604116822] [2024-11-14 04:10:53,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:10:53,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:10:53,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-14 04:10:53,259 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-14 04:10:53,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-14 04:10:53,414 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2024-11-14 04:10:53,414 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-14 04:10:53,415 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2024-11-14 04:10:53,417 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 6 remaining) [2024-11-14 04:10:53,417 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2024-11-14 04:10:53,417 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2024-11-14 04:10:53,418 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2024-11-14 04:10:53,418 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2024-11-14 04:10:53,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-14 04:10:53,421 INFO L407 BasicCegarLoop]: Path program histogram: [7, 6, 2, 2, 1, 1, 1, 1] [2024-11-14 04:10:53,596 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-14 04:10:53,599 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-14 04:10:53,602 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 04:10:53 BasicIcfg [2024-11-14 04:10:53,604 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-14 04:10:53,605 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-14 04:10:53,605 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-14 04:10:53,605 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-14 04:10:53,606 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:08:47" (3/4) ... [2024-11-14 04:10:53,607 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-14 04:10:53,723 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713cfcd-317a-4f2b-95a3-12aba5097cb6/bin/utaipan-verify-sOmjnqqW8E/witness.graphml [2024-11-14 04:10:53,723 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-14 04:10:53,724 INFO L158 Benchmark]: Toolchain (without parser) took 127431.22ms. Allocated memory was 117.4MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 91.0MB in the beginning and 869.2MB in the end (delta: -778.2MB). Peak memory consumption was 485.7MB. Max. memory is 16.1GB. [2024-11-14 04:10:53,725 INFO L158 Benchmark]: CDTParser took 0.52ms. Allocated memory is still 117.4MB. Free memory is still 73.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 04:10:53,726 INFO L158 Benchmark]: CACSL2BoogieTranslator took 522.41ms. Allocated memory is still 117.4MB. Free memory was 91.0MB in the beginning and 70.8MB in the end (delta: 20.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-14 04:10:53,727 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.55ms. Allocated memory is still 117.4MB. Free memory was 70.8MB in the beginning and 69.1MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 04:10:53,727 INFO L158 Benchmark]: Boogie Preprocessor took 35.40ms. Allocated memory is still 117.4MB. Free memory was 69.1MB in the beginning and 68.0MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 04:10:53,728 INFO L158 Benchmark]: RCFGBuilder took 497.67ms. Allocated memory is still 117.4MB. Free memory was 68.0MB in the beginning and 48.8MB in the end (delta: 19.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-14 04:10:53,728 INFO L158 Benchmark]: TraceAbstraction took 126197.61ms. Allocated memory was 117.4MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 48.2MB in the beginning and 886.0MB in the end (delta: -837.7MB). Peak memory consumption was 426.9MB. Max. memory is 16.1GB. [2024-11-14 04:10:53,729 INFO L158 Benchmark]: Witness Printer took 118.73ms. Allocated memory is still 1.4GB. Free memory was 886.0MB in the beginning and 869.2MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-14 04:10:53,730 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.52ms. Allocated memory is still 117.4MB. Free memory is still 73.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 522.41ms. Allocated memory is still 117.4MB. Free memory was 91.0MB in the beginning and 70.8MB in the end (delta: 20.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.55ms. Allocated memory is still 117.4MB. Free memory was 70.8MB in the beginning and 69.1MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 35.40ms. Allocated memory is still 117.4MB. Free memory was 69.1MB in the beginning and 68.0MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 497.67ms. Allocated memory is still 117.4MB. Free memory was 68.0MB in the beginning and 48.8MB in the end (delta: 19.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 126197.61ms. Allocated memory was 117.4MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 48.2MB in the beginning and 886.0MB in the end (delta: -837.7MB). Peak memory consumption was 426.9MB. Max. memory is 16.1GB. * Witness Printer took 118.73ms. Allocated memory is still 1.4GB. Free memory was 886.0MB in the beginning and 869.2MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 753]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L754] 0 int _N; [L755] 0 atomic_int limit; [L775] 0 _N = 100 [L776] CALL 0 assume_abort_if_not(0 <= _N && _N <= 0x7fffffff - 1) [L750] COND FALSE 0 !(!cond) [L776] RET 0 assume_abort_if_not(0 <= _N && _N <= 0x7fffffff - 1) [L777] 0 pthread_t t1, t2; [L778] FCALL, FORK 0 pthread_create(&t1, 0, f1, 0) VAL [_N=100, limit=0, t1=0] [L757] 1 int i, bound; [L758] 1 int lim = _N; VAL [\old(arg)={0:0}, _N=100, arg={0:0}, lim=100, limit=0] [L779] FCALL, FORK 0 pthread_create(&t2, 0, f2, 0) VAL [_N=100, limit=0, t1=0, t2=1] [L766] 2 int i, bound; [L767] 2 int lim = _N + 1; VAL [\old(arg)={0:0}, _N=100, arg={0:0}, lim=101, limit=0] [L768] 2 limit = lim VAL [\old(arg)={0:0}, _N=100, arg={0:0}, lim=101, limit=101] [L759] 1 limit = lim VAL [\old(arg)={0:0}, _N=100, arg={0:0}, lim=100, limit=100] [L769] 2 bound = limit [L770] 2 i = 0 VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=0, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=1, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=2, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=3, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=4, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=5, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=6, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=7, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=8, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=9, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=10, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=11, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=12, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=13, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=14, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=15, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=16, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=17, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=18, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=19, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=20, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=21, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=22, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=23, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=24, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=25, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=26, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=27, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=28, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=29, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=30, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=31, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=32, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=33, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=34, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=35, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=36, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=37, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=38, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=39, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=40, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=41, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=42, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=43, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=44, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=45, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=46, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=47, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=48, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=49, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=50, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=51, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=52, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=53, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=54, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=55, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=56, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=57, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=58, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=59, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=60, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=61, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=62, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=63, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=64, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=65, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=66, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=67, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=68, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=69, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=70, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=71, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=72, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=73, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=74, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=75, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=76, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=77, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=78, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=79, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=80, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=81, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=82, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=83, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=84, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=85, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=86, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=87, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=88, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=89, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=90, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=91, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=92, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=93, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=94, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=95, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=96, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=97, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=98, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=99, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=100, lim=101, limit=100] [L770] COND FALSE 2 !(i < bound) [L771] CALL 2 __VERIFIER_assert(i == lim) [L753] COND TRUE 2 !expression VAL [\old(expression)=0, _N=100, expression=0, limit=100] [L753] 2 reach_error() VAL [\old(expression)=0, _N=100, expression=0, limit=100] - UnprovableResult [Line: 778]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 779]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 753]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 47 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 125.9s, OverallIterations: 21, TraceHistogramMax: 100, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.1s, AutomataDifference: 60.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 20153 SdHoareTripleChecker+Valid, 7.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 20153 mSDsluCounter, 1933 SdHoareTripleChecker+Invalid, 6.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1656 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8167 IncrementalHoareTripleChecker+Invalid, 8181 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 277 mSDtfsCounter, 8167 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2115 GetRequests, 262 SyntacticMatches, 179 SemanticMatches, 1674 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135299 ImplicationChecksByTransitivity, 74.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3927occurred in iteration=20, InterpolantAutomatonStates: 683, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.1s AutomataMinimizationTime, 20 MinimizatonAttempts, 1560 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 55.3s InterpolantComputationTime, 1242 NumberOfCodeBlocks, 1238 NumberOfCodeBlocksAsserted, 93 NumberOfCheckSat, 1598 ConstructedInterpolants, 0 QuantifiedInterpolants, 7590 SizeOfPredicates, 80 NumberOfNonLiveVariables, 2296 ConjunctsInSsa, 460 ConjunctsInUnsatCore, 50 InterpolantComputations, 6 PerfectInterpolantSequences, 20/35236 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-14 04:10:53,772 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713cfcd-317a-4f2b-95a3-12aba5097cb6/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE