./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe000_power.opt.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b8dbc81d Calling Ultimate with: /usr/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/AutomizerReach.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe000_power.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 23eea01b75afdbb0ef381e4ddf0b030c295f59ec7a283af707e459bd9dd9c0c0 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 16:54:18,425 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 16:54:18,428 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 16:54:18,467 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 16:54:18,470 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 16:54:18,471 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 16:54:18,474 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 16:54:18,475 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 16:54:18,477 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 16:54:18,478 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 16:54:18,479 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 16:54:18,481 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 16:54:18,482 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 16:54:18,484 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 16:54:18,485 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 16:54:18,486 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 16:54:18,489 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 16:54:18,494 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 16:54:18,495 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 16:54:18,497 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 16:54:18,498 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 16:54:18,502 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 16:54:18,502 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 16:54:18,503 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 16:54:18,505 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 16:54:18,509 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 16:54:18,509 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 16:54:18,510 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 16:54:18,511 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 16:54:18,512 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 16:54:18,512 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 16:54:18,512 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 16:54:18,513 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 16:54:18,514 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 16:54:18,515 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 16:54:18,515 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 16:54:18,516 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 16:54:18,516 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 16:54:18,516 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 16:54:18,517 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 16:54:18,517 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 16:54:18,518 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-30 16:54:18,543 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 16:54:18,544 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 16:54:18,545 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 16:54:18,545 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 16:54:18,545 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 16:54:18,546 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 16:54:18,546 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 16:54:18,546 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 16:54:18,546 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 16:54:18,546 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 16:54:18,547 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 16:54:18,547 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 16:54:18,547 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 16:54:18,547 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 16:54:18,548 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-30 16:54:18,548 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 16:54:18,548 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-30 16:54:18,548 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 16:54:18,548 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-30 16:54:18,548 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 16:54:18,548 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-30 16:54:18,549 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 16:54:18,549 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 16:54:18,549 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 16:54:18,549 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 16:54:18,549 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 16:54:18,549 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 16:54:18,549 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-30 16:54:18,550 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 16:54:18,550 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 16:54:18,550 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 16:54:18,550 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-30 16:54:18,550 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 16:54:18,550 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 16:54:18,551 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 16:54:18,551 INFO L138 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.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 23eea01b75afdbb0ef381e4ddf0b030c295f59ec7a283af707e459bd9dd9c0c0 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> AFTER [2023-08-30 16:54:18,783 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 16:54:18,796 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 16:54:18,798 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 16:54:18,798 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 16:54:18,799 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 16:54:18,800 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe000_power.opt.i [2023-08-30 16:54:19,808 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 16:54:20,022 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 16:54:20,023 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe000_power.opt.i [2023-08-30 16:54:20,033 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3fd12d24d/51c4ec95e7a14b6aa163b73aab82162c/FLAG9c30e795e [2023-08-30 16:54:20,045 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3fd12d24d/51c4ec95e7a14b6aa163b73aab82162c [2023-08-30 16:54:20,050 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 16:54:20,051 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 16:54:20,052 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 16:54:20,052 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 16:54:20,054 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 16:54:20,054 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 04:54:20" (1/1) ... [2023-08-30 16:54:20,056 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@156f992e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:54:20, skipping insertion in model container [2023-08-30 16:54:20,056 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 04:54:20" (1/1) ... [2023-08-30 16:54:20,061 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 16:54:20,100 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 16:54:20,221 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe000_power.opt.i[951,964] [2023-08-30 16:54:20,395 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 16:54:20,403 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 16:54:20,422 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe000_power.opt.i[951,964] [2023-08-30 16:54:20,458 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 16:54:20,480 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 16:54:20,480 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 16:54:20,485 INFO L208 MainTranslator]: Completed translation [2023-08-30 16:54:20,486 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:54:20 WrapperNode [2023-08-30 16:54:20,486 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 16:54:20,487 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 16:54:20,487 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 16:54:20,487 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 16:54:20,492 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:54:20" (1/1) ... [2023-08-30 16:54:20,503 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:54:20" (1/1) ... [2023-08-30 16:54:20,521 INFO L138 Inliner]: procedures = 176, calls = 73, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 181 [2023-08-30 16:54:20,522 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 16:54:20,522 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 16:54:20,522 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 16:54:20,523 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 16:54:20,529 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:54:20" (1/1) ... [2023-08-30 16:54:20,529 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:54:20" (1/1) ... [2023-08-30 16:54:20,532 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:54:20" (1/1) ... [2023-08-30 16:54:20,532 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:54:20" (1/1) ... [2023-08-30 16:54:20,548 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:54:20" (1/1) ... [2023-08-30 16:54:20,550 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:54:20" (1/1) ... [2023-08-30 16:54:20,552 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:54:20" (1/1) ... [2023-08-30 16:54:20,554 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:54:20" (1/1) ... [2023-08-30 16:54:20,557 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 16:54:20,557 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 16:54:20,558 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 16:54:20,558 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 16:54:20,558 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:54:20" (1/1) ... [2023-08-30 16:54:20,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 16:54:20,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 16:54:20,593 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-30 16:54:20,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-30 16:54:20,618 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-30 16:54:20,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 16:54:20,618 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 16:54:20,618 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 16:54:20,618 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 16:54:20,618 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 16:54:20,618 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 16:54:20,619 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 16:54:20,619 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 16:54:20,619 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 16:54:20,619 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-30 16:54:20,619 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-30 16:54:20,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 16:54:20,619 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 16:54:20,619 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 16:54:20,620 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 16:54:20,620 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 16:54:20,738 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 16:54:20,739 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 16:54:21,084 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 16:54:21,312 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 16:54:21,312 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 16:54:21,314 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:54:21 BoogieIcfgContainer [2023-08-30 16:54:21,314 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 16:54:21,316 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 16:54:21,316 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 16:54:21,318 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 16:54:21,319 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 04:54:20" (1/3) ... [2023-08-30 16:54:21,319 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11022a89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 04:54:21, skipping insertion in model container [2023-08-30 16:54:21,319 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:54:20" (2/3) ... [2023-08-30 16:54:21,320 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11022a89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 04:54:21, skipping insertion in model container [2023-08-30 16:54:21,320 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:54:21" (3/3) ... [2023-08-30 16:54:21,321 INFO L112 eAbstractionObserver]: Analyzing ICFG safe000_power.opt.i [2023-08-30 16:54:21,327 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-30 16:54:21,334 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 16:54:21,334 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-30 16:54:21,335 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 16:54:21,390 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 16:54:21,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 127 transitions, 269 flow [2023-08-30 16:54:21,477 INFO L130 PetriNetUnfolder]: 2/124 cut-off events. [2023-08-30 16:54:21,477 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:54:21,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 124 events. 2/124 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 55 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2023-08-30 16:54:21,482 INFO L82 GeneralOperation]: Start removeDead. Operand has 135 places, 127 transitions, 269 flow [2023-08-30 16:54:21,488 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 132 places, 124 transitions, 257 flow [2023-08-30 16:54:21,492 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 16:54:21,499 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 132 places, 124 transitions, 257 flow [2023-08-30 16:54:21,510 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 132 places, 124 transitions, 257 flow [2023-08-30 16:54:21,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 124 transitions, 257 flow [2023-08-30 16:54:21,530 INFO L130 PetriNetUnfolder]: 2/124 cut-off events. [2023-08-30 16:54:21,531 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:54:21,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 124 events. 2/124 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 55 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2023-08-30 16:54:21,533 INFO L119 LiptonReduction]: Number of co-enabled transitions 1920 [2023-08-30 16:54:27,801 INFO L134 LiptonReduction]: Checked pairs total: 5724 [2023-08-30 16:54:27,801 INFO L136 LiptonReduction]: Total number of compositions: 113 [2023-08-30 16:54:27,810 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 16:54:27,813 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=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@c8a1cd0, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 16:54:27,814 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-08-30 16:54:27,816 INFO L130 PetriNetUnfolder]: 0/4 cut-off events. [2023-08-30 16:54:27,816 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:54:27,816 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:54:27,816 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-30 16:54:27,817 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 16:54:27,819 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:54:27,819 INFO L85 PathProgramCache]: Analyzing trace with hash 25593461, now seen corresponding path program 1 times [2023-08-30 16:54:27,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:54:27,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792478102] [2023-08-30 16:54:27,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:54:27,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:54:27,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:54:28,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:54:28,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:54:28,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792478102] [2023-08-30 16:54:28,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792478102] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:54:28,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:54:28,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 16:54:28,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278489127] [2023-08-30 16:54:28,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:54:28,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 16:54:28,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:54:28,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 16:54:28,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 16:54:28,064 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 240 [2023-08-30 16:54:28,066 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 23 transitions, 55 flow. Second operand has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 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) [2023-08-30 16:54:28,066 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:54:28,066 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 240 [2023-08-30 16:54:28,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:54:28,364 INFO L130 PetriNetUnfolder]: 911/1370 cut-off events. [2023-08-30 16:54:28,364 INFO L131 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2023-08-30 16:54:28,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2789 conditions, 1370 events. 911/1370 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 6646 event pairs, 311 based on Foata normal form. 0/1280 useless extension candidates. Maximal degree in co-relation 2778. Up to 871 conditions per place. [2023-08-30 16:54:28,371 INFO L137 encePairwiseOnDemand]: 237/240 looper letters, 30 selfloop transitions, 2 changer transitions 2/36 dead transitions. [2023-08-30 16:54:28,371 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 36 transitions, 155 flow [2023-08-30 16:54:28,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:54:28,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:54:28,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 371 transitions. [2023-08-30 16:54:28,381 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5152777777777777 [2023-08-30 16:54:28,382 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 371 transitions. [2023-08-30 16:54:28,382 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 371 transitions. [2023-08-30 16:54:28,383 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:54:28,384 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 371 transitions. [2023-08-30 16:54:28,387 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 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) [2023-08-30 16:54:28,389 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 240.0) internal successors, (960), 4 states have internal predecessors, (960), 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) [2023-08-30 16:54:28,390 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 240.0) internal successors, (960), 4 states have internal predecessors, (960), 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) [2023-08-30 16:54:28,391 INFO L175 Difference]: Start difference. First operand has 33 places, 23 transitions, 55 flow. Second operand 3 states and 371 transitions. [2023-08-30 16:54:28,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 36 transitions, 155 flow [2023-08-30 16:54:28,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 36 transitions, 150 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-30 16:54:28,394 INFO L231 Difference]: Finished difference. Result has 31 places, 21 transitions, 52 flow [2023-08-30 16:54:28,413 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=31, PETRI_TRANSITIONS=21} [2023-08-30 16:54:28,415 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, -2 predicate places. [2023-08-30 16:54:28,415 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 21 transitions, 52 flow [2023-08-30 16:54:28,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 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) [2023-08-30 16:54:28,416 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:54:28,416 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:54:28,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 16:54:28,416 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 16:54:28,417 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:54:28,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1081698377, now seen corresponding path program 1 times [2023-08-30 16:54:28,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:54:28,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451999773] [2023-08-30 16:54:28,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:54:28,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:54:28,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:54:28,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:54:28,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:54:28,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451999773] [2023-08-30 16:54:28,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451999773] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:54:28,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:54:28,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 16:54:28,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532323061] [2023-08-30 16:54:28,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:54:28,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 16:54:28,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:54:28,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 16:54:28,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 16:54:28,604 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 240 [2023-08-30 16:54:28,604 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 21 transitions, 52 flow. Second operand has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 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) [2023-08-30 16:54:28,605 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:54:28,605 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 240 [2023-08-30 16:54:28,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:54:28,807 INFO L130 PetriNetUnfolder]: 687/1046 cut-off events. [2023-08-30 16:54:28,808 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2023-08-30 16:54:28,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2218 conditions, 1046 events. 687/1046 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 4936 event pairs, 111 based on Foata normal form. 16/1057 useless extension candidates. Maximal degree in co-relation 2208. Up to 921 conditions per place. [2023-08-30 16:54:28,812 INFO L137 encePairwiseOnDemand]: 237/240 looper letters, 29 selfloop transitions, 2 changer transitions 0/33 dead transitions. [2023-08-30 16:54:28,812 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 33 transitions, 142 flow [2023-08-30 16:54:28,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:54:28,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:54:28,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 365 transitions. [2023-08-30 16:54:28,814 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5069444444444444 [2023-08-30 16:54:28,814 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 365 transitions. [2023-08-30 16:54:28,815 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 365 transitions. [2023-08-30 16:54:28,815 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:54:28,815 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 365 transitions. [2023-08-30 16:54:28,816 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 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) [2023-08-30 16:54:28,817 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 240.0) internal successors, (960), 4 states have internal predecessors, (960), 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) [2023-08-30 16:54:28,818 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 240.0) internal successors, (960), 4 states have internal predecessors, (960), 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) [2023-08-30 16:54:28,818 INFO L175 Difference]: Start difference. First operand has 31 places, 21 transitions, 52 flow. Second operand 3 states and 365 transitions. [2023-08-30 16:54:28,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 33 transitions, 142 flow [2023-08-30 16:54:28,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 33 transitions, 138 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 16:54:28,820 INFO L231 Difference]: Finished difference. Result has 31 places, 21 transitions, 56 flow [2023-08-30 16:54:28,821 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=31, PETRI_TRANSITIONS=21} [2023-08-30 16:54:28,821 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, -2 predicate places. [2023-08-30 16:54:28,821 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 21 transitions, 56 flow [2023-08-30 16:54:28,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 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) [2023-08-30 16:54:28,822 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:54:28,822 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:54:28,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 16:54:28,822 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 16:54:28,822 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:54:28,823 INFO L85 PathProgramCache]: Analyzing trace with hash 827087547, now seen corresponding path program 1 times [2023-08-30 16:54:28,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:54:28,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34981979] [2023-08-30 16:54:28,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:54:28,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:54:28,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:54:29,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:54:29,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:54:29,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34981979] [2023-08-30 16:54:29,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34981979] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:54:29,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:54:29,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 16:54:29,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43913400] [2023-08-30 16:54:29,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:54:29,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:54:29,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:54:29,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:54:29,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:54:29,037 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 240 [2023-08-30 16:54:29,038 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 21 transitions, 56 flow. Second operand has 4 states, 4 states have (on average 110.5) internal successors, (442), 4 states have internal predecessors, (442), 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) [2023-08-30 16:54:29,038 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:54:29,038 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 240 [2023-08-30 16:54:29,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:54:29,377 INFO L130 PetriNetUnfolder]: 1578/2374 cut-off events. [2023-08-30 16:54:29,377 INFO L131 PetriNetUnfolder]: For 233/233 co-relation queries the response was YES. [2023-08-30 16:54:29,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5097 conditions, 2374 events. 1578/2374 cut-off events. For 233/233 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 10937 event pairs, 276 based on Foata normal form. 100/2474 useless extension candidates. Maximal degree in co-relation 5086. Up to 1144 conditions per place. [2023-08-30 16:54:29,383 INFO L137 encePairwiseOnDemand]: 235/240 looper letters, 37 selfloop transitions, 4 changer transitions 7/48 dead transitions. [2023-08-30 16:54:29,383 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 48 transitions, 213 flow [2023-08-30 16:54:29,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 16:54:29,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 16:54:29,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 482 transitions. [2023-08-30 16:54:29,385 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5020833333333333 [2023-08-30 16:54:29,385 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 482 transitions. [2023-08-30 16:54:29,385 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 482 transitions. [2023-08-30 16:54:29,386 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:54:29,386 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 482 transitions. [2023-08-30 16:54:29,387 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 120.5) internal successors, (482), 4 states have internal predecessors, (482), 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) [2023-08-30 16:54:29,388 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 240.0) internal successors, (1200), 5 states have internal predecessors, (1200), 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) [2023-08-30 16:54:29,388 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 240.0) internal successors, (1200), 5 states have internal predecessors, (1200), 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) [2023-08-30 16:54:29,389 INFO L175 Difference]: Start difference. First operand has 31 places, 21 transitions, 56 flow. Second operand 4 states and 482 transitions. [2023-08-30 16:54:29,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 48 transitions, 213 flow [2023-08-30 16:54:29,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 48 transitions, 207 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 16:54:29,390 INFO L231 Difference]: Finished difference. Result has 34 places, 23 transitions, 78 flow [2023-08-30 16:54:29,390 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=78, PETRI_PLACES=34, PETRI_TRANSITIONS=23} [2023-08-30 16:54:29,390 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 1 predicate places. [2023-08-30 16:54:29,390 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 23 transitions, 78 flow [2023-08-30 16:54:29,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 110.5) internal successors, (442), 4 states have internal predecessors, (442), 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) [2023-08-30 16:54:29,391 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:54:29,391 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:54:29,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 16:54:29,391 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 16:54:29,392 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:54:29,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1697908187, now seen corresponding path program 1 times [2023-08-30 16:54:29,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:54:29,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258790537] [2023-08-30 16:54:29,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:54:29,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:54:29,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:54:29,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:54:29,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:54:29,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258790537] [2023-08-30 16:54:29,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258790537] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:54:29,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:54:29,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 16:54:29,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277762027] [2023-08-30 16:54:29,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:54:29,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 16:54:29,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:54:29,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 16:54:29,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 16:54:29,568 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 240 [2023-08-30 16:54:29,568 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 23 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 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) [2023-08-30 16:54:29,568 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:54:29,568 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 240 [2023-08-30 16:54:29,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:54:29,804 INFO L130 PetriNetUnfolder]: 1111/1706 cut-off events. [2023-08-30 16:54:29,805 INFO L131 PetriNetUnfolder]: For 857/857 co-relation queries the response was YES. [2023-08-30 16:54:29,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4055 conditions, 1706 events. 1111/1706 cut-off events. For 857/857 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 7699 event pairs, 478 based on Foata normal form. 60/1766 useless extension candidates. Maximal degree in co-relation 4042. Up to 878 conditions per place. [2023-08-30 16:54:29,810 INFO L137 encePairwiseOnDemand]: 237/240 looper letters, 33 selfloop transitions, 3 changer transitions 0/36 dead transitions. [2023-08-30 16:54:29,810 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 36 transitions, 182 flow [2023-08-30 16:54:29,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:54:29,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:54:29,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 366 transitions. [2023-08-30 16:54:29,811 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5083333333333333 [2023-08-30 16:54:29,811 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 366 transitions. [2023-08-30 16:54:29,811 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 366 transitions. [2023-08-30 16:54:29,812 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:54:29,812 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 366 transitions. [2023-08-30 16:54:29,812 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 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) [2023-08-30 16:54:29,813 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 240.0) internal successors, (960), 4 states have internal predecessors, (960), 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) [2023-08-30 16:54:29,814 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 240.0) internal successors, (960), 4 states have internal predecessors, (960), 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) [2023-08-30 16:54:29,814 INFO L175 Difference]: Start difference. First operand has 34 places, 23 transitions, 78 flow. Second operand 3 states and 366 transitions. [2023-08-30 16:54:29,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 36 transitions, 182 flow [2023-08-30 16:54:29,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 36 transitions, 170 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-30 16:54:29,816 INFO L231 Difference]: Finished difference. Result has 34 places, 23 transitions, 80 flow [2023-08-30 16:54:29,816 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=69, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=34, PETRI_TRANSITIONS=23} [2023-08-30 16:54:29,817 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 1 predicate places. [2023-08-30 16:54:29,817 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 23 transitions, 80 flow [2023-08-30 16:54:29,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 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) [2023-08-30 16:54:29,817 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:54:29,817 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:54:29,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 16:54:29,818 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 16:54:29,818 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:54:29,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1235209584, now seen corresponding path program 1 times [2023-08-30 16:54:29,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:54:29,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577958941] [2023-08-30 16:54:29,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:54:29,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:54:29,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:54:29,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:54:29,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:54:29,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577958941] [2023-08-30 16:54:29,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577958941] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:54:29,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:54:29,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 16:54:29,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020252963] [2023-08-30 16:54:29,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:54:29,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:54:29,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:54:29,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:54:29,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:54:29,947 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 240 [2023-08-30 16:54:29,947 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 23 transitions, 80 flow. Second operand has 4 states, 4 states have (on average 111.0) internal successors, (444), 4 states have internal predecessors, (444), 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) [2023-08-30 16:54:29,947 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:54:29,947 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 240 [2023-08-30 16:54:29,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:54:30,209 INFO L130 PetriNetUnfolder]: 1353/2068 cut-off events. [2023-08-30 16:54:30,209 INFO L131 PetriNetUnfolder]: For 946/946 co-relation queries the response was YES. [2023-08-30 16:54:30,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4816 conditions, 2068 events. 1353/2068 cut-off events. For 946/946 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 9510 event pairs, 543 based on Foata normal form. 60/2128 useless extension candidates. Maximal degree in co-relation 4804. Up to 1363 conditions per place. [2023-08-30 16:54:30,214 INFO L137 encePairwiseOnDemand]: 235/240 looper letters, 30 selfloop transitions, 3 changer transitions 7/40 dead transitions. [2023-08-30 16:54:30,214 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 40 transitions, 202 flow [2023-08-30 16:54:30,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 16:54:30,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 16:54:30,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 473 transitions. [2023-08-30 16:54:30,215 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49270833333333336 [2023-08-30 16:54:30,215 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 473 transitions. [2023-08-30 16:54:30,216 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 473 transitions. [2023-08-30 16:54:30,216 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:54:30,216 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 473 transitions. [2023-08-30 16:54:30,217 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 118.25) internal successors, (473), 4 states have internal predecessors, (473), 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) [2023-08-30 16:54:30,218 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 240.0) internal successors, (1200), 5 states have internal predecessors, (1200), 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) [2023-08-30 16:54:30,218 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 240.0) internal successors, (1200), 5 states have internal predecessors, (1200), 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) [2023-08-30 16:54:30,219 INFO L175 Difference]: Start difference. First operand has 34 places, 23 transitions, 80 flow. Second operand 4 states and 473 transitions. [2023-08-30 16:54:30,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 40 transitions, 202 flow [2023-08-30 16:54:30,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 40 transitions, 194 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-30 16:54:30,221 INFO L231 Difference]: Finished difference. Result has 37 places, 21 transitions, 74 flow [2023-08-30 16:54:30,222 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=74, PETRI_PLACES=37, PETRI_TRANSITIONS=21} [2023-08-30 16:54:30,224 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 4 predicate places. [2023-08-30 16:54:30,224 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 21 transitions, 74 flow [2023-08-30 16:54:30,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.0) internal successors, (444), 4 states have internal predecessors, (444), 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) [2023-08-30 16:54:30,224 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:54:30,224 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:54:30,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 16:54:30,225 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 16:54:30,225 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:54:30,225 INFO L85 PathProgramCache]: Analyzing trace with hash 397768082, now seen corresponding path program 1 times [2023-08-30 16:54:30,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:54:30,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375533695] [2023-08-30 16:54:30,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:54:30,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:54:30,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:54:30,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:54:30,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:54:30,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375533695] [2023-08-30 16:54:30,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375533695] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:54:30,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:54:30,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:54:30,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372472978] [2023-08-30 16:54:30,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:54:30,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:54:30,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:54:30,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:54:30,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:54:30,480 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 240 [2023-08-30 16:54:30,481 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 21 transitions, 74 flow. Second operand has 4 states, 4 states have (on average 111.5) internal successors, (446), 4 states have internal predecessors, (446), 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) [2023-08-30 16:54:30,481 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:54:30,481 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 240 [2023-08-30 16:54:30,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:54:30,646 INFO L130 PetriNetUnfolder]: 752/1164 cut-off events. [2023-08-30 16:54:30,646 INFO L131 PetriNetUnfolder]: For 772/772 co-relation queries the response was YES. [2023-08-30 16:54:30,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2724 conditions, 1164 events. 752/1164 cut-off events. For 772/772 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 4676 event pairs, 223 based on Foata normal form. 36/1200 useless extension candidates. Maximal degree in co-relation 2710. Up to 516 conditions per place. [2023-08-30 16:54:30,649 INFO L137 encePairwiseOnDemand]: 236/240 looper letters, 25 selfloop transitions, 2 changer transitions 21/48 dead transitions. [2023-08-30 16:54:30,649 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 48 transitions, 234 flow [2023-08-30 16:54:30,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 16:54:30,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 16:54:30,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 589 transitions. [2023-08-30 16:54:30,651 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49083333333333334 [2023-08-30 16:54:30,651 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 589 transitions. [2023-08-30 16:54:30,651 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 589 transitions. [2023-08-30 16:54:30,651 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:54:30,652 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 589 transitions. [2023-08-30 16:54:30,653 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 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) [2023-08-30 16:54:30,654 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 240.0) internal successors, (1440), 6 states have internal predecessors, (1440), 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) [2023-08-30 16:54:30,655 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 240.0) internal successors, (1440), 6 states have internal predecessors, (1440), 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) [2023-08-30 16:54:30,655 INFO L175 Difference]: Start difference. First operand has 37 places, 21 transitions, 74 flow. Second operand 5 states and 589 transitions. [2023-08-30 16:54:30,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 48 transitions, 234 flow [2023-08-30 16:54:30,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 48 transitions, 215 flow, removed 2 selfloop flow, removed 6 redundant places. [2023-08-30 16:54:30,657 INFO L231 Difference]: Finished difference. Result has 37 places, 21 transitions, 68 flow [2023-08-30 16:54:30,657 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=68, PETRI_PLACES=37, PETRI_TRANSITIONS=21} [2023-08-30 16:54:30,660 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 4 predicate places. [2023-08-30 16:54:30,660 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 21 transitions, 68 flow [2023-08-30 16:54:30,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.5) internal successors, (446), 4 states have internal predecessors, (446), 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) [2023-08-30 16:54:30,661 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:54:30,661 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:54:30,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 16:54:30,662 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 16:54:30,662 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:54:30,662 INFO L85 PathProgramCache]: Analyzing trace with hash 877019304, now seen corresponding path program 2 times [2023-08-30 16:54:30,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:54:30,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586585839] [2023-08-30 16:54:30,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:54:30,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:54:30,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:54:31,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:54:31,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:54:31,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586585839] [2023-08-30 16:54:31,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586585839] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:54:31,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:54:31,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 16:54:31,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15060727] [2023-08-30 16:54:31,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:54:31,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 16:54:31,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:54:31,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 16:54:31,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-30 16:54:31,885 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 240 [2023-08-30 16:54:31,886 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 21 transitions, 68 flow. Second operand has 6 states, 6 states have (on average 106.0) internal successors, (636), 6 states have internal predecessors, (636), 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) [2023-08-30 16:54:31,886 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:54:31,886 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 240 [2023-08-30 16:54:31,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:54:32,035 INFO L130 PetriNetUnfolder]: 361/583 cut-off events. [2023-08-30 16:54:32,035 INFO L131 PetriNetUnfolder]: For 297/297 co-relation queries the response was YES. [2023-08-30 16:54:32,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1344 conditions, 583 events. 361/583 cut-off events. For 297/297 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2017 event pairs, 67 based on Foata normal form. 18/601 useless extension candidates. Maximal degree in co-relation 1332. Up to 328 conditions per place. [2023-08-30 16:54:32,037 INFO L137 encePairwiseOnDemand]: 233/240 looper letters, 30 selfloop transitions, 6 changer transitions 0/38 dead transitions. [2023-08-30 16:54:32,037 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 38 transitions, 176 flow [2023-08-30 16:54:32,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 16:54:32,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 16:54:32,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 558 transitions. [2023-08-30 16:54:32,039 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.465 [2023-08-30 16:54:32,039 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 558 transitions. [2023-08-30 16:54:32,039 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 558 transitions. [2023-08-30 16:54:32,039 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:54:32,040 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 558 transitions. [2023-08-30 16:54:32,040 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 111.6) internal successors, (558), 5 states have internal predecessors, (558), 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) [2023-08-30 16:54:32,042 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 240.0) internal successors, (1440), 6 states have internal predecessors, (1440), 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) [2023-08-30 16:54:32,042 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 240.0) internal successors, (1440), 6 states have internal predecessors, (1440), 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) [2023-08-30 16:54:32,042 INFO L175 Difference]: Start difference. First operand has 37 places, 21 transitions, 68 flow. Second operand 5 states and 558 transitions. [2023-08-30 16:54:32,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 38 transitions, 176 flow [2023-08-30 16:54:32,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 38 transitions, 166 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-08-30 16:54:32,043 INFO L231 Difference]: Finished difference. Result has 37 places, 24 transitions, 92 flow [2023-08-30 16:54:32,043 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=92, PETRI_PLACES=37, PETRI_TRANSITIONS=24} [2023-08-30 16:54:32,044 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 4 predicate places. [2023-08-30 16:54:32,044 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 24 transitions, 92 flow [2023-08-30 16:54:32,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 106.0) internal successors, (636), 6 states have internal predecessors, (636), 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) [2023-08-30 16:54:32,044 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:54:32,044 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:54:32,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 16:54:32,045 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 16:54:32,045 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:54:32,045 INFO L85 PathProgramCache]: Analyzing trace with hash -368411407, now seen corresponding path program 1 times [2023-08-30 16:54:32,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:54:32,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707763967] [2023-08-30 16:54:32,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:54:32,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:54:32,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:54:32,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:54:32,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:54:32,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707763967] [2023-08-30 16:54:32,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707763967] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:54:32,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:54:32,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:54:32,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338998347] [2023-08-30 16:54:32,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:54:32,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:54:32,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:54:32,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:54:32,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:54:32,344 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 240 [2023-08-30 16:54:32,345 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 24 transitions, 92 flow. Second operand has 4 states, 4 states have (on average 111.5) internal successors, (446), 4 states have internal predecessors, (446), 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) [2023-08-30 16:54:32,345 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:54:32,345 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 240 [2023-08-30 16:54:32,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:54:32,471 INFO L130 PetriNetUnfolder]: 301/518 cut-off events. [2023-08-30 16:54:32,472 INFO L131 PetriNetUnfolder]: For 312/314 co-relation queries the response was YES. [2023-08-30 16:54:32,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1446 conditions, 518 events. 301/518 cut-off events. For 312/314 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2078 event pairs, 51 based on Foata normal form. 59/576 useless extension candidates. Maximal degree in co-relation 1433. Up to 323 conditions per place. [2023-08-30 16:54:32,474 INFO L137 encePairwiseOnDemand]: 234/240 looper letters, 32 selfloop transitions, 4 changer transitions 26/64 dead transitions. [2023-08-30 16:54:32,474 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 64 transitions, 370 flow [2023-08-30 16:54:32,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 16:54:32,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 16:54:32,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 592 transitions. [2023-08-30 16:54:32,476 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49333333333333335 [2023-08-30 16:54:32,476 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 592 transitions. [2023-08-30 16:54:32,476 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 592 transitions. [2023-08-30 16:54:32,476 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:54:32,476 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 592 transitions. [2023-08-30 16:54:32,477 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 118.4) internal successors, (592), 5 states have internal predecessors, (592), 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) [2023-08-30 16:54:32,479 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 240.0) internal successors, (1440), 6 states have internal predecessors, (1440), 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) [2023-08-30 16:54:32,479 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 240.0) internal successors, (1440), 6 states have internal predecessors, (1440), 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) [2023-08-30 16:54:32,479 INFO L175 Difference]: Start difference. First operand has 37 places, 24 transitions, 92 flow. Second operand 5 states and 592 transitions. [2023-08-30 16:54:32,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 64 transitions, 370 flow [2023-08-30 16:54:32,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 64 transitions, 348 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-30 16:54:32,482 INFO L231 Difference]: Finished difference. Result has 41 places, 27 transitions, 120 flow [2023-08-30 16:54:32,483 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=120, PETRI_PLACES=41, PETRI_TRANSITIONS=27} [2023-08-30 16:54:32,484 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 8 predicate places. [2023-08-30 16:54:32,484 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 27 transitions, 120 flow [2023-08-30 16:54:32,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.5) internal successors, (446), 4 states have internal predecessors, (446), 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) [2023-08-30 16:54:32,484 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:54:32,484 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:54:32,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 16:54:32,485 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 16:54:32,488 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:54:32,488 INFO L85 PathProgramCache]: Analyzing trace with hash 2044979947, now seen corresponding path program 1 times [2023-08-30 16:54:32,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:54:32,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810953609] [2023-08-30 16:54:32,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:54:32,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:54:32,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:54:33,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:54:33,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:54:33,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810953609] [2023-08-30 16:54:33,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810953609] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:54:33,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:54:33,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-30 16:54:33,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242866821] [2023-08-30 16:54:33,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:54:33,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-30 16:54:33,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:54:33,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-30 16:54:33,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-08-30 16:54:33,893 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 240 [2023-08-30 16:54:33,894 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 27 transitions, 120 flow. Second operand has 9 states, 9 states have (on average 103.66666666666667) internal successors, (933), 9 states have internal predecessors, (933), 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) [2023-08-30 16:54:33,894 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:54:33,894 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 240 [2023-08-30 16:54:33,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:54:34,033 INFO L130 PetriNetUnfolder]: 214/374 cut-off events. [2023-08-30 16:54:34,033 INFO L131 PetriNetUnfolder]: For 391/393 co-relation queries the response was YES. [2023-08-30 16:54:34,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1337 conditions, 374 events. 214/374 cut-off events. For 391/393 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1288 event pairs, 100 based on Foata normal form. 1/375 useless extension candidates. Maximal degree in co-relation 1321. Up to 353 conditions per place. [2023-08-30 16:54:34,034 INFO L137 encePairwiseOnDemand]: 233/240 looper letters, 33 selfloop transitions, 9 changer transitions 0/44 dead transitions. [2023-08-30 16:54:34,035 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 44 transitions, 272 flow [2023-08-30 16:54:34,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 16:54:34,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 16:54:34,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 545 transitions. [2023-08-30 16:54:34,036 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45416666666666666 [2023-08-30 16:54:34,036 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 545 transitions. [2023-08-30 16:54:34,036 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 545 transitions. [2023-08-30 16:54:34,037 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:54:34,037 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 545 transitions. [2023-08-30 16:54:34,038 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 109.0) internal successors, (545), 5 states have internal predecessors, (545), 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) [2023-08-30 16:54:34,039 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 240.0) internal successors, (1440), 6 states have internal predecessors, (1440), 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) [2023-08-30 16:54:34,039 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 240.0) internal successors, (1440), 6 states have internal predecessors, (1440), 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) [2023-08-30 16:54:34,039 INFO L175 Difference]: Start difference. First operand has 41 places, 27 transitions, 120 flow. Second operand 5 states and 545 transitions. [2023-08-30 16:54:34,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 44 transitions, 272 flow [2023-08-30 16:54:34,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 44 transitions, 263 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-30 16:54:34,041 INFO L231 Difference]: Finished difference. Result has 43 places, 34 transitions, 184 flow [2023-08-30 16:54:34,041 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=184, PETRI_PLACES=43, PETRI_TRANSITIONS=34} [2023-08-30 16:54:34,041 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 10 predicate places. [2023-08-30 16:54:34,041 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 34 transitions, 184 flow [2023-08-30 16:54:34,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 103.66666666666667) internal successors, (933), 9 states have internal predecessors, (933), 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) [2023-08-30 16:54:34,042 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:54:34,042 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:54:34,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 16:54:34,042 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 16:54:34,043 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:54:34,043 INFO L85 PathProgramCache]: Analyzing trace with hash -975753446, now seen corresponding path program 1 times [2023-08-30 16:54:34,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:54:34,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158833164] [2023-08-30 16:54:34,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:54:34,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:54:34,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:54:35,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:54:35,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:54:35,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158833164] [2023-08-30 16:54:35,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158833164] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:54:35,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:54:35,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 16:54:35,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451435820] [2023-08-30 16:54:35,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:54:35,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 16:54:35,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:54:35,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 16:54:35,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-08-30 16:54:35,151 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 240 [2023-08-30 16:54:35,152 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 34 transitions, 184 flow. Second operand has 8 states, 8 states have (on average 100.875) internal successors, (807), 8 states have internal predecessors, (807), 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) [2023-08-30 16:54:35,152 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:54:35,152 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 240 [2023-08-30 16:54:35,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:54:35,304 INFO L130 PetriNetUnfolder]: 212/371 cut-off events. [2023-08-30 16:54:35,304 INFO L131 PetriNetUnfolder]: For 582/588 co-relation queries the response was YES. [2023-08-30 16:54:35,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1435 conditions, 371 events. 212/371 cut-off events. For 582/588 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1284 event pairs, 100 based on Foata normal form. 3/374 useless extension candidates. Maximal degree in co-relation 1417. Up to 350 conditions per place. [2023-08-30 16:54:35,306 INFO L137 encePairwiseOnDemand]: 233/240 looper letters, 35 selfloop transitions, 9 changer transitions 0/46 dead transitions. [2023-08-30 16:54:35,306 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 46 transitions, 320 flow [2023-08-30 16:54:35,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 16:54:35,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 16:54:35,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 530 transitions. [2023-08-30 16:54:35,308 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44166666666666665 [2023-08-30 16:54:35,308 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 530 transitions. [2023-08-30 16:54:35,308 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 530 transitions. [2023-08-30 16:54:35,308 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:54:35,309 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 530 transitions. [2023-08-30 16:54:35,309 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 106.0) internal successors, (530), 5 states have internal predecessors, (530), 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) [2023-08-30 16:54:35,311 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 240.0) internal successors, (1440), 6 states have internal predecessors, (1440), 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) [2023-08-30 16:54:35,312 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 240.0) internal successors, (1440), 6 states have internal predecessors, (1440), 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) [2023-08-30 16:54:35,312 INFO L175 Difference]: Start difference. First operand has 43 places, 34 transitions, 184 flow. Second operand 5 states and 530 transitions. [2023-08-30 16:54:35,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 46 transitions, 320 flow [2023-08-30 16:54:35,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 46 transitions, 314 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-30 16:54:35,314 INFO L231 Difference]: Finished difference. Result has 47 places, 37 transitions, 225 flow [2023-08-30 16:54:35,315 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=225, PETRI_PLACES=47, PETRI_TRANSITIONS=37} [2023-08-30 16:54:35,315 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 14 predicate places. [2023-08-30 16:54:35,315 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 225 flow [2023-08-30 16:54:35,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 100.875) internal successors, (807), 8 states have internal predecessors, (807), 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) [2023-08-30 16:54:35,316 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:54:35,316 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:54:35,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-30 16:54:35,316 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 16:54:35,316 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:54:35,316 INFO L85 PathProgramCache]: Analyzing trace with hash -988086920, now seen corresponding path program 1 times [2023-08-30 16:54:35,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:54:35,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952548033] [2023-08-30 16:54:35,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:54:35,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:54:35,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:54:35,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:54:35,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:54:35,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952548033] [2023-08-30 16:54:35,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952548033] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:54:35,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:54:35,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 16:54:35,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797277713] [2023-08-30 16:54:35,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:54:35,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:54:35,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:54:35,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:54:35,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:54:35,506 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 240 [2023-08-30 16:54:35,507 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 225 flow. Second operand has 5 states, 5 states have (on average 111.0) internal successors, (555), 5 states have internal predecessors, (555), 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) [2023-08-30 16:54:35,507 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:54:35,507 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 240 [2023-08-30 16:54:35,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:54:35,611 INFO L130 PetriNetUnfolder]: 142/275 cut-off events. [2023-08-30 16:54:35,611 INFO L131 PetriNetUnfolder]: For 536/537 co-relation queries the response was YES. [2023-08-30 16:54:35,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1115 conditions, 275 events. 142/275 cut-off events. For 536/537 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 982 event pairs, 12 based on Foata normal form. 36/310 useless extension candidates. Maximal degree in co-relation 1095. Up to 114 conditions per place. [2023-08-30 16:54:35,613 INFO L137 encePairwiseOnDemand]: 234/240 looper letters, 52 selfloop transitions, 7 changer transitions 26/87 dead transitions. [2023-08-30 16:54:35,613 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 87 transitions, 713 flow [2023-08-30 16:54:35,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 16:54:35,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 16:54:35,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 706 transitions. [2023-08-30 16:54:35,615 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49027777777777776 [2023-08-30 16:54:35,615 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 706 transitions. [2023-08-30 16:54:35,615 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 706 transitions. [2023-08-30 16:54:35,615 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:54:35,615 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 706 transitions. [2023-08-30 16:54:35,616 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 117.66666666666667) internal successors, (706), 6 states have internal predecessors, (706), 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) [2023-08-30 16:54:35,618 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 240.0) internal successors, (1680), 7 states have internal predecessors, (1680), 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) [2023-08-30 16:54:35,619 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 240.0) internal successors, (1680), 7 states have internal predecessors, (1680), 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) [2023-08-30 16:54:35,619 INFO L175 Difference]: Start difference. First operand has 47 places, 37 transitions, 225 flow. Second operand 6 states and 706 transitions. [2023-08-30 16:54:35,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 87 transitions, 713 flow [2023-08-30 16:54:35,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 87 transitions, 690 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-30 16:54:35,621 INFO L231 Difference]: Finished difference. Result has 52 places, 40 transitions, 266 flow [2023-08-30 16:54:35,622 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=266, PETRI_PLACES=52, PETRI_TRANSITIONS=40} [2023-08-30 16:54:35,622 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 19 predicate places. [2023-08-30 16:54:35,622 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 40 transitions, 266 flow [2023-08-30 16:54:35,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 111.0) internal successors, (555), 5 states have internal predecessors, (555), 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) [2023-08-30 16:54:35,622 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:54:35,623 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:54:35,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-30 16:54:35,623 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 16:54:35,623 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:54:35,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1950952769, now seen corresponding path program 1 times [2023-08-30 16:54:35,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:54:35,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803501538] [2023-08-30 16:54:35,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:54:35,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:54:35,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:54:36,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:54:36,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:54:36,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803501538] [2023-08-30 16:54:36,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803501538] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:54:36,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:54:36,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-30 16:54:36,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604210543] [2023-08-30 16:54:36,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:54:36,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-30 16:54:36,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:54:36,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-30 16:54:36,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-08-30 16:54:36,947 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 240 [2023-08-30 16:54:36,948 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 40 transitions, 266 flow. Second operand has 10 states, 10 states have (on average 103.7) internal successors, (1037), 10 states have internal predecessors, (1037), 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) [2023-08-30 16:54:36,948 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:54:36,948 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 240 [2023-08-30 16:54:36,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:54:37,099 INFO L130 PetriNetUnfolder]: 100/207 cut-off events. [2023-08-30 16:54:37,099 INFO L131 PetriNetUnfolder]: For 592/592 co-relation queries the response was YES. [2023-08-30 16:54:37,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 959 conditions, 207 events. 100/207 cut-off events. For 592/592 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 620 event pairs, 15 based on Foata normal form. 1/208 useless extension candidates. Maximal degree in co-relation 936. Up to 110 conditions per place. [2023-08-30 16:54:37,100 INFO L137 encePairwiseOnDemand]: 234/240 looper letters, 44 selfloop transitions, 11 changer transitions 0/57 dead transitions. [2023-08-30 16:54:37,100 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 57 transitions, 496 flow [2023-08-30 16:54:37,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 16:54:37,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 16:54:37,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 545 transitions. [2023-08-30 16:54:37,102 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45416666666666666 [2023-08-30 16:54:37,102 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 545 transitions. [2023-08-30 16:54:37,102 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 545 transitions. [2023-08-30 16:54:37,102 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:54:37,102 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 545 transitions. [2023-08-30 16:54:37,103 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 109.0) internal successors, (545), 5 states have internal predecessors, (545), 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) [2023-08-30 16:54:37,104 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 240.0) internal successors, (1440), 6 states have internal predecessors, (1440), 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) [2023-08-30 16:54:37,106 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 240.0) internal successors, (1440), 6 states have internal predecessors, (1440), 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) [2023-08-30 16:54:37,106 INFO L175 Difference]: Start difference. First operand has 52 places, 40 transitions, 266 flow. Second operand 5 states and 545 transitions. [2023-08-30 16:54:37,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 57 transitions, 496 flow [2023-08-30 16:54:37,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 57 transitions, 434 flow, removed 23 selfloop flow, removed 4 redundant places. [2023-08-30 16:54:37,109 INFO L231 Difference]: Finished difference. Result has 51 places, 41 transitions, 279 flow [2023-08-30 16:54:37,109 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=279, PETRI_PLACES=51, PETRI_TRANSITIONS=41} [2023-08-30 16:54:37,109 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 18 predicate places. [2023-08-30 16:54:37,109 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 41 transitions, 279 flow [2023-08-30 16:54:37,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 103.7) internal successors, (1037), 10 states have internal predecessors, (1037), 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) [2023-08-30 16:54:37,110 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:54:37,110 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:54:37,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-30 16:54:37,110 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 16:54:37,111 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:54:37,111 INFO L85 PathProgramCache]: Analyzing trace with hash -815599873, now seen corresponding path program 1 times [2023-08-30 16:54:37,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:54:37,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899804811] [2023-08-30 16:54:37,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:54:37,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:54:37,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:54:37,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:54:37,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:54:37,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899804811] [2023-08-30 16:54:37,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899804811] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:54:37,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:54:37,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 16:54:37,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578979973] [2023-08-30 16:54:37,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:54:37,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 16:54:37,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:54:37,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 16:54:37,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-30 16:54:37,354 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 240 [2023-08-30 16:54:37,355 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 41 transitions, 279 flow. Second operand has 6 states, 6 states have (on average 110.83333333333333) internal successors, (665), 6 states have internal predecessors, (665), 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) [2023-08-30 16:54:37,355 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:54:37,355 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 240 [2023-08-30 16:54:37,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:54:37,459 INFO L130 PetriNetUnfolder]: 83/172 cut-off events. [2023-08-30 16:54:37,460 INFO L131 PetriNetUnfolder]: For 470/471 co-relation queries the response was YES. [2023-08-30 16:54:37,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 771 conditions, 172 events. 83/172 cut-off events. For 470/471 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 530 event pairs, 9 based on Foata normal form. 12/183 useless extension candidates. Maximal degree in co-relation 749. Up to 64 conditions per place. [2023-08-30 16:54:37,461 INFO L137 encePairwiseOnDemand]: 234/240 looper letters, 52 selfloop transitions, 10 changer transitions 11/75 dead transitions. [2023-08-30 16:54:37,461 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 75 transitions, 690 flow [2023-08-30 16:54:37,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 16:54:37,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 16:54:37,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 805 transitions. [2023-08-30 16:54:37,463 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4791666666666667 [2023-08-30 16:54:37,463 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 805 transitions. [2023-08-30 16:54:37,463 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 805 transitions. [2023-08-30 16:54:37,463 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:54:37,463 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 805 transitions. [2023-08-30 16:54:37,465 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 115.0) internal successors, (805), 7 states have internal predecessors, (805), 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) [2023-08-30 16:54:37,466 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 240.0) internal successors, (1920), 8 states have internal predecessors, (1920), 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) [2023-08-30 16:54:37,466 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 240.0) internal successors, (1920), 8 states have internal predecessors, (1920), 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) [2023-08-30 16:54:37,467 INFO L175 Difference]: Start difference. First operand has 51 places, 41 transitions, 279 flow. Second operand 7 states and 805 transitions. [2023-08-30 16:54:37,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 75 transitions, 690 flow [2023-08-30 16:54:37,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 75 transitions, 630 flow, removed 12 selfloop flow, removed 5 redundant places. [2023-08-30 16:54:37,469 INFO L231 Difference]: Finished difference. Result has 55 places, 41 transitions, 275 flow [2023-08-30 16:54:37,469 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=243, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=275, PETRI_PLACES=55, PETRI_TRANSITIONS=41} [2023-08-30 16:54:37,470 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 22 predicate places. [2023-08-30 16:54:37,470 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 41 transitions, 275 flow [2023-08-30 16:54:37,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 110.83333333333333) internal successors, (665), 6 states have internal predecessors, (665), 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) [2023-08-30 16:54:37,470 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:54:37,470 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] [2023-08-30 16:54:37,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-30 16:54:37,470 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 16:54:37,471 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:54:37,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1729690841, now seen corresponding path program 1 times [2023-08-30 16:54:37,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:54:37,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917619875] [2023-08-30 16:54:37,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:54:37,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:54:37,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 16:54:37,549 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 16:54:37,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 16:54:37,709 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 16:54:37,709 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 16:54:37,710 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-08-30 16:54:37,711 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-08-30 16:54:37,711 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-08-30 16:54:37,711 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-08-30 16:54:37,711 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-08-30 16:54:37,712 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-08-30 16:54:37,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-30 16:54:37,712 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:54:37,716 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 16:54:37,716 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 16:54:37,787 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 04:54:37 BasicIcfg [2023-08-30 16:54:37,792 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 16:54:37,792 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 16:54:37,792 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 16:54:37,792 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 16:54:37,793 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:54:21" (3/4) ... [2023-08-30 16:54:37,794 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-08-30 16:54:37,863 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-08-30 16:54:37,863 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 16:54:37,863 INFO L158 Benchmark]: Toolchain (without parser) took 17812.48ms. Allocated memory was 67.1MB in the beginning and 801.1MB in the end (delta: 734.0MB). Free memory was 41.6MB in the beginning and 644.1MB in the end (delta: -602.5MB). Peak memory consumption was 129.8MB. Max. memory is 16.1GB. [2023-08-30 16:54:37,864 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 67.1MB. Free memory was 44.8MB in the beginning and 44.8MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 16:54:37,864 INFO L158 Benchmark]: CACSL2BoogieTranslator took 434.42ms. Allocated memory was 67.1MB in the beginning and 83.9MB in the end (delta: 16.8MB). Free memory was 41.4MB in the beginning and 50.7MB in the end (delta: -9.3MB). Peak memory consumption was 14.4MB. Max. memory is 16.1GB. [2023-08-30 16:54:37,864 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.12ms. Allocated memory is still 83.9MB. Free memory was 50.7MB in the beginning and 48.1MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-08-30 16:54:37,864 INFO L158 Benchmark]: Boogie Preprocessor took 34.72ms. Allocated memory is still 83.9MB. Free memory was 48.1MB in the beginning and 46.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 16:54:37,865 INFO L158 Benchmark]: RCFGBuilder took 757.01ms. Allocated memory is still 83.9MB. Free memory was 46.0MB in the beginning and 52.0MB in the end (delta: -6.0MB). Peak memory consumption was 21.7MB. Max. memory is 16.1GB. [2023-08-30 16:54:37,866 INFO L158 Benchmark]: TraceAbstraction took 16475.65ms. Allocated memory was 83.9MB in the beginning and 801.1MB in the end (delta: 717.2MB). Free memory was 51.4MB in the beginning and 659.8MB in the end (delta: -608.4MB). Peak memory consumption was 108.4MB. Max. memory is 16.1GB. [2023-08-30 16:54:37,866 INFO L158 Benchmark]: Witness Printer took 71.06ms. Allocated memory is still 801.1MB. Free memory was 659.8MB in the beginning and 644.1MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-08-30 16:54:37,868 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 67.1MB. Free memory was 44.8MB in the beginning and 44.8MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 434.42ms. Allocated memory was 67.1MB in the beginning and 83.9MB in the end (delta: 16.8MB). Free memory was 41.4MB in the beginning and 50.7MB in the end (delta: -9.3MB). Peak memory consumption was 14.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.12ms. Allocated memory is still 83.9MB. Free memory was 50.7MB in the beginning and 48.1MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.72ms. Allocated memory is still 83.9MB. Free memory was 48.1MB in the beginning and 46.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 757.01ms. Allocated memory is still 83.9MB. Free memory was 46.0MB in the beginning and 52.0MB in the end (delta: -6.0MB). Peak memory consumption was 21.7MB. Max. memory is 16.1GB. * TraceAbstraction took 16475.65ms. Allocated memory was 83.9MB in the beginning and 801.1MB in the end (delta: 717.2MB). Free memory was 51.4MB in the beginning and 659.8MB in the end (delta: -608.4MB). Peak memory consumption was 108.4MB. Max. memory is 16.1GB. * Witness Printer took 71.06ms. Allocated memory is still 801.1MB. Free memory was 659.8MB in the beginning and 644.1MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.3s, 132 PlacesBefore, 33 PlacesAfterwards, 124 TransitionsBefore, 23 TransitionsAfterwards, 1920 CoEnabledTransitionPairs, 7 FixpointIterations, 57 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 2 ChoiceCompositions, 113 TotalNumberOfCompositions, 5724 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1992, independent: 1779, independent conditional: 0, independent unconditional: 1779, dependent: 213, dependent conditional: 0, dependent unconditional: 213, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1069, independent: 1022, independent conditional: 0, independent unconditional: 1022, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1992, independent: 757, independent conditional: 0, independent unconditional: 757, dependent: 166, dependent conditional: 0, dependent unconditional: 166, unknown: 1069, unknown conditional: 0, unknown unconditional: 1069] , Statistics on independence cache: Total cache size (in pairs): 97, Positive cache size: 71, Positive conditional cache size: 0, Positive unconditional cache size: 71, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - 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_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L714] 0 _Bool __unbuffered_p1_EAX$flush_delayed; [L715] 0 int __unbuffered_p1_EAX$mem_tmp; [L716] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd0; [L717] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd1; [L718] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd2; [L719] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd3; [L720] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd0; [L721] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd1; [L722] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd2; [L723] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd3; [L724] 0 _Bool __unbuffered_p1_EAX$read_delayed; [L725] 0 int *__unbuffered_p1_EAX$read_delayed_var; [L726] 0 int __unbuffered_p1_EAX$w_buff0; [L727] 0 _Bool __unbuffered_p1_EAX$w_buff0_used; [L728] 0 int __unbuffered_p1_EAX$w_buff1; [L729] 0 _Bool __unbuffered_p1_EAX$w_buff1_used; [L731] 0 int __unbuffered_p2_EAX = 0; [L732] 0 _Bool main$tmp_guard0; [L733] 0 _Bool main$tmp_guard1; [L735] 0 int x = 0; [L736] 0 _Bool x$flush_delayed; [L737] 0 int x$mem_tmp; [L738] 0 _Bool x$r_buff0_thd0; [L739] 0 _Bool x$r_buff0_thd1; [L740] 0 _Bool x$r_buff0_thd2; [L741] 0 _Bool x$r_buff0_thd3; [L742] 0 _Bool x$r_buff1_thd0; [L743] 0 _Bool x$r_buff1_thd1; [L744] 0 _Bool x$r_buff1_thd2; [L745] 0 _Bool x$r_buff1_thd3; [L746] 0 _Bool x$read_delayed; [L747] 0 int *x$read_delayed_var; [L748] 0 int x$w_buff0; [L749] 0 _Bool x$w_buff0_used; [L750] 0 int x$w_buff1; [L751] 0 _Bool x$w_buff1_used; [L753] 0 int y = 0; [L754] 0 _Bool weak$$choice0; [L755] 0 _Bool weak$$choice1; [L756] 0 _Bool weak$$choice2; [L853] 0 pthread_t t1780; [L854] FCALL, FORK 0 pthread_create(&t1780, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1780, ((void *)0), P0, ((void *)0))=8, t1780={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L855] 0 pthread_t t1781; [L856] FCALL, FORK 0 pthread_create(&t1781, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1781, ((void *)0), P1, ((void *)0))=9, t1780={7:0}, t1781={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L789] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L790] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L791] 2 x$flush_delayed = weak$$choice2 [L792] EXPR 2 \read(x) [L792] 2 x$mem_tmp = x [L793] 2 weak$$choice1 = __VERIFIER_nondet_bool() [L794] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L794] EXPR 2 \read(x) [L794] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L794] 2 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L795] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)))) [L796] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)))) [L797] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : weak$$choice0)))) [L798] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L799] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L800] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$r_buff1_thd2 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L801] 2 __unbuffered_p1_EAX$read_delayed = (_Bool)1 [L802] 2 __unbuffered_p1_EAX$read_delayed_var = &x [L803] EXPR 2 \read(x) [L803] 2 __unbuffered_p1_EAX = x [L804] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L804] 2 x = x$flush_delayed ? x$mem_tmp : x [L805] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L808] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L811] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L811] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L811] EXPR 2 \read(x) [L811] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L811] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L811] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L812] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L813] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L814] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L815] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L857] 0 pthread_t t1782; [L858] FCALL, FORK 0 pthread_create(&t1782, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1782, ((void *)0), P2, ((void *)0))=10, t1780={7:0}, t1781={5:0}, t1782={6:0}, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L825] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L828] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L760] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L831] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L831] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L831] EXPR 3 \read(x) [L831] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L831] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L831] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L832] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L833] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L834] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L835] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L763] 1 x$w_buff1 = x$w_buff0 [L764] 1 x$w_buff0 = 1 [L765] 1 x$w_buff1_used = x$w_buff0_used [L766] 1 x$w_buff0_used = (_Bool)1 [L767] CALL 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L767] RET 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L768] 1 x$r_buff1_thd0 = x$r_buff0_thd0 [L769] 1 x$r_buff1_thd1 = x$r_buff0_thd1 [L770] 1 x$r_buff1_thd2 = x$r_buff0_thd2 [L771] 1 x$r_buff1_thd3 = x$r_buff0_thd3 [L772] 1 x$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L775] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L775] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L776] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L777] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L778] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L779] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L818] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 2 return 0; [L838] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L840] 3 return 0; [L782] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L784] 1 return 0; [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L862] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L862] RET 0 assume_abort_if_not(main$tmp_guard0) [L864] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L864] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L864] EXPR 0 \read(x) [L864] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L864] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L864] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L865] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L866] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L867] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L868] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1780={7:0}, t1781={5:0}, t1782={6:0}, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L871] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L872] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L872] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L872] EXPR 0 \read(*__unbuffered_p1_EAX$read_delayed_var) [L872] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L872] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L872] 0 __unbuffered_p1_EAX = __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L873] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1) [L875] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 858]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 856]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 154 locations, 6 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: 16.3s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 809 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 602 mSDsluCounter, 530 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 437 mSDsCounter, 178 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1912 IncrementalHoareTripleChecker+Invalid, 2090 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 178 mSolverCounterUnsat, 93 mSDtfsCounter, 1912 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 61 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=279occurred in iteration=12, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.8s InterpolantComputationTime, 201 NumberOfCodeBlocks, 201 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 167 ConstructedInterpolants, 0 QuantifiedInterpolants, 2154 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-30 16:54:37,892 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, 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