./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix055.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/mix055.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/mix055.opt.i ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/mix055.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:32,333 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-31 17:39:32,381 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:32,385 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-31 17:39:32,385 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-31 17:39:32,399 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-31 17:39:32,399 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-31 17:39:32,400 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-31 17:39:32,400 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-31 17:39:32,400 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-31 17:39:32,401 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-31 17:39:32,401 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-31 17:39:32,401 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-31 17:39:32,411 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-31 17:39:32,412 INFO L153 SettingsManager]: * Use SBE=true [2024-01-31 17:39:32,412 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-31 17:39:32,412 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-31 17:39:32,413 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-31 17:39:32,413 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-31 17:39:32,413 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-31 17:39:32,413 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-31 17:39:32,414 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-31 17:39:32,414 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-31 17:39:32,414 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-31 17:39:32,414 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-31 17:39:32,415 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-31 17:39:32,415 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-31 17:39:32,415 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-31 17:39:32,415 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-31 17:39:32,416 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-31 17:39:32,416 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-31 17:39:32,416 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-31 17:39:32,416 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-31 17:39:32,417 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-31 17:39:32,417 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-31 17:39:32,417 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-31 17:39:32,417 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-31 17:39:32,417 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-31 17:39:32,418 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-31 17:39:32,418 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-31 17:39:32,418 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-31 17:39:32,418 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-31 17:39:32,418 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-31 17:39:32,419 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:32,578 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-31 17:39:32,595 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-31 17:39:32,597 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-31 17:39:32,598 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-31 17:39:32,598 INFO L274 PluginConnector]: CDTParser initialized [2024-01-31 17:39:32,599 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix055.opt.i [2024-01-31 17:39:33,862 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-31 17:39:34,047 INFO L384 CDTParser]: Found 1 translation units. [2024-01-31 17:39:34,048 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix055.opt.i [2024-01-31 17:39:34,058 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/835c4d48e/e96cdb5fd12645c3b747aa907b7d56e3/FLAGc4fd82667 [2024-01-31 17:39:34,067 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/835c4d48e/e96cdb5fd12645c3b747aa907b7d56e3 [2024-01-31 17:39:34,069 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-01-31 17:39:34,070 INFO L274 PluginConnector]: Witness Parser initialized [2024-01-31 17:39:34,070 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/mix055.opt.yml/witness.yml [2024-01-31 17:39:34,557 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-31 17:39:34,559 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-31 17:39:34,562 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-31 17:39:34,562 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-31 17:39:34,566 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-31 17:39:34,566 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 05:39:34" (1/2) ... [2024-01-31 17:39:34,568 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65d17624 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:39:34, skipping insertion in model container [2024-01-31 17:39:34,568 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 05:39:34" (1/2) ... [2024-01-31 17:39:34,570 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@3ed26e4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:39:34, skipping insertion in model container [2024-01-31 17:39:34,570 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:34" (2/2) ... [2024-01-31 17:39:34,570 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65d17624 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:39:34, skipping insertion in model container [2024-01-31 17:39:34,570 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:34" (2/2) ... [2024-01-31 17:39:34,571 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-01-31 17:39:36,213 INFO L96 nessWitnessExtractor]: Found the following entries in the witness: [2024-01-31 17:39:36,214 INFO L98 nessWitnessExtractor]: Location invariant after [L18-L18] expression == 1 [2024-01-31 17:39:36,214 INFO L98 nessWitnessExtractor]: Location invariant before [L18-L18] expression == 0 [2024-01-31 17:39:36,242 INFO L179 MainTranslator]: Built tables and reachable declarations [2024-01-31 17:39:36,359 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/mix055.opt.i[944,957] [2024-01-31 17:39:36,481 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-31 17:39:36,507 INFO L204 MainTranslator]: Completed pre-run [2024-01-31 17:39:36,515 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/mix055.opt.i[944,957] Start Parsing Local [2024-01-31 17:39:36,554 WARN L424 MainDispatcher]: Unable to annotate ; with a witness entry [2024-01-31 17:39:36,599 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-31 17:39:36,630 INFO L208 MainTranslator]: Completed translation [2024-01-31 17:39:36,630 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:39:36 WrapperNode [2024-01-31 17:39:36,631 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-31 17:39:36,631 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-31 17:39:36,632 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-31 17:39:36,632 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-31 17:39:36,638 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:36" (1/1) ... [2024-01-31 17:39:36,668 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:36" (1/1) ... [2024-01-31 17:39:36,700 INFO L138 Inliner]: procedures = 177, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 161 [2024-01-31 17:39:36,704 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-31 17:39:36,704 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-31 17:39:36,704 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-31 17:39:36,704 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-31 17:39:36,713 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:36" (1/1) ... [2024-01-31 17:39:36,713 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:36" (1/1) ... [2024-01-31 17:39:36,716 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:36" (1/1) ... [2024-01-31 17:39:36,735 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:36,736 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:36" (1/1) ... [2024-01-31 17:39:36,736 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:36" (1/1) ... [2024-01-31 17:39:36,746 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:36" (1/1) ... [2024-01-31 17:39:36,751 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:36" (1/1) ... [2024-01-31 17:39:36,753 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:36" (1/1) ... [2024-01-31 17:39:36,761 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:36" (1/1) ... [2024-01-31 17:39:36,764 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-31 17:39:36,765 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-31 17:39:36,765 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-31 17:39:36,765 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-31 17:39:36,765 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:36" (1/1) ... [2024-01-31 17:39:36,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-31 17:39:36,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-31 17:39:36,811 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:36,829 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:36,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-31 17:39:36,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-31 17:39:36,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-31 17:39:36,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-31 17:39:36,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-01-31 17:39:36,844 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-01-31 17:39:36,844 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-31 17:39:36,844 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-31 17:39:36,844 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-31 17:39:36,844 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-01-31 17:39:36,844 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-01-31 17:39:36,845 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-01-31 17:39:36,845 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-01-31 17:39:36,845 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-01-31 17:39:36,845 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-01-31 17:39:36,846 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-01-31 17:39:36,848 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-01-31 17:39:36,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-31 17:39:36,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-31 17:39:36,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-31 17:39:36,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-31 17:39:36,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-01-31 17:39:36,848 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-01-31 17:39:36,849 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-31 17:39:36,849 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-31 17:39:36,850 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:36,995 INFO L244 CfgBuilder]: Building ICFG [2024-01-31 17:39:36,996 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-31 17:39:37,233 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-31 17:39:37,233 INFO L293 CfgBuilder]: Performing block encoding [2024-01-31 17:39:37,391 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-31 17:39:37,391 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-01-31 17:39:37,403 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 05:39:37 BoogieIcfgContainer [2024-01-31 17:39:37,404 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-31 17:39:37,405 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-31 17:39:37,406 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-31 17:39:37,408 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-31 17:39:37,408 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 05:39:34" (1/4) ... [2024-01-31 17:39:37,409 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f093c96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 05:39:37, skipping insertion in model container [2024-01-31 17:39:37,409 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:34" (2/4) ... [2024-01-31 17:39:37,409 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f093c96 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 31.01 05:39:37, skipping insertion in model container [2024-01-31 17:39:37,409 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:36" (3/4) ... [2024-01-31 17:39:37,410 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f093c96 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 31.01 05:39:37, skipping insertion in model container [2024-01-31 17:39:37,410 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:37" (4/4) ... [2024-01-31 17:39:37,411 INFO L112 eAbstractionObserver]: Analyzing ICFG mix055.opt.i [2024-01-31 17:39:37,426 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-31 17:39:37,426 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-01-31 17:39:37,426 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-31 17:39:37,471 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-01-31 17:39:37,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 51 transitions, 118 flow [2024-01-31 17:39:37,539 INFO L124 PetriNetUnfolderBase]: 1/47 cut-off events. [2024-01-31 17:39:37,540 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-31 17:39:37,544 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 101 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:37,544 INFO L82 GeneralOperation]: Start removeDead. Operand has 63 places, 51 transitions, 118 flow [2024-01-31 17:39:37,547 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 59 places, 47 transitions, 106 flow [2024-01-31 17:39:37,561 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-31 17:39:37,567 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;@3b3a73d4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-31 17:39:37,567 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2024-01-31 17:39:37,576 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-31 17:39:37,576 INFO L124 PetriNetUnfolderBase]: 0/25 cut-off events. [2024-01-31 17:39:37,577 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-31 17:39:37,577 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:39:37,577 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:39:37,578 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:37,582 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:39:37,582 INFO L85 PathProgramCache]: Analyzing trace with hash -751956939, now seen corresponding path program 1 times [2024-01-31 17:39:37,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:39:37,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395047163] [2024-01-31 17:39:37,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:39:37,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:39:37,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:39:37,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:39:37,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:39:37,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395047163] [2024-01-31 17:39:37,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395047163] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:39:37,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:39:37,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-31 17:39:37,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802678450] [2024-01-31 17:39:37,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:39:37,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-01-31 17:39:37,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:39:37,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-01-31 17:39:37,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-01-31 17:39:37,864 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 51 [2024-01-31 17:39:37,866 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 47 transitions, 106 flow. Second operand has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 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:37,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:39:37,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 51 [2024-01-31 17:39:37,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:39:38,221 INFO L124 PetriNetUnfolderBase]: 1027/1911 cut-off events. [2024-01-31 17:39:38,222 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-31 17:39:38,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3439 conditions, 1911 events. 1027/1911 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 14754 event pairs, 1027 based on Foata normal form. 60/1714 useless extension candidates. Maximal degree in co-relation 3427. Up to 1485 conditions per place. [2024-01-31 17:39:38,241 INFO L140 encePairwiseOnDemand]: 49/51 looper letters, 22 selfloop transitions, 0 changer transitions 0/45 dead transitions. [2024-01-31 17:39:38,242 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 45 transitions, 146 flow [2024-01-31 17:39:38,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-31 17:39:38,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-01-31 17:39:38,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 78 transitions. [2024-01-31 17:39:38,253 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7647058823529411 [2024-01-31 17:39:38,254 INFO L175 Difference]: Start difference. First operand has 59 places, 47 transitions, 106 flow. Second operand 2 states and 78 transitions. [2024-01-31 17:39:38,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 45 transitions, 146 flow [2024-01-31 17:39:38,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 45 transitions, 142 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-01-31 17:39:38,276 INFO L231 Difference]: Finished difference. Result has 55 places, 45 transitions, 98 flow [2024-01-31 17:39:38,278 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:38,281 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -4 predicate places. [2024-01-31 17:39:38,281 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 45 transitions, 98 flow [2024-01-31 17:39:38,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 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,282 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:39:38,282 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:39:38,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-31 17:39:38,282 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:38,282 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:39:38,282 INFO L85 PathProgramCache]: Analyzing trace with hash -751956938, now seen corresponding path program 1 times [2024-01-31 17:39:38,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:39:38,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792256312] [2024-01-31 17:39:38,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:39:38,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:39:38,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:39:38,458 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,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:39:38,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792256312] [2024-01-31 17:39:38,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792256312] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:39:38,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:39:38,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-31 17:39:38,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139049528] [2024-01-31 17:39:38,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:39:38,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-31 17:39:38,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:39:38,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-31 17:39:38,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-31 17:39:38,462 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 51 [2024-01-31 17:39:38,462 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 45 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 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,462 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:39:38,462 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 51 [2024-01-31 17:39:38,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:39:38,659 INFO L124 PetriNetUnfolderBase]: 815/1471 cut-off events. [2024-01-31 17:39:38,660 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-31 17:39:38,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2700 conditions, 1471 events. 815/1471 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 10323 event pairs, 179 based on Foata normal form. 0/1418 useless extension candidates. Maximal degree in co-relation 2697. Up to 889 conditions per place. [2024-01-31 17:39:38,669 INFO L140 encePairwiseOnDemand]: 48/51 looper letters, 27 selfloop transitions, 2 changer transitions 2/54 dead transitions. [2024-01-31 17:39:38,669 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 54 transitions, 178 flow [2024-01-31 17:39:38,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-31 17:39:38,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-31 17:39:38,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2024-01-31 17:39:38,675 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.738562091503268 [2024-01-31 17:39:38,675 INFO L175 Difference]: Start difference. First operand has 55 places, 45 transitions, 98 flow. Second operand 3 states and 113 transitions. [2024-01-31 17:39:38,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 54 transitions, 178 flow [2024-01-31 17:39:38,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 54 transitions, 178 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-01-31 17:39:38,683 INFO L231 Difference]: Finished difference. Result has 56 places, 43 transitions, 98 flow [2024-01-31 17:39:38,683 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:38,684 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -3 predicate places. [2024-01-31 17:39:38,684 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 43 transitions, 98 flow [2024-01-31 17:39:38,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 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,685 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:39:38,685 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:38,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-31 17:39:38,685 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:38,686 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:39:38,686 INFO L85 PathProgramCache]: Analyzing trace with hash -232886638, now seen corresponding path program 1 times [2024-01-31 17:39:38,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:39:38,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532311082] [2024-01-31 17:39:38,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:39:38,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:39:38,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:39:38,770 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,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:39:38,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532311082] [2024-01-31 17:39:38,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532311082] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:39:38,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:39:38,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-31 17:39:38,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059005419] [2024-01-31 17:39:38,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:39:38,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-31 17:39:38,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:39:38,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-31 17:39:38,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-31 17:39:38,774 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 51 [2024-01-31 17:39:38,775 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.0) internal successors, (84), 3 states have internal predecessors, (84), 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,775 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:39:38,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 51 [2024-01-31 17:39:38,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:39:38,985 INFO L124 PetriNetUnfolderBase]: 1047/1679 cut-off events. [2024-01-31 17:39:38,986 INFO L125 PetriNetUnfolderBase]: For 108/108 co-relation queries the response was YES. [2024-01-31 17:39:38,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3346 conditions, 1679 events. 1047/1679 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 11895 event pairs, 815 based on Foata normal form. 0/1578 useless extension candidates. Maximal degree in co-relation 3342. Up to 1189 conditions per place. [2024-01-31 17:39:38,997 INFO L140 encePairwiseOnDemand]: 49/51 looper letters, 28 selfloop transitions, 1 changer transitions 1/49 dead transitions. [2024-01-31 17:39:38,997 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 49 transitions, 172 flow [2024-01-31 17:39:38,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-31 17:39:38,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-31 17:39:39,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 100 transitions. [2024-01-31 17:39:39,002 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6535947712418301 [2024-01-31 17:39:39,002 INFO L175 Difference]: Start difference. First operand has 56 places, 43 transitions, 98 flow. Second operand 3 states and 100 transitions. [2024-01-31 17:39:39,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 49 transitions, 172 flow [2024-01-31 17:39:39,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 49 transitions, 166 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-31 17:39:39,005 INFO L231 Difference]: Finished difference. Result has 54 places, 41 transitions, 92 flow [2024-01-31 17:39:39,005 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:39,007 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -5 predicate places. [2024-01-31 17:39:39,007 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 41 transitions, 92 flow [2024-01-31 17:39:39,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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:39,007 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:39:39,008 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:39,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-31 17:39:39,008 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:39,008 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:39:39,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1370449203, now seen corresponding path program 1 times [2024-01-31 17:39:39,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:39:39,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185169872] [2024-01-31 17:39:39,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:39:39,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:39:39,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:39:39,262 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:39,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:39:39,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185169872] [2024-01-31 17:39:39,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185169872] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:39:39,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:39:39,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-31 17:39:39,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910780536] [2024-01-31 17:39:39,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:39:39,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-31 17:39:39,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:39:39,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-31 17:39:39,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-01-31 17:39:39,274 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 51 [2024-01-31 17:39:39,275 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 41 transitions, 92 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:39,275 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:39:39,275 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 51 [2024-01-31 17:39:39,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:39:39,704 INFO L124 PetriNetUnfolderBase]: 2739/4482 cut-off events. [2024-01-31 17:39:39,705 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-31 17:39:39,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8512 conditions, 4482 events. 2739/4482 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 284. Compared 30244 event pairs, 1053 based on Foata normal form. 108/4516 useless extension candidates. Maximal degree in co-relation 8508. Up to 3017 conditions per place. [2024-01-31 17:39:39,728 INFO L140 encePairwiseOnDemand]: 45/51 looper letters, 37 selfloop transitions, 3 changer transitions 35/92 dead transitions. [2024-01-31 17:39:39,728 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 92 transitions, 350 flow [2024-01-31 17:39:39,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-31 17:39:39,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-01-31 17:39:39,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 224 transitions. [2024-01-31 17:39:39,729 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6274509803921569 [2024-01-31 17:39:39,730 INFO L175 Difference]: Start difference. First operand has 54 places, 41 transitions, 92 flow. Second operand 7 states and 224 transitions. [2024-01-31 17:39:39,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 92 transitions, 350 flow [2024-01-31 17:39:39,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 92 transitions, 349 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-31 17:39:39,736 INFO L231 Difference]: Finished difference. Result has 63 places, 43 transitions, 126 flow [2024-01-31 17:39:39,737 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=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=126, PETRI_PLACES=63, PETRI_TRANSITIONS=43} [2024-01-31 17:39:39,737 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 4 predicate places. [2024-01-31 17:39:39,737 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 43 transitions, 126 flow [2024-01-31 17:39:39,738 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:39,738 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:39:39,738 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:39,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-31 17:39:39,738 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:39,738 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:39:39,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1266829480, now seen corresponding path program 1 times [2024-01-31 17:39:39,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:39:39,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016810240] [2024-01-31 17:39:39,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:39:39,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:39:39,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:39:40,018 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:40,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:39:40,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016810240] [2024-01-31 17:39:40,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016810240] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:39:40,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:39:40,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-31 17:39:40,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624830087] [2024-01-31 17:39:40,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:39:40,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-31 17:39:40,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:39:40,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-31 17:39:40,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-01-31 17:39:40,032 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 51 [2024-01-31 17:39:40,032 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 43 transitions, 126 flow. Second operand has 5 states, 5 states have (on average 25.0) internal successors, (125), 5 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:40,033 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:39:40,033 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 51 [2024-01-31 17:39:40,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:39:40,467 INFO L124 PetriNetUnfolderBase]: 2420/4090 cut-off events. [2024-01-31 17:39:40,468 INFO L125 PetriNetUnfolderBase]: For 1733/1733 co-relation queries the response was YES. [2024-01-31 17:39:40,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9149 conditions, 4090 events. 2420/4090 cut-off events. For 1733/1733 co-relation queries the response was YES. Maximal size of possible extension queue 343. Compared 31157 event pairs, 888 based on Foata normal form. 128/3979 useless extension candidates. Maximal degree in co-relation 9140. Up to 2581 conditions per place. [2024-01-31 17:39:40,491 INFO L140 encePairwiseOnDemand]: 45/51 looper letters, 29 selfloop transitions, 3 changer transitions 27/79 dead transitions. [2024-01-31 17:39:40,492 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 79 transitions, 328 flow [2024-01-31 17:39:40,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-31 17:39:40,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-01-31 17:39:40,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 215 transitions. [2024-01-31 17:39:40,493 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6022408963585434 [2024-01-31 17:39:40,493 INFO L175 Difference]: Start difference. First operand has 63 places, 43 transitions, 126 flow. Second operand 7 states and 215 transitions. [2024-01-31 17:39:40,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 79 transitions, 328 flow [2024-01-31 17:39:40,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 79 transitions, 317 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-01-31 17:39:40,500 INFO L231 Difference]: Finished difference. Result has 67 places, 45 transitions, 154 flow [2024-01-31 17:39:40,500 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=154, PETRI_PLACES=67, PETRI_TRANSITIONS=45} [2024-01-31 17:39:40,501 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 8 predicate places. [2024-01-31 17:39:40,501 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 45 transitions, 154 flow [2024-01-31 17:39:40,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.0) internal successors, (125), 5 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:40,501 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:39:40,501 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:40,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-31 17:39:40,501 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:40,502 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:39:40,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1101335663, now seen corresponding path program 1 times [2024-01-31 17:39:40,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:39:40,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020132758] [2024-01-31 17:39:40,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:39:40,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:39:40,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:39:40,919 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:40,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:39:40,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020132758] [2024-01-31 17:39:40,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020132758] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:39:40,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:39:40,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-01-31 17:39:40,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251179286] [2024-01-31 17:39:40,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:39:40,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-01-31 17:39:40,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:39:40,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-01-31 17:39:40,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-01-31 17:39:40,931 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 51 [2024-01-31 17:39:40,932 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 45 transitions, 154 flow. Second operand has 7 states, 7 states have (on average 24.285714285714285) internal successors, (170), 7 states have internal predecessors, (170), 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:40,932 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:39:40,932 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 51 [2024-01-31 17:39:40,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:39:41,415 INFO L124 PetriNetUnfolderBase]: 2206/3686 cut-off events. [2024-01-31 17:39:41,415 INFO L125 PetriNetUnfolderBase]: For 3917/3917 co-relation queries the response was YES. [2024-01-31 17:39:41,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9665 conditions, 3686 events. 2206/3686 cut-off events. For 3917/3917 co-relation queries the response was YES. Maximal size of possible extension queue 316. Compared 27368 event pairs, 828 based on Foata normal form. 96/3559 useless extension candidates. Maximal degree in co-relation 9653. Up to 2411 conditions per place. [2024-01-31 17:39:41,441 INFO L140 encePairwiseOnDemand]: 44/51 looper letters, 34 selfloop transitions, 5 changer transitions 25/84 dead transitions. [2024-01-31 17:39:41,441 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 84 transitions, 408 flow [2024-01-31 17:39:41,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-01-31 17:39:41,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-01-31 17:39:41,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 242 transitions. [2024-01-31 17:39:41,444 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5931372549019608 [2024-01-31 17:39:41,444 INFO L175 Difference]: Start difference. First operand has 67 places, 45 transitions, 154 flow. Second operand 8 states and 242 transitions. [2024-01-31 17:39:41,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 84 transitions, 408 flow [2024-01-31 17:39:41,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 84 transitions, 397 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-01-31 17:39:41,455 INFO L231 Difference]: Finished difference. Result has 72 places, 47 transitions, 192 flow [2024-01-31 17:39:41,455 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=147, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=192, PETRI_PLACES=72, PETRI_TRANSITIONS=47} [2024-01-31 17:39:41,455 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 13 predicate places. [2024-01-31 17:39:41,455 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 47 transitions, 192 flow [2024-01-31 17:39:41,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.285714285714285) internal successors, (170), 7 states have internal predecessors, (170), 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:41,456 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:39:41,456 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] [2024-01-31 17:39:41,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-31 17:39:41,456 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:41,457 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:39:41,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1310386718, now seen corresponding path program 1 times [2024-01-31 17:39:41,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:39:41,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879154162] [2024-01-31 17:39:41,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:39:41,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:39:41,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:39:41,647 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:41,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:39:41,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879154162] [2024-01-31 17:39:41,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879154162] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:39:41,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:39:41,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-31 17:39:41,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092925557] [2024-01-31 17:39:41,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:39:41,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-31 17:39:41,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:39:41,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-31 17:39:41,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-01-31 17:39:41,656 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 51 [2024-01-31 17:39:41,656 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 47 transitions, 192 flow. Second operand has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 states have internal predecessors, (148), 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:41,656 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:39:41,656 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 51 [2024-01-31 17:39:41,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:39:42,088 INFO L124 PetriNetUnfolderBase]: 2191/3759 cut-off events. [2024-01-31 17:39:42,088 INFO L125 PetriNetUnfolderBase]: For 7396/7396 co-relation queries the response was YES. [2024-01-31 17:39:42,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11117 conditions, 3759 events. 2191/3759 cut-off events. For 7396/7396 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 28674 event pairs, 424 based on Foata normal form. 96/3632 useless extension candidates. Maximal degree in co-relation 11102. Up to 2035 conditions per place. [2024-01-31 17:39:42,116 INFO L140 encePairwiseOnDemand]: 43/51 looper letters, 40 selfloop transitions, 7 changer transitions 25/92 dead transitions. [2024-01-31 17:39:42,116 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 92 transitions, 503 flow [2024-01-31 17:39:42,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-01-31 17:39:42,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-01-31 17:39:42,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 247 transitions. [2024-01-31 17:39:42,118 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6053921568627451 [2024-01-31 17:39:42,118 INFO L175 Difference]: Start difference. First operand has 72 places, 47 transitions, 192 flow. Second operand 8 states and 247 transitions. [2024-01-31 17:39:42,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 92 transitions, 503 flow [2024-01-31 17:39:42,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 92 transitions, 478 flow, removed 9 selfloop flow, removed 4 redundant places. [2024-01-31 17:39:42,131 INFO L231 Difference]: Finished difference. Result has 76 places, 50 transitions, 219 flow [2024-01-31 17:39:42,131 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=219, PETRI_PLACES=76, PETRI_TRANSITIONS=50} [2024-01-31 17:39:42,132 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 17 predicate places. [2024-01-31 17:39:42,132 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 50 transitions, 219 flow [2024-01-31 17:39:42,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 states have internal predecessors, (148), 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,132 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:39:42,132 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] [2024-01-31 17:39:42,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-31 17:39:42,133 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:42,133 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:39:42,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1697145928, now seen corresponding path program 2 times [2024-01-31 17:39:42,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:39:42,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732106650] [2024-01-31 17:39:42,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:39:42,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:39:42,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:39:42,393 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,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:39:42,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732106650] [2024-01-31 17:39:42,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732106650] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:39:42,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:39:42,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-01-31 17:39:42,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261715839] [2024-01-31 17:39:42,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:39:42,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-01-31 17:39:42,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:39:42,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-01-31 17:39:42,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-01-31 17:39:42,403 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 51 [2024-01-31 17:39:42,403 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 50 transitions, 219 flow. Second operand has 7 states, 7 states have (on average 24.285714285714285) internal successors, (170), 7 states have internal predecessors, (170), 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,403 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:39:42,403 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 51 [2024-01-31 17:39:42,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:39:43,050 INFO L124 PetriNetUnfolderBase]: 2093/3591 cut-off events. [2024-01-31 17:39:43,050 INFO L125 PetriNetUnfolderBase]: For 10151/10151 co-relation queries the response was YES. [2024-01-31 17:39:43,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11445 conditions, 3591 events. 2093/3591 cut-off events. For 10151/10151 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 27406 event pairs, 424 based on Foata normal form. 96/3475 useless extension candidates. Maximal degree in co-relation 11427. Up to 2005 conditions per place. [2024-01-31 17:39:43,078 INFO L140 encePairwiseOnDemand]: 44/51 looper letters, 40 selfloop transitions, 8 changer transitions 32/100 dead transitions. [2024-01-31 17:39:43,078 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 100 transitions, 612 flow [2024-01-31 17:39:43,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-01-31 17:39:43,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-01-31 17:39:43,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 298 transitions. [2024-01-31 17:39:43,079 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5843137254901961 [2024-01-31 17:39:43,080 INFO L175 Difference]: Start difference. First operand has 76 places, 50 transitions, 219 flow. Second operand 10 states and 298 transitions. [2024-01-31 17:39:43,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 100 transitions, 612 flow [2024-01-31 17:39:43,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 100 transitions, 569 flow, removed 17 selfloop flow, removed 5 redundant places. [2024-01-31 17:39:43,099 INFO L231 Difference]: Finished difference. Result has 83 places, 52 transitions, 255 flow [2024-01-31 17:39:43,099 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=255, PETRI_PLACES=83, PETRI_TRANSITIONS=52} [2024-01-31 17:39:43,100 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 24 predicate places. [2024-01-31 17:39:43,100 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 52 transitions, 255 flow [2024-01-31 17:39:43,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.285714285714285) internal successors, (170), 7 states have internal predecessors, (170), 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:43,100 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:39:43,100 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] [2024-01-31 17:39:43,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-31 17:39:43,101 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:43,101 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:39:43,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1311021488, now seen corresponding path program 1 times [2024-01-31 17:39:43,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:39:43,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763125349] [2024-01-31 17:39:43,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:39:43,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:39:43,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:39:43,498 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:43,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:39:43,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763125349] [2024-01-31 17:39:43,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763125349] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:39:43,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:39:43,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-01-31 17:39:43,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56861714] [2024-01-31 17:39:43,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:39:43,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-01-31 17:39:43,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:39:43,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-01-31 17:39:43,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-01-31 17:39:43,510 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 51 [2024-01-31 17:39:43,511 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 52 transitions, 255 flow. Second operand has 8 states, 8 states have (on average 24.125) internal successors, (193), 8 states have internal predecessors, (193), 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:43,511 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:39:43,511 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 51 [2024-01-31 17:39:43,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:39:43,960 INFO L124 PetriNetUnfolderBase]: 1888/3197 cut-off events. [2024-01-31 17:39:43,960 INFO L125 PetriNetUnfolderBase]: For 11455/11455 co-relation queries the response was YES. [2024-01-31 17:39:43,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10999 conditions, 3197 events. 1888/3197 cut-off events. For 11455/11455 co-relation queries the response was YES. Maximal size of possible extension queue 265. Compared 23274 event pairs, 337 based on Foata normal form. 64/3059 useless extension candidates. Maximal degree in co-relation 10978. Up to 1911 conditions per place. [2024-01-31 17:39:43,986 INFO L140 encePairwiseOnDemand]: 44/51 looper letters, 38 selfloop transitions, 9 changer transitions 22/89 dead transitions. [2024-01-31 17:39:43,986 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 89 transitions, 556 flow [2024-01-31 17:39:43,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-01-31 17:39:43,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-01-31 17:39:43,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 241 transitions. [2024-01-31 17:39:43,988 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5906862745098039 [2024-01-31 17:39:43,988 INFO L175 Difference]: Start difference. First operand has 83 places, 52 transitions, 255 flow. Second operand 8 states and 241 transitions. [2024-01-31 17:39:43,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 89 transitions, 556 flow [2024-01-31 17:39:43,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 89 transitions, 518 flow, removed 15 selfloop flow, removed 5 redundant places. [2024-01-31 17:39:44,000 INFO L231 Difference]: Finished difference. Result has 85 places, 54 transitions, 290 flow [2024-01-31 17:39:44,000 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=290, PETRI_PLACES=85, PETRI_TRANSITIONS=54} [2024-01-31 17:39:44,001 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 26 predicate places. [2024-01-31 17:39:44,001 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 54 transitions, 290 flow [2024-01-31 17:39:44,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 24.125) internal successors, (193), 8 states have internal predecessors, (193), 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:44,002 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:39:44,002 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] [2024-01-31 17:39:44,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-31 17:39:44,002 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:44,002 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:39:44,002 INFO L85 PathProgramCache]: Analyzing trace with hash 503589678, now seen corresponding path program 1 times [2024-01-31 17:39:44,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:39:44,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327665521] [2024-01-31 17:39:44,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:39:44,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:39:44,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:39:44,115 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:44,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:39:44,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327665521] [2024-01-31 17:39:44,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327665521] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:39:44,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:39:44,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-31 17:39:44,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382673253] [2024-01-31 17:39:44,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:39:44,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-31 17:39:44,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:39:44,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-31 17:39:44,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-31 17:39:44,122 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 51 [2024-01-31 17:39:44,122 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 54 transitions, 290 flow. Second operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:39:44,122 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:39:44,123 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 51 [2024-01-31 17:39:44,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:39:44,902 INFO L124 PetriNetUnfolderBase]: 5717/8917 cut-off events. [2024-01-31 17:39:44,902 INFO L125 PetriNetUnfolderBase]: For 23945/24252 co-relation queries the response was YES. [2024-01-31 17:39:44,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29039 conditions, 8917 events. 5717/8917 cut-off events. For 23945/24252 co-relation queries the response was YES. Maximal size of possible extension queue 570. Compared 62543 event pairs, 826 based on Foata normal form. 569/9223 useless extension candidates. Maximal degree in co-relation 29016. Up to 4779 conditions per place. [2024-01-31 17:39:44,961 INFO L140 encePairwiseOnDemand]: 44/51 looper letters, 62 selfloop transitions, 6 changer transitions 0/88 dead transitions. [2024-01-31 17:39:44,961 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 88 transitions, 594 flow [2024-01-31 17:39:44,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-31 17:39:44,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-31 17:39:44,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 141 transitions. [2024-01-31 17:39:44,962 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6911764705882353 [2024-01-31 17:39:44,962 INFO L175 Difference]: Start difference. First operand has 85 places, 54 transitions, 290 flow. Second operand 4 states and 141 transitions. [2024-01-31 17:39:44,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 88 transitions, 594 flow [2024-01-31 17:39:44,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 88 transitions, 542 flow, removed 13 selfloop flow, removed 7 redundant places. [2024-01-31 17:39:44,985 INFO L231 Difference]: Finished difference. Result has 79 places, 59 transitions, 304 flow [2024-01-31 17:39:44,985 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=74, 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=4, PETRI_FLOW=304, PETRI_PLACES=79, PETRI_TRANSITIONS=59} [2024-01-31 17:39:44,986 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 20 predicate places. [2024-01-31 17:39:44,986 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 59 transitions, 304 flow [2024-01-31 17:39:44,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:39:44,986 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:39:44,986 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:44,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-01-31 17:39:44,987 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:44,987 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:39:44,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1848445091, now seen corresponding path program 1 times [2024-01-31 17:39:44,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:39:44,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740886703] [2024-01-31 17:39:44,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:39:44,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:39:45,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:39:45,102 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,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:39:45,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740886703] [2024-01-31 17:39:45,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740886703] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:39:45,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:39:45,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-31 17:39:45,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934625622] [2024-01-31 17:39:45,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:39:45,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-31 17:39:45,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:39:45,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-31 17:39:45,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-01-31 17:39:45,113 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 51 [2024-01-31 17:39:45,113 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 59 transitions, 304 flow. Second operand has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 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,113 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:39:45,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 51 [2024-01-31 17:39:45,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:39:45,812 INFO L124 PetriNetUnfolderBase]: 5019/7875 cut-off events. [2024-01-31 17:39:45,813 INFO L125 PetriNetUnfolderBase]: For 14191/14515 co-relation queries the response was YES. [2024-01-31 17:39:45,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25591 conditions, 7875 events. 5019/7875 cut-off events. For 14191/14515 co-relation queries the response was YES. Maximal size of possible extension queue 471. Compared 53525 event pairs, 390 based on Foata normal form. 547/8229 useless extension candidates. Maximal degree in co-relation 25571. Up to 3409 conditions per place. [2024-01-31 17:39:45,860 INFO L140 encePairwiseOnDemand]: 44/51 looper letters, 79 selfloop transitions, 10 changer transitions 0/109 dead transitions. [2024-01-31 17:39:45,860 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 109 transitions, 722 flow [2024-01-31 17:39:45,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-31 17:39:45,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-31 17:39:45,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 180 transitions. [2024-01-31 17:39:45,862 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7058823529411765 [2024-01-31 17:39:45,862 INFO L175 Difference]: Start difference. First operand has 79 places, 59 transitions, 304 flow. Second operand 5 states and 180 transitions. [2024-01-31 17:39:45,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 109 transitions, 722 flow [2024-01-31 17:39:45,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 109 transitions, 715 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-01-31 17:39:45,876 INFO L231 Difference]: Finished difference. Result has 83 places, 64 transitions, 365 flow [2024-01-31 17:39:45,876 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=365, PETRI_PLACES=83, PETRI_TRANSITIONS=64} [2024-01-31 17:39:45,876 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 24 predicate places. [2024-01-31 17:39:45,876 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 64 transitions, 365 flow [2024-01-31 17:39:45,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 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,877 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:39:45,877 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:45,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-01-31 17:39:45,877 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:45,878 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:39:45,878 INFO L85 PathProgramCache]: Analyzing trace with hash -700701215, now seen corresponding path program 1 times [2024-01-31 17:39:45,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:39:45,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669980567] [2024-01-31 17:39:45,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:39:45,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:39:45,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:39:45,996 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,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:39:45,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669980567] [2024-01-31 17:39:45,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669980567] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:39:45,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:39:45,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-31 17:39:45,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282125136] [2024-01-31 17:39:45,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:39:45,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-31 17:39:45,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:39:45,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-31 17:39:45,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-01-31 17:39:46,001 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 51 [2024-01-31 17:39:46,002 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 64 transitions, 365 flow. Second operand has 5 states, 5 states have (on average 24.6) internal successors, (123), 5 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:39:46,002 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:39:46,002 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 51 [2024-01-31 17:39:46,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:39:47,178 INFO L124 PetriNetUnfolderBase]: 6614/11404 cut-off events. [2024-01-31 17:39:47,178 INFO L125 PetriNetUnfolderBase]: For 23764/25276 co-relation queries the response was YES. [2024-01-31 17:39:47,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37777 conditions, 11404 events. 6614/11404 cut-off events. For 23764/25276 co-relation queries the response was YES. Maximal size of possible extension queue 645. Compared 92327 event pairs, 3005 based on Foata normal form. 462/11057 useless extension candidates. Maximal degree in co-relation 37756. Up to 4285 conditions per place. [2024-01-31 17:39:47,322 INFO L140 encePairwiseOnDemand]: 46/51 looper letters, 77 selfloop transitions, 8 changer transitions 7/121 dead transitions. [2024-01-31 17:39:47,336 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 121 transitions, 851 flow [2024-01-31 17:39:47,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-31 17:39:47,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-01-31 17:39:47,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 222 transitions. [2024-01-31 17:39:47,338 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6218487394957983 [2024-01-31 17:39:47,338 INFO L175 Difference]: Start difference. First operand has 83 places, 64 transitions, 365 flow. Second operand 7 states and 222 transitions. [2024-01-31 17:39:47,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 121 transitions, 851 flow [2024-01-31 17:39:47,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 121 transitions, 830 flow, removed 7 selfloop flow, removed 2 redundant places. [2024-01-31 17:39:47,386 INFO L231 Difference]: Finished difference. Result has 92 places, 69 transitions, 431 flow [2024-01-31 17:39:47,386 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=348, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=431, PETRI_PLACES=92, PETRI_TRANSITIONS=69} [2024-01-31 17:39:47,387 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 33 predicate places. [2024-01-31 17:39:47,388 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 69 transitions, 431 flow [2024-01-31 17:39:47,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.6) internal successors, (123), 5 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:39:47,388 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:39:47,388 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:47,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-01-31 17:39:47,389 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:47,389 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:39:47,389 INFO L85 PathProgramCache]: Analyzing trace with hash -620124703, now seen corresponding path program 1 times [2024-01-31 17:39:47,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:39:47,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525162469] [2024-01-31 17:39:47,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:39:47,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:39:47,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:39:47,553 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:47,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:39:47,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525162469] [2024-01-31 17:39:47,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525162469] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:39:47,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:39:47,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-31 17:39:47,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666652515] [2024-01-31 17:39:47,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:39:47,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-31 17:39:47,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:39:47,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-31 17:39:47,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-01-31 17:39:47,560 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 51 [2024-01-31 17:39:47,560 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 69 transitions, 431 flow. Second operand has 6 states, 6 states have (on average 25.0) internal successors, (150), 6 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:39:47,561 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:39:47,561 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 51 [2024-01-31 17:39:47,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:39:48,702 INFO L124 PetriNetUnfolderBase]: 6566/9960 cut-off events. [2024-01-31 17:39:48,702 INFO L125 PetriNetUnfolderBase]: For 23384/23915 co-relation queries the response was YES. [2024-01-31 17:39:48,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34082 conditions, 9960 events. 6566/9960 cut-off events. For 23384/23915 co-relation queries the response was YES. Maximal size of possible extension queue 598. Compared 66609 event pairs, 248 based on Foata normal form. 761/10503 useless extension candidates. Maximal degree in co-relation 34056. Up to 3088 conditions per place. [2024-01-31 17:39:48,760 INFO L140 encePairwiseOnDemand]: 44/51 looper letters, 83 selfloop transitions, 14 changer transitions 5/122 dead transitions. [2024-01-31 17:39:48,760 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 122 transitions, 878 flow [2024-01-31 17:39:48,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-31 17:39:48,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-31 17:39:48,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 217 transitions. [2024-01-31 17:39:48,762 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7091503267973857 [2024-01-31 17:39:48,763 INFO L175 Difference]: Start difference. First operand has 92 places, 69 transitions, 431 flow. Second operand 6 states and 217 transitions. [2024-01-31 17:39:48,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 122 transitions, 878 flow [2024-01-31 17:39:48,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 122 transitions, 823 flow, removed 19 selfloop flow, removed 3 redundant places. [2024-01-31 17:39:48,814 INFO L231 Difference]: Finished difference. Result has 96 places, 66 transitions, 414 flow [2024-01-31 17:39:48,814 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=371, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=414, PETRI_PLACES=96, PETRI_TRANSITIONS=66} [2024-01-31 17:39:48,815 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 37 predicate places. [2024-01-31 17:39:48,815 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 66 transitions, 414 flow [2024-01-31 17:39:48,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.0) internal successors, (150), 6 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:39:48,815 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:39:48,815 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:48,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-01-31 17:39:48,816 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:48,816 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:39:48,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1614622270, now seen corresponding path program 1 times [2024-01-31 17:39:48,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:39:48,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238454701] [2024-01-31 17:39:48,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:39:48,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:39:48,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:39:49,013 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:49,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:39:49,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238454701] [2024-01-31 17:39:49,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238454701] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:39:49,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:39:49,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-01-31 17:39:49,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961450462] [2024-01-31 17:39:49,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:39:49,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-01-31 17:39:49,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:39:49,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-01-31 17:39:49,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-01-31 17:39:49,018 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 51 [2024-01-31 17:39:49,018 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 66 transitions, 414 flow. Second operand has 7 states, 7 states have (on average 24.714285714285715) internal successors, (173), 7 states have internal predecessors, (173), 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:49,018 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:39:49,018 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 51 [2024-01-31 17:39:49,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:39:49,750 INFO L124 PetriNetUnfolderBase]: 5130/7612 cut-off events. [2024-01-31 17:39:49,750 INFO L125 PetriNetUnfolderBase]: For 22353/22677 co-relation queries the response was YES. [2024-01-31 17:39:49,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28093 conditions, 7612 events. 5130/7612 cut-off events. For 22353/22677 co-relation queries the response was YES. Maximal size of possible extension queue 598. Compared 49569 event pairs, 200 based on Foata normal form. 419/7813 useless extension candidates. Maximal degree in co-relation 28066. Up to 2784 conditions per place. [2024-01-31 17:39:49,791 INFO L140 encePairwiseOnDemand]: 44/51 looper letters, 76 selfloop transitions, 18 changer transitions 0/114 dead transitions. [2024-01-31 17:39:49,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 114 transitions, 783 flow [2024-01-31 17:39:49,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-31 17:39:49,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-01-31 17:39:49,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 238 transitions. [2024-01-31 17:39:49,793 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-01-31 17:39:49,793 INFO L175 Difference]: Start difference. First operand has 96 places, 66 transitions, 414 flow. Second operand 7 states and 238 transitions. [2024-01-31 17:39:49,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 114 transitions, 783 flow [2024-01-31 17:39:49,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 114 transitions, 657 flow, removed 46 selfloop flow, removed 16 redundant places. [2024-01-31 17:39:49,830 INFO L231 Difference]: Finished difference. Result has 84 places, 65 transitions, 370 flow [2024-01-31 17:39:49,830 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=307, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=370, PETRI_PLACES=84, PETRI_TRANSITIONS=65} [2024-01-31 17:39:49,830 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 25 predicate places. [2024-01-31 17:39:49,831 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 65 transitions, 370 flow [2024-01-31 17:39:49,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.714285714285715) internal successors, (173), 7 states have internal predecessors, (173), 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:49,831 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:39:49,831 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:49,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-01-31 17:39:49,831 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P3Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-01-31 17:39:49,832 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:39:49,832 INFO L85 PathProgramCache]: Analyzing trace with hash -939777733, now seen corresponding path program 1 times [2024-01-31 17:39:49,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:39:49,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531371579] [2024-01-31 17:39:49,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:39:49,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:39:49,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:39:49,996 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:49,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:39:49,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531371579] [2024-01-31 17:39:49,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531371579] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:39:49,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:39:49,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-01-31 17:39:49,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595844939] [2024-01-31 17:39:49,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:39:49,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-31 17:39:49,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:39:49,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-31 17:39:49,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-01-31 17:39:50,005 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 51 [2024-01-31 17:39:50,005 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 65 transitions, 370 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:50,005 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:39:50,005 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 51 [2024-01-31 17:39:50,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:39:50,899 INFO L124 PetriNetUnfolderBase]: 5906/10741 cut-off events. [2024-01-31 17:39:50,900 INFO L125 PetriNetUnfolderBase]: For 19842/22282 co-relation queries the response was YES. [2024-01-31 17:39:50,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30639 conditions, 10741 events. 5906/10741 cut-off events. For 19842/22282 co-relation queries the response was YES. Maximal size of possible extension queue 867. Compared 93808 event pairs, 913 based on Foata normal form. 207/9787 useless extension candidates. Maximal degree in co-relation 30622. Up to 3576 conditions per place. [2024-01-31 17:39:50,946 INFO L140 encePairwiseOnDemand]: 46/51 looper letters, 45 selfloop transitions, 2 changer transitions 16/100 dead transitions. [2024-01-31 17:39:50,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 100 transitions, 614 flow [2024-01-31 17:39:50,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-31 17:39:50,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-31 17:39:50,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 182 transitions. [2024-01-31 17:39:50,948 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5947712418300654 [2024-01-31 17:39:50,948 INFO L175 Difference]: Start difference. First operand has 84 places, 65 transitions, 370 flow. Second operand 6 states and 182 transitions. [2024-01-31 17:39:50,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 100 transitions, 614 flow [2024-01-31 17:39:51,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 100 transitions, 567 flow, removed 12 selfloop flow, removed 4 redundant places. [2024-01-31 17:39:51,070 INFO L231 Difference]: Finished difference. Result has 89 places, 66 transitions, 340 flow [2024-01-31 17:39:51,070 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=323, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=340, PETRI_PLACES=89, PETRI_TRANSITIONS=66} [2024-01-31 17:39:51,070 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 30 predicate places. [2024-01-31 17:39:51,070 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 66 transitions, 340 flow [2024-01-31 17:39:51,071 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,071 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:39:51,071 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,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-01-31 17:39:51,071 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P3Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-01-31 17:39:51,071 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:39:51,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1117651455, now seen corresponding path program 2 times [2024-01-31 17:39:51,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:39:51,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544025572] [2024-01-31 17:39:51,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:39:51,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:39:51,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:39:51,219 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:51,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:39:51,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544025572] [2024-01-31 17:39:51,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544025572] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:39:51,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:39:51,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-01-31 17:39:51,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119918526] [2024-01-31 17:39:51,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:39:51,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-31 17:39:51,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:39:51,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-31 17:39:51,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-01-31 17:39:51,228 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 51 [2024-01-31 17:39:51,228 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 66 transitions, 340 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:51,228 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:39:51,228 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 51 [2024-01-31 17:39:51,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:39:52,632 INFO L124 PetriNetUnfolderBase]: 9061/16384 cut-off events. [2024-01-31 17:39:52,632 INFO L125 PetriNetUnfolderBase]: For 18304/20332 co-relation queries the response was YES. [2024-01-31 17:39:52,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43854 conditions, 16384 events. 9061/16384 cut-off events. For 18304/20332 co-relation queries the response was YES. Maximal size of possible extension queue 1486. Compared 152278 event pairs, 2657 based on Foata normal form. 314/14600 useless extension candidates. Maximal degree in co-relation 43833. Up to 6450 conditions per place. [2024-01-31 17:39:52,717 INFO L140 encePairwiseOnDemand]: 46/51 looper letters, 28 selfloop transitions, 1 changer transitions 37/104 dead transitions. [2024-01-31 17:39:52,717 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 104 transitions, 601 flow [2024-01-31 17:39:52,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-31 17:39:52,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-31 17:39:52,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 184 transitions. [2024-01-31 17:39:52,718 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6013071895424836 [2024-01-31 17:39:52,718 INFO L175 Difference]: Start difference. First operand has 89 places, 66 transitions, 340 flow. Second operand 6 states and 184 transitions. [2024-01-31 17:39:52,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 104 transitions, 601 flow [2024-01-31 17:39:52,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 104 transitions, 594 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-01-31 17:39:53,000 INFO L231 Difference]: Finished difference. Result has 93 places, 63 transitions, 332 flow [2024-01-31 17:39:53,000 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=335, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=332, PETRI_PLACES=93, PETRI_TRANSITIONS=63} [2024-01-31 17:39:53,001 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 34 predicate places. [2024-01-31 17:39:53,001 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 63 transitions, 332 flow [2024-01-31 17:39:53,001 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:53,001 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:39:53,002 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:53,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-01-31 17:39:53,002 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P3Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-01-31 17:39:53,002 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:39:53,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1158324499, now seen corresponding path program 3 times [2024-01-31 17:39:53,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:39:53,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279141230] [2024-01-31 17:39:53,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:39:53,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:39:53,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-31 17:39:53,071 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-31 17:39:53,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-31 17:39:53,130 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-31 17:39:53,130 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-31 17:39:53,131 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (9 of 10 remaining) [2024-01-31 17:39:53,149 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 10 remaining) [2024-01-31 17:39:53,149 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1ASSERT_VIOLATIONERROR_FUNCTION (7 of 10 remaining) [2024-01-31 17:39:53,149 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 10 remaining) [2024-01-31 17:39:53,149 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 10 remaining) [2024-01-31 17:39:53,149 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 10 remaining) [2024-01-31 17:39:53,149 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 10 remaining) [2024-01-31 17:39:53,149 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 10 remaining) [2024-01-31 17:39:53,149 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 10 remaining) [2024-01-31 17:39:53,149 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1ASSERT_VIOLATIONERROR_FUNCTION (0 of 10 remaining) [2024-01-31 17:39:53,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-01-31 17:39:53,150 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:39:53,155 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-31 17:39:53,155 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-31 17:39:53,236 INFO L503 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-01-31 17:39:53,236 INFO L504 ceAbstractionStarter]: WitnessConsidered=2 [2024-01-31 17:39:53,237 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 05:39:53 BasicIcfg [2024-01-31 17:39:53,237 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-31 17:39:53,238 INFO L158 Benchmark]: Toolchain (without parser) took 18678.33ms. Allocated memory was 167.8MB in the beginning and 2.8GB in the end (delta: 2.7GB). Free memory was 96.7MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 659.5MB. Max. memory is 16.1GB. [2024-01-31 17:39:53,238 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 167.8MB. Free memory is still 124.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-31 17:39:53,238 INFO L158 Benchmark]: Witness Parser took 0.13ms. Allocated memory is still 167.8MB. Free memory is still 96.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-31 17:39:53,238 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2069.29ms. Allocated memory was 167.8MB in the beginning and 253.8MB in the end (delta: 86.0MB). Free memory was 96.7MB in the beginning and 195.8MB in the end (delta: -99.0MB). Peak memory consumption was 114.2MB. Max. memory is 16.1GB. [2024-01-31 17:39:53,238 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.33ms. Allocated memory is still 253.8MB. Free memory was 194.7MB in the beginning and 192.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-31 17:39:53,238 INFO L158 Benchmark]: Boogie Preprocessor took 59.76ms. Allocated memory is still 253.8MB. Free memory was 192.6MB in the beginning and 189.0MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-01-31 17:39:53,239 INFO L158 Benchmark]: RCFGBuilder took 639.32ms. Allocated memory is still 253.8MB. Free memory was 187.9MB in the beginning and 136.0MB in the end (delta: 51.9MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. [2024-01-31 17:39:53,239 INFO L158 Benchmark]: TraceAbstraction took 15831.80ms. Allocated memory was 253.8MB in the beginning and 2.8GB in the end (delta: 2.6GB). Free memory was 136.0MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 613.1MB. Max. memory is 16.1GB. [2024-01-31 17:39:53,240 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.16ms. Allocated memory is still 167.8MB. Free memory is still 124.9MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.13ms. Allocated memory is still 167.8MB. Free memory is still 96.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2069.29ms. Allocated memory was 167.8MB in the beginning and 253.8MB in the end (delta: 86.0MB). Free memory was 96.7MB in the beginning and 195.8MB in the end (delta: -99.0MB). Peak memory consumption was 114.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 72.33ms. Allocated memory is still 253.8MB. Free memory was 194.7MB in the beginning and 192.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.76ms. Allocated memory is still 253.8MB. Free memory was 192.6MB in the beginning and 189.0MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 639.32ms. Allocated memory is still 253.8MB. Free memory was 187.9MB in the beginning and 136.0MB in the end (delta: 51.9MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. * TraceAbstraction took 15831.80ms. Allocated memory was 253.8MB in the beginning and 2.8GB in the end (delta: 2.6GB). Free memory was 136.0MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 613.1MB. 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_p1_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; [L836] 0 pthread_t t1461; [L837] FCALL, FORK 0 pthread_create(&t1461, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1461={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] [L838] 0 pthread_t t1462; [L839] FCALL, FORK 0 pthread_create(&t1462, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_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, t1461={5:0}, t1462={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] [L840] 0 pthread_t t1463; [L841] FCALL, FORK 0 pthread_create(&t1463, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1461={5:0}, t1462={6:0}, t1463={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] [L842] 0 pthread_t t1464; [L843] FCALL, FORK 0 pthread_create(&t1464, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1461={5:0}, t1462={6:0}, t1463={7:0}, t1464={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] [L798] 4 z$w_buff1 = z$w_buff0 [L799] 4 z$w_buff0 = 2 [L800] 4 z$w_buff1_used = z$w_buff0_used [L801] 4 z$w_buff0_used = (_Bool)1 [L802] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L802] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L803] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L804] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L805] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L806] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L807] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L808] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=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$$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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L811] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=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$$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=2, 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_p1_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=2, 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_p1_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=2, 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_p1_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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L766] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_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=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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L778] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_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=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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L781] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_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=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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L784] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L785] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L786] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L787] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L788] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_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=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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L814] 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) [L815] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L816] 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 [L817] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L818] 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=0, __unbuffered_p1_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$$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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_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=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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L771] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_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=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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L791] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_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=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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L821] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p1_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$$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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L845] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p1_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, t1461={5:0}, t1462={6:0}, t1463={7:0}, t1464={3: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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L847] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L847] RET 0 assume_abort_if_not(main$tmp_guard0) [L849] 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) [L850] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L851] 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 [L852] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L853] 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_p1_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, t1461={5:0}, t1462={6:0}, t1463={7:0}, t1464={3: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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L856] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L857] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L858] 0 z$flush_delayed = weak$$choice2 [L859] 0 z$mem_tmp = z [L860] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L861] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L862] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L863] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L864] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L865] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L866] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L867] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 0) [L868] 0 z = z$flush_delayed ? z$mem_tmp : z [L869] 0 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=4, __unbuffered_p1_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, t1461={5:0}, t1462={6:0}, t1463={7:0}, t1464={3:0}, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L871] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, __unbuffered_cnt=4, __unbuffered_p1_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=1, z$flush_delayed=0, z$mem_tmp=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L18] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[expression],IntegerLiteral[0]]]] VAL [\old(expression)=0, __unbuffered_cnt=4, __unbuffered_p1_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=1, z$flush_delayed=0, z$mem_tmp=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L18] 0 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=4, __unbuffered_p1_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=1, z$flush_delayed=0, z$mem_tmp=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] - 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: 837]: 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: 839]: 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: 841]: 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: 843]: 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: 15.6s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 12.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 764 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 721 mSDsluCounter, 220 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 181 mSDsCounter, 80 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1986 IncrementalHoareTripleChecker+Invalid, 2066 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 80 mSolverCounterUnsat, 39 mSDtfsCounter, 1986 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 113 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=431occurred in iteration=12, InterpolantAutomatonStates: 97, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 404 NumberOfCodeBlocks, 404 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 351 ConstructedInterpolants, 0 QuantifiedInterpolants, 1700 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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:53,273 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