./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix021_power.oepc_pso.oepc_rmo.oepc.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/mix021_power.oepc_pso.oepc_rmo.oepc.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/mix021_power.oepc_pso.oepc_rmo.oepc.i ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/mix021_power.oepc_pso.oepc_rmo.oepc.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:35:57,070 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-31 17:35:57,141 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-31 17:35:57,145 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-31 17:35:57,145 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-31 17:35:57,167 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-31 17:35:57,168 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-31 17:35:57,169 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-31 17:35:57,169 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-31 17:35:57,174 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-31 17:35:57,174 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-31 17:35:57,175 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-31 17:35:57,176 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-31 17:35:57,177 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-31 17:35:57,177 INFO L153 SettingsManager]: * Use SBE=true [2024-01-31 17:35:57,177 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-31 17:35:57,178 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-31 17:35:57,178 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-31 17:35:57,178 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-31 17:35:57,178 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-31 17:35:57,178 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-31 17:35:57,179 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-31 17:35:57,179 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-31 17:35:57,179 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-31 17:35:57,179 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-31 17:35:57,180 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-31 17:35:57,180 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-31 17:35:57,180 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-31 17:35:57,181 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-31 17:35:57,181 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-31 17:35:57,182 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-31 17:35:57,182 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-31 17:35:57,182 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-31 17:35:57,182 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-31 17:35:57,183 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-31 17:35:57,183 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-31 17:35:57,183 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-31 17:35:57,183 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-31 17:35:57,183 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-31 17:35:57,183 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-31 17:35:57,184 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-31 17:35:57,184 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-31 17:35:57,184 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-31 17:35:57,184 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:35:57,405 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-31 17:35:57,427 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-31 17:35:57,430 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-31 17:35:57,430 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-01-31 17:35:57,431 INFO L274 PluginConnector]: Witness Parser initialized [2024-01-31 17:35:57,432 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/mix021_power.oepc_pso.oepc_rmo.oepc.yml/witness.yml [2024-01-31 17:35:58,150 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-31 17:35:58,150 INFO L274 PluginConnector]: CDTParser initialized [2024-01-31 17:35:58,151 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix021_power.oepc_pso.oepc_rmo.oepc.i [2024-01-31 17:35:59,226 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-31 17:35:59,437 INFO L384 CDTParser]: Found 1 translation units. [2024-01-31 17:35:59,438 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix021_power.oepc_pso.oepc_rmo.oepc.i [2024-01-31 17:35:59,452 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/836990238/f9ff318096b34434bae7790fab523529/FLAG75eaa7f45 [2024-01-31 17:35:59,773 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/836990238/f9ff318096b34434bae7790fab523529 [2024-01-31 17:35:59,774 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-31 17:35:59,775 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-31 17:35:59,775 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-31 17:35:59,776 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-31 17:35:59,780 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-31 17:35:59,780 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 31.01 05:35:58" (1/2) ... [2024-01-31 17:35:59,781 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@164f7b69 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:35:59, skipping insertion in model container [2024-01-31 17:35:59,781 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 31.01 05:35:58" (1/2) ... [2024-01-31 17:35:59,782 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@5955352f and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:35:59, skipping insertion in model container [2024-01-31 17:35:59,785 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 05:35:59" (2/2) ... [2024-01-31 17:35:59,785 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@164f7b69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:35:59, skipping insertion in model container [2024-01-31 17:35:59,785 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 05:35:59" (2/2) ... [2024-01-31 17:35:59,785 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-01-31 17:36:01,979 INFO L96 nessWitnessExtractor]: Found the following entries in the witness: [2024-01-31 17:36:01,981 INFO L98 nessWitnessExtractor]: Location invariant before [L18-L18] expression == 0 [2024-01-31 17:36:01,981 INFO L98 nessWitnessExtractor]: Location invariant after [L18-L18] expression == 1 [2024-01-31 17:36:02,034 INFO L179 MainTranslator]: Built tables and reachable declarations [2024-01-31 17:36:02,201 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/mix021_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2024-01-31 17:36:02,298 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-31 17:36:02,305 INFO L204 MainTranslator]: Completed pre-run [2024-01-31 17:36:02,313 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/mix021_power.oepc_pso.oepc_rmo.oepc.i[969,982] Start Parsing Local [2024-01-31 17:36:02,328 WARN L424 MainDispatcher]: Unable to annotate ; with a witness entry [2024-01-31 17:36:02,376 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-31 17:36:02,412 INFO L208 MainTranslator]: Completed translation [2024-01-31 17:36:02,413 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:36:02 WrapperNode [2024-01-31 17:36:02,414 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-31 17:36:02,415 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-31 17:36:02,415 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-31 17:36:02,415 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-31 17:36:02,420 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:36:02" (1/1) ... [2024-01-31 17:36:02,442 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:36:02" (1/1) ... [2024-01-31 17:36:02,463 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 145 [2024-01-31 17:36:02,467 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-31 17:36:02,468 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-31 17:36:02,469 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-31 17:36:02,469 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-31 17:36:02,477 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:36:02" (1/1) ... [2024-01-31 17:36:02,477 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:36:02" (1/1) ... [2024-01-31 17:36:02,481 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:36:02" (1/1) ... [2024-01-31 17:36:02,494 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:36:02,494 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:36:02" (1/1) ... [2024-01-31 17:36:02,494 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:36:02" (1/1) ... [2024-01-31 17:36:02,509 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:36:02" (1/1) ... [2024-01-31 17:36:02,511 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:36:02" (1/1) ... [2024-01-31 17:36:02,512 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:36:02" (1/1) ... [2024-01-31 17:36:02,514 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:36:02" (1/1) ... [2024-01-31 17:36:02,529 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-31 17:36:02,530 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-31 17:36:02,530 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-31 17:36:02,530 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-31 17:36:02,531 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:36:02" (1/1) ... [2024-01-31 17:36:02,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-31 17:36:02,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-31 17:36:02,561 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:36:02,607 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:36:02,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-31 17:36:02,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-31 17:36:02,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-31 17:36:02,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-31 17:36:02,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-01-31 17:36:02,621 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-01-31 17:36:02,621 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-31 17:36:02,621 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-31 17:36:02,621 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-31 17:36:02,622 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-01-31 17:36:02,622 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-01-31 17:36:02,622 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-01-31 17:36:02,623 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-01-31 17:36:02,623 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-01-31 17:36:02,623 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-01-31 17:36:02,623 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-01-31 17:36:02,625 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-01-31 17:36:02,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-31 17:36:02,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-31 17:36:02,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-31 17:36:02,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-31 17:36:02,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-01-31 17:36:02,626 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-01-31 17:36:02,626 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-31 17:36:02,626 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-31 17:36:02,627 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:36:02,737 INFO L244 CfgBuilder]: Building ICFG [2024-01-31 17:36:02,748 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-31 17:36:03,025 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-31 17:36:03,025 INFO L293 CfgBuilder]: Performing block encoding [2024-01-31 17:36:03,163 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-31 17:36:03,164 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-01-31 17:36:03,164 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 05:36:03 BoogieIcfgContainer [2024-01-31 17:36:03,164 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-31 17:36:03,166 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-31 17:36:03,166 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-31 17:36:03,168 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-31 17:36:03,168 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 31.01 05:35:58" (1/4) ... [2024-01-31 17:36:03,169 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6732fc22 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 31.01 05:36:03, skipping insertion in model container [2024-01-31 17:36:03,171 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 05:35:59" (2/4) ... [2024-01-31 17:36:03,172 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6732fc22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 05:36:03, skipping insertion in model container [2024-01-31 17:36:03,172 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:36:02" (3/4) ... [2024-01-31 17:36:03,184 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6732fc22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 05:36:03, skipping insertion in model container [2024-01-31 17:36:03,184 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 05:36:03" (4/4) ... [2024-01-31 17:36:03,185 INFO L112 eAbstractionObserver]: Analyzing ICFG mix021_power.oepc_pso.oepc_rmo.oepc.i [2024-01-31 17:36:03,198 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-31 17:36:03,208 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-01-31 17:36:03,209 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-31 17:36:03,254 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-01-31 17:36:03,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 52 transitions, 120 flow [2024-01-31 17:36:03,296 INFO L124 PetriNetUnfolderBase]: 1/48 cut-off events. [2024-01-31 17:36:03,296 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-31 17:36:03,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61 conditions, 48 events. 1/48 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 96 event pairs, 0 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 52. Up to 2 conditions per place. [2024-01-31 17:36:03,299 INFO L82 GeneralOperation]: Start removeDead. Operand has 64 places, 52 transitions, 120 flow [2024-01-31 17:36:03,303 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 60 places, 48 transitions, 108 flow [2024-01-31 17:36:03,315 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-31 17:36:03,319 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;@115eb69f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-31 17:36:03,320 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2024-01-31 17:36:03,322 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-31 17:36:03,324 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-01-31 17:36:03,324 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-31 17:36:03,324 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:36:03,325 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-01-31 17:36:03,326 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-01-31 17:36:03,329 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:36:03,330 INFO L85 PathProgramCache]: Analyzing trace with hash 12520184, now seen corresponding path program 1 times [2024-01-31 17:36:03,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:36:03,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607156948] [2024-01-31 17:36:03,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:36:03,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:36:03,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:36:03,680 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:36:03,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:36:03,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607156948] [2024-01-31 17:36:03,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607156948] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:36:03,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:36:03,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-31 17:36:03,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55474016] [2024-01-31 17:36:03,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:36:03,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-01-31 17:36:03,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:36:03,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-01-31 17:36:03,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-01-31 17:36:03,744 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 52 [2024-01-31 17:36:03,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 48 transitions, 108 flow. Second operand has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 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:36:03,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:36:03,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 52 [2024-01-31 17:36:03,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:36:04,369 INFO L124 PetriNetUnfolderBase]: 3179/5508 cut-off events. [2024-01-31 17:36:04,369 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-31 17:36:04,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10036 conditions, 5508 events. 3179/5508 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 332. Compared 40814 event pairs, 3179 based on Foata normal form. 135/5004 useless extension candidates. Maximal degree in co-relation 10024. Up to 4391 conditions per place. [2024-01-31 17:36:04,429 INFO L140 encePairwiseOnDemand]: 50/52 looper letters, 24 selfloop transitions, 0 changer transitions 0/46 dead transitions. [2024-01-31 17:36:04,429 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 46 transitions, 152 flow [2024-01-31 17:36:04,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-31 17:36:04,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-01-31 17:36:04,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 78 transitions. [2024-01-31 17:36:04,438 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.75 [2024-01-31 17:36:04,439 INFO L175 Difference]: Start difference. First operand has 60 places, 48 transitions, 108 flow. Second operand 2 states and 78 transitions. [2024-01-31 17:36:04,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 46 transitions, 152 flow [2024-01-31 17:36:04,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 46 transitions, 148 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-01-31 17:36:04,449 INFO L231 Difference]: Finished difference. Result has 56 places, 46 transitions, 100 flow [2024-01-31 17:36:04,451 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=100, PETRI_PLACES=56, PETRI_TRANSITIONS=46} [2024-01-31 17:36:04,454 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -4 predicate places. [2024-01-31 17:36:04,454 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 46 transitions, 100 flow [2024-01-31 17:36:04,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 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:36:04,454 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:36:04,454 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-01-31 17:36:04,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-31 17:36:04,455 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-01-31 17:36:04,456 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:36:04,456 INFO L85 PathProgramCache]: Analyzing trace with hash 12520185, now seen corresponding path program 1 times [2024-01-31 17:36:04,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:36:04,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536952313] [2024-01-31 17:36:04,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:36:04,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:36:04,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:36:04,654 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:36:04,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:36:04,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536952313] [2024-01-31 17:36:04,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536952313] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:36:04,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:36:04,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-31 17:36:04,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535232542] [2024-01-31 17:36:04,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:36:04,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-31 17:36:04,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:36:04,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-31 17:36:04,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-31 17:36:04,658 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 52 [2024-01-31 17:36:04,658 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 46 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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:36:04,659 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:36:04,659 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 52 [2024-01-31 17:36:04,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:36:05,053 INFO L124 PetriNetUnfolderBase]: 2495/3993 cut-off events. [2024-01-31 17:36:05,053 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-31 17:36:05,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7566 conditions, 3993 events. 2495/3993 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 25056 event pairs, 1647 based on Foata normal form. 0/3911 useless extension candidates. Maximal degree in co-relation 7563. Up to 2779 conditions per place. [2024-01-31 17:36:05,071 INFO L140 encePairwiseOnDemand]: 49/52 looper letters, 37 selfloop transitions, 2 changer transitions 2/63 dead transitions. [2024-01-31 17:36:05,071 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 63 transitions, 222 flow [2024-01-31 17:36:05,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-31 17:36:05,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-31 17:36:05,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 120 transitions. [2024-01-31 17:36:05,073 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7692307692307693 [2024-01-31 17:36:05,073 INFO L175 Difference]: Start difference. First operand has 56 places, 46 transitions, 100 flow. Second operand 3 states and 120 transitions. [2024-01-31 17:36:05,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 63 transitions, 222 flow [2024-01-31 17:36:05,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 63 transitions, 222 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-01-31 17:36:05,075 INFO L231 Difference]: Finished difference. Result has 57 places, 44 transitions, 100 flow [2024-01-31 17:36:05,075 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=57, PETRI_TRANSITIONS=44} [2024-01-31 17:36:05,076 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -3 predicate places. [2024-01-31 17:36:05,076 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 44 transitions, 100 flow [2024-01-31 17:36:05,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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:36:05,076 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:36:05,077 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:36:05,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-31 17:36:05,077 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-01-31 17:36:05,077 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:36:05,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1775083914, now seen corresponding path program 1 times [2024-01-31 17:36:05,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:36:05,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804312051] [2024-01-31 17:36:05,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:36:05,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:36:05,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:36:05,113 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:36:05,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:36:05,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804312051] [2024-01-31 17:36:05,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804312051] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:36:05,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:36:05,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-31 17:36:05,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952218810] [2024-01-31 17:36:05,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:36:05,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-31 17:36:05,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:36:05,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-31 17:36:05,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-31 17:36:05,119 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 52 [2024-01-31 17:36:05,119 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 44 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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:36:05,119 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:36:05,119 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 52 [2024-01-31 17:36:05,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:36:05,602 INFO L124 PetriNetUnfolderBase]: 3311/5211 cut-off events. [2024-01-31 17:36:05,602 INFO L125 PetriNetUnfolderBase]: For 314/314 co-relation queries the response was YES. [2024-01-31 17:36:05,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10204 conditions, 5211 events. 3311/5211 cut-off events. For 314/314 co-relation queries the response was YES. Maximal size of possible extension queue 308. Compared 34714 event pairs, 2495 based on Foata normal form. 0/4929 useless extension candidates. Maximal degree in co-relation 10200. Up to 3465 conditions per place. [2024-01-31 17:36:05,628 INFO L140 encePairwiseOnDemand]: 50/52 looper letters, 33 selfloop transitions, 1 changer transitions 1/53 dead transitions. [2024-01-31 17:36:05,628 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 53 transitions, 190 flow [2024-01-31 17:36:05,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-31 17:36:05,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-31 17:36:05,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2024-01-31 17:36:05,629 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6538461538461539 [2024-01-31 17:36:05,630 INFO L175 Difference]: Start difference. First operand has 57 places, 44 transitions, 100 flow. Second operand 3 states and 102 transitions. [2024-01-31 17:36:05,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 53 transitions, 190 flow [2024-01-31 17:36:05,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 53 transitions, 184 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-31 17:36:05,631 INFO L231 Difference]: Finished difference. Result has 55 places, 42 transitions, 94 flow [2024-01-31 17:36:05,631 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=55, PETRI_TRANSITIONS=42} [2024-01-31 17:36:05,632 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -5 predicate places. [2024-01-31 17:36:05,632 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 42 transitions, 94 flow [2024-01-31 17:36:05,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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:36:05,632 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:36:05,632 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:36:05,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-31 17:36:05,633 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-01-31 17:36:05,633 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:36:05,633 INFO L85 PathProgramCache]: Analyzing trace with hash -806973097, now seen corresponding path program 1 times [2024-01-31 17:36:05,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:36:05,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334578137] [2024-01-31 17:36:05,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:36:05,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:36:05,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:36:05,812 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:36:05,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:36:05,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334578137] [2024-01-31 17:36:05,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334578137] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:36:05,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:36:05,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-31 17:36:05,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779893682] [2024-01-31 17:36:05,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:36:05,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-31 17:36:05,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:36:05,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-31 17:36:05,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-31 17:36:05,831 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 52 [2024-01-31 17:36:05,832 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 42 transitions, 94 flow. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 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:36:05,832 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:36:05,832 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 52 [2024-01-31 17:36:05,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:36:06,669 INFO L124 PetriNetUnfolderBase]: 7779/12167 cut-off events. [2024-01-31 17:36:06,670 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-31 17:36:06,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23393 conditions, 12167 events. 7779/12167 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 694. Compared 86744 event pairs, 1033 based on Foata normal form. 400/12420 useless extension candidates. Maximal degree in co-relation 23389. Up to 5841 conditions per place. [2024-01-31 17:36:06,716 INFO L140 encePairwiseOnDemand]: 45/52 looper letters, 52 selfloop transitions, 6 changer transitions 1/74 dead transitions. [2024-01-31 17:36:06,716 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 74 transitions, 282 flow [2024-01-31 17:36:06,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-31 17:36:06,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-31 17:36:06,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 145 transitions. [2024-01-31 17:36:06,718 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6971153846153846 [2024-01-31 17:36:06,718 INFO L175 Difference]: Start difference. First operand has 55 places, 42 transitions, 94 flow. Second operand 4 states and 145 transitions. [2024-01-31 17:36:06,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 74 transitions, 282 flow [2024-01-31 17:36:06,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 74 transitions, 281 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-31 17:36:06,748 INFO L231 Difference]: Finished difference. Result has 58 places, 46 transitions, 135 flow [2024-01-31 17:36:06,748 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=135, PETRI_PLACES=58, PETRI_TRANSITIONS=46} [2024-01-31 17:36:06,748 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -2 predicate places. [2024-01-31 17:36:06,748 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 46 transitions, 135 flow [2024-01-31 17:36:06,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 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:36:06,749 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:36:06,749 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:36:06,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-31 17:36:06,749 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-01-31 17:36:06,750 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:36:06,750 INFO L85 PathProgramCache]: Analyzing trace with hash -81726388, now seen corresponding path program 1 times [2024-01-31 17:36:06,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:36:06,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545283301] [2024-01-31 17:36:06,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:36:06,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:36:06,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:36:06,870 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:36:06,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:36:06,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545283301] [2024-01-31 17:36:06,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545283301] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:36:06,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:36:06,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-31 17:36:06,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910799389] [2024-01-31 17:36:06,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:36:06,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-31 17:36:06,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:36:06,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-31 17:36:06,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-01-31 17:36:06,882 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 52 [2024-01-31 17:36:06,882 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 135 flow. Second operand has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:36:06,882 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:36:06,882 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 52 [2024-01-31 17:36:06,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:36:07,684 INFO L124 PetriNetUnfolderBase]: 6075/9467 cut-off events. [2024-01-31 17:36:07,684 INFO L125 PetriNetUnfolderBase]: For 2276/2276 co-relation queries the response was YES. [2024-01-31 17:36:07,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21496 conditions, 9467 events. 6075/9467 cut-off events. For 2276/2276 co-relation queries the response was YES. Maximal size of possible extension queue 524. Compared 63320 event pairs, 451 based on Foata normal form. 364/9702 useless extension candidates. Maximal degree in co-relation 21490. Up to 3681 conditions per place. [2024-01-31 17:36:07,728 INFO L140 encePairwiseOnDemand]: 45/52 looper letters, 67 selfloop transitions, 10 changer transitions 1/93 dead transitions. [2024-01-31 17:36:07,728 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 93 transitions, 414 flow [2024-01-31 17:36:07,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-31 17:36:07,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-31 17:36:07,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 185 transitions. [2024-01-31 17:36:07,730 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7115384615384616 [2024-01-31 17:36:07,730 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 135 flow. Second operand 5 states and 185 transitions. [2024-01-31 17:36:07,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 93 transitions, 414 flow [2024-01-31 17:36:07,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 93 transitions, 403 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-01-31 17:36:07,733 INFO L231 Difference]: Finished difference. Result has 62 places, 50 transitions, 187 flow [2024-01-31 17:36:07,733 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=62, PETRI_TRANSITIONS=50} [2024-01-31 17:36:07,734 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 2 predicate places. [2024-01-31 17:36:07,734 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 50 transitions, 187 flow [2024-01-31 17:36:07,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:36:07,735 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:36:07,735 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:36:07,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-31 17:36:07,735 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-01-31 17:36:07,735 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:36:07,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1512374793, now seen corresponding path program 1 times [2024-01-31 17:36:07,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:36:07,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670586892] [2024-01-31 17:36:07,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:36:07,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:36:07,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:36:07,958 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:36:07,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:36:07,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670586892] [2024-01-31 17:36:07,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670586892] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:36:07,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:36:07,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-31 17:36:07,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391707379] [2024-01-31 17:36:07,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:36:07,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-31 17:36:07,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:36:07,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-31 17:36:07,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-01-31 17:36:07,968 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 52 [2024-01-31 17:36:07,969 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 50 transitions, 187 flow. Second operand has 6 states, 6 states have (on average 24.0) internal successors, (144), 6 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:36:07,969 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:36:07,969 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 52 [2024-01-31 17:36:07,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:36:08,542 INFO L124 PetriNetUnfolderBase]: 4027/6115 cut-off events. [2024-01-31 17:36:08,543 INFO L125 PetriNetUnfolderBase]: For 4654/4654 co-relation queries the response was YES. [2024-01-31 17:36:08,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15662 conditions, 6115 events. 4027/6115 cut-off events. For 4654/4654 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 35731 event pairs, 289 based on Foata normal form. 244/6235 useless extension candidates. Maximal degree in co-relation 15655. Up to 1788 conditions per place. [2024-01-31 17:36:08,572 INFO L140 encePairwiseOnDemand]: 45/52 looper letters, 80 selfloop transitions, 14 changer transitions 1/110 dead transitions. [2024-01-31 17:36:08,573 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 110 transitions, 545 flow [2024-01-31 17:36:08,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-31 17:36:08,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-31 17:36:08,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 223 transitions. [2024-01-31 17:36:08,574 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7147435897435898 [2024-01-31 17:36:08,575 INFO L175 Difference]: Start difference. First operand has 62 places, 50 transitions, 187 flow. Second operand 6 states and 223 transitions. [2024-01-31 17:36:08,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 110 transitions, 545 flow [2024-01-31 17:36:08,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 110 transitions, 515 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-01-31 17:36:08,592 INFO L231 Difference]: Finished difference. Result has 65 places, 54 transitions, 237 flow [2024-01-31 17:36:08,593 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=237, PETRI_PLACES=65, PETRI_TRANSITIONS=54} [2024-01-31 17:36:08,595 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 5 predicate places. [2024-01-31 17:36:08,595 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 54 transitions, 237 flow [2024-01-31 17:36:08,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 6 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:36:08,595 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:36:08,596 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:36:08,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-31 17:36:08,596 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-01-31 17:36:08,596 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:36:08,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1058250358, now seen corresponding path program 1 times [2024-01-31 17:36:08,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:36:08,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212371994] [2024-01-31 17:36:08,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:36:08,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:36:08,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:36:08,818 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:36:08,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:36:08,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212371994] [2024-01-31 17:36:08,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212371994] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:36:08,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:36:08,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-01-31 17:36:08,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321539284] [2024-01-31 17:36:08,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:36:08,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-01-31 17:36:08,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:36:08,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-01-31 17:36:08,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-01-31 17:36:08,823 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 52 [2024-01-31 17:36:08,824 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 54 transitions, 237 flow. Second operand has 7 states, 7 states have (on average 23.857142857142858) internal successors, (167), 7 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:36:08,824 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:36:08,824 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 52 [2024-01-31 17:36:08,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:36:09,228 INFO L124 PetriNetUnfolderBase]: 2863/4163 cut-off events. [2024-01-31 17:36:09,229 INFO L125 PetriNetUnfolderBase]: For 5022/5022 co-relation queries the response was YES. [2024-01-31 17:36:09,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11607 conditions, 4163 events. 2863/4163 cut-off events. For 5022/5022 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 21721 event pairs, 231 based on Foata normal form. 96/4135 useless extension candidates. Maximal degree in co-relation 11599. Up to 1316 conditions per place. [2024-01-31 17:36:09,243 INFO L140 encePairwiseOnDemand]: 45/52 looper letters, 71 selfloop transitions, 18 changer transitions 1/105 dead transitions. [2024-01-31 17:36:09,243 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 105 transitions, 535 flow [2024-01-31 17:36:09,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-31 17:36:09,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-01-31 17:36:09,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 239 transitions. [2024-01-31 17:36:09,245 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6565934065934066 [2024-01-31 17:36:09,245 INFO L175 Difference]: Start difference. First operand has 65 places, 54 transitions, 237 flow. Second operand 7 states and 239 transitions. [2024-01-31 17:36:09,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 105 transitions, 535 flow [2024-01-31 17:36:09,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 105 transitions, 489 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-01-31 17:36:09,267 INFO L231 Difference]: Finished difference. Result has 68 places, 54 transitions, 247 flow [2024-01-31 17:36:09,268 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=247, PETRI_PLACES=68, PETRI_TRANSITIONS=54} [2024-01-31 17:36:09,268 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 8 predicate places. [2024-01-31 17:36:09,269 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 54 transitions, 247 flow [2024-01-31 17:36:09,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.857142857142858) internal successors, (167), 7 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:36:09,269 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:36:09,269 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, 1] [2024-01-31 17:36:09,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-31 17:36:09,269 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-01-31 17:36:09,270 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:36:09,270 INFO L85 PathProgramCache]: Analyzing trace with hash -506779151, now seen corresponding path program 1 times [2024-01-31 17:36:09,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:36:09,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226020287] [2024-01-31 17:36:09,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:36:09,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:36:09,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:36:10,165 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:36:10,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:36:10,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226020287] [2024-01-31 17:36:10,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226020287] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:36:10,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:36:10,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-01-31 17:36:10,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515357353] [2024-01-31 17:36:10,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:36:10,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-01-31 17:36:10,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:36:10,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-01-31 17:36:10,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-01-31 17:36:10,185 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 52 [2024-01-31 17:36:10,186 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 54 transitions, 247 flow. Second operand has 10 states, 10 states have (on average 25.1) internal successors, (251), 10 states have internal predecessors, (251), 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:36:10,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:36:10,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 52 [2024-01-31 17:36:10,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:36:10,745 INFO L124 PetriNetUnfolderBase]: 2181/3522 cut-off events. [2024-01-31 17:36:10,745 INFO L125 PetriNetUnfolderBase]: For 2232/2366 co-relation queries the response was YES. [2024-01-31 17:36:10,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8696 conditions, 3522 events. 2181/3522 cut-off events. For 2232/2366 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 21048 event pairs, 543 based on Foata normal form. 16/3330 useless extension candidates. Maximal degree in co-relation 8687. Up to 1087 conditions per place. [2024-01-31 17:36:10,759 INFO L140 encePairwiseOnDemand]: 44/52 looper letters, 57 selfloop transitions, 5 changer transitions 16/107 dead transitions. [2024-01-31 17:36:10,760 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 107 transitions, 531 flow [2024-01-31 17:36:10,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-01-31 17:36:10,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-01-31 17:36:10,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 286 transitions. [2024-01-31 17:36:10,761 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6111111111111112 [2024-01-31 17:36:10,761 INFO L175 Difference]: Start difference. First operand has 68 places, 54 transitions, 247 flow. Second operand 9 states and 286 transitions. [2024-01-31 17:36:10,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 107 transitions, 531 flow [2024-01-31 17:36:10,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 107 transitions, 425 flow, removed 22 selfloop flow, removed 10 redundant places. [2024-01-31 17:36:10,774 INFO L231 Difference]: Finished difference. Result has 70 places, 55 transitions, 174 flow [2024-01-31 17:36:10,774 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=174, PETRI_PLACES=70, PETRI_TRANSITIONS=55} [2024-01-31 17:36:10,774 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 10 predicate places. [2024-01-31 17:36:10,774 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 55 transitions, 174 flow [2024-01-31 17:36:10,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 25.1) internal successors, (251), 10 states have internal predecessors, (251), 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:36:10,775 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:36:10,775 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, 1] [2024-01-31 17:36:10,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-31 17:36:10,775 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-01-31 17:36:10,776 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:36:10,776 INFO L85 PathProgramCache]: Analyzing trace with hash -60396897, now seen corresponding path program 2 times [2024-01-31 17:36:10,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:36:10,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621858010] [2024-01-31 17:36:10,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:36:10,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:36:10,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:36:10,960 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:36:10,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:36:10,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621858010] [2024-01-31 17:36:10,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621858010] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:36:10,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:36:10,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-01-31 17:36:10,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130998965] [2024-01-31 17:36:10,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:36:10,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-31 17:36:10,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:36:10,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-31 17:36:10,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-01-31 17:36:10,983 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 52 [2024-01-31 17:36:10,984 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 55 transitions, 174 flow. Second operand has 6 states, 6 states have (on average 21.5) internal successors, (129), 6 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:36:10,984 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:36:10,984 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 52 [2024-01-31 17:36:10,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:36:12,359 INFO L124 PetriNetUnfolderBase]: 12371/18910 cut-off events. [2024-01-31 17:36:12,360 INFO L125 PetriNetUnfolderBase]: For 3038/3038 co-relation queries the response was YES. [2024-01-31 17:36:12,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40671 conditions, 18910 events. 12371/18910 cut-off events. For 3038/3038 co-relation queries the response was YES. Maximal size of possible extension queue 943. Compared 132911 event pairs, 2708 based on Foata normal form. 32/18120 useless extension candidates. Maximal degree in co-relation 40663. Up to 7640 conditions per place. [2024-01-31 17:36:12,426 INFO L140 encePairwiseOnDemand]: 41/52 looper letters, 58 selfloop transitions, 11 changer transitions 29/121 dead transitions. [2024-01-31 17:36:12,427 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 121 transitions, 544 flow [2024-01-31 17:36:12,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-01-31 17:36:12,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-01-31 17:36:12,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 233 transitions. [2024-01-31 17:36:12,428 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5600961538461539 [2024-01-31 17:36:12,428 INFO L175 Difference]: Start difference. First operand has 70 places, 55 transitions, 174 flow. Second operand 8 states and 233 transitions. [2024-01-31 17:36:12,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 121 transitions, 544 flow [2024-01-31 17:36:12,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 121 transitions, 516 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-01-31 17:36:12,453 INFO L231 Difference]: Finished difference. Result has 75 places, 63 transitions, 248 flow [2024-01-31 17:36:12,453 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=248, PETRI_PLACES=75, PETRI_TRANSITIONS=63} [2024-01-31 17:36:12,454 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 15 predicate places. [2024-01-31 17:36:12,454 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 63 transitions, 248 flow [2024-01-31 17:36:12,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.5) internal successors, (129), 6 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:36:12,454 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:36:12,454 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, 1] [2024-01-31 17:36:12,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-31 17:36:12,455 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-01-31 17:36:12,455 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:36:12,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1670724357, now seen corresponding path program 3 times [2024-01-31 17:36:12,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:36:12,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220248216] [2024-01-31 17:36:12,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:36:12,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:36:12,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:36:12,698 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:36:12,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:36:12,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220248216] [2024-01-31 17:36:12,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220248216] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:36:12,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:36:12,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-01-31 17:36:12,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305896887] [2024-01-31 17:36:12,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:36:12,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-01-31 17:36:12,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:36:12,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-01-31 17:36:12,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-01-31 17:36:12,719 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 52 [2024-01-31 17:36:12,719 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 63 transitions, 248 flow. Second operand has 7 states, 7 states have (on average 20.0) internal successors, (140), 7 states have internal predecessors, (140), 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:36:12,720 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:36:12,720 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 52 [2024-01-31 17:36:12,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:36:15,608 INFO L124 PetriNetUnfolderBase]: 24280/36803 cut-off events. [2024-01-31 17:36:15,609 INFO L125 PetriNetUnfolderBase]: For 12276/12279 co-relation queries the response was YES. [2024-01-31 17:36:15,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87194 conditions, 36803 events. 24280/36803 cut-off events. For 12276/12279 co-relation queries the response was YES. Maximal size of possible extension queue 1928. Compared 278798 event pairs, 3508 based on Foata normal form. 16/35155 useless extension candidates. Maximal degree in co-relation 87183. Up to 10232 conditions per place. [2024-01-31 17:36:15,744 INFO L140 encePairwiseOnDemand]: 40/52 looper letters, 55 selfloop transitions, 12 changer transitions 58/147 dead transitions. [2024-01-31 17:36:15,744 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 147 transitions, 787 flow [2024-01-31 17:36:15,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-01-31 17:36:15,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-01-31 17:36:15,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 238 transitions. [2024-01-31 17:36:15,746 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5721153846153846 [2024-01-31 17:36:15,746 INFO L175 Difference]: Start difference. First operand has 75 places, 63 transitions, 248 flow. Second operand 8 states and 238 transitions. [2024-01-31 17:36:15,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 147 transitions, 787 flow [2024-01-31 17:36:15,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 147 transitions, 775 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-01-31 17:36:15,769 INFO L231 Difference]: Finished difference. Result has 81 places, 62 transitions, 302 flow [2024-01-31 17:36:15,769 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=302, PETRI_PLACES=81, PETRI_TRANSITIONS=62} [2024-01-31 17:36:15,770 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 21 predicate places. [2024-01-31 17:36:15,770 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 62 transitions, 302 flow [2024-01-31 17:36:15,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.0) internal successors, (140), 7 states have internal predecessors, (140), 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:36:15,770 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:36:15,770 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, 1] [2024-01-31 17:36:15,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-01-31 17:36:15,771 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-01-31 17:36:15,771 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:36:15,771 INFO L85 PathProgramCache]: Analyzing trace with hash -2140167611, now seen corresponding path program 4 times [2024-01-31 17:36:15,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:36:15,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814830932] [2024-01-31 17:36:15,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:36:15,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:36:15,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:36:16,149 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:36:16,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:36:16,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814830932] [2024-01-31 17:36:16,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814830932] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:36:16,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:36:16,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-01-31 17:36:16,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483632649] [2024-01-31 17:36:16,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:36:16,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-31 17:36:16,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:36:16,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-31 17:36:16,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-01-31 17:36:16,163 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 52 [2024-01-31 17:36:16,163 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 62 transitions, 302 flow. Second operand has 6 states, 6 states have (on average 21.5) internal successors, (129), 6 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:36:16,163 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:36:16,163 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 52 [2024-01-31 17:36:16,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:36:17,048 INFO L124 PetriNetUnfolderBase]: 6923/11545 cut-off events. [2024-01-31 17:36:17,049 INFO L125 PetriNetUnfolderBase]: For 7420/7480 co-relation queries the response was YES. [2024-01-31 17:36:17,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28705 conditions, 11545 events. 6923/11545 cut-off events. For 7420/7480 co-relation queries the response was YES. Maximal size of possible extension queue 622. Compared 83150 event pairs, 2041 based on Foata normal form. 44/11060 useless extension candidates. Maximal degree in co-relation 28691. Up to 5649 conditions per place. [2024-01-31 17:36:17,084 INFO L140 encePairwiseOnDemand]: 43/52 looper letters, 40 selfloop transitions, 5 changer transitions 36/105 dead transitions. [2024-01-31 17:36:17,084 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 105 transitions, 616 flow [2024-01-31 17:36:17,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-31 17:36:17,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-31 17:36:17,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 179 transitions. [2024-01-31 17:36:17,086 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5737179487179487 [2024-01-31 17:36:17,086 INFO L175 Difference]: Start difference. First operand has 81 places, 62 transitions, 302 flow. Second operand 6 states and 179 transitions. [2024-01-31 17:36:17,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 105 transitions, 616 flow [2024-01-31 17:36:17,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 105 transitions, 572 flow, removed 9 selfloop flow, removed 6 redundant places. [2024-01-31 17:36:17,095 INFO L231 Difference]: Finished difference. Result has 80 places, 55 transitions, 226 flow [2024-01-31 17:36:17,095 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=226, PETRI_PLACES=80, PETRI_TRANSITIONS=55} [2024-01-31 17:36:17,096 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 20 predicate places. [2024-01-31 17:36:17,096 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 55 transitions, 226 flow [2024-01-31 17:36:17,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.5) internal successors, (129), 6 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:36:17,096 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:36:17,097 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, 1] [2024-01-31 17:36:17,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-01-31 17:36:17,097 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-01-31 17:36:17,097 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:36:17,097 INFO L85 PathProgramCache]: Analyzing trace with hash -260914833, now seen corresponding path program 5 times [2024-01-31 17:36:17,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:36:17,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035395892] [2024-01-31 17:36:17,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:36:17,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:36:17,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-31 17:36:17,155 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-31 17:36:17,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-31 17:36:17,269 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-31 17:36:17,269 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-31 17:36:17,270 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (9 of 10 remaining) [2024-01-31 17:36:17,271 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 10 remaining) [2024-01-31 17:36:17,271 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONERROR_FUNCTION (7 of 10 remaining) [2024-01-31 17:36:17,272 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 10 remaining) [2024-01-31 17:36:17,272 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 10 remaining) [2024-01-31 17:36:17,272 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 10 remaining) [2024-01-31 17:36:17,272 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 10 remaining) [2024-01-31 17:36:17,272 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 10 remaining) [2024-01-31 17:36:17,272 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 10 remaining) [2024-01-31 17:36:17,273 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONERROR_FUNCTION (0 of 10 remaining) [2024-01-31 17:36:17,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-01-31 17:36:17,273 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:36:17,278 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-31 17:36:17,278 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-31 17:36:17,362 INFO L503 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-01-31 17:36:17,362 INFO L504 ceAbstractionStarter]: WitnessConsidered=2 [2024-01-31 17:36:17,363 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 05:36:17 BasicIcfg [2024-01-31 17:36:17,363 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-31 17:36:17,363 INFO L158 Benchmark]: Toolchain (without parser) took 17589.06ms. Allocated memory was 199.2MB in the beginning and 4.1GB in the end (delta: 3.9GB). Free memory was 95.4MB in the beginning and 3.5GB in the end (delta: -3.4GB). Peak memory consumption was 431.0MB. Max. memory is 16.1GB. [2024-01-31 17:36:17,364 INFO L158 Benchmark]: Witness Parser took 0.16ms. Allocated memory is still 134.2MB. Free memory is still 84.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-31 17:36:17,364 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 199.2MB. Free memory is still 142.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-31 17:36:17,365 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2638.51ms. Allocated memory was 199.2MB in the beginning and 310.4MB in the end (delta: 111.1MB). Free memory was 94.4MB in the beginning and 178.3MB in the end (delta: -83.9MB). Peak memory consumption was 130.6MB. Max. memory is 16.1GB. [2024-01-31 17:36:17,366 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.12ms. Allocated memory is still 310.4MB. Free memory was 178.3MB in the beginning and 176.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-31 17:36:17,366 INFO L158 Benchmark]: Boogie Preprocessor took 61.19ms. Allocated memory is still 310.4MB. Free memory was 176.2MB in the beginning and 173.1MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-01-31 17:36:17,366 INFO L158 Benchmark]: RCFGBuilder took 634.08ms. Allocated memory is still 310.4MB. Free memory was 172.0MB in the beginning and 116.4MB in the end (delta: 55.6MB). Peak memory consumption was 56.6MB. Max. memory is 16.1GB. [2024-01-31 17:36:17,366 INFO L158 Benchmark]: TraceAbstraction took 14197.55ms. Allocated memory was 310.4MB in the beginning and 4.1GB in the end (delta: 3.8GB). Free memory was 115.4MB in the beginning and 3.5GB in the end (delta: -3.4GB). Peak memory consumption was 340.8MB. Max. memory is 16.1GB. [2024-01-31 17:36:17,368 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.16ms. Allocated memory is still 134.2MB. Free memory is still 84.1MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.13ms. Allocated memory is still 199.2MB. Free memory is still 142.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2638.51ms. Allocated memory was 199.2MB in the beginning and 310.4MB in the end (delta: 111.1MB). Free memory was 94.4MB in the beginning and 178.3MB in the end (delta: -83.9MB). Peak memory consumption was 130.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.12ms. Allocated memory is still 310.4MB. Free memory was 178.3MB in the beginning and 176.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.19ms. Allocated memory is still 310.4MB. Free memory was 176.2MB in the beginning and 173.1MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 634.08ms. Allocated memory is still 310.4MB. Free memory was 172.0MB in the beginning and 116.4MB in the end (delta: 55.6MB). Peak memory consumption was 56.6MB. Max. memory is 16.1GB. * TraceAbstraction took 14197.55ms. Allocated memory was 310.4MB in the beginning and 4.1GB in the end (delta: 3.8GB). Free memory was 115.4MB in the beginning and 3.5GB in the end (delta: -3.4GB). Peak memory consumption was 340.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p2_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L719] 0 _Bool a$flush_delayed; [L720] 0 int a$mem_tmp; [L721] 0 _Bool a$r_buff0_thd0; [L722] 0 _Bool a$r_buff0_thd1; [L723] 0 _Bool a$r_buff0_thd2; [L724] 0 _Bool a$r_buff0_thd3; [L725] 0 _Bool a$r_buff0_thd4; [L726] 0 _Bool a$r_buff1_thd0; [L727] 0 _Bool a$r_buff1_thd1; [L728] 0 _Bool a$r_buff1_thd2; [L729] 0 _Bool a$r_buff1_thd3; [L730] 0 _Bool a$r_buff1_thd4; [L731] 0 _Bool a$read_delayed; [L732] 0 int *a$read_delayed_var; [L733] 0 int a$w_buff0; [L734] 0 _Bool a$w_buff0_used; [L735] 0 int a$w_buff1; [L736] 0 _Bool a$w_buff1_used; [L737] 0 _Bool main$tmp_guard0; [L738] 0 _Bool main$tmp_guard1; [L740] 0 int x = 0; [L742] 0 int y = 0; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L864] 0 pthread_t t553; [L865] FCALL, FORK 0 pthread_create(&t553, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t553={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L750] 1 a$w_buff1 = a$w_buff0 [L751] 1 a$w_buff0 = 1 [L752] 1 a$w_buff1_used = a$w_buff0_used [L753] 1 a$w_buff0_used = (_Bool)1 [L754] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L754] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L755] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L756] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L757] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L758] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L759] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L760] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L866] 0 pthread_t t554; [L867] FCALL, FORK 0 pthread_create(&t554, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t553={5:0}, t554={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L763] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L780] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=0] [L783] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=0] [L868] 0 pthread_t t555; [L869] FCALL, FORK 0 pthread_create(&t555, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t553={5:0}, t554={6:0}, t555={7:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L870] 0 pthread_t t556; [L871] FCALL, FORK 0 pthread_create(&t556, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t553={5:0}, t554={6:0}, t555={7:0}, t556={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L786] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L787] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L788] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L789] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L790] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L800] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L803] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L820] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=2, y=2, z=1] [L823] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=2, y=2, z=1] [L826] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L827] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L828] 4 a$flush_delayed = weak$$choice2 [L829] 4 a$mem_tmp = a [L830] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L831] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L832] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L833] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L834] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L835] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L836] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L837] 4 __unbuffered_p3_EBX = a [L838] 4 a = a$flush_delayed ? a$mem_tmp : a [L839] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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$$choice2=0, x=2, y=2, z=1] [L766] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L767] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L768] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L769] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L770] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z=1] [L773] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z=1] [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z=1] [L806] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L807] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L808] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L809] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L810] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z=1] [L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z=1] [L842] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L843] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L844] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L845] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L846] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z=1] [L849] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z=1] [L873] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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, t553={5:0}, t554={6:0}, t555={7:0}, t556={3:0}, weak$$choice2=0, x=2, y=2, z=1] [L875] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L875] RET 0 assume_abort_if_not(main$tmp_guard0) [L877] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L878] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L879] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L880] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L881] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [__unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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, t553={5:0}, t554={6:0}, t555={7:0}, t556={3:0}, weak$$choice2=0, x=2, y=2, z=1] [L884] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [__unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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, t553={5:0}, t554={6:0}, t555={7:0}, t556={3:0}, weak$$choice2=0, x=2, y=2, z=1] [L886] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z=1] [L18] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[expression],IntegerLiteral[0]]]] VAL [\old(expression)=0, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z=1] [L18] 0 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z=1] - UnprovableResult [Line: 18]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 18]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 865]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 867]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 871]: 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: 869]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 87 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: 14.0s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 10.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 759 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 716 mSDsluCounter, 355 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 304 mSDsCounter, 63 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1678 IncrementalHoareTripleChecker+Invalid, 1741 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 63 mSolverCounterUnsat, 51 mSDtfsCounter, 1678 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 76 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=302occurred in iteration=10, InterpolantAutomatonStates: 61, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 312 NumberOfCodeBlocks, 312 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 263 ConstructedInterpolants, 0 QuantifiedInterpolants, 1548 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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:36:17,400 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