./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix038_tso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcd4e009-1901-4655-ad24-040d6bf70df5/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcd4e009-1901-4655-ad24-040d6bf70df5/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcd4e009-1901-4655-ad24-040d6bf70df5/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcd4e009-1901-4655-ad24-040d6bf70df5/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix038_tso.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcd4e009-1901-4655-ad24-040d6bf70df5/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcd4e009-1901-4655-ad24-040d6bf70df5/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --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 b1e6ad0aca14cacb1f3fe02bd616009a97ed12a62626693737be4e470d14e12e --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:56:05,613 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:56:05,681 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcd4e009-1901-4655-ad24-040d6bf70df5/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 22:56:05,687 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:56:05,688 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:56:05,715 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:56:05,716 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:56:05,717 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:56:05,718 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:56:05,719 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:56:05,720 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:56:05,720 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:56:05,721 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:56:05,722 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:56:05,722 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:56:05,723 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:56:05,724 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:56:05,724 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:56:05,725 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:56:05,726 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:56:05,726 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:56:05,727 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:56:05,728 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:56:05,729 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:56:05,729 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:56:05,730 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:56:05,731 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:56:05,731 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:56:05,732 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:56:05,733 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:56:05,734 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:56:05,734 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:56:05,735 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:56:05,735 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:56:05,736 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:56:05,736 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:56:05,737 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:56:05,737 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:56:05,738 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:56:05,739 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_bcd4e009-1901-4655-ad24-040d6bf70df5/bin/uautomizer-verify-WvqO1wxjHP/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_bcd4e009-1901-4655-ad24-040d6bf70df5/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> b1e6ad0aca14cacb1f3fe02bd616009a97ed12a62626693737be4e470d14e12e [2023-11-06 22:56:05,971 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:56:06,005 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:56:06,008 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:56:06,010 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:56:06,010 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:56:06,012 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcd4e009-1901-4655-ad24-040d6bf70df5/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/pthread-wmm/mix038_tso.oepc.i [2023-11-06 22:56:09,198 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:56:09,595 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:56:09,597 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcd4e009-1901-4655-ad24-040d6bf70df5/sv-benchmarks/c/pthread-wmm/mix038_tso.oepc.i [2023-11-06 22:56:09,627 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcd4e009-1901-4655-ad24-040d6bf70df5/bin/uautomizer-verify-WvqO1wxjHP/data/7382b23eb/eee0d77e81c94375b2064590a43902bf/FLAG9266d7e5b [2023-11-06 22:56:09,644 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcd4e009-1901-4655-ad24-040d6bf70df5/bin/uautomizer-verify-WvqO1wxjHP/data/7382b23eb/eee0d77e81c94375b2064590a43902bf [2023-11-06 22:56:09,652 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:56:09,656 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:56:09,659 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:56:09,659 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:56:09,665 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:56:09,666 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:56:09" (1/1) ... [2023-11-06 22:56:09,667 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15cac85c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:56:09, skipping insertion in model container [2023-11-06 22:56:09,667 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:56:09" (1/1) ... [2023-11-06 22:56:09,746 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:56:09,959 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcd4e009-1901-4655-ad24-040d6bf70df5/sv-benchmarks/c/pthread-wmm/mix038_tso.oepc.i[949,962] [2023-11-06 22:56:10,275 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:56:10,297 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:56:10,314 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcd4e009-1901-4655-ad24-040d6bf70df5/sv-benchmarks/c/pthread-wmm/mix038_tso.oepc.i[949,962] [2023-11-06 22:56:10,401 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:56:10,452 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:56:10,452 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:56:10,459 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:56:10,460 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:56:10 WrapperNode [2023-11-06 22:56:10,460 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:56:10,462 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:56:10,462 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:56:10,464 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:56:10,473 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:56:10" (1/1) ... [2023-11-06 22:56:10,504 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:56:10" (1/1) ... [2023-11-06 22:56:10,537 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 146 [2023-11-06 22:56:10,545 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:56:10,546 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:56:10,547 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:56:10,547 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:56:10,560 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:56:10" (1/1) ... [2023-11-06 22:56:10,560 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:56:10" (1/1) ... [2023-11-06 22:56:10,564 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:56:10" (1/1) ... [2023-11-06 22:56:10,565 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:56:10" (1/1) ... [2023-11-06 22:56:10,575 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:56:10" (1/1) ... [2023-11-06 22:56:10,577 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:56:10" (1/1) ... [2023-11-06 22:56:10,580 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:56:10" (1/1) ... [2023-11-06 22:56:10,582 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:56:10" (1/1) ... [2023-11-06 22:56:10,587 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:56:10,588 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:56:10,588 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:56:10,588 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:56:10,589 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:56:10" (1/1) ... [2023-11-06 22:56:10,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:56:10,622 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcd4e009-1901-4655-ad24-040d6bf70df5/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:56:10,641 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcd4e009-1901-4655-ad24-040d6bf70df5/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:56:10,671 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcd4e009-1901-4655-ad24-040d6bf70df5/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:56:10,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 22:56:10,680 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-06 22:56:10,680 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:56:10,680 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 22:56:10,681 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:56:10,681 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-06 22:56:10,681 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-06 22:56:10,681 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-06 22:56:10,681 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-06 22:56:10,682 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-06 22:56:10,684 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-06 22:56:10,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:56:10,685 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-06 22:56:10,685 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:56:10,685 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:56:10,687 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-06 22:56:10,896 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:56:10,898 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:56:11,351 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:56:11,540 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:56:11,540 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 22:56:11,542 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:56:11 BoogieIcfgContainer [2023-11-06 22:56:11,543 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:56:11,545 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:56:11,549 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:56:11,553 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:56:11,554 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:56:09" (1/3) ... [2023-11-06 22:56:11,555 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32e707de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:56:11, skipping insertion in model container [2023-11-06 22:56:11,556 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:56:10" (2/3) ... [2023-11-06 22:56:11,557 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32e707de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:56:11, skipping insertion in model container [2023-11-06 22:56:11,559 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:56:11" (3/3) ... [2023-11-06 22:56:11,560 INFO L112 eAbstractionObserver]: Analyzing ICFG mix038_tso.oepc.i [2023-11-06 22:56:11,572 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-06 22:56:11,582 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:56:11,583 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-06 22:56:11,583 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 22:56:11,649 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 22:56:11,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 115 transitions, 242 flow [2023-11-06 22:56:11,774 INFO L124 PetriNetUnfolderBase]: 2/112 cut-off events. [2023-11-06 22:56:11,777 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:56:11,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 112 events. 2/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 60 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2023-11-06 22:56:11,784 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 115 transitions, 242 flow [2023-11-06 22:56:11,791 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 120 places, 112 transitions, 233 flow [2023-11-06 22:56:11,795 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 22:56:11,810 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 120 places, 112 transitions, 233 flow [2023-11-06 22:56:11,815 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 120 places, 112 transitions, 233 flow [2023-11-06 22:56:11,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 112 transitions, 233 flow [2023-11-06 22:56:11,874 INFO L124 PetriNetUnfolderBase]: 2/112 cut-off events. [2023-11-06 22:56:11,874 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:56:11,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 112 events. 2/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 60 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2023-11-06 22:56:11,879 INFO L119 LiptonReduction]: Number of co-enabled transitions 2274 [2023-11-06 22:56:17,608 INFO L134 LiptonReduction]: Checked pairs total: 5518 [2023-11-06 22:56:17,608 INFO L136 LiptonReduction]: Total number of compositions: 100 [2023-11-06 22:56:17,624 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:56:17,631 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@367513e2, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:56:17,632 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-06 22:56:17,636 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 22:56:17,636 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2023-11-06 22:56:17,636 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:56:17,637 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:56:17,637 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-06 22:56:17,638 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:56:17,643 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:56:17,644 INFO L85 PathProgramCache]: Analyzing trace with hash 477904821, now seen corresponding path program 1 times [2023-11-06 22:56:17,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:56:17,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555433614] [2023-11-06 22:56:17,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:56:17,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:56:17,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:56:18,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:56:18,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:56:18,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555433614] [2023-11-06 22:56:18,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555433614] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:56:18,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:56:18,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:56:18,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959780076] [2023-11-06 22:56:18,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:56:18,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:56:18,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:56:18,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:56:18,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:56:18,196 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 215 [2023-11-06 22:56:18,201 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 24 transitions, 57 flow. Second operand has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:18,201 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:56:18,201 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 215 [2023-11-06 22:56:18,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:56:18,662 INFO L124 PetriNetUnfolderBase]: 895/1453 cut-off events. [2023-11-06 22:56:18,663 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2023-11-06 22:56:18,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2836 conditions, 1453 events. 895/1453 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 7414 event pairs, 148 based on Foata normal form. 0/1368 useless extension candidates. Maximal degree in co-relation 2825. Up to 1072 conditions per place. [2023-11-06 22:56:18,685 INFO L140 encePairwiseOnDemand]: 212/215 looper letters, 29 selfloop transitions, 2 changer transitions 2/36 dead transitions. [2023-11-06 22:56:18,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 36 transitions, 150 flow [2023-11-06 22:56:18,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:56:18,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:56:18,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 337 transitions. [2023-11-06 22:56:18,710 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5224806201550387 [2023-11-06 22:56:18,711 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 337 transitions. [2023-11-06 22:56:18,712 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 337 transitions. [2023-11-06 22:56:18,716 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:56:18,718 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 337 transitions. [2023-11-06 22:56:18,726 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:18,731 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 215.0) internal successors, (860), 4 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:18,732 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 215.0) internal successors, (860), 4 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:18,734 INFO L175 Difference]: Start difference. First operand has 34 places, 24 transitions, 57 flow. Second operand 3 states and 337 transitions. [2023-11-06 22:56:18,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 36 transitions, 150 flow [2023-11-06 22:56:18,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 36 transitions, 146 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-06 22:56:18,741 INFO L231 Difference]: Finished difference. Result has 32 places, 22 transitions, 54 flow [2023-11-06 22:56:18,744 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=32, PETRI_TRANSITIONS=22} [2023-11-06 22:56:18,748 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2023-11-06 22:56:18,748 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 22 transitions, 54 flow [2023-11-06 22:56:18,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:18,749 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:56:18,749 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:56:18,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:56:18,750 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:56:18,750 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:56:18,751 INFO L85 PathProgramCache]: Analyzing trace with hash 50455054, now seen corresponding path program 1 times [2023-11-06 22:56:18,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:56:18,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107330011] [2023-11-06 22:56:18,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:56:18,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:56:18,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:56:19,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:56:19,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:56:19,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107330011] [2023-11-06 22:56:19,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107330011] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:56:19,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:56:19,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:56:19,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613795199] [2023-11-06 22:56:19,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:56:19,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:56:19,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:56:19,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:56:19,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:56:19,616 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 215 [2023-11-06 22:56:19,617 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 22 transitions, 54 flow. Second operand has 4 states, 4 states have (on average 94.25) internal successors, (377), 4 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:19,617 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:56:19,617 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 215 [2023-11-06 22:56:19,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:56:19,974 INFO L124 PetriNetUnfolderBase]: 991/1481 cut-off events. [2023-11-06 22:56:19,974 INFO L125 PetriNetUnfolderBase]: For 93/93 co-relation queries the response was YES. [2023-11-06 22:56:19,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3111 conditions, 1481 events. 991/1481 cut-off events. For 93/93 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 6101 event pairs, 335 based on Foata normal form. 40/1520 useless extension candidates. Maximal degree in co-relation 3101. Up to 1037 conditions per place. [2023-11-06 22:56:19,987 INFO L140 encePairwiseOnDemand]: 212/215 looper letters, 28 selfloop transitions, 2 changer transitions 0/31 dead transitions. [2023-11-06 22:56:19,988 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 31 transitions, 134 flow [2023-11-06 22:56:19,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:56:19,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:56:19,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 307 transitions. [2023-11-06 22:56:19,991 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.475968992248062 [2023-11-06 22:56:19,992 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 307 transitions. [2023-11-06 22:56:19,992 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 307 transitions. [2023-11-06 22:56:19,993 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:56:19,993 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 307 transitions. [2023-11-06 22:56:19,998 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:20,002 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 215.0) internal successors, (860), 4 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:20,003 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 215.0) internal successors, (860), 4 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:20,004 INFO L175 Difference]: Start difference. First operand has 32 places, 22 transitions, 54 flow. Second operand 3 states and 307 transitions. [2023-11-06 22:56:20,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 31 transitions, 134 flow [2023-11-06 22:56:20,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 31 transitions, 128 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:56:20,009 INFO L231 Difference]: Finished difference. Result has 32 places, 22 transitions, 58 flow [2023-11-06 22:56:20,010 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=32, PETRI_TRANSITIONS=22} [2023-11-06 22:56:20,011 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2023-11-06 22:56:20,016 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 22 transitions, 58 flow [2023-11-06 22:56:20,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 94.25) internal successors, (377), 4 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:20,017 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:56:20,017 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:56:20,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:56:20,018 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:56:20,019 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:56:20,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1199033080, now seen corresponding path program 1 times [2023-11-06 22:56:20,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:56:20,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367011969] [2023-11-06 22:56:20,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:56:20,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:56:20,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:56:20,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:56:20,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:56:20,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367011969] [2023-11-06 22:56:20,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367011969] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:56:20,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:56:20,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:56:20,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259905766] [2023-11-06 22:56:20,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:56:20,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:56:20,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:56:20,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:56:20,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:56:20,645 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 215 [2023-11-06 22:56:20,646 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 22 transitions, 58 flow. Second operand has 4 states, 4 states have (on average 102.75) internal successors, (411), 4 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:20,647 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:56:20,647 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 215 [2023-11-06 22:56:20,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:56:20,946 INFO L124 PetriNetUnfolderBase]: 793/1257 cut-off events. [2023-11-06 22:56:20,946 INFO L125 PetriNetUnfolderBase]: For 114/114 co-relation queries the response was YES. [2023-11-06 22:56:20,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2686 conditions, 1257 events. 793/1257 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 5566 event pairs, 325 based on Foata normal form. 6/1259 useless extension candidates. Maximal degree in co-relation 2675. Up to 1126 conditions per place. [2023-11-06 22:56:20,957 INFO L140 encePairwiseOnDemand]: 211/215 looper letters, 30 selfloop transitions, 3 changer transitions 0/35 dead transitions. [2023-11-06 22:56:20,958 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 35 transitions, 157 flow [2023-11-06 22:56:20,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:56:20,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:56:20,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 334 transitions. [2023-11-06 22:56:20,960 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.517829457364341 [2023-11-06 22:56:20,960 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 334 transitions. [2023-11-06 22:56:20,961 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 334 transitions. [2023-11-06 22:56:20,961 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:56:20,961 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 334 transitions. [2023-11-06 22:56:20,963 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:20,965 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 215.0) internal successors, (860), 4 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:20,966 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 215.0) internal successors, (860), 4 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:20,966 INFO L175 Difference]: Start difference. First operand has 32 places, 22 transitions, 58 flow. Second operand 3 states and 334 transitions. [2023-11-06 22:56:20,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 35 transitions, 157 flow [2023-11-06 22:56:20,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 35 transitions, 151 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:56:20,968 INFO L231 Difference]: Finished difference. Result has 33 places, 24 transitions, 73 flow [2023-11-06 22:56:20,969 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=73, PETRI_PLACES=33, PETRI_TRANSITIONS=24} [2023-11-06 22:56:20,970 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, -1 predicate places. [2023-11-06 22:56:20,970 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 24 transitions, 73 flow [2023-11-06 22:56:20,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 102.75) internal successors, (411), 4 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:20,971 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:56:20,971 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:56:20,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:56:20,972 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:56:20,972 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:56:20,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1487016193, now seen corresponding path program 1 times [2023-11-06 22:56:20,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:56:20,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901698050] [2023-11-06 22:56:20,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:56:20,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:56:21,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:56:22,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:56:22,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:56:22,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901698050] [2023-11-06 22:56:22,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901698050] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:56:22,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:56:22,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:56:22,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115115754] [2023-11-06 22:56:22,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:56:22,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:56:22,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:56:22,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:56:22,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:56:22,118 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 215 [2023-11-06 22:56:22,119 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 24 transitions, 73 flow. Second operand has 5 states, 5 states have (on average 91.4) internal successors, (457), 5 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:22,119 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:56:22,119 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 215 [2023-11-06 22:56:22,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:56:22,701 INFO L124 PetriNetUnfolderBase]: 1375/2028 cut-off events. [2023-11-06 22:56:22,701 INFO L125 PetriNetUnfolderBase]: For 467/467 co-relation queries the response was YES. [2023-11-06 22:56:22,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4723 conditions, 2028 events. 1375/2028 cut-off events. For 467/467 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 8506 event pairs, 304 based on Foata normal form. 8/2036 useless extension candidates. Maximal degree in co-relation 4711. Up to 1747 conditions per place. [2023-11-06 22:56:22,718 INFO L140 encePairwiseOnDemand]: 204/215 looper letters, 52 selfloop transitions, 22 changer transitions 0/74 dead transitions. [2023-11-06 22:56:22,719 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 74 transitions, 353 flow [2023-11-06 22:56:22,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:56:22,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:56:22,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 608 transitions. [2023-11-06 22:56:22,722 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47131782945736433 [2023-11-06 22:56:22,723 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 608 transitions. [2023-11-06 22:56:22,723 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 608 transitions. [2023-11-06 22:56:22,724 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:56:22,724 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 608 transitions. [2023-11-06 22:56:22,726 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 101.33333333333333) internal successors, (608), 6 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:22,729 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 215.0) internal successors, (1505), 7 states have internal predecessors, (1505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:22,731 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 215.0) internal successors, (1505), 7 states have internal predecessors, (1505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:22,731 INFO L175 Difference]: Start difference. First operand has 33 places, 24 transitions, 73 flow. Second operand 6 states and 608 transitions. [2023-11-06 22:56:22,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 74 transitions, 353 flow [2023-11-06 22:56:22,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 74 transitions, 348 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:56:22,735 INFO L231 Difference]: Finished difference. Result has 41 places, 46 transitions, 238 flow [2023-11-06 22:56:22,735 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=238, PETRI_PLACES=41, PETRI_TRANSITIONS=46} [2023-11-06 22:56:22,737 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 7 predicate places. [2023-11-06 22:56:22,738 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 46 transitions, 238 flow [2023-11-06 22:56:22,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 91.4) internal successors, (457), 5 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:22,739 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:56:22,739 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:56:22,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:56:22,739 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:56:22,740 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:56:22,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1484640973, now seen corresponding path program 2 times [2023-11-06 22:56:22,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:56:22,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606834786] [2023-11-06 22:56:22,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:56:22,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:56:22,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:56:23,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:56:23,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:56:23,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606834786] [2023-11-06 22:56:23,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606834786] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:56:23,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:56:23,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:56:23,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958078191] [2023-11-06 22:56:23,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:56:23,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:56:23,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:56:23,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:56:23,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:56:24,010 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 215 [2023-11-06 22:56:24,011 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 46 transitions, 238 flow. Second operand has 6 states, 6 states have (on average 92.0) internal successors, (552), 6 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:24,011 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:56:24,011 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 215 [2023-11-06 22:56:24,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:56:24,588 INFO L124 PetriNetUnfolderBase]: 1490/2199 cut-off events. [2023-11-06 22:56:24,588 INFO L125 PetriNetUnfolderBase]: For 2495/2495 co-relation queries the response was YES. [2023-11-06 22:56:24,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7116 conditions, 2199 events. 1490/2199 cut-off events. For 2495/2495 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 9482 event pairs, 314 based on Foata normal form. 34/2233 useless extension candidates. Maximal degree in co-relation 7099. Up to 1707 conditions per place. [2023-11-06 22:56:24,609 INFO L140 encePairwiseOnDemand]: 204/215 looper letters, 56 selfloop transitions, 28 changer transitions 0/84 dead transitions. [2023-11-06 22:56:24,609 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 84 transitions, 544 flow [2023-11-06 22:56:24,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:56:24,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:56:24,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 516 transitions. [2023-11-06 22:56:24,612 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48 [2023-11-06 22:56:24,612 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 516 transitions. [2023-11-06 22:56:24,613 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 516 transitions. [2023-11-06 22:56:24,613 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:56:24,613 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 516 transitions. [2023-11-06 22:56:24,615 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 103.2) internal successors, (516), 5 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:24,618 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 215.0) internal successors, (1290), 6 states have internal predecessors, (1290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:24,621 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 215.0) internal successors, (1290), 6 states have internal predecessors, (1290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:24,621 INFO L175 Difference]: Start difference. First operand has 41 places, 46 transitions, 238 flow. Second operand 5 states and 516 transitions. [2023-11-06 22:56:24,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 84 transitions, 544 flow [2023-11-06 22:56:24,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 84 transitions, 538 flow, removed 3 selfloop flow, removed 0 redundant places. [2023-11-06 22:56:24,638 INFO L231 Difference]: Finished difference. Result has 47 places, 56 transitions, 386 flow [2023-11-06 22:56:24,638 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=386, PETRI_PLACES=47, PETRI_TRANSITIONS=56} [2023-11-06 22:56:24,640 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 13 predicate places. [2023-11-06 22:56:24,641 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 56 transitions, 386 flow [2023-11-06 22:56:24,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 92.0) internal successors, (552), 6 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:24,642 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:56:24,642 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:56:24,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:56:24,642 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:56:24,643 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:56:24,643 INFO L85 PathProgramCache]: Analyzing trace with hash 809164454, now seen corresponding path program 1 times [2023-11-06 22:56:24,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:56:24,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230635505] [2023-11-06 22:56:24,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:56:24,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:56:24,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:56:25,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:56:25,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:56:25,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230635505] [2023-11-06 22:56:25,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230635505] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:56:25,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:56:25,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:56:25,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342284114] [2023-11-06 22:56:25,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:56:25,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:56:25,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:56:25,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:56:25,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:56:25,129 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 215 [2023-11-06 22:56:25,130 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 56 transitions, 386 flow. Second operand has 5 states, 5 states have (on average 101.6) internal successors, (508), 5 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:25,131 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:56:25,131 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 215 [2023-11-06 22:56:25,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:56:25,614 INFO L124 PetriNetUnfolderBase]: 1305/1994 cut-off events. [2023-11-06 22:56:25,614 INFO L125 PetriNetUnfolderBase]: For 5106/5203 co-relation queries the response was YES. [2023-11-06 22:56:25,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7900 conditions, 1994 events. 1305/1994 cut-off events. For 5106/5203 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 9130 event pairs, 228 based on Foata normal form. 23/1978 useless extension candidates. Maximal degree in co-relation 7879. Up to 1507 conditions per place. [2023-11-06 22:56:25,638 INFO L140 encePairwiseOnDemand]: 208/215 looper letters, 59 selfloop transitions, 17 changer transitions 0/84 dead transitions. [2023-11-06 22:56:25,639 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 84 transitions, 672 flow [2023-11-06 22:56:25,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:56:25,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:56:25,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 442 transitions. [2023-11-06 22:56:25,641 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.513953488372093 [2023-11-06 22:56:25,642 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 442 transitions. [2023-11-06 22:56:25,642 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 442 transitions. [2023-11-06 22:56:25,642 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:56:25,642 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 442 transitions. [2023-11-06 22:56:25,644 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 110.5) internal successors, (442), 4 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:25,646 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 215.0) internal successors, (1075), 5 states have internal predecessors, (1075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:25,646 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 215.0) internal successors, (1075), 5 states have internal predecessors, (1075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:25,647 INFO L175 Difference]: Start difference. First operand has 47 places, 56 transitions, 386 flow. Second operand 4 states and 442 transitions. [2023-11-06 22:56:25,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 84 transitions, 672 flow [2023-11-06 22:56:25,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 84 transitions, 635 flow, removed 16 selfloop flow, removed 1 redundant places. [2023-11-06 22:56:25,663 INFO L231 Difference]: Finished difference. Result has 51 places, 65 transitions, 498 flow [2023-11-06 22:56:25,663 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=357, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=498, PETRI_PLACES=51, PETRI_TRANSITIONS=65} [2023-11-06 22:56:25,664 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 17 predicate places. [2023-11-06 22:56:25,664 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 65 transitions, 498 flow [2023-11-06 22:56:25,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 101.6) internal successors, (508), 5 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:25,665 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:56:25,665 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:56:25,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 22:56:25,666 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:56:25,666 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:56:25,666 INFO L85 PathProgramCache]: Analyzing trace with hash -682477521, now seen corresponding path program 1 times [2023-11-06 22:56:25,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:56:25,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159200695] [2023-11-06 22:56:25,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:56:25,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:56:25,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:56:26,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:56:26,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:56:26,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159200695] [2023-11-06 22:56:26,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159200695] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:56:26,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:56:26,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:56:26,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669093885] [2023-11-06 22:56:26,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:56:26,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:56:26,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:56:26,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:56:26,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:56:26,129 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 215 [2023-11-06 22:56:26,130 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 65 transitions, 498 flow. Second operand has 6 states, 6 states have (on average 99.33333333333333) internal successors, (596), 6 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:26,130 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:56:26,131 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 215 [2023-11-06 22:56:26,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:56:26,702 INFO L124 PetriNetUnfolderBase]: 1514/2291 cut-off events. [2023-11-06 22:56:26,702 INFO L125 PetriNetUnfolderBase]: For 7007/7087 co-relation queries the response was YES. [2023-11-06 22:56:26,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9448 conditions, 2291 events. 1514/2291 cut-off events. For 7007/7087 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 10624 event pairs, 657 based on Foata normal form. 23/2269 useless extension candidates. Maximal degree in co-relation 9424. Up to 1733 conditions per place. [2023-11-06 22:56:26,729 INFO L140 encePairwiseOnDemand]: 207/215 looper letters, 47 selfloop transitions, 34 changer transitions 0/89 dead transitions. [2023-11-06 22:56:26,730 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 89 transitions, 780 flow [2023-11-06 22:56:26,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:56:26,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:56:26,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 531 transitions. [2023-11-06 22:56:26,733 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.493953488372093 [2023-11-06 22:56:26,733 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 531 transitions. [2023-11-06 22:56:26,733 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 531 transitions. [2023-11-06 22:56:26,734 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:56:26,734 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 531 transitions. [2023-11-06 22:56:26,736 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 106.2) internal successors, (531), 5 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:26,738 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 215.0) internal successors, (1290), 6 states have internal predecessors, (1290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:26,739 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 215.0) internal successors, (1290), 6 states have internal predecessors, (1290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:26,739 INFO L175 Difference]: Start difference. First operand has 51 places, 65 transitions, 498 flow. Second operand 5 states and 531 transitions. [2023-11-06 22:56:26,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 89 transitions, 780 flow [2023-11-06 22:56:26,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 89 transitions, 771 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-11-06 22:56:26,754 INFO L231 Difference]: Finished difference. Result has 56 places, 74 transitions, 679 flow [2023-11-06 22:56:26,754 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=489, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=679, PETRI_PLACES=56, PETRI_TRANSITIONS=74} [2023-11-06 22:56:26,755 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 22 predicate places. [2023-11-06 22:56:26,755 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 74 transitions, 679 flow [2023-11-06 22:56:26,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 99.33333333333333) internal successors, (596), 6 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:26,755 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:56:26,756 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:56:26,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 22:56:26,756 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:56:26,756 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:56:26,756 INFO L85 PathProgramCache]: Analyzing trace with hash -608805711, now seen corresponding path program 2 times [2023-11-06 22:56:26,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:56:26,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495889292] [2023-11-06 22:56:26,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:56:26,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:56:26,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:56:27,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:56:27,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:56:27,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495889292] [2023-11-06 22:56:27,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495889292] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:56:27,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:56:27,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:56:27,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184236368] [2023-11-06 22:56:27,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:56:27,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:56:27,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:56:27,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:56:27,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:56:27,354 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 215 [2023-11-06 22:56:27,355 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 74 transitions, 679 flow. Second operand has 6 states, 6 states have (on average 100.33333333333333) internal successors, (602), 6 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:27,356 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:56:27,356 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 215 [2023-11-06 22:56:27,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:56:28,013 INFO L124 PetriNetUnfolderBase]: 1498/2285 cut-off events. [2023-11-06 22:56:28,014 INFO L125 PetriNetUnfolderBase]: For 10537/10645 co-relation queries the response was YES. [2023-11-06 22:56:28,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10646 conditions, 2285 events. 1498/2285 cut-off events. For 10537/10645 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 10692 event pairs, 241 based on Foata normal form. 35/2287 useless extension candidates. Maximal degree in co-relation 10619. Up to 1550 conditions per place. [2023-11-06 22:56:28,042 INFO L140 encePairwiseOnDemand]: 207/215 looper letters, 62 selfloop transitions, 22 changer transitions 0/92 dead transitions. [2023-11-06 22:56:28,042 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 92 transitions, 907 flow [2023-11-06 22:56:28,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:56:28,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:56:28,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 534 transitions. [2023-11-06 22:56:28,046 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4967441860465116 [2023-11-06 22:56:28,046 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 534 transitions. [2023-11-06 22:56:28,046 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 534 transitions. [2023-11-06 22:56:28,046 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:56:28,047 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 534 transitions. [2023-11-06 22:56:28,048 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 106.8) internal successors, (534), 5 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:28,051 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 215.0) internal successors, (1290), 6 states have internal predecessors, (1290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:28,052 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 215.0) internal successors, (1290), 6 states have internal predecessors, (1290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:28,052 INFO L175 Difference]: Start difference. First operand has 56 places, 74 transitions, 679 flow. Second operand 5 states and 534 transitions. [2023-11-06 22:56:28,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 92 transitions, 907 flow [2023-11-06 22:56:28,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 92 transitions, 888 flow, removed 9 selfloop flow, removed 1 redundant places. [2023-11-06 22:56:28,088 INFO L231 Difference]: Finished difference. Result has 59 places, 73 transitions, 683 flow [2023-11-06 22:56:28,088 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=639, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=683, PETRI_PLACES=59, PETRI_TRANSITIONS=73} [2023-11-06 22:56:28,089 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 25 predicate places. [2023-11-06 22:56:28,089 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 73 transitions, 683 flow [2023-11-06 22:56:28,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 100.33333333333333) internal successors, (602), 6 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:28,090 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:56:28,090 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:56:28,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 22:56:28,090 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:56:28,091 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:56:28,091 INFO L85 PathProgramCache]: Analyzing trace with hash -685741821, now seen corresponding path program 3 times [2023-11-06 22:56:28,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:56:28,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711020800] [2023-11-06 22:56:28,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:56:28,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:56:28,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:56:28,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:56:28,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:56:28,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711020800] [2023-11-06 22:56:28,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711020800] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:56:28,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:56:28,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:56:28,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384426209] [2023-11-06 22:56:28,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:56:28,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:56:28,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:56:28,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:56:28,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:56:28,666 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 215 [2023-11-06 22:56:28,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 73 transitions, 683 flow. Second operand has 6 states, 6 states have (on average 98.33333333333333) internal successors, (590), 6 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:28,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:56:28,668 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 215 [2023-11-06 22:56:28,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:56:29,370 INFO L124 PetriNetUnfolderBase]: 1623/2500 cut-off events. [2023-11-06 22:56:29,371 INFO L125 PetriNetUnfolderBase]: For 12605/12699 co-relation queries the response was YES. [2023-11-06 22:56:29,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11823 conditions, 2500 events. 1623/2500 cut-off events. For 12605/12699 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 12124 event pairs, 266 based on Foata normal form. 78/2535 useless extension candidates. Maximal degree in co-relation 11795. Up to 1495 conditions per place. [2023-11-06 22:56:29,402 INFO L140 encePairwiseOnDemand]: 207/215 looper letters, 64 selfloop transitions, 36 changer transitions 0/108 dead transitions. [2023-11-06 22:56:29,403 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 108 transitions, 1066 flow [2023-11-06 22:56:29,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:56:29,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:56:29,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 538 transitions. [2023-11-06 22:56:29,406 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5004651162790698 [2023-11-06 22:56:29,406 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 538 transitions. [2023-11-06 22:56:29,407 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 538 transitions. [2023-11-06 22:56:29,407 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:56:29,407 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 538 transitions. [2023-11-06 22:56:29,409 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 107.6) internal successors, (538), 5 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:29,411 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 215.0) internal successors, (1290), 6 states have internal predecessors, (1290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:29,412 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 215.0) internal successors, (1290), 6 states have internal predecessors, (1290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:29,412 INFO L175 Difference]: Start difference. First operand has 59 places, 73 transitions, 683 flow. Second operand 5 states and 538 transitions. [2023-11-06 22:56:29,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 108 transitions, 1066 flow [2023-11-06 22:56:29,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 108 transitions, 1004 flow, removed 11 selfloop flow, removed 3 redundant places. [2023-11-06 22:56:29,455 INFO L231 Difference]: Finished difference. Result has 61 places, 79 transitions, 794 flow [2023-11-06 22:56:29,455 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=631, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=794, PETRI_PLACES=61, PETRI_TRANSITIONS=79} [2023-11-06 22:56:29,456 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 27 predicate places. [2023-11-06 22:56:29,456 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 79 transitions, 794 flow [2023-11-06 22:56:29,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 98.33333333333333) internal successors, (590), 6 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:29,457 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:56:29,457 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:56:29,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 22:56:29,458 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:56:29,458 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:56:29,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1201457726, now seen corresponding path program 1 times [2023-11-06 22:56:29,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:56:29,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133949196] [2023-11-06 22:56:29,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:56:29,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:56:29,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:56:29,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:56:29,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:56:29,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133949196] [2023-11-06 22:56:29,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133949196] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:56:29,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:56:29,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:56:29,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178520364] [2023-11-06 22:56:29,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:56:29,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:56:29,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:56:29,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:56:29,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:56:30,043 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 215 [2023-11-06 22:56:30,044 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 79 transitions, 794 flow. Second operand has 5 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:30,044 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:56:30,045 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 215 [2023-11-06 22:56:30,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:56:30,957 INFO L124 PetriNetUnfolderBase]: 2332/3504 cut-off events. [2023-11-06 22:56:30,957 INFO L125 PetriNetUnfolderBase]: For 17822/18034 co-relation queries the response was YES. [2023-11-06 22:56:30,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17089 conditions, 3504 events. 2332/3504 cut-off events. For 17822/18034 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 17544 event pairs, 151 based on Foata normal form. 181/3672 useless extension candidates. Maximal degree in co-relation 17060. Up to 1753 conditions per place. [2023-11-06 22:56:30,983 INFO L140 encePairwiseOnDemand]: 207/215 looper letters, 117 selfloop transitions, 16 changer transitions 30/169 dead transitions. [2023-11-06 22:56:30,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 169 transitions, 1929 flow [2023-11-06 22:56:30,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:56:30,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:56:30,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 598 transitions. [2023-11-06 22:56:30,990 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4635658914728682 [2023-11-06 22:56:30,991 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 598 transitions. [2023-11-06 22:56:30,991 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 598 transitions. [2023-11-06 22:56:30,992 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:56:30,992 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 598 transitions. [2023-11-06 22:56:30,995 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 99.66666666666667) internal successors, (598), 6 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:30,998 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 215.0) internal successors, (1505), 7 states have internal predecessors, (1505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:30,999 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 215.0) internal successors, (1505), 7 states have internal predecessors, (1505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:31,000 INFO L175 Difference]: Start difference. First operand has 61 places, 79 transitions, 794 flow. Second operand 6 states and 598 transitions. [2023-11-06 22:56:31,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 169 transitions, 1929 flow [2023-11-06 22:56:31,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 169 transitions, 1811 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-11-06 22:56:31,050 INFO L231 Difference]: Finished difference. Result has 66 places, 92 transitions, 956 flow [2023-11-06 22:56:31,051 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=734, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=956, PETRI_PLACES=66, PETRI_TRANSITIONS=92} [2023-11-06 22:56:31,052 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 32 predicate places. [2023-11-06 22:56:31,052 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 92 transitions, 956 flow [2023-11-06 22:56:31,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:31,053 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:56:31,053 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:56:31,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 22:56:31,054 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:56:31,054 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:56:31,054 INFO L85 PathProgramCache]: Analyzing trace with hash -98555114, now seen corresponding path program 2 times [2023-11-06 22:56:31,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:56:31,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139083820] [2023-11-06 22:56:31,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:56:31,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:56:31,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:56:31,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:56:31,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:56:31,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139083820] [2023-11-06 22:56:31,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139083820] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:56:31,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:56:31,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:56:31,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524539755] [2023-11-06 22:56:31,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:56:31,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:56:31,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:56:31,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:56:31,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:56:31,259 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 215 [2023-11-06 22:56:31,260 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 92 transitions, 956 flow. Second operand has 4 states, 4 states have (on average 96.25) internal successors, (385), 4 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:31,260 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:56:31,260 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 215 [2023-11-06 22:56:31,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:56:31,946 INFO L124 PetriNetUnfolderBase]: 1449/2359 cut-off events. [2023-11-06 22:56:31,946 INFO L125 PetriNetUnfolderBase]: For 14858/15231 co-relation queries the response was YES. [2023-11-06 22:56:31,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11354 conditions, 2359 events. 1449/2359 cut-off events. For 14858/15231 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 13231 event pairs, 260 based on Foata normal form. 520/2800 useless extension candidates. Maximal degree in co-relation 11322. Up to 1174 conditions per place. [2023-11-06 22:56:31,969 INFO L140 encePairwiseOnDemand]: 209/215 looper letters, 132 selfloop transitions, 7 changer transitions 31/184 dead transitions. [2023-11-06 22:56:31,970 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 184 transitions, 2171 flow [2023-11-06 22:56:31,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:56:31,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:56:31,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 521 transitions. [2023-11-06 22:56:31,973 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4846511627906977 [2023-11-06 22:56:31,974 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 521 transitions. [2023-11-06 22:56:31,974 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 521 transitions. [2023-11-06 22:56:31,974 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:56:31,975 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 521 transitions. [2023-11-06 22:56:31,977 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 104.2) internal successors, (521), 5 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:31,980 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 215.0) internal successors, (1290), 6 states have internal predecessors, (1290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:31,980 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 215.0) internal successors, (1290), 6 states have internal predecessors, (1290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:31,981 INFO L175 Difference]: Start difference. First operand has 66 places, 92 transitions, 956 flow. Second operand 5 states and 521 transitions. [2023-11-06 22:56:31,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 184 transitions, 2171 flow [2023-11-06 22:56:32,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 184 transitions, 2159 flow, removed 6 selfloop flow, removed 0 redundant places. [2023-11-06 22:56:32,007 INFO L231 Difference]: Finished difference. Result has 73 places, 85 transitions, 889 flow [2023-11-06 22:56:32,007 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=828, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=889, PETRI_PLACES=73, PETRI_TRANSITIONS=85} [2023-11-06 22:56:32,008 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 39 predicate places. [2023-11-06 22:56:32,008 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 85 transitions, 889 flow [2023-11-06 22:56:32,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 96.25) internal successors, (385), 4 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:32,009 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:56:32,009 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:56:32,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 22:56:32,010 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:56:32,010 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:56:32,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1638811620, now seen corresponding path program 1 times [2023-11-06 22:56:32,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:56:32,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271758928] [2023-11-06 22:56:32,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:56:32,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:56:32,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:56:32,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:56:32,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:56:32,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271758928] [2023-11-06 22:56:32,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271758928] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:56:32,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:56:32,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:56:32,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353234852] [2023-11-06 22:56:32,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:56:32,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:56:32,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:56:32,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:56:32,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:56:32,260 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 215 [2023-11-06 22:56:32,261 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 85 transitions, 889 flow. Second operand has 5 states, 5 states have (on average 95.8) internal successors, (479), 5 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:32,261 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:56:32,261 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 215 [2023-11-06 22:56:32,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:56:32,854 INFO L124 PetriNetUnfolderBase]: 1064/1796 cut-off events. [2023-11-06 22:56:32,855 INFO L125 PetriNetUnfolderBase]: For 12165/12501 co-relation queries the response was YES. [2023-11-06 22:56:32,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9358 conditions, 1796 events. 1064/1796 cut-off events. For 12165/12501 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 9949 event pairs, 95 based on Foata normal form. 346/2096 useless extension candidates. Maximal degree in co-relation 9321. Up to 667 conditions per place. [2023-11-06 22:56:32,870 INFO L140 encePairwiseOnDemand]: 209/215 looper letters, 137 selfloop transitions, 13 changer transitions 39/203 dead transitions. [2023-11-06 22:56:32,871 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 203 transitions, 2383 flow [2023-11-06 22:56:32,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:56:32,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 22:56:32,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 729 transitions. [2023-11-06 22:56:32,875 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48438538205980064 [2023-11-06 22:56:32,875 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 729 transitions. [2023-11-06 22:56:32,875 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 729 transitions. [2023-11-06 22:56:32,876 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:56:32,876 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 729 transitions. [2023-11-06 22:56:32,878 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 104.14285714285714) internal successors, (729), 7 states have internal predecessors, (729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:32,882 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 215.0) internal successors, (1720), 8 states have internal predecessors, (1720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:32,882 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 215.0) internal successors, (1720), 8 states have internal predecessors, (1720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:32,883 INFO L175 Difference]: Start difference. First operand has 73 places, 85 transitions, 889 flow. Second operand 7 states and 729 transitions. [2023-11-06 22:56:32,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 203 transitions, 2383 flow [2023-11-06 22:56:32,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 203 transitions, 2370 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:56:32,911 INFO L231 Difference]: Finished difference. Result has 80 places, 88 transitions, 929 flow [2023-11-06 22:56:32,911 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=837, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=929, PETRI_PLACES=80, PETRI_TRANSITIONS=88} [2023-11-06 22:56:32,912 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 46 predicate places. [2023-11-06 22:56:32,913 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 88 transitions, 929 flow [2023-11-06 22:56:32,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 95.8) internal successors, (479), 5 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:32,913 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:56:32,913 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:56:32,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-06 22:56:32,914 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:56:32,914 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:56:32,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1634334534, now seen corresponding path program 1 times [2023-11-06 22:56:32,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:56:32,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245790929] [2023-11-06 22:56:32,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:56:32,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:56:32,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:56:33,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:56:33,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:56:33,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245790929] [2023-11-06 22:56:33,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245790929] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:56:33,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:56:33,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:56:33,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492188899] [2023-11-06 22:56:33,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:56:33,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:56:33,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:56:33,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:56:33,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:56:33,201 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 215 [2023-11-06 22:56:33,202 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 88 transitions, 929 flow. Second operand has 6 states, 6 states have (on average 95.66666666666667) internal successors, (574), 6 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:33,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:56:33,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 215 [2023-11-06 22:56:33,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:56:33,710 INFO L124 PetriNetUnfolderBase]: 990/1668 cut-off events. [2023-11-06 22:56:33,710 INFO L125 PetriNetUnfolderBase]: For 10929/11194 co-relation queries the response was YES. [2023-11-06 22:56:33,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9154 conditions, 1668 events. 990/1668 cut-off events. For 10929/11194 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 9254 event pairs, 85 based on Foata normal form. 219/1844 useless extension candidates. Maximal degree in co-relation 9114. Up to 631 conditions per place. [2023-11-06 22:56:33,723 INFO L140 encePairwiseOnDemand]: 209/215 looper letters, 65 selfloop transitions, 11 changer transitions 117/202 dead transitions. [2023-11-06 22:56:33,723 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 202 transitions, 2416 flow [2023-11-06 22:56:33,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:56:33,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-06 22:56:33,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 915 transitions. [2023-11-06 22:56:33,728 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4728682170542636 [2023-11-06 22:56:33,728 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 915 transitions. [2023-11-06 22:56:33,728 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 915 transitions. [2023-11-06 22:56:33,729 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:56:33,729 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 915 transitions. [2023-11-06 22:56:33,732 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 101.66666666666667) internal successors, (915), 9 states have internal predecessors, (915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:33,736 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 215.0) internal successors, (2150), 10 states have internal predecessors, (2150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:33,737 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 215.0) internal successors, (2150), 10 states have internal predecessors, (2150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:33,737 INFO L175 Difference]: Start difference. First operand has 80 places, 88 transitions, 929 flow. Second operand 9 states and 915 transitions. [2023-11-06 22:56:33,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 202 transitions, 2416 flow [2023-11-06 22:56:33,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 202 transitions, 2240 flow, removed 28 selfloop flow, removed 5 redundant places. [2023-11-06 22:56:33,779 INFO L231 Difference]: Finished difference. Result has 86 places, 56 transitions, 518 flow [2023-11-06 22:56:33,780 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=810, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=518, PETRI_PLACES=86, PETRI_TRANSITIONS=56} [2023-11-06 22:56:33,781 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 52 predicate places. [2023-11-06 22:56:33,781 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 56 transitions, 518 flow [2023-11-06 22:56:33,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 95.66666666666667) internal successors, (574), 6 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:33,782 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:56:33,782 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:56:33,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-06 22:56:33,782 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:56:33,783 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:56:33,783 INFO L85 PathProgramCache]: Analyzing trace with hash -946954364, now seen corresponding path program 1 times [2023-11-06 22:56:33,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:56:33,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851157174] [2023-11-06 22:56:33,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:56:33,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:56:33,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:56:34,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:56:34,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:56:34,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851157174] [2023-11-06 22:56:34,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851157174] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:56:34,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:56:34,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:56:34,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894022590] [2023-11-06 22:56:34,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:56:34,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:56:34,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:56:34,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:56:34,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:56:34,013 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 215 [2023-11-06 22:56:34,014 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 56 transitions, 518 flow. Second operand has 4 states, 4 states have (on average 103.0) internal successors, (412), 4 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:34,014 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:56:34,014 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 215 [2023-11-06 22:56:34,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:56:34,248 INFO L124 PetriNetUnfolderBase]: 481/859 cut-off events. [2023-11-06 22:56:34,248 INFO L125 PetriNetUnfolderBase]: For 3952/3976 co-relation queries the response was YES. [2023-11-06 22:56:34,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4430 conditions, 859 events. 481/859 cut-off events. For 3952/3976 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3976 event pairs, 93 based on Foata normal form. 16/867 useless extension candidates. Maximal degree in co-relation 4399. Up to 501 conditions per place. [2023-11-06 22:56:34,253 INFO L140 encePairwiseOnDemand]: 212/215 looper letters, 41 selfloop transitions, 1 changer transitions 57/102 dead transitions. [2023-11-06 22:56:34,253 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 102 transitions, 1116 flow [2023-11-06 22:56:34,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:56:34,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:56:34,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 435 transitions. [2023-11-06 22:56:34,256 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5058139534883721 [2023-11-06 22:56:34,256 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 435 transitions. [2023-11-06 22:56:34,256 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 435 transitions. [2023-11-06 22:56:34,257 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:56:34,257 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 435 transitions. [2023-11-06 22:56:34,258 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 108.75) internal successors, (435), 4 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:34,260 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 215.0) internal successors, (1075), 5 states have internal predecessors, (1075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:34,261 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 215.0) internal successors, (1075), 5 states have internal predecessors, (1075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:34,261 INFO L175 Difference]: Start difference. First operand has 86 places, 56 transitions, 518 flow. Second operand 4 states and 435 transitions. [2023-11-06 22:56:34,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 102 transitions, 1116 flow [2023-11-06 22:56:34,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 102 transitions, 943 flow, removed 44 selfloop flow, removed 18 redundant places. [2023-11-06 22:56:34,275 INFO L231 Difference]: Finished difference. Result has 65 places, 37 transitions, 256 flow [2023-11-06 22:56:34,275 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=426, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=256, PETRI_PLACES=65, PETRI_TRANSITIONS=37} [2023-11-06 22:56:34,276 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 31 predicate places. [2023-11-06 22:56:34,276 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 37 transitions, 256 flow [2023-11-06 22:56:34,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 103.0) internal successors, (412), 4 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:34,276 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:56:34,277 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:56:34,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-06 22:56:34,277 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:56:34,277 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:56:34,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1880478968, now seen corresponding path program 2 times [2023-11-06 22:56:34,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:56:34,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089972567] [2023-11-06 22:56:34,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:56:34,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:56:34,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:56:34,334 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:56:34,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:56:34,410 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:56:34,410 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 22:56:34,411 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-11-06 22:56:34,413 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-11-06 22:56:34,413 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-11-06 22:56:34,413 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-11-06 22:56:34,414 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-11-06 22:56:34,414 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-11-06 22:56:34,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-06 22:56:34,414 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-11-06 22:56:34,421 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-06 22:56:34,421 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:56:34,489 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:56:34 BasicIcfg [2023-11-06 22:56:34,489 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:56:34,490 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:56:34,490 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:56:34,490 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:56:34,491 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:56:11" (3/4) ... [2023-11-06 22:56:34,491 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-06 22:56:34,607 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcd4e009-1901-4655-ad24-040d6bf70df5/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.graphml [2023-11-06 22:56:34,607 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:56:34,608 INFO L158 Benchmark]: Toolchain (without parser) took 24952.37ms. Allocated memory was 182.5MB in the beginning and 518.0MB in the end (delta: 335.5MB). Free memory was 147.2MB in the beginning and 377.1MB in the end (delta: -229.8MB). Peak memory consumption was 107.0MB. Max. memory is 16.1GB. [2023-11-06 22:56:34,608 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 113.2MB. Free memory is still 62.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:56:34,608 INFO L158 Benchmark]: CACSL2BoogieTranslator took 801.73ms. Allocated memory is still 182.5MB. Free memory was 146.9MB in the beginning and 123.4MB in the end (delta: 23.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-06 22:56:34,609 INFO L158 Benchmark]: Boogie Procedure Inliner took 84.16ms. Allocated memory is still 182.5MB. Free memory was 123.4MB in the beginning and 120.6MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 22:56:34,609 INFO L158 Benchmark]: Boogie Preprocessor took 40.83ms. Allocated memory is still 182.5MB. Free memory was 120.6MB in the beginning and 118.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:56:34,610 INFO L158 Benchmark]: RCFGBuilder took 954.91ms. Allocated memory is still 182.5MB. Free memory was 118.5MB in the beginning and 133.3MB in the end (delta: -14.8MB). Peak memory consumption was 22.6MB. Max. memory is 16.1GB. [2023-11-06 22:56:34,610 INFO L158 Benchmark]: TraceAbstraction took 22943.95ms. Allocated memory was 182.5MB in the beginning and 518.0MB in the end (delta: 335.5MB). Free memory was 132.3MB in the beginning and 386.5MB in the end (delta: -254.2MB). Peak memory consumption was 82.4MB. Max. memory is 16.1GB. [2023-11-06 22:56:34,611 INFO L158 Benchmark]: Witness Printer took 117.46ms. Allocated memory is still 518.0MB. Free memory was 386.5MB in the beginning and 377.1MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-11-06 22:56:34,615 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.31ms. Allocated memory is still 113.2MB. Free memory is still 62.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 801.73ms. Allocated memory is still 182.5MB. Free memory was 146.9MB in the beginning and 123.4MB in the end (delta: 23.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 84.16ms. Allocated memory is still 182.5MB. Free memory was 123.4MB in the beginning and 120.6MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.83ms. Allocated memory is still 182.5MB. Free memory was 120.6MB in the beginning and 118.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 954.91ms. Allocated memory is still 182.5MB. Free memory was 118.5MB in the beginning and 133.3MB in the end (delta: -14.8MB). Peak memory consumption was 22.6MB. Max. memory is 16.1GB. * TraceAbstraction took 22943.95ms. Allocated memory was 182.5MB in the beginning and 518.0MB in the end (delta: 335.5MB). Free memory was 132.3MB in the beginning and 386.5MB in the end (delta: -254.2MB). Peak memory consumption was 82.4MB. Max. memory is 16.1GB. * Witness Printer took 117.46ms. Allocated memory is still 518.0MB. Free memory was 386.5MB in the beginning and 377.1MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.8s, 120 PlacesBefore, 34 PlacesAfterwards, 112 TransitionsBefore, 24 TransitionsAfterwards, 2274 CoEnabledTransitionPairs, 6 FixpointIterations, 39 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 2 ChoiceCompositions, 100 TotalNumberOfCompositions, 5518 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2537, independent: 2365, independent conditional: 0, independent unconditional: 2365, dependent: 172, dependent conditional: 0, dependent unconditional: 172, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1254, independent: 1214, independent conditional: 0, independent unconditional: 1214, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2537, independent: 1151, independent conditional: 0, independent unconditional: 1151, dependent: 132, dependent conditional: 0, dependent unconditional: 132, unknown: 1254, unknown conditional: 0, unknown unconditional: 1254] , Statistics on independence cache: Total cache size (in pairs): 85, Positive cache size: 72, Positive conditional cache size: 0, Positive unconditional cache size: 72, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - 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_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L717] 0 int a = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L722] 0 _Bool x$flush_delayed; [L723] 0 int x$mem_tmp; [L724] 0 _Bool x$r_buff0_thd0; [L725] 0 _Bool x$r_buff0_thd1; [L726] 0 _Bool x$r_buff0_thd2; [L727] 0 _Bool x$r_buff0_thd3; [L728] 0 _Bool x$r_buff1_thd0; [L729] 0 _Bool x$r_buff1_thd1; [L730] 0 _Bool x$r_buff1_thd2; [L731] 0 _Bool x$r_buff1_thd3; [L732] 0 _Bool x$read_delayed; [L733] 0 int *x$read_delayed_var; [L734] 0 int x$w_buff0; [L735] 0 _Bool x$w_buff0_used; [L736] 0 int x$w_buff1; [L737] 0 _Bool x$w_buff1_used; [L739] 0 int y = 0; [L741] 0 int z = 0; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L830] 0 pthread_t t1019; [L831] FCALL, FORK 0 pthread_create(&t1019, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1019, ((void *)0), P0, ((void *)0))=-1, t1019={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L832] 0 pthread_t t1020; [L833] FCALL, FORK 0 pthread_create(&t1020, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1020, ((void *)0), P1, ((void *)0))=0, t1019={5:0}, t1020={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L834] 0 pthread_t t1021; [L767] 2 x$w_buff1 = x$w_buff0 [L768] 2 x$w_buff0 = 2 [L769] 2 x$w_buff1_used = x$w_buff0_used [L770] 2 x$w_buff0_used = (_Bool)1 [L771] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L771] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L772] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L773] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L774] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L775] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L776] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L835] FCALL, FORK 0 pthread_create(&t1021, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1021, ((void *)0), P2, ((void *)0))=1, t1019={5:0}, t1020={6:0}, t1021={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L779] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L796] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L799] 3 z = 1 [L802] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L805] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L747] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L750] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L753] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L754] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L755] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L756] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L757] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 1 return 0; [L782] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L783] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L784] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L785] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L786] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L789] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L791] 2 return 0; [L808] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L809] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L810] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L811] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L812] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L817] 3 return 0; [L837] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L839] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L839] RET 0 assume_abort_if_not(main$tmp_guard0) [L841] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L842] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L843] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L844] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L845] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1019={5:0}, t1020={6:0}, t1021={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L848] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L849] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L850] 0 x$flush_delayed = weak$$choice2 [L851] 0 x$mem_tmp = x [L852] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L853] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L854] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L855] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L856] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L857] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L858] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L859] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L860] 0 x = x$flush_delayed ? x$mem_tmp : x [L861] 0 x$flush_delayed = (_Bool)0 [L863] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] - 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: 835]: 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: 831]: 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: 833]: 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, 144 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: 22.7s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 9.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 622 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 484 mSDsluCounter, 252 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 144 mSDsCounter, 141 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1331 IncrementalHoareTripleChecker+Invalid, 1472 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 141 mSolverCounterUnsat, 108 mSDtfsCounter, 1331 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 65 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=956occurred in iteration=10, InterpolantAutomatonStates: 70, 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.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.9s InterpolantComputationTime, 209 NumberOfCodeBlocks, 209 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 173 ConstructedInterpolants, 0 QuantifiedInterpolants, 2124 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-11-06 22:56:34,655 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcd4e009-1901-4655-ad24-040d6bf70df5/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE