./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix021.opt.i --full-output --architecture 32bit
--------------------------------------------------------------------------------
Checking for ERROR reachability
Using default analysis
Version d790fecc
Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c930dc56-aece-4316-8ce1-2182e0c38a6f/bin/uautomizer-verify-84ZbGMXZE1/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c930dc56-aece-4316-8ce1-2182e0c38a6f/bin/uautomizer-verify-84ZbGMXZE1/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c930dc56-aece-4316-8ce1-2182e0c38a6f/bin/uautomizer-verify-84ZbGMXZE1/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c930dc56-aece-4316-8ce1-2182e0c38a6f/bin/uautomizer-verify-84ZbGMXZE1/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix021.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c930dc56-aece-4316-8ce1-2182e0c38a6f/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c930dc56-aece-4316-8ce1-2182e0c38a6f/bin/uautomizer-verify-84ZbGMXZE1 --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) )
--witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 576d0750cd121d18ae295ddde1dd1649436f79f5ff3834655e4b6c15fd1260db
--- Real Ultimate output ---
This is Ultimate 0.3.0-dev-d790fec
[2024-12-02 07:33:51,333 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-12-02 07:33:51,384 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c930dc56-aece-4316-8ce1-2182e0c38a6f/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-12-02 07:33:51,389 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-12-02 07:33:51,389 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-12-02 07:33:51,408 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-12-02 07:33:51,408 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-12-02 07:33:51,409 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-12-02 07:33:51,409 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-12-02 07:33:51,409 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-12-02 07:33:51,409 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-12-02 07:33:51,409 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-12-02 07:33:51,409 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-12-02 07:33:51,410 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-12-02 07:33:51,410 INFO L153 SettingsManager]: * Use SBE=true
[2024-12-02 07:33:51,410 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-12-02 07:33:51,410 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-12-02 07:33:51,410 INFO L153 SettingsManager]: * sizeof long=4
[2024-12-02 07:33:51,410 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-12-02 07:33:51,410 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-12-02 07:33:51,410 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-12-02 07:33:51,410 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-12-02 07:33:51,410 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-12-02 07:33:51,410 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-12-02 07:33:51,411 INFO L153 SettingsManager]: * sizeof long double=12
[2024-12-02 07:33:51,411 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-12-02 07:33:51,411 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2024-12-02 07:33:51,411 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-12-02 07:33:51,411 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2024-12-02 07:33:51,411 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-12-02 07:33:51,411 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-12-02 07:33:51,411 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-12-02 07:33:51,411 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-12-02 07:33:51,411 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-12-02 07:33:51,411 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-12-02 07:33:51,411 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-12-02 07:33:51,411 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-12-02 07:33:51,412 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-12-02 07:33:51,412 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-12-02 07:33:51,412 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-12-02 07:33:51,412 INFO L153 SettingsManager]: * Compute procedure contracts=false
[2024-12-02 07:33:51,412 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-12-02 07:33:51,412 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-12-02 07:33:51,412 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-12-02 07:33:51,412 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-12-02 07:33:51,412 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-12-02 07:33:51,412 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-12-02 07:33:51,412 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-12-02 07:33:51,412 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC
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_c930dc56-aece-4316-8ce1-2182e0c38a6f/bin/uautomizer-verify-84ZbGMXZE1
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) )
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 576d0750cd121d18ae295ddde1dd1649436f79f5ff3834655e4b6c15fd1260db
[2024-12-02 07:33:51,640 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-12-02 07:33:51,648 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-12-02 07:33:51,650 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-12-02 07:33:51,651 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-12-02 07:33:51,652 INFO L274 PluginConnector]: CDTParser initialized
[2024-12-02 07:33:51,653 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c930dc56-aece-4316-8ce1-2182e0c38a6f/bin/uautomizer-verify-84ZbGMXZE1/../../sv-benchmarks/c/pthread-wmm/mix021.opt.i
[2024-12-02 07:33:54,277 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c930dc56-aece-4316-8ce1-2182e0c38a6f/bin/uautomizer-verify-84ZbGMXZE1/data/3d1513812/53c3149819424a9282555f1db0507431/FLAGaafff1366
[2024-12-02 07:33:54,516 INFO L384 CDTParser]: Found 1 translation units.
[2024-12-02 07:33:54,516 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c930dc56-aece-4316-8ce1-2182e0c38a6f/sv-benchmarks/c/pthread-wmm/mix021.opt.i
[2024-12-02 07:33:54,527 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c930dc56-aece-4316-8ce1-2182e0c38a6f/bin/uautomizer-verify-84ZbGMXZE1/data/3d1513812/53c3149819424a9282555f1db0507431/FLAGaafff1366
[2024-12-02 07:33:54,540 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c930dc56-aece-4316-8ce1-2182e0c38a6f/bin/uautomizer-verify-84ZbGMXZE1/data/3d1513812/53c3149819424a9282555f1db0507431
[2024-12-02 07:33:54,542 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-12-02 07:33:54,543 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-12-02 07:33:54,544 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-12-02 07:33:54,544 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-12-02 07:33:54,547 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-12-02 07:33:54,548 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 07:33:54" (1/1) ...
[2024-12-02 07:33:54,548 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29cfd9ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:33:54, skipping insertion in model container
[2024-12-02 07:33:54,549 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 07:33:54" (1/1) ...
[2024-12-02 07:33:54,575 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-12-02 07:33:54,723 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c930dc56-aece-4316-8ce1-2182e0c38a6f/sv-benchmarks/c/pthread-wmm/mix021.opt.i[944,957]
[2024-12-02 07:33:54,902 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-12-02 07:33:54,912 INFO L200 MainTranslator]: Completed pre-run
[2024-12-02 07:33:54,921 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c930dc56-aece-4316-8ce1-2182e0c38a6f/sv-benchmarks/c/pthread-wmm/mix021.opt.i[944,957]
[2024-12-02 07:33:54,966 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-12-02 07:33:54,998 INFO L204 MainTranslator]: Completed translation
[2024-12-02 07:33:54,998 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:33:54 WrapperNode
[2024-12-02 07:33:54,998 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-12-02 07:33:54,999 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-12-02 07:33:54,999 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-12-02 07:33:54,999 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-12-02 07:33:55,004 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:33:54" (1/1) ...
[2024-12-02 07:33:55,014 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:33:54" (1/1) ...
[2024-12-02 07:33:55,031 INFO L138 Inliner]: procedures = 176, calls = 53, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 149
[2024-12-02 07:33:55,032 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-12-02 07:33:55,032 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-12-02 07:33:55,032 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-12-02 07:33:55,032 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-12-02 07:33:55,038 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:33:54" (1/1) ...
[2024-12-02 07:33:55,038 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:33:54" (1/1) ...
[2024-12-02 07:33:55,041 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:33:54" (1/1) ...
[2024-12-02 07:33:55,053 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2024-12-02 07:33:55,054 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:33:54" (1/1) ...
[2024-12-02 07:33:55,054 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:33:54" (1/1) ...
[2024-12-02 07:33:55,061 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:33:54" (1/1) ...
[2024-12-02 07:33:55,061 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:33:54" (1/1) ...
[2024-12-02 07:33:55,063 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:33:54" (1/1) ...
[2024-12-02 07:33:55,065 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:33:54" (1/1) ...
[2024-12-02 07:33:55,066 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:33:54" (1/1) ...
[2024-12-02 07:33:55,069 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-12-02 07:33:55,070 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-12-02 07:33:55,070 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-12-02 07:33:55,070 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-12-02 07:33:55,071 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:33:54" (1/1) ...
[2024-12-02 07:33:55,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-12-02 07:33:55,088 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c930dc56-aece-4316-8ce1-2182e0c38a6f/bin/uautomizer-verify-84ZbGMXZE1/z3
[2024-12-02 07:33:55,100 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c930dc56-aece-4316-8ce1-2182e0c38a6f/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-12-02 07:33:55,102 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c930dc56-aece-4316-8ce1-2182e0c38a6f/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-12-02 07:33:55,121 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-12-02 07:33:55,121 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-12-02 07:33:55,121 INFO L130 BoogieDeclarations]: Found specification of procedure P0
[2024-12-02 07:33:55,121 INFO L138 BoogieDeclarations]: Found implementation of procedure P0
[2024-12-02 07:33:55,121 INFO L130 BoogieDeclarations]: Found specification of procedure P1
[2024-12-02 07:33:55,122 INFO L138 BoogieDeclarations]: Found implementation of procedure P1
[2024-12-02 07:33:55,122 INFO L130 BoogieDeclarations]: Found specification of procedure P2
[2024-12-02 07:33:55,122 INFO L138 BoogieDeclarations]: Found implementation of procedure P2
[2024-12-02 07:33:55,122 INFO L130 BoogieDeclarations]: Found specification of procedure P3
[2024-12-02 07:33:55,122 INFO L138 BoogieDeclarations]: Found implementation of procedure P3
[2024-12-02 07:33:55,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-12-02 07:33:55,122 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-12-02 07:33:55,122 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-12-02 07:33:55,122 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-12-02 07:33:55,123 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement.
[2024-12-02 07:33:55,239 INFO L234 CfgBuilder]: Building ICFG
[2024-12-02 07:33:55,241 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-12-02 07:33:55,527 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program.
[2024-12-02 07:33:55,527 INFO L283 CfgBuilder]: Performing block encoding
[2024-12-02 07:33:55,693 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-12-02 07:33:55,694 INFO L312 CfgBuilder]: Removed 0 assume(true) statements.
[2024-12-02 07:33:55,694 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:33:55 BoogieIcfgContainer
[2024-12-02 07:33:55,694 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-12-02 07:33:55,696 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-12-02 07:33:55,696 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-12-02 07:33:55,699 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-12-02 07:33:55,699 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 07:33:54" (1/3) ...
[2024-12-02 07:33:55,700 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b6da9f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 07:33:55, skipping insertion in model container
[2024-12-02 07:33:55,700 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:33:54" (2/3) ...
[2024-12-02 07:33:55,700 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b6da9f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 07:33:55, skipping insertion in model container
[2024-12-02 07:33:55,700 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:33:55" (3/3) ...
[2024-12-02 07:33:55,701 INFO L128 eAbstractionObserver]: Analyzing ICFG mix021.opt.i
[2024-12-02 07:33:55,712 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-12-02 07:33:55,713 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix021.opt.i that has 5 procedures, 49 locations, 1 initial locations, 0 loop locations, and 2 error locations.
[2024-12-02 07:33:55,714 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-12-02 07:33:55,766 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-12-02 07:33:55,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 49 transitions, 114 flow
[2024-12-02 07:33:55,824 INFO L124 PetriNetUnfolderBase]: 1/45 cut-off events.
[2024-12-02 07:33:55,825 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-12-02 07:33:55,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58 conditions, 45 events. 1/45 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 91 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 49. Up to 2 conditions per place.
[2024-12-02 07:33:55,829 INFO L82 GeneralOperation]: Start removeDead. Operand has 61 places, 49 transitions, 114 flow
[2024-12-02 07:33:55,831 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 57 places, 45 transitions, 102 flow
[2024-12-02 07:33:55,837 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-12-02 07:33:55,847 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@d72a33f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-12-02 07:33:55,848 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations.
[2024-12-02 07:33:55,857 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-12-02 07:33:55,857 INFO L124 PetriNetUnfolderBase]: 0/26 cut-off events.
[2024-12-02 07:33:55,857 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-12-02 07:33:55,857 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-12-02 07:33:55,857 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-12-02 07:33:55,858 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2024-12-02 07:33:55,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-12-02 07:33:55,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1251635780, now seen corresponding path program 1 times
[2024-12-02 07:33:55,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-12-02 07:33:55,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074620224]
[2024-12-02 07:33:55,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-12-02 07:33:55,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-12-02 07:33:55,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-12-02 07:33:56,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-12-02 07:33:56,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-12-02 07:33:56,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074620224]
[2024-12-02 07:33:56,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074620224] provided 1 perfect and 0 imperfect interpolant sequences
[2024-12-02 07:33:56,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-12-02 07:33:56,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-12-02 07:33:56,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54052097]
[2024-12-02 07:33:56,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-12-02 07:33:56,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-12-02 07:33:56,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-12-02 07:33:56,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-12-02 07:33:56,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-12-02 07:33:56,290 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 49
[2024-12-02 07:33:56,292 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 45 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-12-02 07:33:56,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-12-02 07:33:56,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 49
[2024-12-02 07:33:56,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-12-02 07:33:56,763 INFO L124 PetriNetUnfolderBase]: 879/1523 cut-off events.
[2024-12-02 07:33:56,763 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-12-02 07:33:56,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2843 conditions, 1523 events. 879/1523 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 10412 event pairs, 159 based on Foata normal form. 60/1543 useless extension candidates. Maximal degree in co-relation 2831. Up to 1009 conditions per place.
[2024-12-02 07:33:56,780 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 26 selfloop transitions, 2 changer transitions 2/52 dead transitions.
[2024-12-02 07:33:56,780 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 52 transitions, 176 flow
[2024-12-02 07:33:56,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-12-02 07:33:56,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-12-02 07:33:56,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions.
[2024-12-02 07:33:56,793 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7551020408163265
[2024-12-02 07:33:56,795 INFO L175 Difference]: Start difference. First operand has 57 places, 45 transitions, 102 flow. Second operand 3 states and 111 transitions.
[2024-12-02 07:33:56,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 52 transitions, 176 flow
[2024-12-02 07:33:56,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 52 transitions, 172 flow, removed 0 selfloop flow, removed 4 redundant places.
[2024-12-02 07:33:56,803 INFO L231 Difference]: Finished difference. Result has 54 places, 42 transitions, 96 flow
[2024-12-02 07:33:56,806 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=54, PETRI_TRANSITIONS=42}
[2024-12-02 07:33:56,809 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, -3 predicate places.
[2024-12-02 07:33:56,809 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 42 transitions, 96 flow
[2024-12-02 07:33:56,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-12-02 07:33:56,810 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-12-02 07:33:56,810 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-12-02 07:33:56,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-12-02 07:33:56,810 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2024-12-02 07:33:56,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-12-02 07:33:56,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1771103079, now seen corresponding path program 1 times
[2024-12-02 07:33:56,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-12-02 07:33:56,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853241134]
[2024-12-02 07:33:56,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-12-02 07:33:56,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-12-02 07:33:56,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-12-02 07:33:57,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-12-02 07:33:57,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-12-02 07:33:57,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853241134]
[2024-12-02 07:33:57,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853241134] provided 1 perfect and 0 imperfect interpolant sequences
[2024-12-02 07:33:57,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-12-02 07:33:57,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-12-02 07:33:57,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753221050]
[2024-12-02 07:33:57,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-12-02 07:33:57,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-12-02 07:33:57,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-12-02 07:33:57,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-12-02 07:33:57,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-12-02 07:33:57,111 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 49
[2024-12-02 07:33:57,111 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 42 transitions, 96 flow. Second operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-12-02 07:33:57,111 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-12-02 07:33:57,111 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 49
[2024-12-02 07:33:57,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-12-02 07:33:59,604 INFO L124 PetriNetUnfolderBase]: 15819/23731 cut-off events.
[2024-12-02 07:33:59,605 INFO L125 PetriNetUnfolderBase]: For 868/868 co-relation queries the response was YES.
[2024-12-02 07:33:59,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46421 conditions, 23731 events. 15819/23731 cut-off events. For 868/868 co-relation queries the response was YES. Maximal size of possible extension queue 1398. Compared 180560 event pairs, 3634 based on Foata normal form. 0/23023 useless extension candidates. Maximal degree in co-relation 46411. Up to 8109 conditions per place.
[2024-12-02 07:33:59,698 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 41 selfloop transitions, 8 changer transitions 85/148 dead transitions.
[2024-12-02 07:33:59,698 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 148 transitions, 594 flow
[2024-12-02 07:33:59,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2024-12-02 07:33:59,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-12-02 07:33:59,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 298 transitions.
[2024-12-02 07:33:59,701 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6757369614512472
[2024-12-02 07:33:59,701 INFO L175 Difference]: Start difference. First operand has 54 places, 42 transitions, 96 flow. Second operand 9 states and 298 transitions.
[2024-12-02 07:33:59,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 148 transitions, 594 flow
[2024-12-02 07:33:59,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 148 transitions, 576 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-12-02 07:33:59,717 INFO L231 Difference]: Finished difference. Result has 67 places, 48 transitions, 202 flow
[2024-12-02 07:33:59,717 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=202, PETRI_PLACES=67, PETRI_TRANSITIONS=48}
[2024-12-02 07:33:59,718 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 10 predicate places.
[2024-12-02 07:33:59,718 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 48 transitions, 202 flow
[2024-12-02 07:33:59,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-12-02 07:33:59,718 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-12-02 07:33:59,718 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-12-02 07:33:59,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-12-02 07:33:59,718 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2024-12-02 07:33:59,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-12-02 07:33:59,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1492082494, now seen corresponding path program 1 times
[2024-12-02 07:33:59,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-12-02 07:33:59,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206462598]
[2024-12-02 07:33:59,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-12-02 07:33:59,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-12-02 07:33:59,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-12-02 07:33:59,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-12-02 07:33:59,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-12-02 07:33:59,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206462598]
[2024-12-02 07:33:59,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206462598] provided 1 perfect and 0 imperfect interpolant sequences
[2024-12-02 07:33:59,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-12-02 07:33:59,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-12-02 07:33:59,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185969526]
[2024-12-02 07:33:59,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-12-02 07:33:59,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-12-02 07:33:59,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-12-02 07:33:59,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-12-02 07:33:59,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2024-12-02 07:33:59,913 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 49
[2024-12-02 07:33:59,914 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 48 transitions, 202 flow. Second operand has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-12-02 07:33:59,914 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-12-02 07:33:59,914 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 49
[2024-12-02 07:33:59,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-12-02 07:34:01,801 INFO L124 PetriNetUnfolderBase]: 11171/17853 cut-off events.
[2024-12-02 07:34:01,801 INFO L125 PetriNetUnfolderBase]: For 29535/29535 co-relation queries the response was YES.
[2024-12-02 07:34:01,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55081 conditions, 17853 events. 11171/17853 cut-off events. For 29535/29535 co-relation queries the response was YES. Maximal size of possible extension queue 1017. Compared 139976 event pairs, 1903 based on Foata normal form. 486/18226 useless extension candidates. Maximal degree in co-relation 55063. Up to 5673 conditions per place.
[2024-12-02 07:34:01,895 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 51 selfloop transitions, 9 changer transitions 80/154 dead transitions.
[2024-12-02 07:34:01,895 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 154 transitions, 1064 flow
[2024-12-02 07:34:01,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2024-12-02 07:34:01,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-12-02 07:34:01,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 305 transitions.
[2024-12-02 07:34:01,898 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6224489795918368
[2024-12-02 07:34:01,898 INFO L175 Difference]: Start difference. First operand has 67 places, 48 transitions, 202 flow. Second operand 10 states and 305 transitions.
[2024-12-02 07:34:01,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 154 transitions, 1064 flow
[2024-12-02 07:34:01,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 154 transitions, 918 flow, removed 36 selfloop flow, removed 4 redundant places.
[2024-12-02 07:34:01,958 INFO L231 Difference]: Finished difference. Result has 74 places, 53 transitions, 272 flow
[2024-12-02 07:34:01,958 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=272, PETRI_PLACES=74, PETRI_TRANSITIONS=53}
[2024-12-02 07:34:01,959 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 17 predicate places.
[2024-12-02 07:34:01,959 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 53 transitions, 272 flow
[2024-12-02 07:34:01,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-12-02 07:34:01,959 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-12-02 07:34:01,959 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-12-02 07:34:01,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-12-02 07:34:01,959 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2024-12-02 07:34:01,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-12-02 07:34:01,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1168558406, now seen corresponding path program 1 times
[2024-12-02 07:34:01,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-12-02 07:34:01,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149881448]
[2024-12-02 07:34:01,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-12-02 07:34:01,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-12-02 07:34:01,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-12-02 07:34:02,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-12-02 07:34:02,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-12-02 07:34:02,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149881448]
[2024-12-02 07:34:02,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149881448] provided 1 perfect and 0 imperfect interpolant sequences
[2024-12-02 07:34:02,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-12-02 07:34:02,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-12-02 07:34:02,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181500582]
[2024-12-02 07:34:02,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-12-02 07:34:02,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-12-02 07:34:02,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-12-02 07:34:02,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-12-02 07:34:02,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-12-02 07:34:02,233 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 49
[2024-12-02 07:34:02,233 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 53 transitions, 272 flow. Second operand has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-12-02 07:34:02,233 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-12-02 07:34:02,233 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 49
[2024-12-02 07:34:02,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-12-02 07:34:03,611 INFO L124 PetriNetUnfolderBase]: 7926/13710 cut-off events.
[2024-12-02 07:34:03,611 INFO L125 PetriNetUnfolderBase]: For 31981/32614 co-relation queries the response was YES.
[2024-12-02 07:34:03,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42846 conditions, 13710 events. 7926/13710 cut-off events. For 31981/32614 co-relation queries the response was YES. Maximal size of possible extension queue 817. Compared 114649 event pairs, 2141 based on Foata normal form. 393/13213 useless extension candidates. Maximal degree in co-relation 42821. Up to 7939 conditions per place.
[2024-12-02 07:34:03,669 INFO L140 encePairwiseOnDemand]: 43/49 looper letters, 43 selfloop transitions, 7 changer transitions 39/111 dead transitions.
[2024-12-02 07:34:03,670 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 111 transitions, 770 flow
[2024-12-02 07:34:03,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-12-02 07:34:03,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-12-02 07:34:03,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 216 transitions.
[2024-12-02 07:34:03,671 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6297376093294461
[2024-12-02 07:34:03,671 INFO L175 Difference]: Start difference. First operand has 74 places, 53 transitions, 272 flow. Second operand 7 states and 216 transitions.
[2024-12-02 07:34:03,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 111 transitions, 770 flow
[2024-12-02 07:34:03,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 111 transitions, 741 flow, removed 12 selfloop flow, removed 3 redundant places.
[2024-12-02 07:34:03,830 INFO L231 Difference]: Finished difference. Result has 76 places, 59 transitions, 368 flow
[2024-12-02 07:34:03,830 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=257, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=368, PETRI_PLACES=76, PETRI_TRANSITIONS=59}
[2024-12-02 07:34:03,831 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 19 predicate places.
[2024-12-02 07:34:03,831 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 59 transitions, 368 flow
[2024-12-02 07:34:03,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-12-02 07:34:03,831 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-12-02 07:34:03,831 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-12-02 07:34:03,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-12-02 07:34:03,831 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2024-12-02 07:34:03,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-12-02 07:34:03,832 INFO L85 PathProgramCache]: Analyzing trace with hash 2130153545, now seen corresponding path program 1 times
[2024-12-02 07:34:03,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-12-02 07:34:03,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696761386]
[2024-12-02 07:34:03,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-12-02 07:34:03,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-12-02 07:34:03,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-12-02 07:34:04,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-12-02 07:34:04,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-12-02 07:34:04,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696761386]
[2024-12-02 07:34:04,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696761386] provided 1 perfect and 0 imperfect interpolant sequences
[2024-12-02 07:34:04,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-12-02 07:34:04,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-12-02 07:34:04,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213796963]
[2024-12-02 07:34:04,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-12-02 07:34:04,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-12-02 07:34:04,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-12-02 07:34:04,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-12-02 07:34:04,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-12-02 07:34:04,023 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 49
[2024-12-02 07:34:04,024 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 59 transitions, 368 flow. Second operand has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-12-02 07:34:04,024 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-12-02 07:34:04,024 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 49
[2024-12-02 07:34:04,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-12-02 07:34:05,284 INFO L124 PetriNetUnfolderBase]: 7570/13001 cut-off events.
[2024-12-02 07:34:05,284 INFO L125 PetriNetUnfolderBase]: For 32969/33579 co-relation queries the response was YES.
[2024-12-02 07:34:05,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42431 conditions, 13001 events. 7570/13001 cut-off events. For 32969/33579 co-relation queries the response was YES. Maximal size of possible extension queue 751. Compared 105860 event pairs, 3000 based on Foata normal form. 363/13062 useless extension candidates. Maximal degree in co-relation 42402. Up to 8123 conditions per place.
[2024-12-02 07:34:05,435 INFO L140 encePairwiseOnDemand]: 43/49 looper letters, 46 selfloop transitions, 6 changer transitions 37/117 dead transitions.
[2024-12-02 07:34:05,435 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 117 transitions, 852 flow
[2024-12-02 07:34:05,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-12-02 07:34:05,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-12-02 07:34:05,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 221 transitions.
[2024-12-02 07:34:05,437 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6443148688046647
[2024-12-02 07:34:05,437 INFO L175 Difference]: Start difference. First operand has 76 places, 59 transitions, 368 flow. Second operand 7 states and 221 transitions.
[2024-12-02 07:34:05,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 117 transitions, 852 flow
[2024-12-02 07:34:05,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 117 transitions, 801 flow, removed 22 selfloop flow, removed 7 redundant places.
[2024-12-02 07:34:05,561 INFO L231 Difference]: Finished difference. Result has 76 places, 64 transitions, 411 flow
[2024-12-02 07:34:05,562 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=329, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=411, PETRI_PLACES=76, PETRI_TRANSITIONS=64}
[2024-12-02 07:34:05,562 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 19 predicate places.
[2024-12-02 07:34:05,562 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 64 transitions, 411 flow
[2024-12-02 07:34:05,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-12-02 07:34:05,563 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-12-02 07:34:05,563 INFO L206 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]
[2024-12-02 07:34:05,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-12-02 07:34:05,563 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2024-12-02 07:34:05,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-12-02 07:34:05,563 INFO L85 PathProgramCache]: Analyzing trace with hash 185670121, now seen corresponding path program 1 times
[2024-12-02 07:34:05,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-12-02 07:34:05,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283914391]
[2024-12-02 07:34:05,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-12-02 07:34:05,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-12-02 07:34:05,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-12-02 07:34:05,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-12-02 07:34:05,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-12-02 07:34:05,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283914391]
[2024-12-02 07:34:05,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283914391] provided 1 perfect and 0 imperfect interpolant sequences
[2024-12-02 07:34:05,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-12-02 07:34:05,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-12-02 07:34:05,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721243201]
[2024-12-02 07:34:05,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-12-02 07:34:05,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-12-02 07:34:05,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-12-02 07:34:05,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-12-02 07:34:05,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-12-02 07:34:05,787 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 49
[2024-12-02 07:34:05,787 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 64 transitions, 411 flow. Second operand has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-12-02 07:34:05,787 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-12-02 07:34:05,788 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 49
[2024-12-02 07:34:05,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-12-02 07:34:07,862 INFO L124 PetriNetUnfolderBase]: 9176/15681 cut-off events.
[2024-12-02 07:34:07,863 INFO L125 PetriNetUnfolderBase]: For 47018/47447 co-relation queries the response was YES.
[2024-12-02 07:34:07,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51281 conditions, 15681 events. 9176/15681 cut-off events. For 47018/47447 co-relation queries the response was YES. Maximal size of possible extension queue 927. Compared 135324 event pairs, 3516 based on Foata normal form. 345/15356 useless extension candidates. Maximal degree in co-relation 51252. Up to 5947 conditions per place.
[2024-12-02 07:34:07,952 INFO L140 encePairwiseOnDemand]: 44/49 looper letters, 46 selfloop transitions, 8 changer transitions 38/119 dead transitions.
[2024-12-02 07:34:07,952 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 119 transitions, 883 flow
[2024-12-02 07:34:07,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-12-02 07:34:07,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-12-02 07:34:07,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 220 transitions.
[2024-12-02 07:34:07,954 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.641399416909621
[2024-12-02 07:34:07,954 INFO L175 Difference]: Start difference. First operand has 76 places, 64 transitions, 411 flow. Second operand 7 states and 220 transitions.
[2024-12-02 07:34:07,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 119 transitions, 883 flow
[2024-12-02 07:34:08,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 119 transitions, 849 flow, removed 14 selfloop flow, removed 3 redundant places.
[2024-12-02 07:34:08,074 INFO L231 Difference]: Finished difference. Result has 80 places, 63 transitions, 419 flow
[2024-12-02 07:34:08,074 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=393, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=419, PETRI_PLACES=80, PETRI_TRANSITIONS=63}
[2024-12-02 07:34:08,075 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 23 predicate places.
[2024-12-02 07:34:08,075 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 63 transitions, 419 flow
[2024-12-02 07:34:08,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-12-02 07:34:08,075 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-12-02 07:34:08,075 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-12-02 07:34:08,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-12-02 07:34:08,076 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2024-12-02 07:34:08,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-12-02 07:34:08,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1390336798, now seen corresponding path program 1 times
[2024-12-02 07:34:08,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-12-02 07:34:08,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817016922]
[2024-12-02 07:34:08,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-12-02 07:34:08,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-12-02 07:34:08,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-12-02 07:34:08,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-12-02 07:34:08,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-12-02 07:34:08,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817016922]
[2024-12-02 07:34:08,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817016922] provided 1 perfect and 0 imperfect interpolant sequences
[2024-12-02 07:34:08,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-12-02 07:34:08,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-12-02 07:34:08,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609548955]
[2024-12-02 07:34:08,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-12-02 07:34:08,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-12-02 07:34:08,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-12-02 07:34:08,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-12-02 07:34:08,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-12-02 07:34:08,356 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 49
[2024-12-02 07:34:08,356 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 63 transitions, 419 flow. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-12-02 07:34:08,356 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-12-02 07:34:08,356 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 49
[2024-12-02 07:34:08,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-12-02 07:34:11,620 INFO L124 PetriNetUnfolderBase]: 24881/37722 cut-off events.
[2024-12-02 07:34:11,620 INFO L125 PetriNetUnfolderBase]: For 77188/80109 co-relation queries the response was YES.
[2024-12-02 07:34:11,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105455 conditions, 37722 events. 24881/37722 cut-off events. For 77188/80109 co-relation queries the response was YES. Maximal size of possible extension queue 1934. Compared 296201 event pairs, 4474 based on Foata normal form. 1825/38557 useless extension candidates. Maximal degree in co-relation 105423. Up to 19440 conditions per place.
[2024-12-02 07:34:11,803 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 56 selfloop transitions, 6 changer transitions 0/97 dead transitions.
[2024-12-02 07:34:11,803 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 97 transitions, 677 flow
[2024-12-02 07:34:11,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-12-02 07:34:11,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-12-02 07:34:11,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 139 transitions.
[2024-12-02 07:34:11,804 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7091836734693877
[2024-12-02 07:34:11,804 INFO L175 Difference]: Start difference. First operand has 80 places, 63 transitions, 419 flow. Second operand 4 states and 139 transitions.
[2024-12-02 07:34:11,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 97 transitions, 677 flow
[2024-12-02 07:34:11,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 97 transitions, 647 flow, removed 11 selfloop flow, removed 5 redundant places.
[2024-12-02 07:34:11,959 INFO L231 Difference]: Finished difference. Result has 76 places, 68 transitions, 435 flow
[2024-12-02 07:34:11,959 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=389, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=435, PETRI_PLACES=76, PETRI_TRANSITIONS=68}
[2024-12-02 07:34:11,959 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 19 predicate places.
[2024-12-02 07:34:11,959 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 68 transitions, 435 flow
[2024-12-02 07:34:11,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-12-02 07:34:11,960 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-12-02 07:34:11,960 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-12-02 07:34:11,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-12-02 07:34:11,960 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2024-12-02 07:34:11,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-12-02 07:34:11,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1693650685, now seen corresponding path program 1 times
[2024-12-02 07:34:11,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-12-02 07:34:11,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690168878]
[2024-12-02 07:34:11,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-12-02 07:34:11,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-12-02 07:34:11,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-12-02 07:34:12,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-12-02 07:34:12,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-12-02 07:34:12,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690168878]
[2024-12-02 07:34:12,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690168878] provided 1 perfect and 0 imperfect interpolant sequences
[2024-12-02 07:34:12,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-12-02 07:34:12,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-12-02 07:34:12,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313730865]
[2024-12-02 07:34:12,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-12-02 07:34:12,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-12-02 07:34:12,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-12-02 07:34:12,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-12-02 07:34:12,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-12-02 07:34:12,144 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 49
[2024-12-02 07:34:12,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 68 transitions, 435 flow. Second operand has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-12-02 07:34:12,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-12-02 07:34:12,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 49
[2024-12-02 07:34:12,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-12-02 07:34:16,860 INFO L124 PetriNetUnfolderBase]: 25111/41694 cut-off events.
[2024-12-02 07:34:16,860 INFO L125 PetriNetUnfolderBase]: For 87937/90012 co-relation queries the response was YES.
[2024-12-02 07:34:16,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125079 conditions, 41694 events. 25111/41694 cut-off events. For 87937/90012 co-relation queries the response was YES. Maximal size of possible extension queue 2394. Compared 384610 event pairs, 11933 based on Foata normal form. 1102/38239 useless extension candidates. Maximal degree in co-relation 125048. Up to 15762 conditions per place.
[2024-12-02 07:34:17,061 INFO L140 encePairwiseOnDemand]: 44/49 looper letters, 72 selfloop transitions, 14 changer transitions 4/122 dead transitions.
[2024-12-02 07:34:17,061 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 122 transitions, 873 flow
[2024-12-02 07:34:17,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-12-02 07:34:17,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-12-02 07:34:17,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 222 transitions.
[2024-12-02 07:34:17,062 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6472303206997084
[2024-12-02 07:34:17,062 INFO L175 Difference]: Start difference. First operand has 76 places, 68 transitions, 435 flow. Second operand 7 states and 222 transitions.
[2024-12-02 07:34:17,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 122 transitions, 873 flow
[2024-12-02 07:34:17,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 122 transitions, 865 flow, removed 3 selfloop flow, removed 1 redundant places.
[2024-12-02 07:34:17,158 INFO L231 Difference]: Finished difference. Result has 86 places, 73 transitions, 544 flow
[2024-12-02 07:34:17,158 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=431, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=544, PETRI_PLACES=86, PETRI_TRANSITIONS=73}
[2024-12-02 07:34:17,159 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 29 predicate places.
[2024-12-02 07:34:17,159 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 73 transitions, 544 flow
[2024-12-02 07:34:17,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-12-02 07:34:17,159 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-12-02 07:34:17,159 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-12-02 07:34:17,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-12-02 07:34:17,159 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2024-12-02 07:34:17,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-12-02 07:34:17,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1232035489, now seen corresponding path program 1 times
[2024-12-02 07:34:17,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-12-02 07:34:17,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918941873]
[2024-12-02 07:34:17,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-12-02 07:34:17,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-12-02 07:34:17,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-12-02 07:34:17,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-12-02 07:34:17,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-12-02 07:34:17,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918941873]
[2024-12-02 07:34:17,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918941873] provided 1 perfect and 0 imperfect interpolant sequences
[2024-12-02 07:34:17,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-12-02 07:34:17,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-12-02 07:34:17,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623863328]
[2024-12-02 07:34:17,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-12-02 07:34:17,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-12-02 07:34:17,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-12-02 07:34:17,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-12-02 07:34:17,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-12-02 07:34:17,318 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 49
[2024-12-02 07:34:17,318 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 73 transitions, 544 flow. Second operand has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-12-02 07:34:17,318 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-12-02 07:34:17,318 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 49
[2024-12-02 07:34:17,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-12-02 07:34:22,791 INFO L124 PetriNetUnfolderBase]: 33733/50865 cut-off events.
[2024-12-02 07:34:22,791 INFO L125 PetriNetUnfolderBase]: For 95433/99619 co-relation queries the response was YES.
[2024-12-02 07:34:22,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152810 conditions, 50865 events. 33733/50865 cut-off events. For 95433/99619 co-relation queries the response was YES. Maximal size of possible extension queue 2544. Compared 404280 event pairs, 3592 based on Foata normal form. 2747/52482 useless extension candidates. Maximal degree in co-relation 152774. Up to 20977 conditions per place.
[2024-12-02 07:34:23,014 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 71 selfloop transitions, 10 changer transitions 5/123 dead transitions.
[2024-12-02 07:34:23,014 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 123 transitions, 932 flow
[2024-12-02 07:34:23,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-12-02 07:34:23,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-12-02 07:34:23,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 178 transitions.
[2024-12-02 07:34:23,015 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.726530612244898
[2024-12-02 07:34:23,016 INFO L175 Difference]: Start difference. First operand has 86 places, 73 transitions, 544 flow. Second operand 5 states and 178 transitions.
[2024-12-02 07:34:23,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 123 transitions, 932 flow
[2024-12-02 07:34:23,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 123 transitions, 901 flow, removed 11 selfloop flow, removed 1 redundant places.
[2024-12-02 07:34:23,449 INFO L231 Difference]: Finished difference. Result has 91 places, 75 transitions, 548 flow
[2024-12-02 07:34:23,450 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=513, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=548, PETRI_PLACES=91, PETRI_TRANSITIONS=75}
[2024-12-02 07:34:23,450 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 34 predicate places.
[2024-12-02 07:34:23,450 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 75 transitions, 548 flow
[2024-12-02 07:34:23,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-12-02 07:34:23,450 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-12-02 07:34:23,450 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-12-02 07:34:23,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-12-02 07:34:23,450 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2024-12-02 07:34:23,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-12-02 07:34:23,451 INFO L85 PathProgramCache]: Analyzing trace with hash -118071740, now seen corresponding path program 1 times
[2024-12-02 07:34:23,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-12-02 07:34:23,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232439739]
[2024-12-02 07:34:23,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-12-02 07:34:23,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-12-02 07:34:23,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-12-02 07:34:23,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-12-02 07:34:23,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-12-02 07:34:23,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232439739]
[2024-12-02 07:34:23,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232439739] provided 1 perfect and 0 imperfect interpolant sequences
[2024-12-02 07:34:23,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-12-02 07:34:23,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-12-02 07:34:23,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145700640]
[2024-12-02 07:34:23,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-12-02 07:34:23,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-12-02 07:34:23,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-12-02 07:34:23,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-12-02 07:34:23,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2024-12-02 07:34:23,698 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 49
[2024-12-02 07:34:23,699 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 75 transitions, 548 flow. Second operand has 6 states, 6 states have (on average 24.0) internal successors, (144), 6 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-12-02 07:34:23,699 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-12-02 07:34:23,699 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 49
[2024-12-02 07:34:23,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-12-02 07:34:27,331 INFO L124 PetriNetUnfolderBase]: 26417/39785 cut-off events.
[2024-12-02 07:34:27,331 INFO L125 PetriNetUnfolderBase]: For 80673/86154 co-relation queries the response was YES.
[2024-12-02 07:34:27,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131308 conditions, 39785 events. 26417/39785 cut-off events. For 80673/86154 co-relation queries the response was YES. Maximal size of possible extension queue 2094. Compared 306861 event pairs, 1412 based on Foata normal form. 2254/41035 useless extension candidates. Maximal degree in co-relation 131269. Up to 12976 conditions per place.
[2024-12-02 07:34:27,536 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 81 selfloop transitions, 14 changer transitions 5/137 dead transitions.
[2024-12-02 07:34:27,536 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 137 transitions, 1033 flow
[2024-12-02 07:34:27,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-12-02 07:34:27,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-12-02 07:34:27,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 215 transitions.
[2024-12-02 07:34:27,537 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7312925170068028
[2024-12-02 07:34:27,538 INFO L175 Difference]: Start difference. First operand has 91 places, 75 transitions, 548 flow. Second operand 6 states and 215 transitions.
[2024-12-02 07:34:27,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 137 transitions, 1033 flow
[2024-12-02 07:34:27,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 137 transitions, 1007 flow, removed 9 selfloop flow, removed 4 redundant places.
[2024-12-02 07:34:27,628 INFO L231 Difference]: Finished difference. Result has 92 places, 80 transitions, 608 flow
[2024-12-02 07:34:27,628 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=523, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=608, PETRI_PLACES=92, PETRI_TRANSITIONS=80}
[2024-12-02 07:34:27,629 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 35 predicate places.
[2024-12-02 07:34:27,629 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 80 transitions, 608 flow
[2024-12-02 07:34:27,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 6 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-12-02 07:34:27,629 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-12-02 07:34:27,629 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-12-02 07:34:27,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-12-02 07:34:27,629 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2024-12-02 07:34:27,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-12-02 07:34:27,630 INFO L85 PathProgramCache]: Analyzing trace with hash 601255363, now seen corresponding path program 1 times
[2024-12-02 07:34:27,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-12-02 07:34:27,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476201378]
[2024-12-02 07:34:27,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-12-02 07:34:27,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-12-02 07:34:27,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-12-02 07:34:27,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-12-02 07:34:27,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-12-02 07:34:27,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476201378]
[2024-12-02 07:34:27,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476201378] provided 1 perfect and 0 imperfect interpolant sequences
[2024-12-02 07:34:27,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-12-02 07:34:27,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-12-02 07:34:27,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777695369]
[2024-12-02 07:34:27,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-12-02 07:34:27,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-12-02 07:34:27,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-12-02 07:34:27,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-12-02 07:34:27,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2024-12-02 07:34:27,815 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 49
[2024-12-02 07:34:27,815 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 80 transitions, 608 flow. Second operand has 7 states, 7 states have (on average 23.857142857142858) internal successors, (167), 7 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-12-02 07:34:27,815 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-12-02 07:34:27,815 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 49
[2024-12-02 07:34:27,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-12-02 07:34:32,370 INFO L124 PetriNetUnfolderBase]: 23525/35277 cut-off events.
[2024-12-02 07:34:32,370 INFO L125 PetriNetUnfolderBase]: For 106398/111792 co-relation queries the response was YES.
[2024-12-02 07:34:32,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127267 conditions, 35277 events. 23525/35277 cut-off events. For 106398/111792 co-relation queries the response was YES. Maximal size of possible extension queue 2087. Compared 270249 event pairs, 1308 based on Foata normal form. 1419/35708 useless extension candidates. Maximal degree in co-relation 127228. Up to 12976 conditions per place.
[2024-12-02 07:34:32,506 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 70 selfloop transitions, 18 changer transitions 10/132 dead transitions.
[2024-12-02 07:34:32,506 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 132 transitions, 999 flow
[2024-12-02 07:34:32,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-12-02 07:34:32,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-12-02 07:34:32,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 234 transitions.
[2024-12-02 07:34:32,507 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6822157434402333
[2024-12-02 07:34:32,508 INFO L175 Difference]: Start difference. First operand has 92 places, 80 transitions, 608 flow. Second operand 7 states and 234 transitions.
[2024-12-02 07:34:32,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 132 transitions, 999 flow
[2024-12-02 07:34:33,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 132 transitions, 914 flow, removed 30 selfloop flow, removed 11 redundant places.
[2024-12-02 07:34:33,021 INFO L231 Difference]: Finished difference. Result has 88 places, 76 transitions, 545 flow
[2024-12-02 07:34:33,021 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=518, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=545, PETRI_PLACES=88, PETRI_TRANSITIONS=76}
[2024-12-02 07:34:33,021 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 31 predicate places.
[2024-12-02 07:34:33,021 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 76 transitions, 545 flow
[2024-12-02 07:34:33,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.857142857142858) internal successors, (167), 7 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-12-02 07:34:33,022 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-12-02 07:34:33,022 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-12-02 07:34:33,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-12-02 07:34:33,022 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2024-12-02 07:34:33,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-12-02 07:34:33,022 INFO L85 PathProgramCache]: Analyzing trace with hash -864357697, now seen corresponding path program 1 times
[2024-12-02 07:34:33,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-12-02 07:34:33,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129108074]
[2024-12-02 07:34:33,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-12-02 07:34:33,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-12-02 07:34:33,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-12-02 07:34:33,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-12-02 07:34:33,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-12-02 07:34:33,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129108074]
[2024-12-02 07:34:33,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129108074] provided 1 perfect and 0 imperfect interpolant sequences
[2024-12-02 07:34:33,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-12-02 07:34:33,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-12-02 07:34:33,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065649847]
[2024-12-02 07:34:33,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-12-02 07:34:33,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-12-02 07:34:33,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-12-02 07:34:33,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-12-02 07:34:33,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2024-12-02 07:34:33,215 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 49
[2024-12-02 07:34:33,215 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 76 transitions, 545 flow. Second operand has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 6 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-12-02 07:34:33,215 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-12-02 07:34:33,215 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 49
[2024-12-02 07:34:33,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-12-02 07:34:35,404 INFO L124 PetriNetUnfolderBase]: 13506/25395 cut-off events.
[2024-12-02 07:34:35,405 INFO L125 PetriNetUnfolderBase]: For 53807/58601 co-relation queries the response was YES.
[2024-12-02 07:34:35,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79262 conditions, 25395 events. 13506/25395 cut-off events. For 53807/58601 co-relation queries the response was YES. Maximal size of possible extension queue 2089. Compared 256161 event pairs, 3650 based on Foata normal form. 324/22770 useless extension candidates. Maximal degree in co-relation 79229. Up to 8429 conditions per place.
[2024-12-02 07:34:35,537 INFO L140 encePairwiseOnDemand]: 44/49 looper letters, 44 selfloop transitions, 3 changer transitions 16/112 dead transitions.
[2024-12-02 07:34:35,537 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 112 transitions, 807 flow
[2024-12-02 07:34:35,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-12-02 07:34:35,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-12-02 07:34:35,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 185 transitions.
[2024-12-02 07:34:35,538 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6292517006802721
[2024-12-02 07:34:35,538 INFO L175 Difference]: Start difference. First operand has 88 places, 76 transitions, 545 flow. Second operand 6 states and 185 transitions.
[2024-12-02 07:34:35,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 112 transitions, 807 flow
[2024-12-02 07:34:36,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 112 transitions, 712 flow, removed 36 selfloop flow, removed 7 redundant places.
[2024-12-02 07:34:36,587 INFO L231 Difference]: Finished difference. Result has 89 places, 76 transitions, 479 flow
[2024-12-02 07:34:36,587 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=468, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=479, PETRI_PLACES=89, PETRI_TRANSITIONS=76}
[2024-12-02 07:34:36,587 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 32 predicate places.
[2024-12-02 07:34:36,587 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 76 transitions, 479 flow
[2024-12-02 07:34:36,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 6 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-12-02 07:34:36,588 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-12-02 07:34:36,588 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-12-02 07:34:36,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-12-02 07:34:36,588 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2024-12-02 07:34:36,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-12-02 07:34:36,588 INFO L85 PathProgramCache]: Analyzing trace with hash 727568977, now seen corresponding path program 2 times
[2024-12-02 07:34:36,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-12-02 07:34:36,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603822896]
[2024-12-02 07:34:36,589 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-12-02 07:34:36,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-12-02 07:34:36,626 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2024-12-02 07:34:36,626 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-12-02 07:34:38,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-12-02 07:34:38,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-12-02 07:34:38,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603822896]
[2024-12-02 07:34:38,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603822896] provided 1 perfect and 0 imperfect interpolant sequences
[2024-12-02 07:34:38,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-12-02 07:34:38,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-12-02 07:34:38,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057980868]
[2024-12-02 07:34:38,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-12-02 07:34:38,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-12-02 07:34:38,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-12-02 07:34:38,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-12-02 07:34:38,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72
[2024-12-02 07:34:38,046 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 49
[2024-12-02 07:34:38,046 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 76 transitions, 479 flow. Second operand has 9 states, 9 states have (on average 25.0) internal successors, (225), 9 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-12-02 07:34:38,047 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-12-02 07:34:38,047 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 49
[2024-12-02 07:34:38,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-12-02 07:34:40,038 INFO L124 PetriNetUnfolderBase]: 11168/21897 cut-off events.
[2024-12-02 07:34:40,039 INFO L125 PetriNetUnfolderBase]: For 27231/31434 co-relation queries the response was YES.
[2024-12-02 07:34:40,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60628 conditions, 21897 events. 11168/21897 cut-off events. For 27231/31434 co-relation queries the response was YES. Maximal size of possible extension queue 1883. Compared 224598 event pairs, 2289 based on Foata normal form. 245/19668 useless extension candidates. Maximal degree in co-relation 60595. Up to 7082 conditions per place.
[2024-12-02 07:34:40,182 INFO L140 encePairwiseOnDemand]: 40/49 looper letters, 40 selfloop transitions, 11 changer transitions 18/122 dead transitions.
[2024-12-02 07:34:40,182 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 122 transitions, 759 flow
[2024-12-02 07:34:40,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2024-12-02 07:34:40,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-12-02 07:34:40,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 297 transitions.
[2024-12-02 07:34:40,183 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6061224489795919
[2024-12-02 07:34:40,183 INFO L175 Difference]: Start difference. First operand has 89 places, 76 transitions, 479 flow. Second operand 10 states and 297 transitions.
[2024-12-02 07:34:40,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 122 transitions, 759 flow
[2024-12-02 07:34:41,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 122 transitions, 748 flow, removed 5 selfloop flow, removed 3 redundant places.
[2024-12-02 07:34:41,062 INFO L231 Difference]: Finished difference. Result has 98 places, 83 transitions, 541 flow
[2024-12-02 07:34:41,062 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=472, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=541, PETRI_PLACES=98, PETRI_TRANSITIONS=83}
[2024-12-02 07:34:41,062 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 41 predicate places.
[2024-12-02 07:34:41,062 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 83 transitions, 541 flow
[2024-12-02 07:34:41,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 25.0) internal successors, (225), 9 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-12-02 07:34:41,062 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-12-02 07:34:41,063 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-12-02 07:34:41,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-12-02 07:34:41,063 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2024-12-02 07:34:41,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-12-02 07:34:41,063 INFO L85 PathProgramCache]: Analyzing trace with hash 627899519, now seen corresponding path program 3 times
[2024-12-02 07:34:41,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-12-02 07:34:41,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824817189]
[2024-12-02 07:34:41,063 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2024-12-02 07:34:41,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-12-02 07:34:41,105 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s)
[2024-12-02 07:34:41,105 INFO L230 tOrderPrioritization]: Conjunction of SSA is sat
[2024-12-02 07:34:41,105 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-12-02 07:34:41,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-12-02 07:34:41,184 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-12-02 07:34:41,185 INFO L340 BasicCegarLoop]: Counterexample is feasible
[2024-12-02 07:34:41,185 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining)
[2024-12-02 07:34:41,187 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining)
[2024-12-02 07:34:41,187 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining)
[2024-12-02 07:34:41,187 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining)
[2024-12-02 07:34:41,187 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining)
[2024-12-02 07:34:41,187 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining)
[2024-12-02 07:34:41,187 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining)
[2024-12-02 07:34:41,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-12-02 07:34:41,188 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-12-02 07:34:41,254 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2024-12-02 07:34:41,254 INFO L170 ceAbstractionStarter]: Computing trace abstraction results
[2024-12-02 07:34:41,259 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 07:34:41 BasicIcfg
[2024-12-02 07:34:41,259 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-12-02 07:34:41,260 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2024-12-02 07:34:41,260 INFO L270 PluginConnector]: Initializing Witness Printer...
[2024-12-02 07:34:41,260 INFO L274 PluginConnector]: Witness Printer initialized
[2024-12-02 07:34:41,261 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:33:55" (3/4) ...
[2024-12-02 07:34:41,262 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample
[2024-12-02 07:34:41,347 INFO L129 tionWitnessGenerator]: Generated YAML witness of length 9.
[2024-12-02 07:34:41,391 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c930dc56-aece-4316-8ce1-2182e0c38a6f/bin/uautomizer-verify-84ZbGMXZE1/witness.graphml
[2024-12-02 07:34:41,391 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c930dc56-aece-4316-8ce1-2182e0c38a6f/bin/uautomizer-verify-84ZbGMXZE1/witness.yml
[2024-12-02 07:34:41,391 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-12-02 07:34:41,392 INFO L158 Benchmark]: Toolchain (without parser) took 46848.47ms. Allocated memory was 117.4MB in the beginning and 8.4GB in the end (delta: 8.3GB). Free memory was 91.7MB in the beginning and 4.2GB in the end (delta: -4.1GB). Peak memory consumption was 4.2GB. Max. memory is 16.1GB.
[2024-12-02 07:34:41,392 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 117.4MB. Free memory is still 73.3MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-12-02 07:34:41,392 INFO L158 Benchmark]: CACSL2BoogieTranslator took 454.28ms. Allocated memory is still 117.4MB. Free memory was 91.7MB in the beginning and 67.4MB in the end (delta: 24.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2024-12-02 07:34:41,392 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.88ms. Allocated memory is still 117.4MB. Free memory was 67.4MB in the beginning and 64.9MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-12-02 07:34:41,393 INFO L158 Benchmark]: Boogie Preprocessor took 37.15ms. Allocated memory is still 117.4MB. Free memory was 64.9MB in the beginning and 61.4MB in the end (delta: 3.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2024-12-02 07:34:41,393 INFO L158 Benchmark]: RCFGBuilder took 624.34ms. Allocated memory is still 117.4MB. Free memory was 61.4MB in the beginning and 59.8MB in the end (delta: 1.6MB). Peak memory consumption was 30.5MB. Max. memory is 16.1GB.
[2024-12-02 07:34:41,393 INFO L158 Benchmark]: TraceAbstraction took 45563.63ms. Allocated memory was 117.4MB in the beginning and 8.4GB in the end (delta: 8.3GB). Free memory was 59.3MB in the beginning and 4.2GB in the end (delta: -4.1GB). Peak memory consumption was 4.1GB. Max. memory is 16.1GB.
[2024-12-02 07:34:41,394 INFO L158 Benchmark]: Witness Printer took 131.28ms. Allocated memory is still 8.4GB. Free memory was 4.2GB in the beginning and 4.2GB in the end (delta: 21.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2024-12-02 07:34:41,395 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.26ms. Allocated memory is still 117.4MB. Free memory is still 73.3MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 454.28ms. Allocated memory is still 117.4MB. Free memory was 91.7MB in the beginning and 67.4MB in the end (delta: 24.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 32.88ms. Allocated memory is still 117.4MB. Free memory was 67.4MB in the beginning and 64.9MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB.
* Boogie Preprocessor took 37.15ms. Allocated memory is still 117.4MB. Free memory was 64.9MB in the beginning and 61.4MB in the end (delta: 3.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
* RCFGBuilder took 624.34ms. Allocated memory is still 117.4MB. Free memory was 61.4MB in the beginning and 59.8MB in the end (delta: 1.6MB). Peak memory consumption was 30.5MB. Max. memory is 16.1GB.
* TraceAbstraction took 45563.63ms. Allocated memory was 117.4MB in the beginning and 8.4GB in the end (delta: 8.3GB). Free memory was 59.3MB in the beginning and 4.2GB in the end (delta: -4.1GB). Peak memory consumption was 4.1GB. Max. memory is 16.1GB.
* Witness Printer took 131.28ms. Allocated memory is still 8.4GB. Free memory was 4.2GB in the beginning and 4.2GB in the end (delta: 21.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- CounterExampleResult [Line: 18]: a call to reach_error is reachable
a call to reach_error is reachable
We found a FailurePath:
[L710] 0 int __unbuffered_cnt = 0;
[L712] 0 int __unbuffered_p2_EAX = 0;
[L714] 0 int __unbuffered_p3_EAX = 0;
[L716] 0 int __unbuffered_p3_EBX = 0;
[L718] 0 int a = 0;
[L719] 0 _Bool main$tmp_guard0;
[L720] 0 _Bool main$tmp_guard1;
[L722] 0 int x = 0;
[L724] 0 int y = 0;
[L726] 0 int z = 0;
[L727] 0 _Bool z$flush_delayed;
[L728] 0 int z$mem_tmp;
[L729] 0 _Bool z$r_buff0_thd0;
[L730] 0 _Bool z$r_buff0_thd1;
[L731] 0 _Bool z$r_buff0_thd2;
[L732] 0 _Bool z$r_buff0_thd3;
[L733] 0 _Bool z$r_buff0_thd4;
[L734] 0 _Bool z$r_buff1_thd0;
[L735] 0 _Bool z$r_buff1_thd1;
[L736] 0 _Bool z$r_buff1_thd2;
[L737] 0 _Bool z$r_buff1_thd3;
[L738] 0 _Bool z$r_buff1_thd4;
[L739] 0 _Bool z$read_delayed;
[L740] 0 int *z$read_delayed_var;
[L741] 0 int z$w_buff0;
[L742] 0 _Bool z$w_buff0_used;
[L743] 0 int z$w_buff1;
[L744] 0 _Bool z$w_buff1_used;
[L745] 0 _Bool weak$$choice0;
[L746] 0 _Bool weak$$choice2;
[L862] 0 pthread_t t557;
[L863] FCALL, FORK 0 pthread_create(&t557, ((void *)0), P0, ((void *)0))
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t557=-3, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L864] 0 pthread_t t558;
[L865] FCALL, FORK 0 pthread_create(&t558, ((void *)0), P1, ((void *)0))
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t557=-3, t558=-2, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L866] 0 pthread_t t559;
[L867] FCALL, FORK 0 pthread_create(&t559, ((void *)0), P2, ((void *)0))
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t557=-3, t558=-2, t559=-1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L868] 0 pthread_t t560;
[L869] FCALL, FORK 0 pthread_create(&t560, ((void *)0), P3, ((void *)0))
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t557=-3, t558=-2, t559=-1, t560=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L808] 4 z$w_buff1 = z$w_buff0
[L809] 4 z$w_buff0 = 1
[L810] 4 z$w_buff1_used = z$w_buff0_used
[L811] 4 z$w_buff0_used = (_Bool)1
[L812] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used))
[L18] COND FALSE 4 !(!expression)
[L812] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used))
[L813] 4 z$r_buff1_thd0 = z$r_buff0_thd0
[L814] 4 z$r_buff1_thd1 = z$r_buff0_thd1
[L815] 4 z$r_buff1_thd2 = z$r_buff0_thd2
[L816] 4 z$r_buff1_thd3 = z$r_buff0_thd3
[L817] 4 z$r_buff1_thd4 = z$r_buff0_thd4
[L818] 4 z$r_buff0_thd4 = (_Bool)1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L821] 4 weak$$choice0 = __VERIFIER_nondet_bool()
[L822] 4 weak$$choice2 = __VERIFIER_nondet_bool()
[L823] 4 z$flush_delayed = weak$$choice2
[L824] 4 z$mem_tmp = z
[L825] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1)
[L826] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0))
[L827] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1))
[L828] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used))
[L829] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0))
[L830] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4))
[L831] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0))
[L832] 4 __unbuffered_p3_EAX = z
[L833] 4 z = z$flush_delayed ? z$mem_tmp : z
[L834] 4 z$flush_delayed = (_Bool)0
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L837] 4 __unbuffered_p3_EBX = a
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L750] 1 a = 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L753] 1 x = 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L765] 2 x = 2
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L768] 2 y = 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L773] 2 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L780] 3 y = 2
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L783] 3 weak$$choice0 = __VERIFIER_nondet_bool()
[L784] 3 weak$$choice2 = __VERIFIER_nondet_bool()
[L785] 3 z$flush_delayed = weak$$choice2
[L786] 3 z$mem_tmp = z
[L787] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)
[L788] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))
[L789] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))
[L790] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))
[L791] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L792] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3))
[L793] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L794] 3 __unbuffered_p2_EAX = z
[L795] 3 z = z$flush_delayed ? z$mem_tmp : z
[L796] 3 z$flush_delayed = (_Bool)0
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L801] 3 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L840] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z)
[L841] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used
[L842] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used
[L843] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4
[L844] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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=1, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]
[L847] 4 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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=1, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]
[L871] 0 main$tmp_guard0 = __unbuffered_cnt == 4
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t557=-3, t558=-2, t559=-1, t560=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]
[L873] CALL 0 assume_abort_if_not(main$tmp_guard0)
[L3] COND FALSE 0 !(!cond)
[L873] RET 0 assume_abort_if_not(main$tmp_guard0)
[L875] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z)
[L876] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used
[L877] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used
[L878] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0
[L879] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t557=-3, t558=-2, t559=-1, t560=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]
[L882] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0)
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t557=-3, t558=-2, t559=-1, t560=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]
[L884] CALL 0 __VERIFIER_assert(main$tmp_guard1)
[L18] COND TRUE 0 !expression
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]
[L18] 0 reach_error()
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, 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: 869]: 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: 867]: 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: 865]: 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: 863]: 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 9 procedures, 83 locations, 7 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: 45.4s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 41.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 793 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 745 mSDsluCounter, 236 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 173 mSDsCounter, 46 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1850 IncrementalHoareTripleChecker+Invalid, 1896 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 46 mSolverCounterUnsat, 63 mSDtfsCounter, 1850 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 99 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=608occurred in iteration=10, InterpolantAutomatonStates: 88, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 353 NumberOfCodeBlocks, 353 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 303 ConstructedInterpolants, 0 QuantifiedInterpolants, 1548 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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, ConComCheckerStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
[2024-12-02 07:34:41,412 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c930dc56-aece-4316-8ce1-2182e0c38a6f/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0
Received shutdown request...
--- End real Ultimate output ---
Execution finished normally
Writing output log to file Ultimate.log
Writing human readable error path to file UltimateCounterExample.errorpath
Result:
FALSE