./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe013_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cf1a7837 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2a22259-fcb5-40b6-869e-7e8e7aec7e1d/bin/uautomizer-verify-uTZkv6EMXl/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2a22259-fcb5-40b6-869e-7e8e7aec7e1d/bin/uautomizer-verify-uTZkv6EMXl/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2a22259-fcb5-40b6-869e-7e8e7aec7e1d/bin/uautomizer-verify-uTZkv6EMXl/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2a22259-fcb5-40b6-869e-7e8e7aec7e1d/bin/uautomizer-verify-uTZkv6EMXl/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe013_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2a22259-fcb5-40b6-869e-7e8e7aec7e1d/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2a22259-fcb5-40b6-869e-7e8e7aec7e1d/bin/uautomizer-verify-uTZkv6EMXl --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7b294c1ec1607d3ab81534ceeb65193cc4f28ccd9d1a1422b3183b94b9b567c9 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 02:21:20,355 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 02:21:20,465 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2a22259-fcb5-40b6-869e-7e8e7aec7e1d/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-12 02:21:20,473 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 02:21:20,474 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 02:21:20,519 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 02:21:20,520 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 02:21:20,521 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 02:21:20,522 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 02:21:20,527 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 02:21:20,528 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-12 02:21:20,528 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-12 02:21:20,529 INFO L153 SettingsManager]: * Use SBE=true [2023-11-12 02:21:20,531 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 02:21:20,531 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-12 02:21:20,532 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 02:21:20,532 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 02:21:20,533 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 02:21:20,533 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 02:21:20,533 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-12 02:21:20,534 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 02:21:20,535 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-12 02:21:20,535 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 02:21:20,536 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-12 02:21:20,536 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 02:21:20,537 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 02:21:20,537 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-12 02:21:20,538 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 02:21:20,538 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:21:20,539 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 02:21:20,540 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 02:21:20,541 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-12 02:21:20,541 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-12 02:21:20,541 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 02:21:20,541 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-12 02:21:20,542 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-12 02:21:20,542 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-12 02:21:20,542 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 02:21:20,542 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-12 02:21:20,542 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2a22259-fcb5-40b6-869e-7e8e7aec7e1d/bin/uautomizer-verify-uTZkv6EMXl/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2a22259-fcb5-40b6-869e-7e8e7aec7e1d/bin/uautomizer-verify-uTZkv6EMXl 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 -> Automizer 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 -> 7b294c1ec1607d3ab81534ceeb65193cc4f28ccd9d1a1422b3183b94b9b567c9 [2023-11-12 02:21:20,896 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 02:21:20,925 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 02:21:20,930 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 02:21:20,932 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 02:21:20,933 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 02:21:20,934 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2a22259-fcb5-40b6-869e-7e8e7aec7e1d/bin/uautomizer-verify-uTZkv6EMXl/../../sv-benchmarks/c/pthread-wmm/safe013_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-12 02:21:24,232 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 02:21:24,590 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 02:21:24,591 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2a22259-fcb5-40b6-869e-7e8e7aec7e1d/sv-benchmarks/c/pthread-wmm/safe013_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-12 02:21:24,620 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2a22259-fcb5-40b6-869e-7e8e7aec7e1d/bin/uautomizer-verify-uTZkv6EMXl/data/414fc1b36/e90157fa68b444ebb472c886e5ea7344/FLAGa25fe07e0 [2023-11-12 02:21:24,639 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2a22259-fcb5-40b6-869e-7e8e7aec7e1d/bin/uautomizer-verify-uTZkv6EMXl/data/414fc1b36/e90157fa68b444ebb472c886e5ea7344 [2023-11-12 02:21:24,645 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 02:21:24,647 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 02:21:24,650 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 02:21:24,651 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 02:21:24,656 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 02:21:24,659 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:21:24" (1/1) ... [2023-11-12 02:21:24,660 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54bab667 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:21:24, skipping insertion in model container [2023-11-12 02:21:24,660 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:21:24" (1/1) ... [2023-11-12 02:21:24,712 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 02:21:24,973 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2a22259-fcb5-40b6-869e-7e8e7aec7e1d/sv-benchmarks/c/pthread-wmm/safe013_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2023-11-12 02:21:25,345 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:21:25,365 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 02:21:25,382 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2a22259-fcb5-40b6-869e-7e8e7aec7e1d/sv-benchmarks/c/pthread-wmm/safe013_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2023-11-12 02:21:25,479 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:21:25,534 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 02:21:25,534 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 02:21:25,544 INFO L206 MainTranslator]: Completed translation [2023-11-12 02:21:25,545 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:21:25 WrapperNode [2023-11-12 02:21:25,546 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 02:21:25,547 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 02:21:25,548 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 02:21:25,548 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 02:21:25,558 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:21:25" (1/1) ... [2023-11-12 02:21:25,609 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:21:25" (1/1) ... [2023-11-12 02:21:25,669 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 127 [2023-11-12 02:21:25,670 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 02:21:25,672 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 02:21:25,672 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 02:21:25,672 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 02:21:25,686 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:21:25" (1/1) ... [2023-11-12 02:21:25,687 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:21:25" (1/1) ... [2023-11-12 02:21:25,702 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:21:25" (1/1) ... [2023-11-12 02:21:25,703 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:21:25" (1/1) ... [2023-11-12 02:21:25,727 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:21:25" (1/1) ... [2023-11-12 02:21:25,730 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:21:25" (1/1) ... [2023-11-12 02:21:25,733 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:21:25" (1/1) ... [2023-11-12 02:21:25,735 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:21:25" (1/1) ... [2023-11-12 02:21:25,756 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 02:21:25,772 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 02:21:25,772 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 02:21:25,772 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 02:21:25,773 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:21:25" (1/1) ... [2023-11-12 02:21:25,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:21:25,796 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2a22259-fcb5-40b6-869e-7e8e7aec7e1d/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:21:25,818 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2a22259-fcb5-40b6-869e-7e8e7aec7e1d/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-12 02:21:25,837 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2a22259-fcb5-40b6-869e-7e8e7aec7e1d/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-12 02:21:25,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-12 02:21:25,869 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-12 02:21:25,869 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 02:21:25,869 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-12 02:21:25,869 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-12 02:21:25,870 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-12 02:21:25,870 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-12 02:21:25,870 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-12 02:21:25,870 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-12 02:21:25,871 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-12 02:21:25,873 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-12 02:21:25,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-12 02:21:25,874 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-12 02:21:25,874 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 02:21:25,874 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 02:21:25,876 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-12 02:21:26,191 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 02:21:26,194 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 02:21:26,674 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 02:21:26,862 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 02:21:26,862 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-12 02:21:26,865 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:21:26 BoogieIcfgContainer [2023-11-12 02:21:26,866 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 02:21:26,869 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 02:21:26,870 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 02:21:26,874 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 02:21:26,874 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 02:21:24" (1/3) ... [2023-11-12 02:21:26,875 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@484d7de7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:21:26, skipping insertion in model container [2023-11-12 02:21:26,875 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:21:25" (2/3) ... [2023-11-12 02:21:26,876 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@484d7de7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:21:26, skipping insertion in model container [2023-11-12 02:21:26,876 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:21:26" (3/3) ... [2023-11-12 02:21:26,878 INFO L112 eAbstractionObserver]: Analyzing ICFG safe013_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-12 02:21:26,889 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-12 02:21:26,903 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 02:21:26,904 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-12 02:21:26,904 INFO L521 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-12 02:21:26,988 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-12 02:21:27,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 110 transitions, 232 flow [2023-11-12 02:21:27,163 INFO L124 PetriNetUnfolderBase]: 2/107 cut-off events. [2023-11-12 02:21:27,163 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-12 02:21:27,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 107 events. 2/107 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2023-11-12 02:21:27,170 INFO L82 GeneralOperation]: Start removeDead. Operand has 118 places, 110 transitions, 232 flow [2023-11-12 02:21:27,176 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 115 places, 107 transitions, 223 flow [2023-11-12 02:21:27,183 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-12 02:21:27,210 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 115 places, 107 transitions, 223 flow [2023-11-12 02:21:27,215 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 115 places, 107 transitions, 223 flow [2023-11-12 02:21:27,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 107 transitions, 223 flow [2023-11-12 02:21:27,245 INFO L124 PetriNetUnfolderBase]: 2/107 cut-off events. [2023-11-12 02:21:27,245 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-12 02:21:27,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 107 events. 2/107 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2023-11-12 02:21:27,248 INFO L119 LiptonReduction]: Number of co-enabled transitions 1958 [2023-11-12 02:21:32,069 INFO L134 LiptonReduction]: Checked pairs total: 4604 [2023-11-12 02:21:32,070 INFO L136 LiptonReduction]: Total number of compositions: 99 [2023-11-12 02:21:32,086 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 02:21:32,093 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, 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;@55d22a1d, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-12 02:21:32,093 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-12 02:21:32,098 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-12 02:21:32,098 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2023-11-12 02:21:32,098 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-12 02:21:32,099 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:21:32,099 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-12 02:21:32,100 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-12 02:21:32,105 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:21:32,105 INFO L85 PathProgramCache]: Analyzing trace with hash 455123480, now seen corresponding path program 1 times [2023-11-12 02:21:32,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:21:32,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675588226] [2023-11-12 02:21:32,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:21:32,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:21:32,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:32,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:21:32,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:21:32,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675588226] [2023-11-12 02:21:32,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675588226] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:21:32,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:21:32,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-12 02:21:32,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741997947] [2023-11-12 02:21:32,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:21:32,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:21:32,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:21:32,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:21:32,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:21:32,681 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 209 [2023-11-12 02:21:32,686 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 23 transitions, 55 flow. Second operand has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:21:32,687 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:21:32,687 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 209 [2023-11-12 02:21:32,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:21:33,111 INFO L124 PetriNetUnfolderBase]: 711/1164 cut-off events. [2023-11-12 02:21:33,111 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2023-11-12 02:21:33,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2283 conditions, 1164 events. 711/1164 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 5713 event pairs, 117 based on Foata normal form. 0/1096 useless extension candidates. Maximal degree in co-relation 2272. Up to 859 conditions per place. [2023-11-12 02:21:33,131 INFO L140 encePairwiseOnDemand]: 205/209 looper letters, 27 selfloop transitions, 2 changer transitions 2/33 dead transitions. [2023-11-12 02:21:33,132 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 33 transitions, 140 flow [2023-11-12 02:21:33,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:21:33,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-12 02:21:33,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 325 transitions. [2023-11-12 02:21:33,158 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.518341307814992 [2023-11-12 02:21:33,159 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 325 transitions. [2023-11-12 02:21:33,159 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 325 transitions. [2023-11-12 02:21:33,164 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:21:33,167 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 325 transitions. [2023-11-12 02:21:33,176 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:21:33,181 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 209.0) internal successors, (836), 4 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:21:33,182 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 209.0) internal successors, (836), 4 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:21:33,185 INFO L175 Difference]: Start difference. First operand has 32 places, 23 transitions, 55 flow. Second operand 3 states and 325 transitions. [2023-11-12 02:21:33,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 33 transitions, 140 flow [2023-11-12 02:21:33,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 33 transitions, 136 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-12 02:21:33,192 INFO L231 Difference]: Finished difference. Result has 30 places, 20 transitions, 50 flow [2023-11-12 02:21:33,194 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=30, PETRI_TRANSITIONS=20} [2023-11-12 02:21:33,199 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -2 predicate places. [2023-11-12 02:21:33,199 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 20 transitions, 50 flow [2023-11-12 02:21:33,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:21:33,200 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:21:33,200 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:21:33,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 02:21:33,201 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-12 02:21:33,204 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:21:33,204 INFO L85 PathProgramCache]: Analyzing trace with hash 2044074957, now seen corresponding path program 1 times [2023-11-12 02:21:33,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:21:33,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319314571] [2023-11-12 02:21:33,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:21:33,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:21:33,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:33,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:21:33,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:21:33,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319314571] [2023-11-12 02:21:33,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319314571] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:21:33,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:21:33,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-12 02:21:33,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541713222] [2023-11-12 02:21:33,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:21:33,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:21:33,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:21:33,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:21:33,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:21:33,485 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 209 [2023-11-12 02:21:33,488 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 20 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:21:33,488 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:21:33,488 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 209 [2023-11-12 02:21:33,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:21:33,857 INFO L124 PetriNetUnfolderBase]: 916/1419 cut-off events. [2023-11-12 02:21:33,857 INFO L125 PetriNetUnfolderBase]: For 122/122 co-relation queries the response was YES. [2023-11-12 02:21:33,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3005 conditions, 1419 events. 916/1419 cut-off events. For 122/122 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 6970 event pairs, 340 based on Foata normal form. 52/1470 useless extension candidates. Maximal degree in co-relation 2995. Up to 903 conditions per place. [2023-11-12 02:21:33,869 INFO L140 encePairwiseOnDemand]: 203/209 looper letters, 29 selfloop transitions, 5 changer transitions 0/35 dead transitions. [2023-11-12 02:21:33,869 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 35 transitions, 154 flow [2023-11-12 02:21:33,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:21:33,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-12 02:21:33,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 311 transitions. [2023-11-12 02:21:33,873 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4960127591706539 [2023-11-12 02:21:33,873 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 311 transitions. [2023-11-12 02:21:33,873 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 311 transitions. [2023-11-12 02:21:33,874 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:21:33,874 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 311 transitions. [2023-11-12 02:21:33,875 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:21:33,878 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 209.0) internal successors, (836), 4 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:21:33,879 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 209.0) internal successors, (836), 4 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:21:33,879 INFO L175 Difference]: Start difference. First operand has 30 places, 20 transitions, 50 flow. Second operand 3 states and 311 transitions. [2023-11-12 02:21:33,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 35 transitions, 154 flow [2023-11-12 02:21:33,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 35 transitions, 148 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-12 02:21:33,882 INFO L231 Difference]: Finished difference. Result has 30 places, 23 transitions, 75 flow [2023-11-12 02:21:33,882 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=75, PETRI_PLACES=30, PETRI_TRANSITIONS=23} [2023-11-12 02:21:33,883 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -2 predicate places. [2023-11-12 02:21:33,883 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 23 transitions, 75 flow [2023-11-12 02:21:33,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:21:33,884 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:21:33,884 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:21:33,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-12 02:21:33,884 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-12 02:21:33,885 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:21:33,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1058186976, now seen corresponding path program 1 times [2023-11-12 02:21:33,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:21:33,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959631026] [2023-11-12 02:21:33,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:21:33,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:21:33,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:34,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:21:34,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:21:34,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959631026] [2023-11-12 02:21:34,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959631026] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:21:34,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:21:34,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-12 02:21:34,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391320135] [2023-11-12 02:21:34,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:21:34,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:21:34,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:21:34,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:21:34,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:21:34,131 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 209 [2023-11-12 02:21:34,132 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 23 transitions, 75 flow. Second operand has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:21:34,132 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:21:34,132 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 209 [2023-11-12 02:21:34,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:21:34,443 INFO L124 PetriNetUnfolderBase]: 791/1284 cut-off events. [2023-11-12 02:21:34,443 INFO L125 PetriNetUnfolderBase]: For 226/226 co-relation queries the response was YES. [2023-11-12 02:21:34,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3061 conditions, 1284 events. 791/1284 cut-off events. For 226/226 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 6065 event pairs, 243 based on Foata normal form. 12/1292 useless extension candidates. Maximal degree in co-relation 3050. Up to 1017 conditions per place. [2023-11-12 02:21:34,455 INFO L140 encePairwiseOnDemand]: 206/209 looper letters, 26 selfloop transitions, 3 changer transitions 0/31 dead transitions. [2023-11-12 02:21:34,456 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 31 transitions, 154 flow [2023-11-12 02:21:34,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:21:34,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-12 02:21:34,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 315 transitions. [2023-11-12 02:21:34,458 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5023923444976076 [2023-11-12 02:21:34,458 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 315 transitions. [2023-11-12 02:21:34,458 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 315 transitions. [2023-11-12 02:21:34,459 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:21:34,459 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 315 transitions. [2023-11-12 02:21:34,460 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:21:34,462 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 209.0) internal successors, (836), 4 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:21:34,463 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 209.0) internal successors, (836), 4 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:21:34,463 INFO L175 Difference]: Start difference. First operand has 30 places, 23 transitions, 75 flow. Second operand 3 states and 315 transitions. [2023-11-12 02:21:34,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 31 transitions, 154 flow [2023-11-12 02:21:34,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 31 transitions, 148 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-12 02:21:34,470 INFO L231 Difference]: Finished difference. Result has 32 places, 23 transitions, 81 flow [2023-11-12 02:21:34,470 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=81, PETRI_PLACES=32, PETRI_TRANSITIONS=23} [2023-11-12 02:21:34,472 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 0 predicate places. [2023-11-12 02:21:34,475 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 23 transitions, 81 flow [2023-11-12 02:21:34,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:21:34,476 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:21:34,477 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:21:34,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-12 02:21:34,477 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-12 02:21:34,478 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:21:34,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1058186945, now seen corresponding path program 1 times [2023-11-12 02:21:34,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:21:34,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746930323] [2023-11-12 02:21:34,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:21:34,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:21:34,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:34,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:21:34,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:21:34,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746930323] [2023-11-12 02:21:34,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746930323] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:21:34,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:21:34,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:21:34,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585815347] [2023-11-12 02:21:34,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:21:34,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:21:34,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:21:34,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:21:34,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:21:34,726 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 209 [2023-11-12 02:21:34,727 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 23 transitions, 81 flow. Second operand has 4 states, 4 states have (on average 96.5) internal successors, (386), 4 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:21:34,727 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:21:34,727 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 209 [2023-11-12 02:21:34,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:21:35,174 INFO L124 PetriNetUnfolderBase]: 1267/2007 cut-off events. [2023-11-12 02:21:35,174 INFO L125 PetriNetUnfolderBase]: For 677/677 co-relation queries the response was YES. [2023-11-12 02:21:35,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4680 conditions, 2007 events. 1267/2007 cut-off events. For 677/677 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 10091 event pairs, 355 based on Foata normal form. 65/2060 useless extension candidates. Maximal degree in co-relation 4667. Up to 747 conditions per place. [2023-11-12 02:21:35,187 INFO L140 encePairwiseOnDemand]: 205/209 looper letters, 32 selfloop transitions, 4 changer transitions 10/47 dead transitions. [2023-11-12 02:21:35,187 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 47 transitions, 249 flow [2023-11-12 02:21:35,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:21:35,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-12 02:21:35,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 416 transitions. [2023-11-12 02:21:35,190 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49760765550239233 [2023-11-12 02:21:35,190 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 416 transitions. [2023-11-12 02:21:35,190 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 416 transitions. [2023-11-12 02:21:35,191 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:21:35,191 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 416 transitions. [2023-11-12 02:21:35,193 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 104.0) internal successors, (416), 4 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:21:35,195 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 209.0) internal successors, (1045), 5 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:21:35,196 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 209.0) internal successors, (1045), 5 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:21:35,196 INFO L175 Difference]: Start difference. First operand has 32 places, 23 transitions, 81 flow. Second operand 4 states and 416 transitions. [2023-11-12 02:21:35,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 47 transitions, 249 flow [2023-11-12 02:21:35,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 47 transitions, 239 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-12 02:21:35,200 INFO L231 Difference]: Finished difference. Result has 35 places, 23 transitions, 92 flow [2023-11-12 02:21:35,201 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=92, PETRI_PLACES=35, PETRI_TRANSITIONS=23} [2023-11-12 02:21:35,203 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 3 predicate places. [2023-11-12 02:21:35,203 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 23 transitions, 92 flow [2023-11-12 02:21:35,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 96.5) internal successors, (386), 4 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:21:35,204 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:21:35,204 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:21:35,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-12 02:21:35,206 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-12 02:21:35,207 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:21:35,207 INFO L85 PathProgramCache]: Analyzing trace with hash -37306865, now seen corresponding path program 1 times [2023-11-12 02:21:35,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:21:35,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803637134] [2023-11-12 02:21:35,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:21:35,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:21:35,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:35,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:21:35,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:21:35,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803637134] [2023-11-12 02:21:35,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803637134] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:21:35,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:21:35,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:21:35,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914487497] [2023-11-12 02:21:35,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:21:35,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:21:35,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:21:35,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:21:35,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:21:35,429 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 209 [2023-11-12 02:21:35,430 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 23 transitions, 92 flow. Second operand has 4 states, 4 states have (on average 94.75) internal successors, (379), 4 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:21:35,430 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:21:35,430 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 209 [2023-11-12 02:21:35,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:21:35,692 INFO L124 PetriNetUnfolderBase]: 648/1026 cut-off events. [2023-11-12 02:21:35,692 INFO L125 PetriNetUnfolderBase]: For 367/367 co-relation queries the response was YES. [2023-11-12 02:21:35,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2601 conditions, 1026 events. 648/1026 cut-off events. For 367/367 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 4351 event pairs, 66 based on Foata normal form. 3/1028 useless extension candidates. Maximal degree in co-relation 2586. Up to 637 conditions per place. [2023-11-12 02:21:35,701 INFO L140 encePairwiseOnDemand]: 204/209 looper letters, 33 selfloop transitions, 7 changer transitions 0/41 dead transitions. [2023-11-12 02:21:35,702 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 41 transitions, 216 flow [2023-11-12 02:21:35,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:21:35,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-12 02:21:35,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 408 transitions. [2023-11-12 02:21:35,704 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4880382775119617 [2023-11-12 02:21:35,704 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 408 transitions. [2023-11-12 02:21:35,705 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 408 transitions. [2023-11-12 02:21:35,705 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:21:35,705 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 408 transitions. [2023-11-12 02:21:35,707 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 102.0) internal successors, (408), 4 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:21:35,709 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 209.0) internal successors, (1045), 5 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:21:35,710 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 209.0) internal successors, (1045), 5 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:21:35,711 INFO L175 Difference]: Start difference. First operand has 35 places, 23 transitions, 92 flow. Second operand 4 states and 408 transitions. [2023-11-12 02:21:35,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 41 transitions, 216 flow [2023-11-12 02:21:35,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 41 transitions, 202 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-11-12 02:21:35,717 INFO L231 Difference]: Finished difference. Result has 35 places, 25 transitions, 106 flow [2023-11-12 02:21:35,717 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=106, PETRI_PLACES=35, PETRI_TRANSITIONS=25} [2023-11-12 02:21:35,740 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 3 predicate places. [2023-11-12 02:21:35,740 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 25 transitions, 106 flow [2023-11-12 02:21:35,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 94.75) internal successors, (379), 4 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:21:35,741 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:21:35,741 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:21:35,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-12 02:21:35,741 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-12 02:21:35,742 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:21:35,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1804227038, now seen corresponding path program 1 times [2023-11-12 02:21:35,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:21:35,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119063346] [2023-11-12 02:21:35,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:21:35,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:21:35,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:35,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:21:35,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:21:35,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119063346] [2023-11-12 02:21:35,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119063346] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:21:35,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:21:35,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:21:35,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115858346] [2023-11-12 02:21:35,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:21:35,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:21:35,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:21:35,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:21:35,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:21:35,940 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 209 [2023-11-12 02:21:35,941 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 25 transitions, 106 flow. Second operand has 4 states, 4 states have (on average 95.0) internal successors, (380), 4 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:21:35,941 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:21:35,941 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 209 [2023-11-12 02:21:35,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:21:36,172 INFO L124 PetriNetUnfolderBase]: 477/830 cut-off events. [2023-11-12 02:21:36,172 INFO L125 PetriNetUnfolderBase]: For 445/448 co-relation queries the response was YES. [2023-11-12 02:21:36,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2139 conditions, 830 events. 477/830 cut-off events. For 445/448 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 3903 event pairs, 100 based on Foata normal form. 82/907 useless extension candidates. Maximal degree in co-relation 2125. Up to 344 conditions per place. [2023-11-12 02:21:36,178 INFO L140 encePairwiseOnDemand]: 203/209 looper letters, 47 selfloop transitions, 5 changer transitions 1/56 dead transitions. [2023-11-12 02:21:36,179 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 56 transitions, 334 flow [2023-11-12 02:21:36,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:21:36,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-12 02:21:36,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 411 transitions. [2023-11-12 02:21:36,181 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4916267942583732 [2023-11-12 02:21:36,181 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 411 transitions. [2023-11-12 02:21:36,182 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 411 transitions. [2023-11-12 02:21:36,182 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:21:36,182 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 411 transitions. [2023-11-12 02:21:36,184 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 102.75) internal successors, (411), 4 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:21:36,186 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 209.0) internal successors, (1045), 5 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:21:36,187 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 209.0) internal successors, (1045), 5 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:21:36,187 INFO L175 Difference]: Start difference. First operand has 35 places, 25 transitions, 106 flow. Second operand 4 states and 411 transitions. [2023-11-12 02:21:36,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 56 transitions, 334 flow [2023-11-12 02:21:36,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 56 transitions, 334 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-12 02:21:36,191 INFO L231 Difference]: Finished difference. Result has 40 places, 28 transitions, 140 flow [2023-11-12 02:21:36,191 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=140, PETRI_PLACES=40, PETRI_TRANSITIONS=28} [2023-11-12 02:21:36,192 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 8 predicate places. [2023-11-12 02:21:36,192 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 28 transitions, 140 flow [2023-11-12 02:21:36,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.0) internal successors, (380), 4 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:21:36,193 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:21:36,193 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:21:36,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-12 02:21:36,193 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-12 02:21:36,194 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:21:36,194 INFO L85 PathProgramCache]: Analyzing trace with hash -131041675, now seen corresponding path program 1 times [2023-11-12 02:21:36,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:21:36,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752216787] [2023-11-12 02:21:36,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:21:36,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:21:36,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:36,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:21:36,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:21:36,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752216787] [2023-11-12 02:21:36,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752216787] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:21:36,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:21:36,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:21:36,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98924531] [2023-11-12 02:21:36,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:21:36,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:21:36,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:21:36,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:21:36,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:21:36,420 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 209 [2023-11-12 02:21:36,421 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 28 transitions, 140 flow. Second operand has 5 states, 5 states have (on average 94.8) internal successors, (474), 5 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:21:36,421 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:21:36,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 209 [2023-11-12 02:21:36,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:21:36,683 INFO L124 PetriNetUnfolderBase]: 248/470 cut-off events. [2023-11-12 02:21:36,683 INFO L125 PetriNetUnfolderBase]: For 420/421 co-relation queries the response was YES. [2023-11-12 02:21:36,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1540 conditions, 470 events. 248/470 cut-off events. For 420/421 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1998 event pairs, 48 based on Foata normal form. 51/517 useless extension candidates. Maximal degree in co-relation 1522. Up to 186 conditions per place. [2023-11-12 02:21:36,688 INFO L140 encePairwiseOnDemand]: 203/209 looper letters, 51 selfloop transitions, 8 changer transitions 1/63 dead transitions. [2023-11-12 02:21:36,688 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 63 transitions, 407 flow [2023-11-12 02:21:36,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 02:21:36,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-12 02:21:36,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 512 transitions. [2023-11-12 02:21:36,691 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48995215311004786 [2023-11-12 02:21:36,691 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 512 transitions. [2023-11-12 02:21:36,691 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 512 transitions. [2023-11-12 02:21:36,692 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:21:36,692 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 512 transitions. [2023-11-12 02:21:36,694 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 102.4) internal successors, (512), 5 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:21:36,696 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 209.0) internal successors, (1254), 6 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:21:36,697 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 209.0) internal successors, (1254), 6 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:21:36,697 INFO L175 Difference]: Start difference. First operand has 40 places, 28 transitions, 140 flow. Second operand 5 states and 512 transitions. [2023-11-12 02:21:36,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 63 transitions, 407 flow [2023-11-12 02:21:36,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 63 transitions, 389 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-11-12 02:21:36,701 INFO L231 Difference]: Finished difference. Result has 43 places, 31 transitions, 174 flow [2023-11-12 02:21:36,702 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=174, PETRI_PLACES=43, PETRI_TRANSITIONS=31} [2023-11-12 02:21:36,702 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 11 predicate places. [2023-11-12 02:21:36,703 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 31 transitions, 174 flow [2023-11-12 02:21:36,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 94.8) internal successors, (474), 5 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:21:36,703 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:21:36,703 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:21:36,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-12 02:21:36,704 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-12 02:21:36,704 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:21:36,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1350280744, now seen corresponding path program 1 times [2023-11-12 02:21:36,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:21:36,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562560380] [2023-11-12 02:21:36,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:21:36,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:21:36,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:36,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:21:36,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:21:36,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562560380] [2023-11-12 02:21:36,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562560380] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:21:36,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:21:36,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:21:36,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102308508] [2023-11-12 02:21:36,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:21:36,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 02:21:36,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:21:36,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 02:21:36,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-12 02:21:36,947 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 209 [2023-11-12 02:21:36,948 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 31 transitions, 174 flow. Second operand has 6 states, 6 states have (on average 94.66666666666667) internal successors, (568), 6 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:21:36,949 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:21:36,949 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 209 [2023-11-12 02:21:36,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:21:37,129 INFO L124 PetriNetUnfolderBase]: 159/309 cut-off events. [2023-11-12 02:21:37,129 INFO L125 PetriNetUnfolderBase]: For 472/472 co-relation queries the response was YES. [2023-11-12 02:21:37,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1110 conditions, 309 events. 159/309 cut-off events. For 472/472 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1131 event pairs, 48 based on Foata normal form. 16/321 useless extension candidates. Maximal degree in co-relation 1091. Up to 111 conditions per place. [2023-11-12 02:21:37,132 INFO L140 encePairwiseOnDemand]: 203/209 looper letters, 33 selfloop transitions, 11 changer transitions 7/54 dead transitions. [2023-11-12 02:21:37,132 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 54 transitions, 372 flow [2023-11-12 02:21:37,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 02:21:37,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-12 02:21:37,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 596 transitions. [2023-11-12 02:21:37,135 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47527910685805425 [2023-11-12 02:21:37,136 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 596 transitions. [2023-11-12 02:21:37,136 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 596 transitions. [2023-11-12 02:21:37,136 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:21:37,137 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 596 transitions. [2023-11-12 02:21:37,139 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 99.33333333333333) internal successors, (596), 6 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:21:37,141 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 209.0) internal successors, (1463), 7 states have internal predecessors, (1463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:21:37,142 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 209.0) internal successors, (1463), 7 states have internal predecessors, (1463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:21:37,142 INFO L175 Difference]: Start difference. First operand has 43 places, 31 transitions, 174 flow. Second operand 6 states and 596 transitions. [2023-11-12 02:21:37,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 54 transitions, 372 flow [2023-11-12 02:21:37,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 54 transitions, 339 flow, removed 5 selfloop flow, removed 5 redundant places. [2023-11-12 02:21:37,147 INFO L231 Difference]: Finished difference. Result has 45 places, 31 transitions, 183 flow [2023-11-12 02:21:37,147 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=147, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=183, PETRI_PLACES=45, PETRI_TRANSITIONS=31} [2023-11-12 02:21:37,148 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 13 predicate places. [2023-11-12 02:21:37,148 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 31 transitions, 183 flow [2023-11-12 02:21:37,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 94.66666666666667) internal successors, (568), 6 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:21:37,149 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:21:37,149 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:21:37,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-12 02:21:37,150 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-12 02:21:37,150 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:21:37,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1713117342, now seen corresponding path program 1 times [2023-11-12 02:21:37,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:21:37,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964424119] [2023-11-12 02:21:37,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:21:37,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:21:37,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:37,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:21:37,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:21:37,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964424119] [2023-11-12 02:21:37,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964424119] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:21:37,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:21:37,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:21:37,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913831129] [2023-11-12 02:21:37,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:21:37,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:21:37,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:21:37,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:21:37,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:21:37,415 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 209 [2023-11-12 02:21:37,416 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 31 transitions, 183 flow. Second operand has 4 states, 4 states have (on average 96.75) internal successors, (387), 4 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:21:37,416 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:21:37,416 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 209 [2023-11-12 02:21:37,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:21:37,545 INFO L124 PetriNetUnfolderBase]: 173/331 cut-off events. [2023-11-12 02:21:37,546 INFO L125 PetriNetUnfolderBase]: For 562/562 co-relation queries the response was YES. [2023-11-12 02:21:37,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1219 conditions, 331 events. 173/331 cut-off events. For 562/562 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1268 event pairs, 21 based on Foata normal form. 1/331 useless extension candidates. Maximal degree in co-relation 1200. Up to 195 conditions per place. [2023-11-12 02:21:37,548 INFO L140 encePairwiseOnDemand]: 204/209 looper letters, 29 selfloop transitions, 4 changer transitions 17/51 dead transitions. [2023-11-12 02:21:37,548 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 51 transitions, 405 flow [2023-11-12 02:21:37,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:21:37,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-12 02:21:37,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 406 transitions. [2023-11-12 02:21:37,551 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48564593301435405 [2023-11-12 02:21:37,551 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 406 transitions. [2023-11-12 02:21:37,552 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 406 transitions. [2023-11-12 02:21:37,552 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:21:37,552 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 406 transitions. [2023-11-12 02:21:37,554 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 101.5) internal successors, (406), 4 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:21:37,556 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 209.0) internal successors, (1045), 5 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:21:37,556 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 209.0) internal successors, (1045), 5 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:21:37,557 INFO L175 Difference]: Start difference. First operand has 45 places, 31 transitions, 183 flow. Second operand 4 states and 406 transitions. [2023-11-12 02:21:37,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 51 transitions, 405 flow [2023-11-12 02:21:37,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 51 transitions, 288 flow, removed 20 selfloop flow, removed 9 redundant places. [2023-11-12 02:21:37,562 INFO L231 Difference]: Finished difference. Result has 40 places, 26 transitions, 108 flow [2023-11-12 02:21:37,562 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=108, PETRI_PLACES=40, PETRI_TRANSITIONS=26} [2023-11-12 02:21:37,563 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 8 predicate places. [2023-11-12 02:21:37,563 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 26 transitions, 108 flow [2023-11-12 02:21:37,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 96.75) internal successors, (387), 4 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:21:37,564 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:21:37,564 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:21:37,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-12 02:21:37,564 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-12 02:21:37,565 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:21:37,565 INFO L85 PathProgramCache]: Analyzing trace with hash -915508206, now seen corresponding path program 2 times [2023-11-12 02:21:37,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:21:37,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901103821] [2023-11-12 02:21:37,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:21:37,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:21:37,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:38,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:21:38,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:21:38,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901103821] [2023-11-12 02:21:38,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901103821] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:21:38,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:21:38,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:21:38,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018139305] [2023-11-12 02:21:38,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:21:38,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-12 02:21:38,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:21:38,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-12 02:21:38,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-12 02:21:38,784 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 209 [2023-11-12 02:21:38,786 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 26 transitions, 108 flow. Second operand has 7 states, 7 states have (on average 95.57142857142857) internal successors, (669), 7 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:21:38,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:21:38,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 209 [2023-11-12 02:21:38,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:21:39,014 INFO L124 PetriNetUnfolderBase]: 56/128 cut-off events. [2023-11-12 02:21:39,014 INFO L125 PetriNetUnfolderBase]: For 86/86 co-relation queries the response was YES. [2023-11-12 02:21:39,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 381 conditions, 128 events. 56/128 cut-off events. For 86/86 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 365 event pairs, 5 based on Foata normal form. 1/129 useless extension candidates. Maximal degree in co-relation 365. Up to 40 conditions per place. [2023-11-12 02:21:39,015 INFO L140 encePairwiseOnDemand]: 204/209 looper letters, 25 selfloop transitions, 3 changer transitions 23/53 dead transitions. [2023-11-12 02:21:39,016 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 53 transitions, 308 flow [2023-11-12 02:21:39,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 02:21:39,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-12 02:21:39,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 596 transitions. [2023-11-12 02:21:39,019 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47527910685805425 [2023-11-12 02:21:39,019 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 596 transitions. [2023-11-12 02:21:39,019 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 596 transitions. [2023-11-12 02:21:39,020 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:21:39,020 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 596 transitions. [2023-11-12 02:21:39,022 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 99.33333333333333) internal successors, (596), 6 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:21:39,025 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 209.0) internal successors, (1463), 7 states have internal predecessors, (1463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:21:39,026 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 209.0) internal successors, (1463), 7 states have internal predecessors, (1463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:21:39,026 INFO L175 Difference]: Start difference. First operand has 40 places, 26 transitions, 108 flow. Second operand 6 states and 596 transitions. [2023-11-12 02:21:39,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 53 transitions, 308 flow [2023-11-12 02:21:39,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 53 transitions, 265 flow, removed 4 selfloop flow, removed 9 redundant places. [2023-11-12 02:21:39,029 INFO L231 Difference]: Finished difference. Result has 38 places, 26 transitions, 90 flow [2023-11-12 02:21:39,029 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=90, PETRI_PLACES=38, PETRI_TRANSITIONS=26} [2023-11-12 02:21:39,030 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 6 predicate places. [2023-11-12 02:21:39,031 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 26 transitions, 90 flow [2023-11-12 02:21:39,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 95.57142857142857) internal successors, (669), 7 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:21:39,032 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:21:39,032 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:21:39,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-12 02:21:39,032 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-12 02:21:39,033 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:21:39,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1633708602, now seen corresponding path program 3 times [2023-11-12 02:21:39,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:21:39,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797875631] [2023-11-12 02:21:39,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:21:39,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:21:39,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:21:39,089 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:21:39,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:21:39,177 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:21:39,177 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-12 02:21:39,180 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-11-12 02:21:39,182 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-11-12 02:21:39,183 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-11-12 02:21:39,183 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-11-12 02:21:39,183 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-11-12 02:21:39,183 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-11-12 02:21:39,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-12 02:21:39,184 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:21:39,192 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-12 02:21:39,192 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-11-12 02:21:39,268 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-12 02:21:39,271 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-12 02:21:39,273 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-12 02:21:39,313 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 02:21:39 BasicIcfg [2023-11-12 02:21:39,314 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-12 02:21:39,314 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-12 02:21:39,315 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-12 02:21:39,315 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-12 02:21:39,315 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:21:26" (3/4) ... [2023-11-12 02:21:39,316 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-12 02:21:39,349 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-12 02:21:39,353 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-12 02:21:39,357 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-12 02:21:39,443 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2a22259-fcb5-40b6-869e-7e8e7aec7e1d/bin/uautomizer-verify-uTZkv6EMXl/witness.graphml [2023-11-12 02:21:39,444 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-12 02:21:39,444 INFO L158 Benchmark]: Toolchain (without parser) took 14797.40ms. Allocated memory was 148.9MB in the beginning and 276.8MB in the end (delta: 127.9MB). Free memory was 106.2MB in the beginning and 182.0MB in the end (delta: -75.9MB). Peak memory consumption was 53.4MB. Max. memory is 16.1GB. [2023-11-12 02:21:39,445 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 111.1MB. Free memory is still 61.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-12 02:21:39,445 INFO L158 Benchmark]: CACSL2BoogieTranslator took 895.74ms. Allocated memory is still 148.9MB. Free memory was 105.8MB in the beginning and 82.8MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-12 02:21:39,445 INFO L158 Benchmark]: Boogie Procedure Inliner took 123.59ms. Allocated memory is still 148.9MB. Free memory was 82.8MB in the beginning and 80.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-12 02:21:39,446 INFO L158 Benchmark]: Boogie Preprocessor took 84.72ms. Allocated memory is still 148.9MB. Free memory was 80.4MB in the beginning and 78.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-12 02:21:39,446 INFO L158 Benchmark]: RCFGBuilder took 1094.26ms. Allocated memory is still 148.9MB. Free memory was 78.6MB in the beginning and 94.1MB in the end (delta: -15.5MB). Peak memory consumption was 14.0MB. Max. memory is 16.1GB. [2023-11-12 02:21:39,448 INFO L158 Benchmark]: TraceAbstraction took 12444.48ms. Allocated memory was 148.9MB in the beginning and 276.8MB in the end (delta: 127.9MB). Free memory was 94.1MB in the beginning and 191.5MB in the end (delta: -97.4MB). Peak memory consumption was 31.0MB. Max. memory is 16.1GB. [2023-11-12 02:21:39,449 INFO L158 Benchmark]: Witness Printer took 129.32ms. Allocated memory is still 276.8MB. Free memory was 191.5MB in the beginning and 182.0MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-11-12 02:21:39,451 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.33ms. Allocated memory is still 111.1MB. Free memory is still 61.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 895.74ms. Allocated memory is still 148.9MB. Free memory was 105.8MB in the beginning and 82.8MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 123.59ms. Allocated memory is still 148.9MB. Free memory was 82.8MB in the beginning and 80.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 84.72ms. Allocated memory is still 148.9MB. Free memory was 80.4MB in the beginning and 78.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1094.26ms. Allocated memory is still 148.9MB. Free memory was 78.6MB in the beginning and 94.1MB in the end (delta: -15.5MB). Peak memory consumption was 14.0MB. Max. memory is 16.1GB. * TraceAbstraction took 12444.48ms. Allocated memory was 148.9MB in the beginning and 276.8MB in the end (delta: 127.9MB). Free memory was 94.1MB in the beginning and 191.5MB in the end (delta: -97.4MB). Peak memory consumption was 31.0MB. Max. memory is 16.1GB. * Witness Printer took 129.32ms. Allocated memory is still 276.8MB. Free memory was 191.5MB in the beginning and 182.0MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.9s, 115 PlacesBefore, 32 PlacesAfterwards, 107 TransitionsBefore, 23 TransitionsAfterwards, 1958 CoEnabledTransitionPairs, 6 FixpointIterations, 37 TrivialSequentialCompositions, 52 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 99 TotalNumberOfCompositions, 4604 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2138, independent: 1990, independent conditional: 0, independent unconditional: 1990, dependent: 148, dependent conditional: 0, dependent unconditional: 148, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1084, independent: 1049, independent conditional: 0, independent unconditional: 1049, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2138, independent: 941, independent conditional: 0, independent unconditional: 941, dependent: 113, dependent conditional: 0, dependent unconditional: 113, unknown: 1084, unknown conditional: 0, unknown unconditional: 1084] , Statistics on independence cache: Total cache size (in pairs): 76, Positive cache size: 61, Positive conditional cache size: 0, Positive unconditional cache size: 61, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L715] 0 _Bool main$tmp_guard0; [L716] 0 _Bool main$tmp_guard1; [L718] 0 int x = 0; [L719] 0 _Bool x$flush_delayed; [L720] 0 int x$mem_tmp; [L721] 0 _Bool x$r_buff0_thd0; [L722] 0 _Bool x$r_buff0_thd1; [L723] 0 _Bool x$r_buff0_thd2; [L724] 0 _Bool x$r_buff0_thd3; [L725] 0 _Bool x$r_buff1_thd0; [L726] 0 _Bool x$r_buff1_thd1; [L727] 0 _Bool x$r_buff1_thd2; [L728] 0 _Bool x$r_buff1_thd3; [L729] 0 _Bool x$read_delayed; [L730] 0 int *x$read_delayed_var; [L731] 0 int x$w_buff0; [L732] 0 _Bool x$w_buff0_used; [L733] 0 int x$w_buff1; [L734] 0 _Bool x$w_buff1_used; [L736] 0 int y = 0; [L738] 0 int z = 0; [L739] 0 _Bool weak$$choice0; [L740] 0 _Bool weak$$choice2; [L831] 0 pthread_t t2073; [L832] FCALL, FORK 0 pthread_create(&t2073, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2073={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L833] 0 pthread_t t2074; [L834] FCALL, FORK 0 pthread_create(&t2074, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2073={5:0}, t2074={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L835] 0 pthread_t t2075; [L836] FCALL, FORK 0 pthread_create(&t2075, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2073={5:0}, t2074={6:0}, t2075={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 1 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L783] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L786] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L803] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L806] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L744] 1 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L809] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L810] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L811] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L812] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L813] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L816] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L818] 3 return 0; [L749] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L750] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L751] 1 x$flush_delayed = weak$$choice2 [L752] 1 x$mem_tmp = x [L753] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L754] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L755] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L756] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L757] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L759] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 1 __unbuffered_p0_EAX = x [L761] 1 x = x$flush_delayed ? x$mem_tmp : x [L762] 1 x$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L789] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L790] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L791] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L792] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L793] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 1 return 0; [L796] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L798] 2 return 0; [L838] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2073={5:0}, t2074={6:0}, t2075={3:0}, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] [L840] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L840] RET 0 assume_abort_if_not(main$tmp_guard0) [L842] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L843] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L844] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L845] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L846] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2073={5:0}, t2074={6:0}, t2075={3:0}, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] [L849] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1) [L851] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] - UnprovableResult [Line: 19]: 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. - UnprovableResult [Line: 834]: 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: 836]: 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: 832]: 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 136 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 12.1s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 355 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 291 mSDsluCounter, 109 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 77 mSDsCounter, 65 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 667 IncrementalHoareTripleChecker+Invalid, 732 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 65 mSolverCounterUnsat, 32 mSDtfsCounter, 667 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=183occurred in iteration=8, InterpolantAutomatonStates: 42, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 151 NumberOfCodeBlocks, 151 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 121 ConstructedInterpolants, 0 QuantifiedInterpolants, 658 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 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! [2023-11-12 02:21:39,496 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2a22259-fcb5-40b6-869e-7e8e7aec7e1d/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, 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