./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi006_pso.oepc_pso.opt_tso.oepc_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4fc63b2a 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_6b68c545-415b-4464-908d-b042761e8959/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b68c545-415b-4464-908d-b042761e8959/bin/uautomizer-verify-4GaUIPS5ZU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b68c545-415b-4464-908d-b042761e8959/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b68c545-415b-4464-908d-b042761e8959/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi006_pso.oepc_pso.opt_tso.oepc_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b68c545-415b-4464-908d-b042761e8959/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b68c545-415b-4464-908d-b042761e8959/bin/uautomizer-verify-4GaUIPS5ZU --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 596bf38d5c1bddbb7fa933c2910678824d7396d44da5246db401a53a5b4ba843 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 22:06:16,363 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 22:06:16,452 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b68c545-415b-4464-908d-b042761e8959/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-31 22:06:16,457 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 22:06:16,460 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 22:06:16,489 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 22:06:16,492 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 22:06:16,492 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 22:06:16,493 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 22:06:16,494 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 22:06:16,495 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 22:06:16,495 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 22:06:16,496 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 22:06:16,497 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 22:06:16,499 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 22:06:16,499 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 22:06:16,500 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 22:06:16,500 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 22:06:16,500 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 22:06:16,501 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 22:06:16,501 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 22:06:16,505 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 22:06:16,505 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 22:06:16,506 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 22:06:16,506 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 22:06:16,506 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 22:06:16,506 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 22:06:16,507 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 22:06:16,507 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 22:06:16,507 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 22:06:16,507 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 22:06:16,508 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 22:06:16,508 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:06:16,508 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 22:06:16,508 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 22:06:16,509 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 22:06:16,509 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-31 22:06:16,510 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-31 22:06:16,511 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 22:06:16,511 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 22:06:16,512 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 22:06:16,512 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 22:06:16,512 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_6b68c545-415b-4464-908d-b042761e8959/bin/uautomizer-verify-4GaUIPS5ZU/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_6b68c545-415b-4464-908d-b042761e8959/bin/uautomizer-verify-4GaUIPS5ZU 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 -> 596bf38d5c1bddbb7fa933c2910678824d7396d44da5246db401a53a5b4ba843 [2024-10-31 22:06:16,847 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 22:06:16,877 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 22:06:16,881 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 22:06:16,882 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 22:06:16,883 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 22:06:16,884 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b68c545-415b-4464-908d-b042761e8959/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/pthread-wmm/rfi006_pso.oepc_pso.opt_tso.oepc_tso.opt.i Unable to find full path for "g++" [2024-10-31 22:06:19,052 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 22:06:19,403 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 22:06:19,407 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b68c545-415b-4464-908d-b042761e8959/sv-benchmarks/c/pthread-wmm/rfi006_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2024-10-31 22:06:19,429 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b68c545-415b-4464-908d-b042761e8959/bin/uautomizer-verify-4GaUIPS5ZU/data/607c2e234/6dc27d2587c54ecfa76e23dca16eb04f/FLAG9fb571ec2 [2024-10-31 22:06:19,451 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b68c545-415b-4464-908d-b042761e8959/bin/uautomizer-verify-4GaUIPS5ZU/data/607c2e234/6dc27d2587c54ecfa76e23dca16eb04f [2024-10-31 22:06:19,456 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 22:06:19,457 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 22:06:19,460 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 22:06:19,460 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 22:06:19,466 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 22:06:19,467 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:06:19" (1/1) ... [2024-10-31 22:06:19,469 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d1b5d9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:06:19, skipping insertion in model container [2024-10-31 22:06:19,469 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:06:19" (1/1) ... [2024-10-31 22:06:19,537 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 22:06:19,796 WARN L251 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_6b68c545-415b-4464-908d-b042761e8959/sv-benchmarks/c/pthread-wmm/rfi006_pso.oepc_pso.opt_tso.oepc_tso.opt.i[974,987] [2024-10-31 22:06:20,198 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:06:20,221 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 22:06:20,238 WARN L251 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_6b68c545-415b-4464-908d-b042761e8959/sv-benchmarks/c/pthread-wmm/rfi006_pso.oepc_pso.opt_tso.oepc_tso.opt.i[974,987] [2024-10-31 22:06:20,312 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:06:20,360 INFO L204 MainTranslator]: Completed translation [2024-10-31 22:06:20,360 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:06:20 WrapperNode [2024-10-31 22:06:20,361 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 22:06:20,362 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 22:06:20,362 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 22:06:20,362 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 22:06:20,370 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:06:20" (1/1) ... [2024-10-31 22:06:20,387 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:06:20" (1/1) ... [2024-10-31 22:06:20,423 INFO L138 Inliner]: procedures = 175, calls = 42, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 156 [2024-10-31 22:06:20,423 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 22:06:20,424 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 22:06:20,424 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 22:06:20,424 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 22:06:20,439 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:06:20" (1/1) ... [2024-10-31 22:06:20,439 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:06:20" (1/1) ... [2024-10-31 22:06:20,443 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:06:20" (1/1) ... [2024-10-31 22:06:20,468 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-31 22:06:20,468 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:06:20" (1/1) ... [2024-10-31 22:06:20,468 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:06:20" (1/1) ... [2024-10-31 22:06:20,478 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:06:20" (1/1) ... [2024-10-31 22:06:20,480 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:06:20" (1/1) ... [2024-10-31 22:06:20,482 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:06:20" (1/1) ... [2024-10-31 22:06:20,487 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:06:20" (1/1) ... [2024-10-31 22:06:20,491 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 22:06:20,492 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 22:06:20,492 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 22:06:20,492 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 22:06:20,493 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:06:20" (1/1) ... [2024-10-31 22:06:20,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:06:20,517 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b68c545-415b-4464-908d-b042761e8959/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:06:20,533 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b68c545-415b-4464-908d-b042761e8959/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 22:06:20,540 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b68c545-415b-4464-908d-b042761e8959/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 22:06:20,573 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-31 22:06:20,574 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 22:06:20,575 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-10-31 22:06:20,576 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-10-31 22:06:20,576 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-10-31 22:06:20,576 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-10-31 22:06:20,576 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-10-31 22:06:20,576 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-10-31 22:06:20,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-31 22:06:20,577 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-31 22:06:20,577 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 22:06:20,579 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 22:06:20,581 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-31 22:06:20,782 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 22:06:20,785 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 22:06:21,304 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-31 22:06:21,305 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 22:06:21,606 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 22:06:21,606 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-31 22:06:21,607 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:06:21 BoogieIcfgContainer [2024-10-31 22:06:21,607 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 22:06:21,610 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 22:06:21,611 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 22:06:21,614 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 22:06:21,615 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 10:06:19" (1/3) ... [2024-10-31 22:06:21,617 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34a7d98e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:06:21, skipping insertion in model container [2024-10-31 22:06:21,617 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:06:20" (2/3) ... [2024-10-31 22:06:21,618 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34a7d98e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:06:21, skipping insertion in model container [2024-10-31 22:06:21,618 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:06:21" (3/3) ... [2024-10-31 22:06:21,622 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi006_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2024-10-31 22:06:21,642 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 22:06:21,643 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-31 22:06:21,643 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-31 22:06:21,715 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-31 22:06:21,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 39 transitions, 90 flow [2024-10-31 22:06:21,798 INFO L124 PetriNetUnfolderBase]: 1/36 cut-off events. [2024-10-31 22:06:21,799 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-31 22:06:21,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 36 events. 1/36 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 68 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 38. Up to 2 conditions per place. [2024-10-31 22:06:21,805 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 39 transitions, 90 flow [2024-10-31 22:06:21,810 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 36 transitions, 81 flow [2024-10-31 22:06:21,824 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 22:06:21,830 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=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;@85e27f6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 22:06:21,830 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-10-31 22:06:21,837 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-31 22:06:21,838 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2024-10-31 22:06:21,839 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-31 22:06:21,839 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:06:21,839 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-31 22:06:21,840 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-31 22:06:21,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:06:21,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1207813579, now seen corresponding path program 1 times [2024-10-31 22:06:21,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:06:21,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018123607] [2024-10-31 22:06:21,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:06:21,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:06:22,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:22,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:06:22,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:06:22,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018123607] [2024-10-31 22:06:22,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018123607] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:06:22,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:06:22,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-31 22:06:22,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453008242] [2024-10-31 22:06:22,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:06:22,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:06:22,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:06:22,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:06:22,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:06:22,582 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 39 [2024-10-31 22:06:22,588 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 36 transitions, 81 flow. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:06:22,592 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:06:22,592 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 39 [2024-10-31 22:06:22,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:06:23,222 INFO L124 PetriNetUnfolderBase]: 676/1221 cut-off events. [2024-10-31 22:06:23,223 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-10-31 22:06:23,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2292 conditions, 1221 events. 676/1221 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 7358 event pairs, 210 based on Foata normal form. 45/1244 useless extension candidates. Maximal degree in co-relation 2281. Up to 869 conditions per place. [2024-10-31 22:06:23,240 INFO L140 encePairwiseOnDemand]: 35/39 looper letters, 28 selfloop transitions, 2 changer transitions 2/46 dead transitions. [2024-10-31 22:06:23,241 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 46 transitions, 168 flow [2024-10-31 22:06:23,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:06:23,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:06:23,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2024-10-31 22:06:23,256 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7350427350427351 [2024-10-31 22:06:23,259 INFO L175 Difference]: Start difference. First operand has 45 places, 36 transitions, 81 flow. Second operand 3 states and 86 transitions. [2024-10-31 22:06:23,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 46 transitions, 168 flow [2024-10-31 22:06:23,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 46 transitions, 164 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-31 22:06:23,268 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 76 flow [2024-10-31 22:06:23,271 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2024-10-31 22:06:23,276 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, -2 predicate places. [2024-10-31 22:06:23,278 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 76 flow [2024-10-31 22:06:23,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:06:23,279 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:06:23,279 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:06:23,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-31 22:06:23,280 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-31 22:06:23,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:06:23,281 INFO L85 PathProgramCache]: Analyzing trace with hash -615355795, now seen corresponding path program 1 times [2024-10-31 22:06:23,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:06:23,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108254382] [2024-10-31 22:06:23,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:06:23,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:06:23,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:23,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:06:23,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:06:23,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108254382] [2024-10-31 22:06:23,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108254382] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:06:23,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:06:23,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:06:23,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747843963] [2024-10-31 22:06:23,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:06:23,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:06:23,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:06:23,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:06:23,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:06:23,732 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 39 [2024-10-31 22:06:23,733 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 76 flow. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:06:23,733 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:06:23,734 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 39 [2024-10-31 22:06:23,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:06:24,421 INFO L124 PetriNetUnfolderBase]: 1459/2465 cut-off events. [2024-10-31 22:06:24,421 INFO L125 PetriNetUnfolderBase]: For 116/116 co-relation queries the response was YES. [2024-10-31 22:06:24,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4847 conditions, 2465 events. 1459/2465 cut-off events. For 116/116 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 15106 event pairs, 179 based on Foata normal form. 96/2465 useless extension candidates. Maximal degree in co-relation 4837. Up to 1281 conditions per place. [2024-10-31 22:06:24,442 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 42 selfloop transitions, 5 changer transitions 1/58 dead transitions. [2024-10-31 22:06:24,442 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 58 transitions, 230 flow [2024-10-31 22:06:24,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:06:24,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-31 22:06:24,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 102 transitions. [2024-10-31 22:06:24,446 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6538461538461539 [2024-10-31 22:06:24,446 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 76 flow. Second operand 4 states and 102 transitions. [2024-10-31 22:06:24,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 58 transitions, 230 flow [2024-10-31 22:06:24,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 58 transitions, 222 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 22:06:24,453 INFO L231 Difference]: Finished difference. Result has 45 places, 36 transitions, 106 flow [2024-10-31 22:06:24,454 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=106, PETRI_PLACES=45, PETRI_TRANSITIONS=36} [2024-10-31 22:06:24,455 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 0 predicate places. [2024-10-31 22:06:24,455 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 36 transitions, 106 flow [2024-10-31 22:06:24,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:06:24,456 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:06:24,456 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:06:24,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-31 22:06:24,457 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-31 22:06:24,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:06:24,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1188716069, now seen corresponding path program 1 times [2024-10-31 22:06:24,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:06:24,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570232729] [2024-10-31 22:06:24,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:06:24,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:06:24,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:24,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:06:24,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:06:24,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570232729] [2024-10-31 22:06:24,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570232729] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:06:24,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:06:24,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:06:24,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159596133] [2024-10-31 22:06:24,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:06:24,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:06:24,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:06:24,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:06:24,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:06:24,918 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 39 [2024-10-31 22:06:24,918 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 36 transitions, 106 flow. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:06:24,918 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:06:24,919 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 39 [2024-10-31 22:06:24,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:06:25,412 INFO L124 PetriNetUnfolderBase]: 951/1621 cut-off events. [2024-10-31 22:06:25,412 INFO L125 PetriNetUnfolderBase]: For 410/410 co-relation queries the response was YES. [2024-10-31 22:06:25,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3713 conditions, 1621 events. 951/1621 cut-off events. For 410/410 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 8722 event pairs, 95 based on Foata normal form. 80/1645 useless extension candidates. Maximal degree in co-relation 3701. Up to 581 conditions per place. [2024-10-31 22:06:25,422 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 53 selfloop transitions, 8 changer transitions 1/72 dead transitions. [2024-10-31 22:06:25,422 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 72 transitions, 323 flow [2024-10-31 22:06:25,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 22:06:25,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-31 22:06:25,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 129 transitions. [2024-10-31 22:06:25,424 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6615384615384615 [2024-10-31 22:06:25,424 INFO L175 Difference]: Start difference. First operand has 45 places, 36 transitions, 106 flow. Second operand 5 states and 129 transitions. [2024-10-31 22:06:25,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 72 transitions, 323 flow [2024-10-31 22:06:25,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 72 transitions, 313 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-10-31 22:06:25,430 INFO L231 Difference]: Finished difference. Result has 49 places, 39 transitions, 146 flow [2024-10-31 22:06:25,430 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=146, PETRI_PLACES=49, PETRI_TRANSITIONS=39} [2024-10-31 22:06:25,432 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 4 predicate places. [2024-10-31 22:06:25,432 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 39 transitions, 146 flow [2024-10-31 22:06:25,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:06:25,432 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:06:25,432 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:06:25,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-31 22:06:25,433 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-31 22:06:25,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:06:25,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1989089637, now seen corresponding path program 1 times [2024-10-31 22:06:25,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:06:25,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244116675] [2024-10-31 22:06:25,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:06:25,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:06:25,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:25,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:06:25,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:06:25,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244116675] [2024-10-31 22:06:25,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244116675] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:06:25,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:06:25,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:06:25,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284862148] [2024-10-31 22:06:25,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:06:25,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 22:06:25,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:06:25,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 22:06:25,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:06:25,830 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 39 [2024-10-31 22:06:25,830 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 39 transitions, 146 flow. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:06:25,830 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:06:25,831 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 39 [2024-10-31 22:06:25,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:06:26,178 INFO L124 PetriNetUnfolderBase]: 563/937 cut-off events. [2024-10-31 22:06:26,178 INFO L125 PetriNetUnfolderBase]: For 765/765 co-relation queries the response was YES. [2024-10-31 22:06:26,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2449 conditions, 937 events. 563/937 cut-off events. For 765/765 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 4238 event pairs, 79 based on Foata normal form. 40/953 useless extension candidates. Maximal degree in co-relation 2435. Up to 308 conditions per place. [2024-10-31 22:06:26,185 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 46 selfloop transitions, 11 changer transitions 1/68 dead transitions. [2024-10-31 22:06:26,185 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 68 transitions, 330 flow [2024-10-31 22:06:26,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:06:26,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-31 22:06:26,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 138 transitions. [2024-10-31 22:06:26,187 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5897435897435898 [2024-10-31 22:06:26,187 INFO L175 Difference]: Start difference. First operand has 49 places, 39 transitions, 146 flow. Second operand 6 states and 138 transitions. [2024-10-31 22:06:26,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 68 transitions, 330 flow [2024-10-31 22:06:26,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 68 transitions, 305 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-10-31 22:06:26,193 INFO L231 Difference]: Finished difference. Result has 52 places, 39 transitions, 160 flow [2024-10-31 22:06:26,194 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=160, PETRI_PLACES=52, PETRI_TRANSITIONS=39} [2024-10-31 22:06:26,194 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 7 predicate places. [2024-10-31 22:06:26,195 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 39 transitions, 160 flow [2024-10-31 22:06:26,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:06:26,195 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:06:26,195 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:06:26,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-31 22:06:26,196 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-31 22:06:26,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:06:26,197 INFO L85 PathProgramCache]: Analyzing trace with hash -506014015, now seen corresponding path program 1 times [2024-10-31 22:06:26,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:06:26,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255810041] [2024-10-31 22:06:26,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:06:26,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:06:26,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:27,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:06:27,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:06:27,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255810041] [2024-10-31 22:06:27,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255810041] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:06:27,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:06:27,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-31 22:06:27,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673728351] [2024-10-31 22:06:27,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:06:27,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-31 22:06:27,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:06:27,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-31 22:06:27,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-31 22:06:27,662 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 39 [2024-10-31 22:06:27,663 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 39 transitions, 160 flow. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:06:27,663 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:06:27,663 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 39 [2024-10-31 22:06:27,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:06:28,177 INFO L124 PetriNetUnfolderBase]: 856/1552 cut-off events. [2024-10-31 22:06:28,177 INFO L125 PetriNetUnfolderBase]: For 685/705 co-relation queries the response was YES. [2024-10-31 22:06:28,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3589 conditions, 1552 events. 856/1552 cut-off events. For 685/705 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8509 event pairs, 228 based on Foata normal form. 8/1532 useless extension candidates. Maximal degree in co-relation 3574. Up to 505 conditions per place. [2024-10-31 22:06:28,187 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 34 selfloop transitions, 3 changer transitions 15/68 dead transitions. [2024-10-31 22:06:28,188 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 68 transitions, 330 flow [2024-10-31 22:06:28,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:06:28,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-31 22:06:28,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 131 transitions. [2024-10-31 22:06:28,189 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5598290598290598 [2024-10-31 22:06:28,190 INFO L175 Difference]: Start difference. First operand has 52 places, 39 transitions, 160 flow. Second operand 6 states and 131 transitions. [2024-10-31 22:06:28,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 68 transitions, 330 flow [2024-10-31 22:06:28,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 68 transitions, 266 flow, removed 14 selfloop flow, removed 8 redundant places. [2024-10-31 22:06:28,204 INFO L231 Difference]: Finished difference. Result has 52 places, 39 transitions, 118 flow [2024-10-31 22:06:28,204 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=118, PETRI_PLACES=52, PETRI_TRANSITIONS=39} [2024-10-31 22:06:28,206 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 7 predicate places. [2024-10-31 22:06:28,208 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 39 transitions, 118 flow [2024-10-31 22:06:28,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:06:28,209 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:06:28,209 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:06:28,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-31 22:06:28,209 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-31 22:06:28,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:06:28,210 INFO L85 PathProgramCache]: Analyzing trace with hash -366649061, now seen corresponding path program 2 times [2024-10-31 22:06:28,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:06:28,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630381169] [2024-10-31 22:06:28,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:06:28,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:06:28,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:31,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:06:31,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:06:31,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630381169] [2024-10-31 22:06:31,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630381169] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:06:31,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:06:31,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-31 22:06:31,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100507998] [2024-10-31 22:06:31,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:06:31,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-31 22:06:31,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:06:31,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-31 22:06:31,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-10-31 22:06:31,469 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 39 [2024-10-31 22:06:31,470 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 39 transitions, 118 flow. Second operand has 10 states, 10 states have (on average 16.8) internal successors, (168), 10 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:06:31,470 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:06:31,470 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 39 [2024-10-31 22:06:31,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:06:32,291 INFO L124 PetriNetUnfolderBase]: 564/1051 cut-off events. [2024-10-31 22:06:32,292 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-31 22:06:32,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2104 conditions, 1051 events. 564/1051 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 5529 event pairs, 112 based on Foata normal form. 8/1013 useless extension candidates. Maximal degree in co-relation 2090. Up to 460 conditions per place. [2024-10-31 22:06:32,299 INFO L140 encePairwiseOnDemand]: 30/39 looper letters, 38 selfloop transitions, 8 changer transitions 10/74 dead transitions. [2024-10-31 22:06:32,300 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 74 transitions, 308 flow [2024-10-31 22:06:32,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-31 22:06:32,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-31 22:06:32,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 177 transitions. [2024-10-31 22:06:32,302 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5673076923076923 [2024-10-31 22:06:32,302 INFO L175 Difference]: Start difference. First operand has 52 places, 39 transitions, 118 flow. Second operand 8 states and 177 transitions. [2024-10-31 22:06:32,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 74 transitions, 308 flow [2024-10-31 22:06:32,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 74 transitions, 292 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-10-31 22:06:32,305 INFO L231 Difference]: Finished difference. Result has 57 places, 45 transitions, 163 flow [2024-10-31 22:06:32,305 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=163, PETRI_PLACES=57, PETRI_TRANSITIONS=45} [2024-10-31 22:06:32,306 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 12 predicate places. [2024-10-31 22:06:32,306 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 45 transitions, 163 flow [2024-10-31 22:06:32,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.8) internal successors, (168), 10 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:06:32,307 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:06:32,307 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:06:32,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-31 22:06:32,307 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-31 22:06:32,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:06:32,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1973280139, now seen corresponding path program 3 times [2024-10-31 22:06:32,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:06:32,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124997280] [2024-10-31 22:06:32,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:06:32,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:06:32,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:32,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:06:32,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:06:32,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124997280] [2024-10-31 22:06:32,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124997280] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:06:32,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:06:32,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-31 22:06:32,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151486033] [2024-10-31 22:06:32,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:06:32,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 22:06:32,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:06:32,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 22:06:32,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:06:32,851 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 39 [2024-10-31 22:06:32,852 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 45 transitions, 163 flow. Second operand has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:06:32,852 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:06:32,852 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 39 [2024-10-31 22:06:32,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:06:33,359 INFO L124 PetriNetUnfolderBase]: 901/1662 cut-off events. [2024-10-31 22:06:33,359 INFO L125 PetriNetUnfolderBase]: For 509/515 co-relation queries the response was YES. [2024-10-31 22:06:33,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3864 conditions, 1662 events. 901/1662 cut-off events. For 509/515 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 9616 event pairs, 265 based on Foata normal form. 12/1578 useless extension candidates. Maximal degree in co-relation 3848. Up to 761 conditions per place. [2024-10-31 22:06:33,368 INFO L140 encePairwiseOnDemand]: 34/39 looper letters, 26 selfloop transitions, 1 changer transitions 26/70 dead transitions. [2024-10-31 22:06:33,368 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 70 transitions, 344 flow [2024-10-31 22:06:33,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:06:33,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-31 22:06:33,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 130 transitions. [2024-10-31 22:06:33,370 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2024-10-31 22:06:33,370 INFO L175 Difference]: Start difference. First operand has 57 places, 45 transitions, 163 flow. Second operand 6 states and 130 transitions. [2024-10-31 22:06:33,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 70 transitions, 344 flow [2024-10-31 22:06:33,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 70 transitions, 334 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-10-31 22:06:33,375 INFO L231 Difference]: Finished difference. Result has 60 places, 41 transitions, 147 flow [2024-10-31 22:06:33,376 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=147, PETRI_PLACES=60, PETRI_TRANSITIONS=41} [2024-10-31 22:06:33,377 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 15 predicate places. [2024-10-31 22:06:33,377 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 41 transitions, 147 flow [2024-10-31 22:06:33,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:06:33,378 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:06:33,378 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:06:33,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-31 22:06:33,379 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-31 22:06:33,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:06:33,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1279281527, now seen corresponding path program 4 times [2024-10-31 22:06:33,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:06:33,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997285800] [2024-10-31 22:06:33,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:06:33,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:06:33,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:36,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:06:36,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:06:36,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997285800] [2024-10-31 22:06:36,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997285800] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:06:36,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:06:36,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-31 22:06:36,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996055406] [2024-10-31 22:06:36,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:06:36,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-31 22:06:36,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:06:36,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-31 22:06:36,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-10-31 22:06:36,219 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 39 [2024-10-31 22:06:36,220 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 41 transitions, 147 flow. Second operand has 10 states, 10 states have (on average 15.0) internal successors, (150), 10 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:06:36,220 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:06:36,220 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 39 [2024-10-31 22:06:36,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:06:36,865 INFO L124 PetriNetUnfolderBase]: 587/1119 cut-off events. [2024-10-31 22:06:36,866 INFO L125 PetriNetUnfolderBase]: For 315/320 co-relation queries the response was YES. [2024-10-31 22:06:36,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2575 conditions, 1119 events. 587/1119 cut-off events. For 315/320 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 6055 event pairs, 173 based on Foata normal form. 9/1074 useless extension candidates. Maximal degree in co-relation 2558. Up to 399 conditions per place. [2024-10-31 22:06:36,873 INFO L140 encePairwiseOnDemand]: 30/39 looper letters, 31 selfloop transitions, 7 changer transitions 19/73 dead transitions. [2024-10-31 22:06:36,873 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 73 transitions, 343 flow [2024-10-31 22:06:36,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-31 22:06:36,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-31 22:06:36,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 162 transitions. [2024-10-31 22:06:36,875 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5192307692307693 [2024-10-31 22:06:36,875 INFO L175 Difference]: Start difference. First operand has 60 places, 41 transitions, 147 flow. Second operand 8 states and 162 transitions. [2024-10-31 22:06:36,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 73 transitions, 343 flow [2024-10-31 22:06:36,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 73 transitions, 326 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-10-31 22:06:36,878 INFO L231 Difference]: Finished difference. Result has 61 places, 41 transitions, 158 flow [2024-10-31 22:06:36,879 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=158, PETRI_PLACES=61, PETRI_TRANSITIONS=41} [2024-10-31 22:06:36,879 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 16 predicate places. [2024-10-31 22:06:36,880 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 41 transitions, 158 flow [2024-10-31 22:06:36,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.0) internal successors, (150), 10 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:06:36,880 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:06:36,880 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:06:36,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-31 22:06:36,881 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-31 22:06:36,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:06:36,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1622882531, now seen corresponding path program 5 times [2024-10-31 22:06:36,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:06:36,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605289753] [2024-10-31 22:06:36,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:06:36,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:06:37,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:06:37,069 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 22:06:37,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:06:37,259 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 22:06:37,259 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-31 22:06:37,260 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2024-10-31 22:06:37,262 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2024-10-31 22:06:37,263 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2024-10-31 22:06:37,263 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-10-31 22:06:37,263 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-10-31 22:06:37,264 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2024-10-31 22:06:37,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-31 22:06:37,264 INFO L407 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1] [2024-10-31 22:06:37,369 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-31 22:06:37,370 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-10-31 22:06:37,375 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.10 10:06:37 BasicIcfg [2024-10-31 22:06:37,377 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-31 22:06:37,378 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-31 22:06:37,378 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-31 22:06:37,378 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-31 22:06:37,379 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:06:21" (3/4) ... [2024-10-31 22:06:37,380 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-31 22:06:37,507 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b68c545-415b-4464-908d-b042761e8959/bin/uautomizer-verify-4GaUIPS5ZU/witness.graphml [2024-10-31 22:06:37,510 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-31 22:06:37,510 INFO L158 Benchmark]: Toolchain (without parser) took 18053.36ms. Allocated memory was 159.4MB in the beginning and 478.2MB in the end (delta: 318.8MB). Free memory was 113.8MB in the beginning and 274.5MB in the end (delta: -160.7MB). Peak memory consumption was 159.4MB. Max. memory is 16.1GB. [2024-10-31 22:06:37,511 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 159.4MB. Free memory is still 132.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-31 22:06:37,511 INFO L158 Benchmark]: CACSL2BoogieTranslator took 900.96ms. Allocated memory is still 159.4MB. Free memory was 113.7MB in the beginning and 86.4MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-10-31 22:06:37,511 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.80ms. Allocated memory is still 159.4MB. Free memory was 86.4MB in the beginning and 83.1MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-31 22:06:37,511 INFO L158 Benchmark]: Boogie Preprocessor took 67.12ms. Allocated memory is still 159.4MB. Free memory was 83.1MB in the beginning and 79.1MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-31 22:06:37,512 INFO L158 Benchmark]: RCFGBuilder took 1115.44ms. Allocated memory was 159.4MB in the beginning and 213.9MB in the end (delta: 54.5MB). Free memory was 78.9MB in the beginning and 135.9MB in the end (delta: -56.9MB). Peak memory consumption was 25.4MB. Max. memory is 16.1GB. [2024-10-31 22:06:37,513 INFO L158 Benchmark]: TraceAbstraction took 15767.29ms. Allocated memory was 213.9MB in the beginning and 478.2MB in the end (delta: 264.2MB). Free memory was 134.8MB in the beginning and 287.1MB in the end (delta: -152.3MB). Peak memory consumption was 110.9MB. Max. memory is 16.1GB. [2024-10-31 22:06:37,514 INFO L158 Benchmark]: Witness Printer took 131.75ms. Allocated memory is still 478.2MB. Free memory was 287.1MB in the beginning and 274.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-31 22:06:37,516 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.24ms. Allocated memory is still 159.4MB. Free memory is still 132.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 900.96ms. Allocated memory is still 159.4MB. Free memory was 113.7MB in the beginning and 86.4MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.80ms. Allocated memory is still 159.4MB. Free memory was 86.4MB in the beginning and 83.1MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.12ms. Allocated memory is still 159.4MB. Free memory was 83.1MB in the beginning and 79.1MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1115.44ms. Allocated memory was 159.4MB in the beginning and 213.9MB in the end (delta: 54.5MB). Free memory was 78.9MB in the beginning and 135.9MB in the end (delta: -56.9MB). Peak memory consumption was 25.4MB. Max. memory is 16.1GB. * TraceAbstraction took 15767.29ms. Allocated memory was 213.9MB in the beginning and 478.2MB in the end (delta: 264.2MB). Free memory was 134.8MB in the beginning and 287.1MB in the end (delta: -152.3MB). Peak memory consumption was 110.9MB. Max. memory is 16.1GB. * Witness Printer took 131.75ms. Allocated memory is still 478.2MB. Free memory was 287.1MB in the beginning and 274.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L721] 0 int y = 0; [L722] 0 _Bool y$flush_delayed; [L723] 0 int y$mem_tmp; [L724] 0 _Bool y$r_buff0_thd0; [L725] 0 _Bool y$r_buff0_thd1; [L726] 0 _Bool y$r_buff0_thd2; [L727] 0 _Bool y$r_buff0_thd3; [L728] 0 _Bool y$r_buff1_thd0; [L729] 0 _Bool y$r_buff1_thd1; [L730] 0 _Bool y$r_buff1_thd2; [L731] 0 _Bool y$r_buff1_thd3; [L732] 0 _Bool y$read_delayed; [L733] 0 int *y$read_delayed_var; [L734] 0 int y$w_buff0; [L735] 0 _Bool y$w_buff0_used; [L736] 0 int y$w_buff1; [L737] 0 _Bool y$w_buff1_used; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L833] 0 pthread_t t1687; [L834] FCALL, FORK 0 pthread_create(&t1687, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1687=-1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L835] 0 pthread_t t1688; [L836] FCALL, FORK 0 pthread_create(&t1688, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1687=-1, t1688=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L837] 0 pthread_t t1689; [L838] FCALL, FORK 0 pthread_create(&t1689, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1687=-1, t1688=0, t1689=1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L763] 2 y$w_buff1 = y$w_buff0 [L764] 2 y$w_buff0 = 2 [L765] 2 y$w_buff1_used = y$w_buff0_used [L766] 2 y$w_buff0_used = (_Bool)1 [L767] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L767] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L768] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L769] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L770] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L771] 2 y$r_buff1_thd3 = y$r_buff0_thd3 [L772] 2 y$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L775] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L776] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L777] 2 y$flush_delayed = weak$$choice2 [L778] 2 y$mem_tmp = y [L779] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L780] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L781] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L782] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L783] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L784] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L785] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L786] 2 __unbuffered_p1_EAX = y [L787] 2 y = y$flush_delayed ? y$mem_tmp : y [L788] 2 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L791] 2 __unbuffered_p1_EBX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L808] 3 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L811] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L812] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L813] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L814] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L815] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L743] 1 __unbuffered_p0_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L746] 1 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L749] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L750] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L751] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L752] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L753] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L794] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L795] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L796] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L797] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L798] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L801] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L818] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L840] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1687=-1, t1688=0, t1689=1, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L842] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L842] RET 0 assume_abort_if_not(main$tmp_guard0) [L844] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L845] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L846] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L847] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L848] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1687=-1, t1688=0, t1689=1, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L851] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L852] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L853] 0 y$flush_delayed = weak$$choice2 [L854] 0 y$mem_tmp = y [L855] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L856] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L857] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L858] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L859] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L860] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L861] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L862] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) [L863] 0 y = y$flush_delayed ? y$mem_tmp : y [L864] 0 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1687=-1, t1688=0, t1689=1, weak$$choice0=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L866] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L18] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] - UnprovableResult [Line: 18]: 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: 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: 838]: 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: 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 64 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: 15.5s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 5.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 456 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 438 mSDsluCounter, 197 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 188 mSDsCounter, 69 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 990 IncrementalHoareTripleChecker+Invalid, 1059 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 69 mSolverCounterUnsat, 9 mSDtfsCounter, 990 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 65 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=163occurred in iteration=6, InterpolantAutomatonStates: 46, 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, 1.2s SatisfiabilityAnalysisTime, 8.7s InterpolantComputationTime, 206 NumberOfCodeBlocks, 206 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 169 ConstructedInterpolants, 0 QuantifiedInterpolants, 1335 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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! [2024-10-31 22:06:37,555 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b68c545-415b-4464-908d-b042761e8959/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (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