./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix053.opt.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/mix053.opt.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 80b1b132 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix053.opt.i ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/mix053.opt.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-?-80b1b13-m [2024-01-31 17:39:18,907 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-31 17:39:19,028 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-31 17:39:19,033 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-31 17:39:19,033 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-31 17:39:19,057 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-31 17:39:19,057 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-31 17:39:19,057 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-31 17:39:19,058 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-31 17:39:19,061 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-31 17:39:19,062 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-31 17:39:19,062 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-31 17:39:19,063 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-31 17:39:19,064 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-31 17:39:19,064 INFO L153 SettingsManager]: * Use SBE=true [2024-01-31 17:39:19,064 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-31 17:39:19,064 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-31 17:39:19,065 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-31 17:39:19,065 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-31 17:39:19,065 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-31 17:39:19,065 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-31 17:39:19,066 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-31 17:39:19,066 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-31 17:39:19,066 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-31 17:39:19,066 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-31 17:39:19,066 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-31 17:39:19,067 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-31 17:39:19,067 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-31 17:39:19,067 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-31 17:39:19,067 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-31 17:39:19,068 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-31 17:39:19,068 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-31 17:39:19,069 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-31 17:39:19,069 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-31 17:39:19,069 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-31 17:39:19,069 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-31 17:39:19,069 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-31 17:39:19,069 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-31 17:39:19,070 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-31 17:39:19,070 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-31 17:39:19,070 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-31 17:39:19,070 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-31 17:39:19,070 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-31 17:39:19,071 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-01-31 17:39:19,274 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-31 17:39:19,300 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-31 17:39:19,302 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-31 17:39:19,303 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-31 17:39:19,314 INFO L274 PluginConnector]: CDTParser initialized [2024-01-31 17:39:19,315 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix053.opt.i [2024-01-31 17:39:20,474 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-31 17:39:20,704 INFO L384 CDTParser]: Found 1 translation units. [2024-01-31 17:39:20,705 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix053.opt.i [2024-01-31 17:39:20,729 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf7b4c6de/fe2c3daedcd845d190ec7622d42e747f/FLAG45f66f8e5 [2024-01-31 17:39:20,744 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf7b4c6de/fe2c3daedcd845d190ec7622d42e747f [2024-01-31 17:39:20,747 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-01-31 17:39:20,747 INFO L274 PluginConnector]: Witness Parser initialized [2024-01-31 17:39:20,749 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/mix053.opt.yml/witness.yml [2024-01-31 17:39:21,404 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-31 17:39:21,433 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-31 17:39:21,434 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-31 17:39:21,434 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-31 17:39:21,437 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-31 17:39:21,452 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 05:39:20" (1/2) ... [2024-01-31 17:39:21,453 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ef71368 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:39:21, skipping insertion in model container [2024-01-31 17:39:21,453 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 05:39:20" (1/2) ... [2024-01-31 17:39:21,454 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@2ac50bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:39:21, skipping insertion in model container [2024-01-31 17:39:21,454 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 31.01 05:39:21" (2/2) ... [2024-01-31 17:39:21,454 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ef71368 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:39:21, skipping insertion in model container [2024-01-31 17:39:21,454 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 31.01 05:39:21" (2/2) ... [2024-01-31 17:39:21,455 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-01-31 17:39:23,053 INFO L96 nessWitnessExtractor]: Found the following entries in the witness: [2024-01-31 17:39:23,054 INFO L98 nessWitnessExtractor]: Location invariant before [L18-L18] expression == 0 [2024-01-31 17:39:23,054 INFO L98 nessWitnessExtractor]: Location invariant after [L18-L18] expression == 1 [2024-01-31 17:39:23,109 INFO L179 MainTranslator]: Built tables and reachable declarations [2024-01-31 17:39:23,243 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix053.opt.i[944,957] [2024-01-31 17:39:23,335 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-31 17:39:23,343 INFO L204 MainTranslator]: Completed pre-run [2024-01-31 17:39:23,352 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix053.opt.i[944,957] Start Parsing Local [2024-01-31 17:39:23,369 WARN L424 MainDispatcher]: Unable to annotate ; with a witness entry [2024-01-31 17:39:23,407 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-31 17:39:23,434 INFO L208 MainTranslator]: Completed translation [2024-01-31 17:39:23,435 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:39:23 WrapperNode [2024-01-31 17:39:23,435 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-31 17:39:23,436 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-31 17:39:23,436 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-31 17:39:23,436 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-31 17:39:23,441 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:39:23" (1/1) ... [2024-01-31 17:39:23,454 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:39:23" (1/1) ... [2024-01-31 17:39:23,473 INFO L138 Inliner]: procedures = 177, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 144 [2024-01-31 17:39:23,474 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-31 17:39:23,474 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-31 17:39:23,474 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-31 17:39:23,475 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-31 17:39:23,483 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:39:23" (1/1) ... [2024-01-31 17:39:23,484 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:39:23" (1/1) ... [2024-01-31 17:39:23,487 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:39:23" (1/1) ... [2024-01-31 17:39:23,501 INFO L175 MemorySlicer]: Split 6 memory accesses to 5 slices as follows [2, 1, 1, 1, 1]. 33 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0]. The 4 writes are split as follows [0, 1, 1, 1, 1]. [2024-01-31 17:39:23,502 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:39:23" (1/1) ... [2024-01-31 17:39:23,502 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:39:23" (1/1) ... [2024-01-31 17:39:23,509 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:39:23" (1/1) ... [2024-01-31 17:39:23,511 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:39:23" (1/1) ... [2024-01-31 17:39:23,512 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:39:23" (1/1) ... [2024-01-31 17:39:23,513 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:39:23" (1/1) ... [2024-01-31 17:39:23,516 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-31 17:39:23,517 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-31 17:39:23,517 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-31 17:39:23,517 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-31 17:39:23,518 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:39:23" (1/1) ... [2024-01-31 17:39:23,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-31 17:39:23,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-31 17:39:23,549 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-01-31 17:39:23,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-01-31 17:39:23,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-31 17:39:23,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-31 17:39:23,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-31 17:39:23,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-31 17:39:23,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-01-31 17:39:23,576 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-01-31 17:39:23,576 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-31 17:39:23,576 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-31 17:39:23,577 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-31 17:39:23,577 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-01-31 17:39:23,577 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-01-31 17:39:23,577 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-01-31 17:39:23,577 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-01-31 17:39:23,577 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-01-31 17:39:23,577 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-01-31 17:39:23,577 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-01-31 17:39:23,578 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-01-31 17:39:23,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-31 17:39:23,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-31 17:39:23,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-31 17:39:23,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-31 17:39:23,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-01-31 17:39:23,578 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-01-31 17:39:23,578 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-31 17:39:23,579 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-31 17:39:23,580 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-31 17:39:23,742 INFO L244 CfgBuilder]: Building ICFG [2024-01-31 17:39:23,744 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-31 17:39:23,923 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-31 17:39:23,923 INFO L293 CfgBuilder]: Performing block encoding [2024-01-31 17:39:24,037 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-31 17:39:24,037 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-01-31 17:39:24,038 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 05:39:24 BoogieIcfgContainer [2024-01-31 17:39:24,038 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-31 17:39:24,039 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-31 17:39:24,039 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-31 17:39:24,042 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-31 17:39:24,042 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 05:39:20" (1/4) ... [2024-01-31 17:39:24,042 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c6b50cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 05:39:24, skipping insertion in model container [2024-01-31 17:39:24,043 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 31.01 05:39:21" (2/4) ... [2024-01-31 17:39:24,043 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c6b50cb and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 31.01 05:39:24, skipping insertion in model container [2024-01-31 17:39:24,043 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:39:23" (3/4) ... [2024-01-31 17:39:24,043 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c6b50cb and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 31.01 05:39:24, skipping insertion in model container [2024-01-31 17:39:24,043 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 05:39:24" (4/4) ... [2024-01-31 17:39:24,044 INFO L112 eAbstractionObserver]: Analyzing ICFG mix053.opt.i [2024-01-31 17:39:24,058 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-31 17:39:24,058 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-01-31 17:39:24,058 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-31 17:39:24,093 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-01-31 17:39:24,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 51 transitions, 118 flow [2024-01-31 17:39:24,139 INFO L124 PetriNetUnfolderBase]: 1/47 cut-off events. [2024-01-31 17:39:24,140 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-31 17:39:24,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60 conditions, 47 events. 1/47 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 100 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 51. Up to 2 conditions per place. [2024-01-31 17:39:24,143 INFO L82 GeneralOperation]: Start removeDead. Operand has 63 places, 51 transitions, 118 flow [2024-01-31 17:39:24,146 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 59 places, 47 transitions, 106 flow [2024-01-31 17:39:24,153 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-31 17:39:24,158 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, 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;@6b96f9e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-31 17:39:24,159 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2024-01-31 17:39:24,165 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-31 17:39:24,166 INFO L124 PetriNetUnfolderBase]: 0/27 cut-off events. [2024-01-31 17:39:24,166 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-31 17:39:24,166 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:39:24,167 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:39:24,167 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [P3Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P3Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-01-31 17:39:24,171 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:39:24,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1824146210, now seen corresponding path program 1 times [2024-01-31 17:39:24,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:39:24,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040969656] [2024-01-31 17:39:24,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:39:24,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:39:24,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:39:24,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:39:24,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:39:24,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040969656] [2024-01-31 17:39:24,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040969656] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:39:24,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:39:24,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-31 17:39:24,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378584277] [2024-01-31 17:39:24,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:39:24,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-01-31 17:39:24,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:39:24,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-01-31 17:39:24,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-01-31 17:39:24,364 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 51 [2024-01-31 17:39:24,365 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 47 transitions, 106 flow. Second operand has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 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-01-31 17:39:24,366 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:39:24,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 51 [2024-01-31 17:39:24,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:39:24,584 INFO L124 PetriNetUnfolderBase]: 879/1763 cut-off events. [2024-01-31 17:39:24,584 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-31 17:39:24,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3083 conditions, 1763 events. 879/1763 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 13984 event pairs, 879 based on Foata normal form. 60/1570 useless extension candidates. Maximal degree in co-relation 3071. Up to 1277 conditions per place. [2024-01-31 17:39:24,599 INFO L140 encePairwiseOnDemand]: 49/51 looper letters, 21 selfloop transitions, 0 changer transitions 0/45 dead transitions. [2024-01-31 17:39:24,599 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 45 transitions, 144 flow [2024-01-31 17:39:24,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-31 17:39:24,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-01-31 17:39:24,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 79 transitions. [2024-01-31 17:39:24,608 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7745098039215687 [2024-01-31 17:39:24,609 INFO L175 Difference]: Start difference. First operand has 59 places, 47 transitions, 106 flow. Second operand 2 states and 79 transitions. [2024-01-31 17:39:24,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 45 transitions, 144 flow [2024-01-31 17:39:24,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 45 transitions, 140 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-01-31 17:39:24,613 INFO L231 Difference]: Finished difference. Result has 55 places, 45 transitions, 98 flow [2024-01-31 17:39:24,614 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=98, PETRI_PLACES=55, PETRI_TRANSITIONS=45} [2024-01-31 17:39:24,617 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -4 predicate places. [2024-01-31 17:39:24,617 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 45 transitions, 98 flow [2024-01-31 17:39:24,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 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-01-31 17:39:24,617 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:39:24,617 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:39:24,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-31 17:39:24,618 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P3Err1ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P3Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-01-31 17:39:24,618 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:39:24,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1824146209, now seen corresponding path program 1 times [2024-01-31 17:39:24,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:39:24,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901172100] [2024-01-31 17:39:24,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:39:24,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:39:24,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:39:24,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:39:24,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:39:24,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901172100] [2024-01-31 17:39:24,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901172100] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:39:24,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:39:24,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-31 17:39:24,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752809265] [2024-01-31 17:39:24,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:39:24,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-31 17:39:24,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:39:24,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-31 17:39:24,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-31 17:39:24,845 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 51 [2024-01-31 17:39:24,846 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 45 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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-01-31 17:39:24,846 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:39:24,846 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 51 [2024-01-31 17:39:24,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:39:24,997 INFO L124 PetriNetUnfolderBase]: 699/1295 cut-off events. [2024-01-31 17:39:24,997 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-31 17:39:25,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2360 conditions, 1295 events. 699/1295 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 8957 event pairs, 159 based on Foata normal form. 0/1234 useless extension candidates. Maximal degree in co-relation 2357. Up to 757 conditions per place. [2024-01-31 17:39:25,006 INFO L140 encePairwiseOnDemand]: 48/51 looper letters, 25 selfloop transitions, 2 changer transitions 2/53 dead transitions. [2024-01-31 17:39:25,007 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 53 transitions, 172 flow [2024-01-31 17:39:25,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-31 17:39:25,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-31 17:39:25,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2024-01-31 17:39:25,008 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7450980392156863 [2024-01-31 17:39:25,009 INFO L175 Difference]: Start difference. First operand has 55 places, 45 transitions, 98 flow. Second operand 3 states and 114 transitions. [2024-01-31 17:39:25,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 53 transitions, 172 flow [2024-01-31 17:39:25,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 53 transitions, 172 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-01-31 17:39:25,011 INFO L231 Difference]: Finished difference. Result has 56 places, 43 transitions, 98 flow [2024-01-31 17:39:25,011 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=56, PETRI_TRANSITIONS=43} [2024-01-31 17:39:25,011 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -3 predicate places. [2024-01-31 17:39:25,012 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 43 transitions, 98 flow [2024-01-31 17:39:25,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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-01-31 17:39:25,012 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:39:25,012 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:39:25,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-31 17:39:25,013 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P3Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P3Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-01-31 17:39:25,013 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:39:25,013 INFO L85 PathProgramCache]: Analyzing trace with hash -954339763, now seen corresponding path program 1 times [2024-01-31 17:39:25,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:39:25,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603593739] [2024-01-31 17:39:25,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:39:25,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:39:25,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:39:25,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:39:25,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:39:25,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603593739] [2024-01-31 17:39:25,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603593739] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:39:25,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:39:25,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-31 17:39:25,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508708722] [2024-01-31 17:39:25,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:39:25,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-31 17:39:25,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:39:25,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-31 17:39:25,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-31 17:39:25,098 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 51 [2024-01-31 17:39:25,099 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 43 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 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-01-31 17:39:25,100 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:39:25,100 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 51 [2024-01-31 17:39:25,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:39:25,277 INFO L124 PetriNetUnfolderBase]: 931/1563 cut-off events. [2024-01-31 17:39:25,278 INFO L125 PetriNetUnfolderBase]: For 96/96 co-relation queries the response was YES. [2024-01-31 17:39:25,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3054 conditions, 1563 events. 931/1563 cut-off events. For 96/96 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 11319 event pairs, 699 based on Foata normal form. 0/1454 useless extension candidates. Maximal degree in co-relation 3050. Up to 1025 conditions per place. [2024-01-31 17:39:25,288 INFO L140 encePairwiseOnDemand]: 49/51 looper letters, 27 selfloop transitions, 1 changer transitions 1/49 dead transitions. [2024-01-31 17:39:25,288 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 49 transitions, 170 flow [2024-01-31 17:39:25,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-31 17:39:25,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-31 17:39:25,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2024-01-31 17:39:25,293 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-01-31 17:39:25,293 INFO L175 Difference]: Start difference. First operand has 56 places, 43 transitions, 98 flow. Second operand 3 states and 102 transitions. [2024-01-31 17:39:25,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 49 transitions, 170 flow [2024-01-31 17:39:25,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 49 transitions, 164 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-31 17:39:25,296 INFO L231 Difference]: Finished difference. Result has 54 places, 41 transitions, 92 flow [2024-01-31 17:39:25,296 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=54, PETRI_TRANSITIONS=41} [2024-01-31 17:39:25,298 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -5 predicate places. [2024-01-31 17:39:25,298 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 41 transitions, 92 flow [2024-01-31 17:39:25,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 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-01-31 17:39:25,298 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:39:25,298 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:39:25,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-31 17:39:25,299 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P3Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-01-31 17:39:25,299 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:39:25,299 INFO L85 PathProgramCache]: Analyzing trace with hash 480238799, now seen corresponding path program 1 times [2024-01-31 17:39:25,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:39:25,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145465780] [2024-01-31 17:39:25,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:39:25,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:39:25,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:39:25,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:39:25,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:39:25,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145465780] [2024-01-31 17:39:25,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145465780] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:39:25,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:39:25,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-31 17:39:25,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159510286] [2024-01-31 17:39:25,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:39:25,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-31 17:39:25,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:39:25,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-31 17:39:25,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-01-31 17:39:25,521 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 51 [2024-01-31 17:39:25,521 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 41 transitions, 92 flow. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 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-01-31 17:39:25,521 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:39:25,522 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 51 [2024-01-31 17:39:25,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:39:26,965 INFO L124 PetriNetUnfolderBase]: 11751/18217 cut-off events. [2024-01-31 17:39:26,966 INFO L125 PetriNetUnfolderBase]: For 418/418 co-relation queries the response was YES. [2024-01-31 17:39:26,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34997 conditions, 18217 events. 11751/18217 cut-off events. For 418/418 co-relation queries the response was YES. Maximal size of possible extension queue 1096. Compared 140472 event pairs, 3409 based on Foata normal form. 424/18417 useless extension candidates. Maximal degree in co-relation 34993. Up to 7387 conditions per place. [2024-01-31 17:39:27,213 INFO L140 encePairwiseOnDemand]: 41/51 looper letters, 42 selfloop transitions, 7 changer transitions 51/114 dead transitions. [2024-01-31 17:39:27,214 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 114 transitions, 444 flow [2024-01-31 17:39:27,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-31 17:39:27,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-01-31 17:39:27,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 228 transitions. [2024-01-31 17:39:27,215 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6386554621848739 [2024-01-31 17:39:27,215 INFO L175 Difference]: Start difference. First operand has 54 places, 41 transitions, 92 flow. Second operand 7 states and 228 transitions. [2024-01-31 17:39:27,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 114 transitions, 444 flow [2024-01-31 17:39:27,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 114 transitions, 442 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-31 17:39:27,259 INFO L231 Difference]: Finished difference. Result has 64 places, 47 transitions, 177 flow [2024-01-31 17:39:27,259 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=91, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=177, PETRI_PLACES=64, PETRI_TRANSITIONS=47} [2024-01-31 17:39:27,259 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 5 predicate places. [2024-01-31 17:39:27,260 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 47 transitions, 177 flow [2024-01-31 17:39:27,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 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-01-31 17:39:27,260 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:39:27,260 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:39:27,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-31 17:39:27,261 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P3Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-01-31 17:39:27,261 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:39:27,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1717491982, now seen corresponding path program 1 times [2024-01-31 17:39:27,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:39:27,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584449212] [2024-01-31 17:39:27,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:39:27,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:39:27,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:39:27,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:39:27,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:39:27,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584449212] [2024-01-31 17:39:27,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584449212] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:39:27,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:39:27,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-31 17:39:27,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498587831] [2024-01-31 17:39:27,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:39:27,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-31 17:39:27,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:39:27,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-31 17:39:27,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-01-31 17:39:27,418 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 51 [2024-01-31 17:39:27,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 47 transitions, 177 flow. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 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-01-31 17:39:27,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:39:27,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 51 [2024-01-31 17:39:27,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:39:28,981 INFO L124 PetriNetUnfolderBase]: 10639/17203 cut-off events. [2024-01-31 17:39:28,982 INFO L125 PetriNetUnfolderBase]: For 18163/18169 co-relation queries the response was YES. [2024-01-31 17:39:29,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48408 conditions, 17203 events. 10639/17203 cut-off events. For 18163/18169 co-relation queries the response was YES. Maximal size of possible extension queue 1015. Compared 137716 event pairs, 1050 based on Foata normal form. 394/17498 useless extension candidates. Maximal degree in co-relation 48399. Up to 6555 conditions per place. [2024-01-31 17:39:29,082 INFO L140 encePairwiseOnDemand]: 41/51 looper letters, 57 selfloop transitions, 11 changer transitions 78/160 dead transitions. [2024-01-31 17:39:29,082 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 160 transitions, 982 flow [2024-01-31 17:39:29,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-01-31 17:39:29,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-01-31 17:39:29,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 316 transitions. [2024-01-31 17:39:29,084 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6196078431372549 [2024-01-31 17:39:29,084 INFO L175 Difference]: Start difference. First operand has 64 places, 47 transitions, 177 flow. Second operand 10 states and 316 transitions. [2024-01-31 17:39:29,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 160 transitions, 982 flow [2024-01-31 17:39:29,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 160 transitions, 914 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-31 17:39:29,111 INFO L231 Difference]: Finished difference. Result has 76 places, 54 transitions, 287 flow [2024-01-31 17:39:29,111 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=287, PETRI_PLACES=76, PETRI_TRANSITIONS=54} [2024-01-31 17:39:29,112 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 17 predicate places. [2024-01-31 17:39:29,112 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 54 transitions, 287 flow [2024-01-31 17:39:29,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 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-01-31 17:39:29,113 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:39:29,113 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:39:29,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-31 17:39:29,113 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P3Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-01-31 17:39:29,113 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:39:29,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1375645618, now seen corresponding path program 1 times [2024-01-31 17:39:29,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:39:29,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274575390] [2024-01-31 17:39:29,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:39:29,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:39:29,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:39:29,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:39:29,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:39:29,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274575390] [2024-01-31 17:39:29,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274575390] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:39:29,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:39:29,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-31 17:39:29,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265542077] [2024-01-31 17:39:29,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:39:29,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-31 17:39:29,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:39:29,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-31 17:39:29,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-01-31 17:39:29,390 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 51 [2024-01-31 17:39:29,390 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 54 transitions, 287 flow. Second operand has 5 states, 5 states have (on average 24.0) internal successors, (120), 5 states have internal predecessors, (120), 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-01-31 17:39:29,390 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:39:29,390 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 51 [2024-01-31 17:39:29,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:39:30,710 INFO L124 PetriNetUnfolderBase]: 7981/13425 cut-off events. [2024-01-31 17:39:30,710 INFO L125 PetriNetUnfolderBase]: For 33285/33842 co-relation queries the response was YES. [2024-01-31 17:39:30,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41250 conditions, 13425 events. 7981/13425 cut-off events. For 33285/33842 co-relation queries the response was YES. Maximal size of possible extension queue 856. Compared 109241 event pairs, 3355 based on Foata normal form. 606/13647 useless extension candidates. Maximal degree in co-relation 41233. Up to 8713 conditions per place. [2024-01-31 17:39:30,795 INFO L140 encePairwiseOnDemand]: 45/51 looper letters, 42 selfloop transitions, 6 changer transitions 41/114 dead transitions. [2024-01-31 17:39:30,796 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 114 transitions, 763 flow [2024-01-31 17:39:30,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-31 17:39:30,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-01-31 17:39:30,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 224 transitions. [2024-01-31 17:39:30,797 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6274509803921569 [2024-01-31 17:39:30,797 INFO L175 Difference]: Start difference. First operand has 76 places, 54 transitions, 287 flow. Second operand 7 states and 224 transitions. [2024-01-31 17:39:30,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 114 transitions, 763 flow [2024-01-31 17:39:30,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 114 transitions, 747 flow, removed 8 selfloop flow, removed 0 redundant places. [2024-01-31 17:39:30,865 INFO L231 Difference]: Finished difference. Result has 81 places, 59 transitions, 369 flow [2024-01-31 17:39:30,865 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=369, PETRI_PLACES=81, PETRI_TRANSITIONS=59} [2024-01-31 17:39:30,866 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 22 predicate places. [2024-01-31 17:39:30,866 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 59 transitions, 369 flow [2024-01-31 17:39:30,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.0) internal successors, (120), 5 states have internal predecessors, (120), 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-01-31 17:39:30,866 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:39:30,867 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:39:30,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-31 17:39:30,867 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P3Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-01-31 17:39:30,867 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:39:30,867 INFO L85 PathProgramCache]: Analyzing trace with hash 662085937, now seen corresponding path program 1 times [2024-01-31 17:39:30,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:39:30,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666097672] [2024-01-31 17:39:30,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:39:30,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:39:30,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:39:30,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:39:30,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:39:30,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666097672] [2024-01-31 17:39:30,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666097672] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:39:30,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:39:30,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-31 17:39:30,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634012155] [2024-01-31 17:39:30,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:39:30,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-31 17:39:30,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:39:30,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-31 17:39:30,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-31 17:39:30,969 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 51 [2024-01-31 17:39:30,970 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 59 transitions, 369 flow. Second operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 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-01-31 17:39:30,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:39:30,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 51 [2024-01-31 17:39:30,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:39:32,940 INFO L124 PetriNetUnfolderBase]: 14389/23309 cut-off events. [2024-01-31 17:39:32,941 INFO L125 PetriNetUnfolderBase]: For 40315/43779 co-relation queries the response was YES. [2024-01-31 17:39:33,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63525 conditions, 23309 events. 14389/23309 cut-off events. For 40315/43779 co-relation queries the response was YES. Maximal size of possible extension queue 1283. Compared 190294 event pairs, 2382 based on Foata normal form. 1279/23764 useless extension candidates. Maximal degree in co-relation 63502. Up to 11377 conditions per place. [2024-01-31 17:39:33,101 INFO L140 encePairwiseOnDemand]: 44/51 looper letters, 47 selfloop transitions, 6 changer transitions 0/87 dead transitions. [2024-01-31 17:39:33,102 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 87 transitions, 561 flow [2024-01-31 17:39:33,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-31 17:39:33,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-31 17:39:33,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 144 transitions. [2024-01-31 17:39:33,103 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7058823529411765 [2024-01-31 17:39:33,103 INFO L175 Difference]: Start difference. First operand has 81 places, 59 transitions, 369 flow. Second operand 4 states and 144 transitions. [2024-01-31 17:39:33,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 87 transitions, 561 flow [2024-01-31 17:39:33,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 87 transitions, 527 flow, removed 14 selfloop flow, removed 7 redundant places. [2024-01-31 17:39:33,132 INFO L231 Difference]: Finished difference. Result has 75 places, 64 transitions, 381 flow [2024-01-31 17:39:33,132 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=335, PETRI_DIFFERENCE_MINUEND_PLACES=70, 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=4, PETRI_FLOW=381, PETRI_PLACES=75, PETRI_TRANSITIONS=64} [2024-01-31 17:39:33,133 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 16 predicate places. [2024-01-31 17:39:33,133 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 64 transitions, 381 flow [2024-01-31 17:39:33,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 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-01-31 17:39:33,134 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:39:33,134 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:39:33,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-31 17:39:33,134 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P3Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-01-31 17:39:33,134 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:39:33,135 INFO L85 PathProgramCache]: Analyzing trace with hash -405268977, now seen corresponding path program 1 times [2024-01-31 17:39:33,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:39:33,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744012107] [2024-01-31 17:39:33,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:39:33,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:39:33,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:39:33,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:39:33,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:39:33,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744012107] [2024-01-31 17:39:33,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744012107] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:39:33,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:39:33,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-01-31 17:39:33,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708690019] [2024-01-31 17:39:33,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:39:33,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-31 17:39:33,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:39:33,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-31 17:39:33,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-01-31 17:39:33,328 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 51 [2024-01-31 17:39:33,328 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 64 transitions, 381 flow. Second operand has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 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-01-31 17:39:33,330 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:39:33,330 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 51 [2024-01-31 17:39:33,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:39:37,905 INFO L124 PetriNetUnfolderBase]: 24332/39094 cut-off events. [2024-01-31 17:39:37,906 INFO L125 PetriNetUnfolderBase]: For 88335/89119 co-relation queries the response was YES. [2024-01-31 17:39:38,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122054 conditions, 39094 events. 24332/39094 cut-off events. For 88335/89119 co-relation queries the response was YES. Maximal size of possible extension queue 2037. Compared 338737 event pairs, 7864 based on Foata normal form. 741/36783 useless extension candidates. Maximal degree in co-relation 122035. Up to 12966 conditions per place. [2024-01-31 17:39:38,218 INFO L140 encePairwiseOnDemand]: 41/51 looper letters, 111 selfloop transitions, 29 changer transitions 14/173 dead transitions. [2024-01-31 17:39:38,218 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 173 transitions, 1231 flow [2024-01-31 17:39:38,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-01-31 17:39:38,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-01-31 17:39:38,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 314 transitions. [2024-01-31 17:39:38,220 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.615686274509804 [2024-01-31 17:39:38,220 INFO L175 Difference]: Start difference. First operand has 75 places, 64 transitions, 381 flow. Second operand 10 states and 314 transitions. [2024-01-31 17:39:38,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 173 transitions, 1231 flow [2024-01-31 17:39:38,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 173 transitions, 1219 flow, removed 5 selfloop flow, removed 1 redundant places. [2024-01-31 17:39:38,366 INFO L231 Difference]: Finished difference. Result has 91 places, 80 transitions, 640 flow [2024-01-31 17:39:38,367 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=373, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=640, PETRI_PLACES=91, PETRI_TRANSITIONS=80} [2024-01-31 17:39:38,369 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 32 predicate places. [2024-01-31 17:39:38,369 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 80 transitions, 640 flow [2024-01-31 17:39:38,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 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-01-31 17:39:38,370 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:39:38,370 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:39:38,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-31 17:39:38,370 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P3Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-01-31 17:39:38,370 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:39:38,371 INFO L85 PathProgramCache]: Analyzing trace with hash -92435085, now seen corresponding path program 1 times [2024-01-31 17:39:38,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:39:38,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689719460] [2024-01-31 17:39:38,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:39:38,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:39:38,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:39:38,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:39:38,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:39:38,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689719460] [2024-01-31 17:39:38,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689719460] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:39:38,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:39:38,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-31 17:39:38,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099703759] [2024-01-31 17:39:38,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:39:38,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-31 17:39:38,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:39:38,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-31 17:39:38,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-01-31 17:39:38,500 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 51 [2024-01-31 17:39:38,500 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 80 transitions, 640 flow. Second operand has 5 states, 5 states have (on average 25.8) internal successors, (129), 5 states have internal predecessors, (129), 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-01-31 17:39:38,500 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:39:38,500 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 51 [2024-01-31 17:39:38,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:39:41,607 INFO L124 PetriNetUnfolderBase]: 20673/32328 cut-off events. [2024-01-31 17:39:41,607 INFO L125 PetriNetUnfolderBase]: For 72750/79240 co-relation queries the response was YES. [2024-01-31 17:39:41,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98813 conditions, 32328 events. 20673/32328 cut-off events. For 72750/79240 co-relation queries the response was YES. Maximal size of possible extension queue 1742. Compared 259836 event pairs, 2119 based on Foata normal form. 2006/33355 useless extension candidates. Maximal degree in co-relation 98786. Up to 13365 conditions per place. [2024-01-31 17:39:42,063 INFO L140 encePairwiseOnDemand]: 44/51 looper letters, 65 selfloop transitions, 10 changer transitions 8/124 dead transitions. [2024-01-31 17:39:42,064 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 124 transitions, 985 flow [2024-01-31 17:39:42,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-31 17:39:42,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-31 17:39:42,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 184 transitions. [2024-01-31 17:39:42,065 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7215686274509804 [2024-01-31 17:39:42,066 INFO L175 Difference]: Start difference. First operand has 91 places, 80 transitions, 640 flow. Second operand 5 states and 184 transitions. [2024-01-31 17:39:42,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 124 transitions, 985 flow [2024-01-31 17:39:42,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 124 transitions, 949 flow, removed 18 selfloop flow, removed 0 redundant places. [2024-01-31 17:39:42,379 INFO L231 Difference]: Finished difference. Result has 97 places, 77 transitions, 587 flow [2024-01-31 17:39:42,379 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=604, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=587, PETRI_PLACES=97, PETRI_TRANSITIONS=77} [2024-01-31 17:39:42,380 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 38 predicate places. [2024-01-31 17:39:42,380 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 77 transitions, 587 flow [2024-01-31 17:39:42,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.8) internal successors, (129), 5 states have internal predecessors, (129), 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-01-31 17:39:42,380 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:39:42,380 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:39:42,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-31 17:39:42,381 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P3Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-01-31 17:39:42,381 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:39:42,381 INFO L85 PathProgramCache]: Analyzing trace with hash -888443897, now seen corresponding path program 1 times [2024-01-31 17:39:42,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:39:42,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409591856] [2024-01-31 17:39:42,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:39:42,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:39:42,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:39:42,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:39:42,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:39:42,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409591856] [2024-01-31 17:39:42,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409591856] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:39:42,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:39:42,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-31 17:39:42,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409360485] [2024-01-31 17:39:42,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:39:42,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-31 17:39:42,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:39:42,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-31 17:39:42,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-01-31 17:39:42,706 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 51 [2024-01-31 17:39:42,707 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 77 transitions, 587 flow. Second operand has 6 states, 6 states have (on average 25.666666666666668) internal successors, (154), 6 states have internal predecessors, (154), 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-01-31 17:39:42,707 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:39:42,707 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 51 [2024-01-31 17:39:42,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:39:45,162 INFO L124 PetriNetUnfolderBase]: 15473/23672 cut-off events. [2024-01-31 17:39:45,162 INFO L125 PetriNetUnfolderBase]: For 49658/56892 co-relation queries the response was YES. [2024-01-31 17:39:45,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77369 conditions, 23672 events. 15473/23672 cut-off events. For 49658/56892 co-relation queries the response was YES. Maximal size of possible extension queue 1382. Compared 177671 event pairs, 935 based on Foata normal form. 1537/24362 useless extension candidates. Maximal degree in co-relation 77339. Up to 7752 conditions per place. [2024-01-31 17:39:45,285 INFO L140 encePairwiseOnDemand]: 44/51 looper letters, 76 selfloop transitions, 14 changer transitions 2/132 dead transitions. [2024-01-31 17:39:45,286 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 132 transitions, 1012 flow [2024-01-31 17:39:45,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-31 17:39:45,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-31 17:39:45,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 222 transitions. [2024-01-31 17:39:45,296 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7254901960784313 [2024-01-31 17:39:45,296 INFO L175 Difference]: Start difference. First operand has 97 places, 77 transitions, 587 flow. Second operand 6 states and 222 transitions. [2024-01-31 17:39:45,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 132 transitions, 1012 flow [2024-01-31 17:39:45,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 132 transitions, 984 flow, removed 10 selfloop flow, removed 5 redundant places. [2024-01-31 17:39:45,346 INFO L231 Difference]: Finished difference. Result has 96 places, 81 transitions, 633 flow [2024-01-31 17:39:45,347 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=548, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=633, PETRI_PLACES=96, PETRI_TRANSITIONS=81} [2024-01-31 17:39:45,347 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 37 predicate places. [2024-01-31 17:39:45,349 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 81 transitions, 633 flow [2024-01-31 17:39:45,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.666666666666668) internal successors, (154), 6 states have internal predecessors, (154), 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-01-31 17:39:45,349 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:39:45,349 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:39:45,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-01-31 17:39:45,350 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P3Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-01-31 17:39:45,350 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:39:45,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1551048260, now seen corresponding path program 1 times [2024-01-31 17:39:45,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:39:45,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64063868] [2024-01-31 17:39:45,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:39:45,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:39:45,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:39:45,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:39:45,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:39:45,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64063868] [2024-01-31 17:39:45,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64063868] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:39:45,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:39:45,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-01-31 17:39:45,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170904831] [2024-01-31 17:39:45,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:39:45,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-01-31 17:39:45,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:39:45,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-01-31 17:39:45,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-01-31 17:39:45,611 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 51 [2024-01-31 17:39:45,611 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 81 transitions, 633 flow. Second operand has 7 states, 7 states have (on average 25.428571428571427) internal successors, (178), 7 states have internal predecessors, (178), 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-01-31 17:39:45,611 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:39:45,612 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 51 [2024-01-31 17:39:45,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:39:47,820 INFO L124 PetriNetUnfolderBase]: 13633/20480 cut-off events. [2024-01-31 17:39:47,821 INFO L125 PetriNetUnfolderBase]: For 59847/67210 co-relation queries the response was YES. [2024-01-31 17:39:47,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72840 conditions, 20480 events. 13633/20480 cut-off events. For 59847/67210 co-relation queries the response was YES. Maximal size of possible extension queue 1382. Compared 150587 event pairs, 835 based on Foata normal form. 998/20655 useless extension candidates. Maximal degree in co-relation 72811. Up to 7752 conditions per place. [2024-01-31 17:39:47,971 INFO L140 encePairwiseOnDemand]: 44/51 looper letters, 70 selfloop transitions, 18 changer transitions 2/127 dead transitions. [2024-01-31 17:39:47,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 127 transitions, 971 flow [2024-01-31 17:39:47,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-31 17:39:47,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-01-31 17:39:47,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 244 transitions. [2024-01-31 17:39:47,975 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6834733893557423 [2024-01-31 17:39:47,975 INFO L175 Difference]: Start difference. First operand has 96 places, 81 transitions, 633 flow. Second operand 7 states and 244 transitions. [2024-01-31 17:39:47,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 127 transitions, 971 flow [2024-01-31 17:39:48,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 127 transitions, 897 flow, removed 29 selfloop flow, removed 11 redundant places. [2024-01-31 17:39:48,172 INFO L231 Difference]: Finished difference. Result has 91 places, 79 transitions, 591 flow [2024-01-31 17:39:48,172 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=536, PETRI_DIFFERENCE_MINUEND_PLACES=83, 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=591, PETRI_PLACES=91, PETRI_TRANSITIONS=79} [2024-01-31 17:39:48,173 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 32 predicate places. [2024-01-31 17:39:48,173 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 79 transitions, 591 flow [2024-01-31 17:39:48,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.428571428571427) internal successors, (178), 7 states have internal predecessors, (178), 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-01-31 17:39:48,190 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:39:48,190 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:39:48,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-01-31 17:39:48,190 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P3Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-01-31 17:39:48,190 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:39:48,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1310400789, now seen corresponding path program 1 times [2024-01-31 17:39:48,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:39:48,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17656749] [2024-01-31 17:39:48,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:39:48,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:39:48,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:39:48,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:39:48,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:39:48,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17656749] [2024-01-31 17:39:48,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17656749] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:39:48,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:39:48,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-01-31 17:39:48,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125097920] [2024-01-31 17:39:48,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:39:48,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-31 17:39:48,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:39:48,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-31 17:39:48,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-01-31 17:39:48,578 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 51 [2024-01-31 17:39:48,578 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 79 transitions, 591 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-01-31 17:39:48,578 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:39:48,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 51 [2024-01-31 17:39:48,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:39:50,737 INFO L124 PetriNetUnfolderBase]: 11268/20882 cut-off events. [2024-01-31 17:39:50,738 INFO L125 PetriNetUnfolderBase]: For 52519/56844 co-relation queries the response was YES. [2024-01-31 17:39:50,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66981 conditions, 20882 events. 11268/20882 cut-off events. For 52519/56844 co-relation queries the response was YES. Maximal size of possible extension queue 1681. Compared 201743 event pairs, 3492 based on Foata normal form. 609/18891 useless extension candidates. Maximal degree in co-relation 66958. Up to 7314 conditions per place. [2024-01-31 17:39:50,889 INFO L140 encePairwiseOnDemand]: 46/51 looper letters, 50 selfloop transitions, 6 changer transitions 12/117 dead transitions. [2024-01-31 17:39:50,889 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 117 transitions, 891 flow [2024-01-31 17:39:50,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-31 17:39:50,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-31 17:39:50,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 184 transitions. [2024-01-31 17:39:50,890 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6013071895424836 [2024-01-31 17:39:50,890 INFO L175 Difference]: Start difference. First operand has 91 places, 79 transitions, 591 flow. Second operand 6 states and 184 transitions. [2024-01-31 17:39:50,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 117 transitions, 891 flow [2024-01-31 17:39:51,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 117 transitions, 804 flow, removed 32 selfloop flow, removed 7 redundant places. [2024-01-31 17:39:51,635 INFO L231 Difference]: Finished difference. Result has 92 places, 82 transitions, 577 flow [2024-01-31 17:39:51,635 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=518, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=577, PETRI_PLACES=92, PETRI_TRANSITIONS=82} [2024-01-31 17:39:51,636 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 33 predicate places. [2024-01-31 17:39:51,636 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 82 transitions, 577 flow [2024-01-31 17:39:51,636 INFO L496 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-01-31 17:39:51,636 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:39:51,636 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:39:51,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-01-31 17:39:51,637 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P3Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-01-31 17:39:51,638 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:39:51,638 INFO L85 PathProgramCache]: Analyzing trace with hash 401017967, now seen corresponding path program 2 times [2024-01-31 17:39:51,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:39:51,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859481186] [2024-01-31 17:39:51,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:39:51,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:39:51,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:39:52,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:39:52,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:39:52,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859481186] [2024-01-31 17:39:52,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859481186] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:39:52,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:39:52,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-01-31 17:39:52,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630015354] [2024-01-31 17:39:52,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:39:52,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-01-31 17:39:52,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:39:52,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-01-31 17:39:52,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-01-31 17:39:52,075 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 51 [2024-01-31 17:39:52,075 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 82 transitions, 577 flow. Second operand has 8 states, 8 states have (on average 25.25) internal successors, (202), 8 states have internal predecessors, (202), 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-01-31 17:39:52,075 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:39:52,075 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 51 [2024-01-31 17:39:52,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:39:54,706 INFO L124 PetriNetUnfolderBase]: 13912/26580 cut-off events. [2024-01-31 17:39:54,706 INFO L125 PetriNetUnfolderBase]: For 42692/46753 co-relation queries the response was YES. [2024-01-31 17:39:54,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76495 conditions, 26580 events. 13912/26580 cut-off events. For 42692/46753 co-relation queries the response was YES. Maximal size of possible extension queue 2371. Compared 277414 event pairs, 1978 based on Foata normal form. 645/24368 useless extension candidates. Maximal degree in co-relation 76471. Up to 6643 conditions per place. [2024-01-31 17:39:54,916 INFO L140 encePairwiseOnDemand]: 43/51 looper letters, 40 selfloop transitions, 7 changer transitions 16/121 dead transitions. [2024-01-31 17:39:54,916 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 121 transitions, 843 flow [2024-01-31 17:39:54,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-01-31 17:39:54,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-01-31 17:39:54,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 265 transitions. [2024-01-31 17:39:54,917 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5773420479302832 [2024-01-31 17:39:54,918 INFO L175 Difference]: Start difference. First operand has 92 places, 82 transitions, 577 flow. Second operand 9 states and 265 transitions. [2024-01-31 17:39:54,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 121 transitions, 843 flow [2024-01-31 17:39:55,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 121 transitions, 836 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-01-31 17:39:55,665 INFO L231 Difference]: Finished difference. Result has 99 places, 85 transitions, 628 flow [2024-01-31 17:39:55,665 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=572, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=628, PETRI_PLACES=99, PETRI_TRANSITIONS=85} [2024-01-31 17:39:55,666 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 40 predicate places. [2024-01-31 17:39:55,666 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 85 transitions, 628 flow [2024-01-31 17:39:55,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 25.25) internal successors, (202), 8 states have internal predecessors, (202), 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-01-31 17:39:55,667 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:39:55,667 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:39:55,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-01-31 17:39:55,667 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P3Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-01-31 17:39:55,668 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:39:55,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1059827557, now seen corresponding path program 3 times [2024-01-31 17:39:55,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:39:55,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774222485] [2024-01-31 17:39:55,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:39:55,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:39:55,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-31 17:39:55,874 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-31 17:39:55,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-31 17:39:55,942 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-31 17:39:55,942 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-31 17:39:55,943 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (9 of 10 remaining) [2024-01-31 17:39:55,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 10 remaining) [2024-01-31 17:39:55,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1ASSERT_VIOLATIONERROR_FUNCTION (7 of 10 remaining) [2024-01-31 17:39:55,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 10 remaining) [2024-01-31 17:39:55,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 10 remaining) [2024-01-31 17:39:55,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 10 remaining) [2024-01-31 17:39:55,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 10 remaining) [2024-01-31 17:39:55,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 10 remaining) [2024-01-31 17:39:55,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 10 remaining) [2024-01-31 17:39:55,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1ASSERT_VIOLATIONERROR_FUNCTION (0 of 10 remaining) [2024-01-31 17:39:55,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-01-31 17:39:55,947 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:39:55,952 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-31 17:39:55,953 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-31 17:39:56,044 INFO L503 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-01-31 17:39:56,045 INFO L504 ceAbstractionStarter]: WitnessConsidered=2 [2024-01-31 17:39:56,046 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 05:39:56 BasicIcfg [2024-01-31 17:39:56,047 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-31 17:39:56,047 INFO L158 Benchmark]: Toolchain (without parser) took 34614.56ms. Allocated memory was 239.1MB in the beginning and 13.3GB in the end (delta: 13.1GB). Free memory was 180.1MB in the beginning and 11.6GB in the end (delta: -11.4GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. [2024-01-31 17:39:56,047 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 125.8MB. Free memory was 87.4MB in the beginning and 87.4MB in the end (delta: 69.3kB). There was no memory consumed. Max. memory is 16.1GB. [2024-01-31 17:39:56,047 INFO L158 Benchmark]: Witness Parser took 0.49ms. Allocated memory is still 239.1MB. Free memory is still 207.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-31 17:39:56,048 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2001.32ms. Allocated memory was 239.1MB in the beginning and 446.7MB in the end (delta: 207.6MB). Free memory was 180.1MB in the beginning and 370.8MB in the end (delta: -190.7MB). Peak memory consumption was 197.9MB. Max. memory is 16.1GB. [2024-01-31 17:39:56,048 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.13ms. Allocated memory is still 446.7MB. Free memory was 369.7MB in the beginning and 367.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-31 17:39:56,048 INFO L158 Benchmark]: Boogie Preprocessor took 42.09ms. Allocated memory is still 446.7MB. Free memory was 367.7MB in the beginning and 364.5MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-01-31 17:39:56,048 INFO L158 Benchmark]: RCFGBuilder took 520.99ms. Allocated memory is still 446.7MB. Free memory was 364.5MB in the beginning and 315.2MB in the end (delta: 49.3MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. [2024-01-31 17:39:56,049 INFO L158 Benchmark]: TraceAbstraction took 32007.33ms. Allocated memory was 446.7MB in the beginning and 13.3GB in the end (delta: 12.9GB). Free memory was 314.2MB in the beginning and 11.6GB in the end (delta: -11.3GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. [2024-01-31 17:39:56,050 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.22ms. Allocated memory is still 125.8MB. Free memory was 87.4MB in the beginning and 87.4MB in the end (delta: 69.3kB). There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.49ms. Allocated memory is still 239.1MB. Free memory is still 207.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2001.32ms. Allocated memory was 239.1MB in the beginning and 446.7MB in the end (delta: 207.6MB). Free memory was 180.1MB in the beginning and 370.8MB in the end (delta: -190.7MB). Peak memory consumption was 197.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.13ms. Allocated memory is still 446.7MB. Free memory was 369.7MB in the beginning and 367.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.09ms. Allocated memory is still 446.7MB. Free memory was 367.7MB in the beginning and 364.5MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 520.99ms. Allocated memory is still 446.7MB. Free memory was 364.5MB in the beginning and 315.2MB in the end (delta: 49.3MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. * TraceAbstraction took 32007.33ms. Allocated memory was 446.7MB in the beginning and 13.3GB in the end (delta: 12.9GB). Free memory was 314.2MB in the beginning and 11.6GB in the end (delta: -11.3GB). Peak memory consumption was 1.6GB. 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 a = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L722] 0 int y = 0; [L724] 0 int z = 0; [L725] 0 _Bool z$flush_delayed; [L726] 0 int z$mem_tmp; [L727] 0 _Bool z$r_buff0_thd0; [L728] 0 _Bool z$r_buff0_thd1; [L729] 0 _Bool z$r_buff0_thd2; [L730] 0 _Bool z$r_buff0_thd3; [L731] 0 _Bool z$r_buff0_thd4; [L732] 0 _Bool z$r_buff1_thd0; [L733] 0 _Bool z$r_buff1_thd1; [L734] 0 _Bool z$r_buff1_thd2; [L735] 0 _Bool z$r_buff1_thd3; [L736] 0 _Bool z$r_buff1_thd4; [L737] 0 _Bool z$read_delayed; [L738] 0 int *z$read_delayed_var; [L739] 0 int z$w_buff0; [L740] 0 _Bool z$w_buff0_used; [L741] 0 int z$w_buff1; [L742] 0 _Bool z$w_buff1_used; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L844] 0 pthread_t t1413; [L845] FCALL, FORK 0 pthread_create(&t1413, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1413={5: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] [L846] 0 pthread_t t1414; [L847] FCALL, FORK 0 pthread_create(&t1414, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1413={5:0}, t1414={6: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] [L848] 0 pthread_t t1415; [L849] FCALL, FORK 0 pthread_create(&t1415, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1413={5:0}, t1414={6:0}, t1415={7: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] [L850] 0 pthread_t t1416; [L851] FCALL, FORK 0 pthread_create(&t1416, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1413={5:0}, t1414={6:0}, t1415={7:0}, t1416={3: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] [L806] 4 z$w_buff1 = z$w_buff0 [L807] 4 z$w_buff0 = 1 [L808] 4 z$w_buff1_used = z$w_buff0_used [L809] 4 z$w_buff0_used = (_Bool)1 [L810] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L810] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L811] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L812] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L813] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L814] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L815] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L816] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L819] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L748] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L763] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L766] 2 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L771] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L778] 3 y = 2 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L781] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L782] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L783] 3 z$flush_delayed = weak$$choice2 [L784] 3 z$mem_tmp = z [L785] 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) [L786] 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)) [L787] 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)) [L788] 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)) [L789] 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)) [L790] 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)) [L791] 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)) [L792] 3 __unbuffered_p2_EAX = z [L793] 3 z = z$flush_delayed ? z$mem_tmp : z [L794] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, 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] [L799] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, 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] [L822] 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) [L823] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L824] 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 [L825] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L826] 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 [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, 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] [L829] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, 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] [L853] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1413={5:0}, t1414={6:0}, t1415={7:0}, t1416={3:0}, weak$$choice2=0, 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] [L855] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L855] RET 0 assume_abort_if_not(main$tmp_guard0) [L857] 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) [L858] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L859] 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 [L860] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L861] 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 [__unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1413={5:0}, t1414={6:0}, t1415={7:0}, t1416={3:0}, weak$$choice2=0, 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] [L864] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) VAL [__unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1413={5:0}, t1414={6:0}, t1415={7:0}, t1416={3:0}, weak$$choice2=0, 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] [L866] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=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 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[expression],IntegerLiteral[0]]]] VAL [\old(expression)=0, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=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(expression)=0, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=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 invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - 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: 18]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 851]: 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: 845]: 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: 847]: 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: 849]: 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, 85 locations, 10 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: 31.8s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 28.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 796 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 729 mSDsluCounter, 297 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 209 mSDsCounter, 64 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1628 IncrementalHoareTripleChecker+Invalid, 1692 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 64 mSolverCounterUnsat, 88 mSDtfsCounter, 1628 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 86 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=640occurred in iteration=8, InterpolantAutomatonStates: 79, 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.5s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 330 NumberOfCodeBlocks, 330 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 280 ConstructedInterpolants, 0 QuantifiedInterpolants, 1303 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 RESULT: Ultimate proved your program to be incorrect! [2024-01-31 17:39:56,085 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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