./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix038_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/mix038_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/mix038_power.oepc_pso.oepc_rmo.oepc.i ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/mix038_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:37:55,774 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-31 17:37:55,809 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-31 17:37:55,813 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-31 17:37:55,814 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-31 17:37:55,832 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-31 17:37:55,833 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-31 17:37:55,833 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-31 17:37:55,834 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-31 17:37:55,837 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-31 17:37:55,837 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-31 17:37:55,837 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-31 17:37:55,838 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-31 17:37:55,839 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-31 17:37:55,839 INFO L153 SettingsManager]: * Use SBE=true [2024-01-31 17:37:55,840 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-31 17:37:55,840 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-31 17:37:55,840 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-31 17:37:55,840 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-31 17:37:55,841 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-31 17:37:55,841 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-31 17:37:55,841 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-31 17:37:55,841 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-31 17:37:55,842 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-31 17:37:55,842 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-31 17:37:55,842 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-31 17:37:55,842 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-31 17:37:55,843 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-31 17:37:55,843 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-31 17:37:55,843 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-31 17:37:55,844 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-31 17:37:55,844 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-31 17:37:55,845 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-31 17:37:55,845 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-31 17:37:55,845 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-31 17:37:55,845 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-31 17:37:55,845 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-31 17:37:55,845 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-31 17:37:55,846 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-31 17:37:55,846 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-31 17:37:55,846 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-31 17:37:55,846 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-31 17:37:55,846 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-31 17:37:55,847 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:37:56,040 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-31 17:37:56,059 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-31 17:37:56,061 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-31 17:37:56,062 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-31 17:37:56,062 INFO L274 PluginConnector]: CDTParser initialized [2024-01-31 17:37:56,063 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix038_power.oepc_pso.oepc_rmo.oepc.i [2024-01-31 17:37:57,162 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-31 17:37:57,409 INFO L384 CDTParser]: Found 1 translation units. [2024-01-31 17:37:57,410 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix038_power.oepc_pso.oepc_rmo.oepc.i [2024-01-31 17:37:57,422 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a8fe8b4a/a4d7f15accde40a59164dcafa30d542b/FLAG2f06ea0ad [2024-01-31 17:37:57,442 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a8fe8b4a/a4d7f15accde40a59164dcafa30d542b [2024-01-31 17:37:57,444 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-01-31 17:37:57,445 INFO L274 PluginConnector]: Witness Parser initialized [2024-01-31 17:37:57,446 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/mix038_power.oepc_pso.oepc_rmo.oepc.yml/witness.yml [2024-01-31 17:37:58,011 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-31 17:37:58,012 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-31 17:37:58,013 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-31 17:37:58,013 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-31 17:37:58,017 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-31 17:37:58,018 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 05:37:57" (1/2) ... [2024-01-31 17:37:58,019 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@291afd41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:37:58, skipping insertion in model container [2024-01-31 17:37:58,019 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 05:37:57" (1/2) ... [2024-01-31 17:37:58,021 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@709b3978 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:37:58, skipping insertion in model container [2024-01-31 17:37:58,021 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 31.01 05:37:58" (2/2) ... [2024-01-31 17:37:58,022 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@291afd41 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:37:58, skipping insertion in model container [2024-01-31 17:37:58,022 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 31.01 05:37:58" (2/2) ... [2024-01-31 17:37:58,022 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-01-31 17:37:59,926 INFO L96 nessWitnessExtractor]: Found the following entries in the witness: [2024-01-31 17:37:59,927 INFO L98 nessWitnessExtractor]: Location invariant after [L18-L18] expression == 1 [2024-01-31 17:37:59,928 INFO L98 nessWitnessExtractor]: Location invariant before [L18-L18] expression == 0 [2024-01-31 17:37:59,960 INFO L179 MainTranslator]: Built tables and reachable declarations [2024-01-31 17:38:00,067 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/mix038_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2024-01-31 17:38:00,177 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-31 17:38:00,187 INFO L204 MainTranslator]: Completed pre-run [2024-01-31 17:38:00,196 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/mix038_power.oepc_pso.oepc_rmo.oepc.i[969,982] Start Parsing Local [2024-01-31 17:38:00,224 WARN L424 MainDispatcher]: Unable to annotate ; with a witness entry [2024-01-31 17:38:00,258 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-31 17:38:00,293 INFO L208 MainTranslator]: Completed translation [2024-01-31 17:38:00,294 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:38:00 WrapperNode [2024-01-31 17:38:00,294 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-31 17:38:00,295 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-31 17:38:00,295 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-31 17:38:00,295 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-31 17:38:00,300 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:38:00" (1/1) ... [2024-01-31 17:38:00,336 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:38:00" (1/1) ... [2024-01-31 17:38:00,371 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 131 [2024-01-31 17:38:00,375 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-31 17:38:00,376 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-31 17:38:00,377 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-31 17:38:00,377 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-31 17:38:00,385 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:38:00" (1/1) ... [2024-01-31 17:38:00,386 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:38:00" (1/1) ... [2024-01-31 17:38:00,405 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:38:00" (1/1) ... [2024-01-31 17:38:00,418 INFO L175 MemorySlicer]: Split 5 memory accesses to 4 slices as follows [2, 1, 1, 1]. 40 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 3 writes are split as follows [0, 1, 1, 1]. [2024-01-31 17:38:00,430 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:38:00" (1/1) ... [2024-01-31 17:38:00,431 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:38:00" (1/1) ... [2024-01-31 17:38:00,436 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:38:00" (1/1) ... [2024-01-31 17:38:00,453 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:38:00" (1/1) ... [2024-01-31 17:38:00,458 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:38:00" (1/1) ... [2024-01-31 17:38:00,459 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:38:00" (1/1) ... [2024-01-31 17:38:00,462 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-31 17:38:00,464 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-31 17:38:00,468 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-31 17:38:00,469 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-31 17:38:00,469 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:38:00" (1/1) ... [2024-01-31 17:38:00,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-31 17:38:00,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-31 17:38:00,518 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:38:00,557 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:38:00,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-31 17:38:00,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-31 17:38:00,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-31 17:38:00,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-31 17:38:00,584 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-01-31 17:38:00,584 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-31 17:38:00,585 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-31 17:38:00,585 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-31 17:38:00,585 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-01-31 17:38:00,585 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-01-31 17:38:00,585 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-01-31 17:38:00,585 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-01-31 17:38:00,586 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-01-31 17:38:00,586 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-01-31 17:38:00,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-31 17:38:00,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-31 17:38:00,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-31 17:38:00,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-31 17:38:00,587 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-01-31 17:38:00,588 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-31 17:38:00,588 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-31 17:38:00,589 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:38:00,696 INFO L244 CfgBuilder]: Building ICFG [2024-01-31 17:38:00,698 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-31 17:38:00,935 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-31 17:38:00,936 INFO L293 CfgBuilder]: Performing block encoding [2024-01-31 17:38:01,082 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-31 17:38:01,082 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-01-31 17:38:01,083 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 05:38:01 BoogieIcfgContainer [2024-01-31 17:38:01,083 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-31 17:38:01,085 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-31 17:38:01,085 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-31 17:38:01,088 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-31 17:38:01,088 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 05:37:57" (1/4) ... [2024-01-31 17:38:01,089 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f3236f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 05:38:01, skipping insertion in model container [2024-01-31 17:38:01,089 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 31.01 05:37:58" (2/4) ... [2024-01-31 17:38:01,089 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f3236f7 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 31.01 05:38:01, skipping insertion in model container [2024-01-31 17:38:01,089 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:38:00" (3/4) ... [2024-01-31 17:38:01,089 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f3236f7 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 31.01 05:38:01, skipping insertion in model container [2024-01-31 17:38:01,090 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 05:38:01" (4/4) ... [2024-01-31 17:38:01,091 INFO L112 eAbstractionObserver]: Analyzing ICFG mix038_power.oepc_pso.oepc_rmo.oepc.i [2024-01-31 17:38:01,104 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-31 17:38:01,104 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-01-31 17:38:01,104 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-31 17:38:01,137 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-01-31 17:38:01,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 44 transitions, 100 flow [2024-01-31 17:38:01,179 INFO L124 PetriNetUnfolderBase]: 1/41 cut-off events. [2024-01-31 17:38:01,179 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-31 17:38:01,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 41 events. 1/41 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 79 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 43. Up to 2 conditions per place. [2024-01-31 17:38:01,182 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 44 transitions, 100 flow [2024-01-31 17:38:01,186 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 41 transitions, 91 flow [2024-01-31 17:38:01,200 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-31 17:38:01,205 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;@5b2507ce, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-31 17:38:01,205 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-01-31 17:38:01,209 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-31 17:38:01,209 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-01-31 17:38:01,210 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-31 17:38:01,210 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:38:01,211 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-01-31 17:38:01,211 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-01-31 17:38:01,215 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:38:01,215 INFO L85 PathProgramCache]: Analyzing trace with hash 11756703, now seen corresponding path program 1 times [2024-01-31 17:38:01,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:38:01,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689412066] [2024-01-31 17:38:01,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:38:01,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:38:01,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:38:01,454 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:38:01,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:38:01,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689412066] [2024-01-31 17:38:01,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689412066] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:38:01,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:38:01,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-31 17:38:01,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026417912] [2024-01-31 17:38:01,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:38:01,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-01-31 17:38:01,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:38:01,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-01-31 17:38:01,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-01-31 17:38:01,494 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 44 [2024-01-31 17:38:01,496 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 41 transitions, 91 flow. Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 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:38:01,497 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:38:01,497 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 44 [2024-01-31 17:38:01,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:38:01,771 INFO L124 PetriNetUnfolderBase]: 791/1575 cut-off events. [2024-01-31 17:38:01,771 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-31 17:38:01,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2814 conditions, 1575 events. 791/1575 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 10640 event pairs, 791 based on Foata normal form. 45/1413 useless extension candidates. Maximal degree in co-relation 2803. Up to 1193 conditions per place. [2024-01-31 17:38:01,786 INFO L140 encePairwiseOnDemand]: 42/44 looper letters, 20 selfloop transitions, 0 changer transitions 0/39 dead transitions. [2024-01-31 17:38:01,786 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 39 transitions, 127 flow [2024-01-31 17:38:01,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-31 17:38:01,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-01-31 17:38:01,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 66 transitions. [2024-01-31 17:38:01,797 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.75 [2024-01-31 17:38:01,799 INFO L175 Difference]: Start difference. First operand has 50 places, 41 transitions, 91 flow. Second operand 2 states and 66 transitions. [2024-01-31 17:38:01,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 39 transitions, 127 flow [2024-01-31 17:38:01,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 39 transitions, 124 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-01-31 17:38:01,805 INFO L231 Difference]: Finished difference. Result has 47 places, 39 transitions, 84 flow [2024-01-31 17:38:01,806 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=84, PETRI_PLACES=47, PETRI_TRANSITIONS=39} [2024-01-31 17:38:01,809 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -3 predicate places. [2024-01-31 17:38:01,810 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 39 transitions, 84 flow [2024-01-31 17:38:01,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 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:38:01,810 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:38:01,810 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-01-31 17:38:01,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-31 17:38:01,811 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-01-31 17:38:01,812 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:38:01,812 INFO L85 PathProgramCache]: Analyzing trace with hash 11756704, now seen corresponding path program 1 times [2024-01-31 17:38:01,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:38:01,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291595672] [2024-01-31 17:38:01,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:38:01,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:38:01,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:38:01,997 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:38:01,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:38:01,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291595672] [2024-01-31 17:38:01,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291595672] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:38:01,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:38:01,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-31 17:38:01,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750074712] [2024-01-31 17:38:01,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:38:02,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-31 17:38:02,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:38:02,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-31 17:38:02,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-31 17:38:02,001 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 44 [2024-01-31 17:38:02,002 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 39 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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:38:02,002 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:38:02,002 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 44 [2024-01-31 17:38:02,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:38:02,288 INFO L124 PetriNetUnfolderBase]: 617/1175 cut-off events. [2024-01-31 17:38:02,288 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-31 17:38:02,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2150 conditions, 1175 events. 617/1175 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 7436 event pairs, 95 based on Foata normal form. 0/1143 useless extension candidates. Maximal degree in co-relation 2147. Up to 763 conditions per place. [2024-01-31 17:38:02,293 INFO L140 encePairwiseOnDemand]: 41/44 looper letters, 29 selfloop transitions, 2 changer transitions 2/52 dead transitions. [2024-01-31 17:38:02,294 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 52 transitions, 180 flow [2024-01-31 17:38:02,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-31 17:38:02,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-31 17:38:02,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 100 transitions. [2024-01-31 17:38:02,295 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7575757575757576 [2024-01-31 17:38:02,295 INFO L175 Difference]: Start difference. First operand has 47 places, 39 transitions, 84 flow. Second operand 3 states and 100 transitions. [2024-01-31 17:38:02,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 52 transitions, 180 flow [2024-01-31 17:38:02,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 52 transitions, 180 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-01-31 17:38:02,297 INFO L231 Difference]: Finished difference. Result has 48 places, 37 transitions, 84 flow [2024-01-31 17:38:02,298 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=48, PETRI_TRANSITIONS=37} [2024-01-31 17:38:02,298 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -2 predicate places. [2024-01-31 17:38:02,298 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 37 transitions, 84 flow [2024-01-31 17:38:02,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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:38:02,299 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:38:02,299 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:38:02,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-31 17:38:02,299 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-01-31 17:38:02,300 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:38:02,300 INFO L85 PathProgramCache]: Analyzing trace with hash 172146116, now seen corresponding path program 1 times [2024-01-31 17:38:02,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:38:02,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056170699] [2024-01-31 17:38:02,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:38:02,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:38:02,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:38:02,337 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:38:02,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:38:02,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056170699] [2024-01-31 17:38:02,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056170699] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:38:02,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:38:02,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-31 17:38:02,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466761387] [2024-01-31 17:38:02,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:38:02,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-31 17:38:02,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:38:02,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-31 17:38:02,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-31 17:38:02,343 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 44 [2024-01-31 17:38:02,343 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 37 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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:38:02,343 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:38:02,343 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 44 [2024-01-31 17:38:02,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:38:02,538 INFO L124 PetriNetUnfolderBase]: 825/1465 cut-off events. [2024-01-31 17:38:02,538 INFO L125 PetriNetUnfolderBase]: For 104/104 co-relation queries the response was YES. [2024-01-31 17:38:02,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2850 conditions, 1465 events. 825/1465 cut-off events. For 104/104 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 9025 event pairs, 617 based on Foata normal form. 0/1375 useless extension candidates. Maximal degree in co-relation 2846. Up to 939 conditions per place. [2024-01-31 17:38:02,550 INFO L140 encePairwiseOnDemand]: 42/44 looper letters, 27 selfloop transitions, 1 changer transitions 1/44 dead transitions. [2024-01-31 17:38:02,552 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 44 transitions, 158 flow [2024-01-31 17:38:02,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-31 17:38:02,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-31 17:38:02,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2024-01-31 17:38:02,557 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6363636363636364 [2024-01-31 17:38:02,558 INFO L175 Difference]: Start difference. First operand has 48 places, 37 transitions, 84 flow. Second operand 3 states and 84 transitions. [2024-01-31 17:38:02,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 44 transitions, 158 flow [2024-01-31 17:38:02,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 44 transitions, 152 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-31 17:38:02,559 INFO L231 Difference]: Finished difference. Result has 46 places, 35 transitions, 78 flow [2024-01-31 17:38:02,560 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=46, PETRI_TRANSITIONS=35} [2024-01-31 17:38:02,560 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -4 predicate places. [2024-01-31 17:38:02,560 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 35 transitions, 78 flow [2024-01-31 17:38:02,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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:38:02,561 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:38:02,561 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:38:02,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-31 17:38:02,562 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-01-31 17:38:02,562 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:38:02,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1041562659, now seen corresponding path program 1 times [2024-01-31 17:38:02,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:38:02,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560759821] [2024-01-31 17:38:02,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:38:02,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:38:02,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:38:02,721 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:38:02,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:38:02,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560759821] [2024-01-31 17:38:02,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560759821] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:38:02,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:38:02,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-31 17:38:02,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365215574] [2024-01-31 17:38:02,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:38:02,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-31 17:38:02,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:38:02,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-31 17:38:02,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-01-31 17:38:02,744 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 44 [2024-01-31 17:38:02,745 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 35 transitions, 78 flow. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 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:38:02,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:38:02,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 44 [2024-01-31 17:38:02,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:38:03,494 INFO L124 PetriNetUnfolderBase]: 4298/6932 cut-off events. [2024-01-31 17:38:03,494 INFO L125 PetriNetUnfolderBase]: For 192/192 co-relation queries the response was YES. [2024-01-31 17:38:03,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13547 conditions, 6932 events. 4298/6932 cut-off events. For 192/192 co-relation queries the response was YES. Maximal size of possible extension queue 371. Compared 46689 event pairs, 1308 based on Foata normal form. 197/7069 useless extension candidates. Maximal degree in co-relation 13543. Up to 3519 conditions per place. [2024-01-31 17:38:03,523 INFO L140 encePairwiseOnDemand]: 35/44 looper letters, 39 selfloop transitions, 6 changer transitions 51/106 dead transitions. [2024-01-31 17:38:03,523 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 106 transitions, 416 flow [2024-01-31 17:38:03,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-31 17:38:03,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-01-31 17:38:03,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 189 transitions. [2024-01-31 17:38:03,528 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6136363636363636 [2024-01-31 17:38:03,528 INFO L175 Difference]: Start difference. First operand has 46 places, 35 transitions, 78 flow. Second operand 7 states and 189 transitions. [2024-01-31 17:38:03,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 106 transitions, 416 flow [2024-01-31 17:38:03,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 106 transitions, 414 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-31 17:38:03,542 INFO L231 Difference]: Finished difference. Result has 56 places, 40 transitions, 151 flow [2024-01-31 17:38:03,543 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=77, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=151, PETRI_PLACES=56, PETRI_TRANSITIONS=40} [2024-01-31 17:38:03,544 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 6 predicate places. [2024-01-31 17:38:03,544 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 40 transitions, 151 flow [2024-01-31 17:38:03,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 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:38:03,544 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:38:03,544 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:38:03,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-31 17:38:03,545 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-01-31 17:38:03,546 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:38:03,546 INFO L85 PathProgramCache]: Analyzing trace with hash -2026665374, now seen corresponding path program 1 times [2024-01-31 17:38:03,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:38:03,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103486515] [2024-01-31 17:38:03,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:38:03,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:38:03,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:38:03,744 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:38:03,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:38:03,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103486515] [2024-01-31 17:38:03,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103486515] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:38:03,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:38:03,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-31 17:38:03,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606698742] [2024-01-31 17:38:03,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:38:03,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-31 17:38:03,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:38:03,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-31 17:38:03,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-01-31 17:38:03,757 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 44 [2024-01-31 17:38:03,757 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 40 transitions, 151 flow. Second operand has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 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:38:03,757 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:38:03,758 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 44 [2024-01-31 17:38:03,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:38:04,469 INFO L124 PetriNetUnfolderBase]: 3782/6114 cut-off events. [2024-01-31 17:38:04,469 INFO L125 PetriNetUnfolderBase]: For 5341/5545 co-relation queries the response was YES. [2024-01-31 17:38:04,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16830 conditions, 6114 events. 3782/6114 cut-off events. For 5341/5545 co-relation queries the response was YES. Maximal size of possible extension queue 297. Compared 39477 event pairs, 596 based on Foata normal form. 160/6236 useless extension candidates. Maximal degree in co-relation 16821. Up to 2881 conditions per place. [2024-01-31 17:38:04,531 INFO L140 encePairwiseOnDemand]: 35/44 looper letters, 47 selfloop transitions, 7 changer transitions 60/124 dead transitions. [2024-01-31 17:38:04,534 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 124 transitions, 684 flow [2024-01-31 17:38:04,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-01-31 17:38:04,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-01-31 17:38:04,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 240 transitions. [2024-01-31 17:38:04,548 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5454545454545454 [2024-01-31 17:38:04,548 INFO L175 Difference]: Start difference. First operand has 56 places, 40 transitions, 151 flow. Second operand 10 states and 240 transitions. [2024-01-31 17:38:04,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 124 transitions, 684 flow [2024-01-31 17:38:04,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 124 transitions, 628 flow, removed 7 selfloop flow, removed 2 redundant places. [2024-01-31 17:38:04,564 INFO L231 Difference]: Finished difference. Result has 68 places, 43 transitions, 203 flow [2024-01-31 17:38:04,564 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=203, PETRI_PLACES=68, PETRI_TRANSITIONS=43} [2024-01-31 17:38:04,565 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 18 predicate places. [2024-01-31 17:38:04,565 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 43 transitions, 203 flow [2024-01-31 17:38:04,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 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:38:04,565 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:38:04,565 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:38:04,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-31 17:38:04,566 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-01-31 17:38:04,566 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:38:04,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1600009439, now seen corresponding path program 1 times [2024-01-31 17:38:04,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:38:04,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796522389] [2024-01-31 17:38:04,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:38:04,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:38:04,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:38:04,703 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:38:04,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:38:04,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796522389] [2024-01-31 17:38:04,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796522389] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:38:04,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:38:04,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-31 17:38:04,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528273245] [2024-01-31 17:38:04,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:38:04,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-31 17:38:04,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:38:04,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-31 17:38:04,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-01-31 17:38:04,721 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 44 [2024-01-31 17:38:04,722 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 43 transitions, 203 flow. Second operand has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 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:38:04,722 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:38:04,722 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 44 [2024-01-31 17:38:04,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:38:05,419 INFO L124 PetriNetUnfolderBase]: 3565/5762 cut-off events. [2024-01-31 17:38:05,420 INFO L125 PetriNetUnfolderBase]: For 10906/11051 co-relation queries the response was YES. [2024-01-31 17:38:05,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17550 conditions, 5762 events. 3565/5762 cut-off events. For 10906/11051 co-relation queries the response was YES. Maximal size of possible extension queue 281. Compared 36794 event pairs, 867 based on Foata normal form. 162/5911 useless extension candidates. Maximal degree in co-relation 17533. Up to 2955 conditions per place. [2024-01-31 17:38:05,453 INFO L140 encePairwiseOnDemand]: 35/44 looper letters, 49 selfloop transitions, 13 changer transitions 56/128 dead transitions. [2024-01-31 17:38:05,453 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 128 transitions, 808 flow [2024-01-31 17:38:05,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-01-31 17:38:05,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-01-31 17:38:05,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 246 transitions. [2024-01-31 17:38:05,455 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5590909090909091 [2024-01-31 17:38:05,455 INFO L175 Difference]: Start difference. First operand has 68 places, 43 transitions, 203 flow. Second operand 10 states and 246 transitions. [2024-01-31 17:38:05,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 128 transitions, 808 flow [2024-01-31 17:38:05,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 128 transitions, 758 flow, removed 23 selfloop flow, removed 5 redundant places. [2024-01-31 17:38:05,492 INFO L231 Difference]: Finished difference. Result has 74 places, 47 transitions, 276 flow [2024-01-31 17:38:05,493 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=276, PETRI_PLACES=74, PETRI_TRANSITIONS=47} [2024-01-31 17:38:05,493 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 24 predicate places. [2024-01-31 17:38:05,493 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 47 transitions, 276 flow [2024-01-31 17:38:05,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 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:38:05,494 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:38:05,494 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:38:05,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-31 17:38:05,494 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-01-31 17:38:05,495 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:38:05,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1259530656, now seen corresponding path program 1 times [2024-01-31 17:38:05,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:38:05,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470679546] [2024-01-31 17:38:05,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:38:05,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:38:05,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:38:05,566 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:38:05,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:38:05,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470679546] [2024-01-31 17:38:05,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470679546] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:38:05,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:38:05,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-31 17:38:05,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330061327] [2024-01-31 17:38:05,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:38:05,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-31 17:38:05,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:38:05,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-31 17:38:05,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-31 17:38:05,574 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 44 [2024-01-31 17:38:05,574 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 47 transitions, 276 flow. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 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:38:05,574 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:38:05,574 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 44 [2024-01-31 17:38:05,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:38:06,125 INFO L124 PetriNetUnfolderBase]: 3465/6068 cut-off events. [2024-01-31 17:38:06,126 INFO L125 PetriNetUnfolderBase]: For 6768/7062 co-relation queries the response was YES. [2024-01-31 17:38:06,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15819 conditions, 6068 events. 3465/6068 cut-off events. For 6768/7062 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 41900 event pairs, 623 based on Foata normal form. 294/6174 useless extension candidates. Maximal degree in co-relation 15797. Up to 2769 conditions per place. [2024-01-31 17:38:06,176 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 45 selfloop transitions, 5 changer transitions 0/74 dead transitions. [2024-01-31 17:38:06,176 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 74 transitions, 464 flow [2024-01-31 17:38:06,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-31 17:38:06,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-31 17:38:06,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 121 transitions. [2024-01-31 17:38:06,177 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6875 [2024-01-31 17:38:06,177 INFO L175 Difference]: Start difference. First operand has 74 places, 47 transitions, 276 flow. Second operand 4 states and 121 transitions. [2024-01-31 17:38:06,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 74 transitions, 464 flow [2024-01-31 17:38:06,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 74 transitions, 438 flow, removed 13 selfloop flow, removed 10 redundant places. [2024-01-31 17:38:06,217 INFO L231 Difference]: Finished difference. Result has 63 places, 51 transitions, 288 flow [2024-01-31 17:38:06,217 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=288, PETRI_PLACES=63, PETRI_TRANSITIONS=51} [2024-01-31 17:38:06,217 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 13 predicate places. [2024-01-31 17:38:06,218 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 51 transitions, 288 flow [2024-01-31 17:38:06,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 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:38:06,218 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:38:06,218 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:38:06,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-31 17:38:06,219 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-01-31 17:38:06,219 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:38:06,219 INFO L85 PathProgramCache]: Analyzing trace with hash 827592610, now seen corresponding path program 1 times [2024-01-31 17:38:06,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:38:06,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496342814] [2024-01-31 17:38:06,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:38:06,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:38:06,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:38:06,367 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:38:06,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:38:06,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496342814] [2024-01-31 17:38:06,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496342814] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:38:06,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:38:06,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-01-31 17:38:06,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635894540] [2024-01-31 17:38:06,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:38:06,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-31 17:38:06,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:38:06,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-31 17:38:06,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-01-31 17:38:06,377 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 44 [2024-01-31 17:38:06,378 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 51 transitions, 288 flow. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 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:38:06,378 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:38:06,378 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 44 [2024-01-31 17:38:06,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:38:07,246 INFO L124 PetriNetUnfolderBase]: 4646/7735 cut-off events. [2024-01-31 17:38:07,246 INFO L125 PetriNetUnfolderBase]: For 10258/10853 co-relation queries the response was YES. [2024-01-31 17:38:07,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22738 conditions, 7735 events. 4646/7735 cut-off events. For 10258/10853 co-relation queries the response was YES. Maximal size of possible extension queue 397. Compared 53862 event pairs, 1719 based on Foata normal form. 155/7538 useless extension candidates. Maximal degree in co-relation 22723. Up to 3245 conditions per place. [2024-01-31 17:38:07,290 INFO L140 encePairwiseOnDemand]: 37/44 looper letters, 59 selfloop transitions, 14 changer transitions 24/111 dead transitions. [2024-01-31 17:38:07,291 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 111 transitions, 712 flow [2024-01-31 17:38:07,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-01-31 17:38:07,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-01-31 17:38:07,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 195 transitions. [2024-01-31 17:38:07,292 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5539772727272727 [2024-01-31 17:38:07,293 INFO L175 Difference]: Start difference. First operand has 63 places, 51 transitions, 288 flow. Second operand 8 states and 195 transitions. [2024-01-31 17:38:07,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 111 transitions, 712 flow [2024-01-31 17:38:07,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 111 transitions, 710 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-31 17:38:07,318 INFO L231 Difference]: Finished difference. Result has 74 places, 54 transitions, 358 flow [2024-01-31 17:38:07,319 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=358, PETRI_PLACES=74, PETRI_TRANSITIONS=54} [2024-01-31 17:38:07,319 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 24 predicate places. [2024-01-31 17:38:07,319 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 54 transitions, 358 flow [2024-01-31 17:38:07,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 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:38:07,320 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:38:07,320 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:38:07,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-31 17:38:07,320 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-01-31 17:38:07,321 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:38:07,321 INFO L85 PathProgramCache]: Analyzing trace with hash 325909696, now seen corresponding path program 1 times [2024-01-31 17:38:07,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:38:07,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671476778] [2024-01-31 17:38:07,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:38:07,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:38:07,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:38:07,563 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:38:07,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:38:07,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671476778] [2024-01-31 17:38:07,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671476778] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:38:07,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:38:07,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-01-31 17:38:07,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406005071] [2024-01-31 17:38:07,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:38:07,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-31 17:38:07,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:38:07,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-31 17:38:07,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-01-31 17:38:07,579 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 44 [2024-01-31 17:38:07,579 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 54 transitions, 358 flow. Second operand has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:38:07,579 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:38:07,579 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 44 [2024-01-31 17:38:07,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:38:08,699 INFO L124 PetriNetUnfolderBase]: 7030/11983 cut-off events. [2024-01-31 17:38:08,700 INFO L125 PetriNetUnfolderBase]: For 22311/22839 co-relation queries the response was YES. [2024-01-31 17:38:08,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35640 conditions, 11983 events. 7030/11983 cut-off events. For 22311/22839 co-relation queries the response was YES. Maximal size of possible extension queue 608. Compared 92983 event pairs, 1258 based on Foata normal form. 197/11700 useless extension candidates. Maximal degree in co-relation 35620. Up to 4355 conditions per place. [2024-01-31 17:38:08,762 INFO L140 encePairwiseOnDemand]: 34/44 looper letters, 73 selfloop transitions, 21 changer transitions 28/135 dead transitions. [2024-01-31 17:38:08,762 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 135 transitions, 982 flow [2024-01-31 17:38:08,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-01-31 17:38:08,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-01-31 17:38:08,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 211 transitions. [2024-01-31 17:38:08,763 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5328282828282829 [2024-01-31 17:38:08,764 INFO L175 Difference]: Start difference. First operand has 74 places, 54 transitions, 358 flow. Second operand 9 states and 211 transitions. [2024-01-31 17:38:08,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 135 transitions, 982 flow [2024-01-31 17:38:08,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 135 transitions, 913 flow, removed 8 selfloop flow, removed 3 redundant places. [2024-01-31 17:38:08,868 INFO L231 Difference]: Finished difference. Result has 85 places, 66 transitions, 522 flow [2024-01-31 17:38:08,869 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=319, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=522, PETRI_PLACES=85, PETRI_TRANSITIONS=66} [2024-01-31 17:38:08,869 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 35 predicate places. [2024-01-31 17:38:08,869 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 66 transitions, 522 flow [2024-01-31 17:38:08,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:38:08,870 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:38:08,870 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:38:08,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-31 17:38:08,870 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-01-31 17:38:08,870 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:38:08,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1832025104, now seen corresponding path program 2 times [2024-01-31 17:38:08,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:38:08,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516231756] [2024-01-31 17:38:08,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:38:08,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:38:08,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:38:08,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:38:08,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:38:08,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516231756] [2024-01-31 17:38:08,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516231756] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:38:08,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:38:08,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-31 17:38:08,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969959069] [2024-01-31 17:38:08,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:38:08,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-31 17:38:08,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:38:08,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-31 17:38:08,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-01-31 17:38:08,965 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 44 [2024-01-31 17:38:08,966 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 66 transitions, 522 flow. Second operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 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:38:08,966 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:38:08,966 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 44 [2024-01-31 17:38:08,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:38:09,652 INFO L124 PetriNetUnfolderBase]: 4867/8198 cut-off events. [2024-01-31 17:38:09,652 INFO L125 PetriNetUnfolderBase]: For 11709/11849 co-relation queries the response was YES. [2024-01-31 17:38:09,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23653 conditions, 8198 events. 4867/8198 cut-off events. For 11709/11849 co-relation queries the response was YES. Maximal size of possible extension queue 396. Compared 56745 event pairs, 616 based on Foata normal form. 436/8432 useless extension candidates. Maximal degree in co-relation 23627. Up to 2489 conditions per place. [2024-01-31 17:38:09,703 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 60 selfloop transitions, 8 changer transitions 9/108 dead transitions. [2024-01-31 17:38:09,703 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 108 transitions, 862 flow [2024-01-31 17:38:09,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-31 17:38:09,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-31 17:38:09,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 154 transitions. [2024-01-31 17:38:09,705 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7 [2024-01-31 17:38:09,705 INFO L175 Difference]: Start difference. First operand has 85 places, 66 transitions, 522 flow. Second operand 5 states and 154 transitions. [2024-01-31 17:38:09,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 108 transitions, 862 flow [2024-01-31 17:38:09,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 108 transitions, 826 flow, removed 15 selfloop flow, removed 1 redundant places. [2024-01-31 17:38:09,742 INFO L231 Difference]: Finished difference. Result has 90 places, 63 transitions, 484 flow [2024-01-31 17:38:09,742 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=486, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=484, PETRI_PLACES=90, PETRI_TRANSITIONS=63} [2024-01-31 17:38:09,743 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 40 predicate places. [2024-01-31 17:38:09,743 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 63 transitions, 484 flow [2024-01-31 17:38:09,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 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:38:09,743 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:38:09,744 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:38:09,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-01-31 17:38:09,744 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-01-31 17:38:09,744 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:38:09,744 INFO L85 PathProgramCache]: Analyzing trace with hash -226257838, now seen corresponding path program 1 times [2024-01-31 17:38:09,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:38:09,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059382444] [2024-01-31 17:38:09,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:38:09,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:38:09,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:38:09,921 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:38:09,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:38:09,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059382444] [2024-01-31 17:38:09,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059382444] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:38:09,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:38:09,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-31 17:38:09,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597221243] [2024-01-31 17:38:09,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:38:09,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-31 17:38:09,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:38:09,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-31 17:38:09,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-01-31 17:38:09,931 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 44 [2024-01-31 17:38:09,931 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 63 transitions, 484 flow. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:38:09,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:38:09,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 44 [2024-01-31 17:38:09,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:38:10,499 INFO L124 PetriNetUnfolderBase]: 3791/6254 cut-off events. [2024-01-31 17:38:10,499 INFO L125 PetriNetUnfolderBase]: For 11401/11473 co-relation queries the response was YES. [2024-01-31 17:38:10,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19785 conditions, 6254 events. 3791/6254 cut-off events. For 11401/11473 co-relation queries the response was YES. Maximal size of possible extension queue 370. Compared 41116 event pairs, 558 based on Foata normal form. 204/6255 useless extension candidates. Maximal degree in co-relation 19757. Up to 2248 conditions per place. [2024-01-31 17:38:10,534 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 50 selfloop transitions, 11 changer transitions 9/95 dead transitions. [2024-01-31 17:38:10,535 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 95 transitions, 735 flow [2024-01-31 17:38:10,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-31 17:38:10,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-31 17:38:10,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 169 transitions. [2024-01-31 17:38:10,536 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6401515151515151 [2024-01-31 17:38:10,536 INFO L175 Difference]: Start difference. First operand has 90 places, 63 transitions, 484 flow. Second operand 6 states and 169 transitions. [2024-01-31 17:38:10,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 95 transitions, 735 flow [2024-01-31 17:38:10,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 95 transitions, 671 flow, removed 26 selfloop flow, removed 9 redundant places. [2024-01-31 17:38:10,550 INFO L231 Difference]: Finished difference. Result has 82 places, 57 transitions, 393 flow [2024-01-31 17:38:10,550 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=417, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=393, PETRI_PLACES=82, PETRI_TRANSITIONS=57} [2024-01-31 17:38:10,550 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 32 predicate places. [2024-01-31 17:38:10,550 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 57 transitions, 393 flow [2024-01-31 17:38:10,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:38:10,551 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:38:10,551 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:38:10,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-01-31 17:38:10,551 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-01-31 17:38:10,551 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:38:10,552 INFO L85 PathProgramCache]: Analyzing trace with hash -912064479, now seen corresponding path program 1 times [2024-01-31 17:38:10,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:38:10,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788299958] [2024-01-31 17:38:10,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:38:10,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:38:10,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:38:11,292 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:38:11,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:38:11,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788299958] [2024-01-31 17:38:11,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788299958] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:38:11,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:38:11,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-01-31 17:38:11,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522809472] [2024-01-31 17:38:11,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:38:11,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-01-31 17:38:11,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:38:11,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-01-31 17:38:11,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-01-31 17:38:11,306 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 44 [2024-01-31 17:38:11,307 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 57 transitions, 393 flow. Second operand has 9 states, 9 states have (on average 19.0) internal successors, (171), 9 states have internal predecessors, (171), 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:38:11,307 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:38:11,307 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 44 [2024-01-31 17:38:11,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:38:11,705 INFO L124 PetriNetUnfolderBase]: 1379/2795 cut-off events. [2024-01-31 17:38:11,705 INFO L125 PetriNetUnfolderBase]: For 4565/4903 co-relation queries the response was YES. [2024-01-31 17:38:11,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8201 conditions, 2795 events. 1379/2795 cut-off events. For 4565/4903 co-relation queries the response was YES. Maximal size of possible extension queue 247. Compared 20825 event pairs, 262 based on Foata normal form. 42/2552 useless extension candidates. Maximal degree in co-relation 8178. Up to 743 conditions per place. [2024-01-31 17:38:11,720 INFO L140 encePairwiseOnDemand]: 36/44 looper letters, 37 selfloop transitions, 4 changer transitions 25/101 dead transitions. [2024-01-31 17:38:11,720 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 101 transitions, 671 flow [2024-01-31 17:38:11,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-01-31 17:38:11,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-01-31 17:38:11,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 217 transitions. [2024-01-31 17:38:11,722 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.547979797979798 [2024-01-31 17:38:11,722 INFO L175 Difference]: Start difference. First operand has 82 places, 57 transitions, 393 flow. Second operand 9 states and 217 transitions. [2024-01-31 17:38:11,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 101 transitions, 671 flow [2024-01-31 17:38:11,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 101 transitions, 589 flow, removed 28 selfloop flow, removed 9 redundant places. [2024-01-31 17:38:11,737 INFO L231 Difference]: Finished difference. Result has 83 places, 57 transitions, 347 flow [2024-01-31 17:38:11,738 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=327, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=347, PETRI_PLACES=83, PETRI_TRANSITIONS=57} [2024-01-31 17:38:11,739 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 33 predicate places. [2024-01-31 17:38:11,739 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 57 transitions, 347 flow [2024-01-31 17:38:11,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 19.0) internal successors, (171), 9 states have internal predecessors, (171), 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:38:11,739 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:38:11,739 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:38:11,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-01-31 17:38:11,740 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-01-31 17:38:11,740 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:38:11,740 INFO L85 PathProgramCache]: Analyzing trace with hash -2074228699, now seen corresponding path program 2 times [2024-01-31 17:38:11,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:38:11,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854876717] [2024-01-31 17:38:11,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:38:11,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:38:11,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-31 17:38:11,813 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-31 17:38:11,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-31 17:38:11,904 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-31 17:38:11,904 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-31 17:38:11,905 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (8 of 9 remaining) [2024-01-31 17:38:11,906 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 9 remaining) [2024-01-31 17:38:11,906 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONERROR_FUNCTION (6 of 9 remaining) [2024-01-31 17:38:11,906 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 9 remaining) [2024-01-31 17:38:11,907 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 9 remaining) [2024-01-31 17:38:11,907 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 9 remaining) [2024-01-31 17:38:11,907 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 9 remaining) [2024-01-31 17:38:11,907 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 9 remaining) [2024-01-31 17:38:11,907 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONERROR_FUNCTION (0 of 9 remaining) [2024-01-31 17:38:11,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-01-31 17:38:11,908 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:38:11,913 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-31 17:38:11,913 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-31 17:38:11,999 INFO L503 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-01-31 17:38:12,000 INFO L504 ceAbstractionStarter]: WitnessConsidered=2 [2024-01-31 17:38:12,001 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 05:38:12 BasicIcfg [2024-01-31 17:38:12,001 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-31 17:38:12,001 INFO L158 Benchmark]: Toolchain (without parser) took 13989.33ms. Allocated memory was 172.0MB in the beginning and 855.6MB in the end (delta: 683.7MB). Free memory was 97.7MB in the beginning and 408.6MB in the end (delta: -310.9MB). Peak memory consumption was 372.6MB. Max. memory is 16.1GB. [2024-01-31 17:38:12,002 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 172.0MB. Free memory is still 130.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-31 17:38:12,003 INFO L158 Benchmark]: Witness Parser took 0.15ms. Allocated memory is still 172.0MB. Free memory is still 101.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-31 17:38:12,004 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2280.63ms. Allocated memory was 172.0MB in the beginning and 285.2MB in the end (delta: 113.2MB). Free memory was 97.7MB in the beginning and 87.7MB in the end (delta: 10.1MB). Peak memory consumption was 132.1MB. Max. memory is 16.1GB. [2024-01-31 17:38:12,004 INFO L158 Benchmark]: Boogie Procedure Inliner took 81.21ms. Allocated memory is still 285.2MB. Free memory was 87.7MB in the beginning and 85.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-31 17:38:12,005 INFO L158 Benchmark]: Boogie Preprocessor took 87.28ms. Allocated memory is still 285.2MB. Free memory was 85.6MB in the beginning and 81.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-01-31 17:38:12,006 INFO L158 Benchmark]: RCFGBuilder took 619.03ms. Allocated memory is still 285.2MB. Free memory was 81.4MB in the beginning and 179.1MB in the end (delta: -97.7MB). Peak memory consumption was 7.2MB. Max. memory is 16.1GB. [2024-01-31 17:38:12,006 INFO L158 Benchmark]: TraceAbstraction took 10915.51ms. Allocated memory was 285.2MB in the beginning and 855.6MB in the end (delta: 570.4MB). Free memory was 178.0MB in the beginning and 408.6MB in the end (delta: -230.6MB). Peak memory consumption was 340.9MB. Max. memory is 16.1GB. [2024-01-31 17:38:12,007 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 172.0MB. Free memory is still 130.7MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.15ms. Allocated memory is still 172.0MB. Free memory is still 101.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2280.63ms. Allocated memory was 172.0MB in the beginning and 285.2MB in the end (delta: 113.2MB). Free memory was 97.7MB in the beginning and 87.7MB in the end (delta: 10.1MB). Peak memory consumption was 132.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 81.21ms. Allocated memory is still 285.2MB. Free memory was 87.7MB in the beginning and 85.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 87.28ms. Allocated memory is still 285.2MB. Free memory was 85.6MB in the beginning and 81.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 619.03ms. Allocated memory is still 285.2MB. Free memory was 81.4MB in the beginning and 179.1MB in the end (delta: -97.7MB). Peak memory consumption was 7.2MB. Max. memory is 16.1GB. * TraceAbstraction took 10915.51ms. Allocated memory was 285.2MB in the beginning and 855.6MB in the end (delta: 570.4MB). Free memory was 178.0MB in the beginning and 408.6MB in the end (delta: -230.6MB). Peak memory consumption was 340.9MB. 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: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L717] 0 int a = 0; [L718] 0 _Bool a$flush_delayed; [L719] 0 int a$mem_tmp; [L720] 0 _Bool a$r_buff0_thd0; [L721] 0 _Bool a$r_buff0_thd1; [L722] 0 _Bool a$r_buff0_thd2; [L723] 0 _Bool a$r_buff0_thd3; [L724] 0 _Bool a$r_buff1_thd0; [L725] 0 _Bool a$r_buff1_thd1; [L726] 0 _Bool a$r_buff1_thd2; [L727] 0 _Bool a$r_buff1_thd3; [L728] 0 _Bool a$read_delayed; [L729] 0 int *a$read_delayed_var; [L730] 0 int a$w_buff0; [L731] 0 _Bool a$w_buff0_used; [L732] 0 int a$w_buff1; [L733] 0 _Bool a$w_buff1_used; [L734] 0 _Bool main$tmp_guard0; [L735] 0 _Bool main$tmp_guard1; [L737] 0 int x = 0; [L739] 0 int y = 0; [L741] 0 int z = 0; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L843] 0 pthread_t t1001; [L844] FCALL, FORK 0 pthread_create(&t1001, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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, t1001={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L845] 0 pthread_t t1002; [L846] FCALL, FORK 0 pthread_create(&t1002, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1001={5:0}, t1002={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L847] 0 pthread_t t1003; [L848] FCALL, FORK 0 pthread_create(&t1003, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1001={5:0}, t1002={6:0}, t1003={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L747] 1 a$w_buff1 = a$w_buff0 [L748] 1 a$w_buff0 = 1 [L749] 1 a$w_buff1_used = a$w_buff0_used [L750] 1 a$w_buff0_used = (_Bool)1 [L751] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L751] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L752] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L753] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L754] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L755] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L756] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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=0, y=0, z=0] [L759] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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=1, y=0, z=0] [L776] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L779] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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=0, z=0] [L796] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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] [L799] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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=1] [L802] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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=1] [L805] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L806] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L807] 3 a$flush_delayed = weak$$choice2 [L808] 3 a$mem_tmp = a [L809] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L810] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L811] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L812] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L813] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L814] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L815] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L816] 3 __unbuffered_p2_EBX = a [L817] 3 a = a$flush_delayed ? a$mem_tmp : a [L818] 3 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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$$choice2=1, x=2, y=1, z=1] [L782] 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) [L783] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L784] 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 [L785] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L786] 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_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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$$choice2=1, x=2, y=1, z=1] [L821] 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) [L822] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L823] 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 [L824] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L825] 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=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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$$choice2=1, x=2, y=1, z=1] [L762] 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) [L763] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L764] 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 [L765] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L766] 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_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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=1, x=2, y=1, z=1] [L769] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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=1, x=2, y=1, z=1] [L789] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=1] [L828] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=1] [L850] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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}, main$tmp_guard0=1, main$tmp_guard1=0, t1001={5:0}, t1002={6:0}, t1003={3:0}, weak$$choice2=1, x=2, y=1, z=1] [L852] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L852] RET 0 assume_abort_if_not(main$tmp_guard0) [L854] 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) [L855] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L856] 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 [L857] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L858] 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=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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}, main$tmp_guard0=1, main$tmp_guard1=0, t1001={5:0}, t1002={6:0}, t1003={3:0}, weak$$choice2=1, x=2, y=1, z=1] [L861] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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}, main$tmp_guard0=1, main$tmp_guard1=0, t1001={5:0}, t1002={6:0}, t1003={3:0}, weak$$choice2=1, x=2, y=1, z=1] [L863] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=1] [L18] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[expression],IntegerLiteral[0]]]] VAL [\old(expression)=0, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=1] [L18] 0 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, 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: 844]: 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: 848]: 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: 846]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 72 locations, 9 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: 10.7s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 8.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 641 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 589 mSDsluCounter, 271 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 190 mSDsCounter, 57 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1643 IncrementalHoareTripleChecker+Invalid, 1700 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 57 mSolverCounterUnsat, 81 mSDtfsCounter, 1643 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 81 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=522occurred in iteration=9, InterpolantAutomatonStates: 76, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 257 NumberOfCodeBlocks, 257 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 213 ConstructedInterpolants, 0 QuantifiedInterpolants, 1153 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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:38:12,042 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