/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix002.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-27 18:02:46,243 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-27 18:02:46,245 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-27 18:02:46,284 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-27 18:02:46,285 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-27 18:02:46,288 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-27 18:02:46,290 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-27 18:02:46,293 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-27 18:02:46,294 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-27 18:02:46,299 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-27 18:02:46,300 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-27 18:02:46,301 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-27 18:02:46,302 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-27 18:02:46,304 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-27 18:02:46,306 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-27 18:02:46,307 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-27 18:02:46,307 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-27 18:02:46,308 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-27 18:02:46,311 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-27 18:02:46,316 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-27 18:02:46,317 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-27 18:02:46,318 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-27 18:02:46,319 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-27 18:02:46,320 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-27 18:02:46,328 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-27 18:02:46,328 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-27 18:02:46,328 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-27 18:02:46,330 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-27 18:02:46,330 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-27 18:02:46,331 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-27 18:02:46,331 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-27 18:02:46,331 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-27 18:02:46,333 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-27 18:02:46,333 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-27 18:02:46,334 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-27 18:02:46,334 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-27 18:02:46,334 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-27 18:02:46,335 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-27 18:02:46,335 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-27 18:02:46,335 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-27 18:02:46,336 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-27 18:02:46,337 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-01-27 18:02:46,364 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-27 18:02:46,364 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-27 18:02:46,365 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-27 18:02:46,365 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-27 18:02:46,366 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-27 18:02:46,366 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-27 18:02:46,366 INFO L138 SettingsManager]: * Use SBE=true [2023-01-27 18:02:46,366 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-27 18:02:46,366 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-27 18:02:46,367 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-27 18:02:46,367 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-27 18:02:46,367 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-27 18:02:46,368 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-27 18:02:46,368 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-27 18:02:46,368 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-27 18:02:46,368 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-27 18:02:46,368 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-27 18:02:46,368 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-27 18:02:46,368 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-27 18:02:46,369 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-27 18:02:46,369 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-27 18:02:46,369 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-27 18:02:46,369 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-27 18:02:46,369 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 18:02:46,369 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-27 18:02:46,369 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-27 18:02:46,369 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-27 18:02:46,370 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-27 18:02:46,370 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-27 18:02:46,370 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-27 18:02:46,370 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-27 18:02:46,370 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC 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 [2023-01-27 18:02:46,622 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-27 18:02:46,653 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-27 18:02:46,656 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-27 18:02:46,657 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-27 18:02:46,657 INFO L275 PluginConnector]: CDTParser initialized [2023-01-27 18:02:46,658 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix002.opt.i [2023-01-27 18:02:47,859 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-27 18:02:48,142 INFO L351 CDTParser]: Found 1 translation units. [2023-01-27 18:02:48,143 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix002.opt.i [2023-01-27 18:02:48,158 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9f5e1c8d/d44fc31df4e949938a7ec49be220865e/FLAG8f9a03c7a [2023-01-27 18:02:48,174 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9f5e1c8d/d44fc31df4e949938a7ec49be220865e [2023-01-27 18:02:48,177 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-27 18:02:48,178 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-27 18:02:48,179 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-27 18:02:48,179 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-27 18:02:48,183 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-27 18:02:48,183 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 06:02:48" (1/1) ... [2023-01-27 18:02:48,184 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c34689f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:02:48, skipping insertion in model container [2023-01-27 18:02:48,185 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 06:02:48" (1/1) ... [2023-01-27 18:02:48,191 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-27 18:02:48,227 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-27 18:02:48,353 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/mix002.opt.i[944,957] [2023-01-27 18:02:48,537 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 18:02:48,553 INFO L203 MainTranslator]: Completed pre-run [2023-01-27 18:02:48,569 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/mix002.opt.i[944,957] [2023-01-27 18:02:48,628 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 18:02:48,658 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-27 18:02:48,658 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-27 18:02:48,665 INFO L208 MainTranslator]: Completed translation [2023-01-27 18:02:48,665 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:02:48 WrapperNode [2023-01-27 18:02:48,665 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-27 18:02:48,667 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-27 18:02:48,667 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-27 18:02:48,667 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-27 18:02:48,673 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:02:48" (1/1) ... [2023-01-27 18:02:48,704 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:02:48" (1/1) ... [2023-01-27 18:02:48,752 INFO L138 Inliner]: procedures = 176, calls = 62, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 153 [2023-01-27 18:02:48,753 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-27 18:02:48,753 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-27 18:02:48,754 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-27 18:02:48,754 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-27 18:02:48,763 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:02:48" (1/1) ... [2023-01-27 18:02:48,763 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:02:48" (1/1) ... [2023-01-27 18:02:48,778 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:02:48" (1/1) ... [2023-01-27 18:02:48,779 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:02:48" (1/1) ... [2023-01-27 18:02:48,786 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:02:48" (1/1) ... [2023-01-27 18:02:48,788 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:02:48" (1/1) ... [2023-01-27 18:02:48,804 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:02:48" (1/1) ... [2023-01-27 18:02:48,806 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:02:48" (1/1) ... [2023-01-27 18:02:48,809 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-27 18:02:48,810 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-27 18:02:48,810 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-27 18:02:48,810 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-27 18:02:48,811 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:02:48" (1/1) ... [2023-01-27 18:02:48,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 18:02:48,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 18:02:48,862 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-01-27 18:02:48,883 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-01-27 18:02:48,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-27 18:02:48,900 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-27 18:02:48,900 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-27 18:02:48,900 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-27 18:02:48,900 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-27 18:02:48,900 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-01-27 18:02:48,900 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-01-27 18:02:48,902 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-01-27 18:02:48,902 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-01-27 18:02:48,902 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-01-27 18:02:48,903 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-01-27 18:02:48,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-27 18:02:48,903 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-27 18:02:48,903 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-27 18:02:48,903 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-27 18:02:48,904 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-01-27 18:02:49,055 INFO L236 CfgBuilder]: Building ICFG [2023-01-27 18:02:49,057 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-27 18:02:49,387 INFO L277 CfgBuilder]: Performing block encoding [2023-01-27 18:02:49,576 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-27 18:02:49,577 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-01-27 18:02:49,579 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 06:02:49 BoogieIcfgContainer [2023-01-27 18:02:49,579 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-27 18:02:49,583 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-27 18:02:49,583 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-27 18:02:49,586 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-27 18:02:49,586 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 06:02:48" (1/3) ... [2023-01-27 18:02:49,587 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@263f26f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 06:02:49, skipping insertion in model container [2023-01-27 18:02:49,587 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:02:48" (2/3) ... [2023-01-27 18:02:49,587 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@263f26f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 06:02:49, skipping insertion in model container [2023-01-27 18:02:49,587 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 06:02:49" (3/3) ... [2023-01-27 18:02:49,589 INFO L112 eAbstractionObserver]: Analyzing ICFG mix002.opt.i [2023-01-27 18:02:49,606 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-27 18:02:49,607 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-01-27 18:02:49,607 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-27 18:02:49,687 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-27 18:02:49,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 115 transitions, 245 flow [2023-01-27 18:02:49,790 INFO L130 PetriNetUnfolder]: 2/112 cut-off events. [2023-01-27 18:02:49,791 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:02:49,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 112 events. 2/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 61 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 71. Up to 2 conditions per place. [2023-01-27 18:02:49,798 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 115 transitions, 245 flow [2023-01-27 18:02:49,802 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 120 places, 112 transitions, 233 flow [2023-01-27 18:02:49,804 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-27 18:02:49,818 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 120 places, 112 transitions, 233 flow [2023-01-27 18:02:49,820 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 120 places, 112 transitions, 233 flow [2023-01-27 18:02:49,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 112 transitions, 233 flow [2023-01-27 18:02:49,844 INFO L130 PetriNetUnfolder]: 2/112 cut-off events. [2023-01-27 18:02:49,845 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:02:49,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 112 events. 2/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 61 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 71. Up to 2 conditions per place. [2023-01-27 18:02:49,847 INFO L119 LiptonReduction]: Number of co-enabled transitions 2096 [2023-01-27 18:02:53,712 INFO L134 LiptonReduction]: Checked pairs total: 5803 [2023-01-27 18:02:53,712 INFO L136 LiptonReduction]: Total number of compositions: 101 [2023-01-27 18:02:53,735 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-27 18:02:53,747 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=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;@547952b0, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-27 18:02:53,747 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-01-27 18:02:53,755 INFO L130 PetriNetUnfolder]: 0/14 cut-off events. [2023-01-27 18:02:53,755 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:02:53,755 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:02:53,757 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:02:53,758 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:02:53,762 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:02:53,763 INFO L85 PathProgramCache]: Analyzing trace with hash -420123915, now seen corresponding path program 1 times [2023-01-27 18:02:53,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:02:53,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414531798] [2023-01-27 18:02:53,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:02:53,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:02:53,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:02:54,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:02:54,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:02:54,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414531798] [2023-01-27 18:02:54,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414531798] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:02:54,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:02:54,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-27 18:02:54,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021612403] [2023-01-27 18:02:54,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:02:54,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-27 18:02:54,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:02:54,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-27 18:02:54,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-27 18:02:54,307 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 216 [2023-01-27 18:02:54,309 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 59 flow. Second operand has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 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-01-27 18:02:54,309 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:02:54,309 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 216 [2023-01-27 18:02:54,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:02:54,553 INFO L130 PetriNetUnfolder]: 644/1045 cut-off events. [2023-01-27 18:02:54,553 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2023-01-27 18:02:54,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2057 conditions, 1045 events. 644/1045 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 5339 event pairs, 112 based on Foata normal form. 0/979 useless extension candidates. Maximal degree in co-relation 2046. Up to 773 conditions per place. [2023-01-27 18:02:54,567 INFO L137 encePairwiseOnDemand]: 212/216 looper letters, 24 selfloop transitions, 2 changer transitions 2/32 dead transitions. [2023-01-27 18:02:54,568 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 32 transitions, 129 flow [2023-01-27 18:02:54,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 18:02:54,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 18:02:54,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 337 transitions. [2023-01-27 18:02:54,586 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5200617283950617 [2023-01-27 18:02:54,587 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 337 transitions. [2023-01-27 18:02:54,587 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 337 transitions. [2023-01-27 18:02:54,590 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:02:54,592 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 337 transitions. [2023-01-27 18:02:54,597 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 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-01-27 18:02:54,601 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 216.0) internal successors, (864), 4 states have internal predecessors, (864), 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-01-27 18:02:54,602 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 216.0) internal successors, (864), 4 states have internal predecessors, (864), 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-01-27 18:02:54,603 INFO L175 Difference]: Start difference. First operand has 34 places, 25 transitions, 59 flow. Second operand 3 states and 337 transitions. [2023-01-27 18:02:54,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 32 transitions, 129 flow [2023-01-27 18:02:54,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 32 transitions, 126 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-01-27 18:02:54,634 INFO L231 Difference]: Finished difference. Result has 32 places, 22 transitions, 54 flow [2023-01-27 18:02:54,636 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=32, PETRI_TRANSITIONS=22} [2023-01-27 18:02:54,641 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2023-01-27 18:02:54,641 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 22 transitions, 54 flow [2023-01-27 18:02:54,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 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-01-27 18:02:54,642 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:02:54,642 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:02:54,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-27 18:02:54,643 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:02:54,653 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:02:54,653 INFO L85 PathProgramCache]: Analyzing trace with hash -12109673, now seen corresponding path program 1 times [2023-01-27 18:02:54,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:02:54,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854699342] [2023-01-27 18:02:54,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:02:54,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:02:54,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:02:55,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:02:55,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:02:55,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854699342] [2023-01-27 18:02:55,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854699342] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:02:55,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:02:55,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-27 18:02:55,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975496035] [2023-01-27 18:02:55,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:02:55,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-27 18:02:55,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:02:55,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-27 18:02:55,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-27 18:02:55,079 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 216 [2023-01-27 18:02:55,080 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 22 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 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-01-27 18:02:55,080 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:02:55,080 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 216 [2023-01-27 18:02:55,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:02:55,353 INFO L130 PetriNetUnfolder]: 1375/2028 cut-off events. [2023-01-27 18:02:55,353 INFO L131 PetriNetUnfolder]: For 92/92 co-relation queries the response was YES. [2023-01-27 18:02:55,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4218 conditions, 2028 events. 1375/2028 cut-off events. For 92/92 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 8323 event pairs, 597 based on Foata normal form. 8/2036 useless extension candidates. Maximal degree in co-relation 4208. Up to 1953 conditions per place. [2023-01-27 18:02:55,369 INFO L137 encePairwiseOnDemand]: 211/216 looper letters, 30 selfloop transitions, 4 changer transitions 0/34 dead transitions. [2023-01-27 18:02:55,370 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 34 transitions, 152 flow [2023-01-27 18:02:55,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 18:02:55,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 18:02:55,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 311 transitions. [2023-01-27 18:02:55,372 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4799382716049383 [2023-01-27 18:02:55,372 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 311 transitions. [2023-01-27 18:02:55,373 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 311 transitions. [2023-01-27 18:02:55,373 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:02:55,373 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 311 transitions. [2023-01-27 18:02:55,374 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 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-01-27 18:02:55,377 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 216.0) internal successors, (864), 4 states have internal predecessors, (864), 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-01-27 18:02:55,378 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 216.0) internal successors, (864), 4 states have internal predecessors, (864), 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-01-27 18:02:55,378 INFO L175 Difference]: Start difference. First operand has 32 places, 22 transitions, 54 flow. Second operand 3 states and 311 transitions. [2023-01-27 18:02:55,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 34 transitions, 152 flow [2023-01-27 18:02:55,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 34 transitions, 146 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-27 18:02:55,381 INFO L231 Difference]: Finished difference. Result has 32 places, 25 transitions, 76 flow [2023-01-27 18:02:55,381 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=32, PETRI_TRANSITIONS=25} [2023-01-27 18:02:55,382 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2023-01-27 18:02:55,382 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 25 transitions, 76 flow [2023-01-27 18:02:55,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 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-01-27 18:02:55,382 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:02:55,383 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:02:55,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-27 18:02:55,383 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:02:55,383 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:02:55,384 INFO L85 PathProgramCache]: Analyzing trace with hash 17336372, now seen corresponding path program 1 times [2023-01-27 18:02:55,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:02:55,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115480779] [2023-01-27 18:02:55,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:02:55,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:02:55,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:02:55,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:02:55,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:02:55,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115480779] [2023-01-27 18:02:55,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115480779] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:02:55,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:02:55,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-27 18:02:55,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895002378] [2023-01-27 18:02:55,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:02:55,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 18:02:55,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:02:55,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 18:02:55,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-27 18:02:55,683 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 216 [2023-01-27 18:02:55,684 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 25 transitions, 76 flow. Second operand has 4 states, 4 states have (on average 94.75) internal successors, (379), 4 states have internal predecessors, (379), 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-01-27 18:02:55,684 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:02:55,684 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 216 [2023-01-27 18:02:55,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:02:55,925 INFO L130 PetriNetUnfolder]: 1269/1880 cut-off events. [2023-01-27 18:02:55,927 INFO L131 PetriNetUnfolder]: For 313/313 co-relation queries the response was YES. [2023-01-27 18:02:55,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4290 conditions, 1880 events. 1269/1880 cut-off events. For 313/313 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 7453 event pairs, 405 based on Foata normal form. 42/1922 useless extension candidates. Maximal degree in co-relation 4279. Up to 1316 conditions per place. [2023-01-27 18:02:55,940 INFO L137 encePairwiseOnDemand]: 213/216 looper letters, 32 selfloop transitions, 3 changer transitions 0/35 dead transitions. [2023-01-27 18:02:55,940 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 35 transitions, 170 flow [2023-01-27 18:02:55,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 18:02:55,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 18:02:55,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 309 transitions. [2023-01-27 18:02:55,942 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47685185185185186 [2023-01-27 18:02:55,942 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 309 transitions. [2023-01-27 18:02:55,942 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 309 transitions. [2023-01-27 18:02:55,942 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:02:55,942 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 309 transitions. [2023-01-27 18:02:55,944 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 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-01-27 18:02:55,945 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 216.0) internal successors, (864), 4 states have internal predecessors, (864), 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-01-27 18:02:55,945 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 216.0) internal successors, (864), 4 states have internal predecessors, (864), 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-01-27 18:02:55,946 INFO L175 Difference]: Start difference. First operand has 32 places, 25 transitions, 76 flow. Second operand 3 states and 309 transitions. [2023-01-27 18:02:55,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 35 transitions, 170 flow [2023-01-27 18:02:55,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 35 transitions, 166 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-27 18:02:55,947 INFO L231 Difference]: Finished difference. Result has 34 places, 25 transitions, 83 flow [2023-01-27 18:02:55,948 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=83, PETRI_PLACES=34, PETRI_TRANSITIONS=25} [2023-01-27 18:02:55,949 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 0 predicate places. [2023-01-27 18:02:55,951 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 25 transitions, 83 flow [2023-01-27 18:02:55,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 94.75) internal successors, (379), 4 states have internal predecessors, (379), 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-01-27 18:02:55,952 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:02:55,953 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:02:55,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-27 18:02:55,953 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:02:55,953 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:02:55,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1217666721, now seen corresponding path program 1 times [2023-01-27 18:02:55,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:02:55,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089699959] [2023-01-27 18:02:55,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:02:55,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:02:56,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:02:56,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:02:56,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:02:56,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089699959] [2023-01-27 18:02:56,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089699959] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:02:56,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:02:56,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-27 18:02:56,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214668948] [2023-01-27 18:02:56,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:02:56,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 18:02:56,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:02:56,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 18:02:56,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-27 18:02:56,228 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 216 [2023-01-27 18:02:56,229 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 83 flow. Second operand has 4 states, 4 states have (on average 94.75) internal successors, (379), 4 states have internal predecessors, (379), 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-01-27 18:02:56,229 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:02:56,229 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 216 [2023-01-27 18:02:56,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:02:56,470 INFO L130 PetriNetUnfolder]: 1167/1738 cut-off events. [2023-01-27 18:02:56,470 INFO L131 PetriNetUnfolder]: For 583/583 co-relation queries the response was YES. [2023-01-27 18:02:56,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4104 conditions, 1738 events. 1167/1738 cut-off events. For 583/583 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 6910 event pairs, 726 based on Foata normal form. 40/1778 useless extension candidates. Maximal degree in co-relation 4091. Up to 1181 conditions per place. [2023-01-27 18:02:56,480 INFO L137 encePairwiseOnDemand]: 213/216 looper letters, 37 selfloop transitions, 3 changer transitions 0/40 dead transitions. [2023-01-27 18:02:56,480 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 40 transitions, 204 flow [2023-01-27 18:02:56,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 18:02:56,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 18:02:56,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 314 transitions. [2023-01-27 18:02:56,482 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4845679012345679 [2023-01-27 18:02:56,482 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 314 transitions. [2023-01-27 18:02:56,483 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 314 transitions. [2023-01-27 18:02:56,486 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:02:56,486 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 314 transitions. [2023-01-27 18:02:56,489 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 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-01-27 18:02:56,490 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 216.0) internal successors, (864), 4 states have internal predecessors, (864), 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-01-27 18:02:56,490 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 216.0) internal successors, (864), 4 states have internal predecessors, (864), 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-01-27 18:02:56,491 INFO L175 Difference]: Start difference. First operand has 34 places, 25 transitions, 83 flow. Second operand 3 states and 314 transitions. [2023-01-27 18:02:56,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 40 transitions, 204 flow [2023-01-27 18:02:56,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 40 transitions, 196 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-27 18:02:56,494 INFO L231 Difference]: Finished difference. Result has 35 places, 25 transitions, 88 flow [2023-01-27 18:02:56,495 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=77, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=35, PETRI_TRANSITIONS=25} [2023-01-27 18:02:56,496 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 1 predicate places. [2023-01-27 18:02:56,496 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 25 transitions, 88 flow [2023-01-27 18:02:56,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 94.75) internal successors, (379), 4 states have internal predecessors, (379), 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-01-27 18:02:56,497 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:02:56,497 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:02:56,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-27 18:02:56,497 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:02:56,497 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:02:56,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1441772436, now seen corresponding path program 1 times [2023-01-27 18:02:56,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:02:56,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708775160] [2023-01-27 18:02:56,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:02:56,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:02:56,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:02:56,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:02:56,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:02:56,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708775160] [2023-01-27 18:02:56,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708775160] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:02:56,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:02:56,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-27 18:02:56,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836640883] [2023-01-27 18:02:56,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:02:56,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-27 18:02:56,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:02:56,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-27 18:02:56,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-27 18:02:56,770 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 216 [2023-01-27 18:02:56,770 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 25 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 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-01-27 18:02:56,770 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:02:56,770 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 216 [2023-01-27 18:02:56,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:02:56,920 INFO L130 PetriNetUnfolder]: 631/1022 cut-off events. [2023-01-27 18:02:56,920 INFO L131 PetriNetUnfolder]: For 255/255 co-relation queries the response was YES. [2023-01-27 18:02:56,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2344 conditions, 1022 events. 631/1022 cut-off events. For 255/255 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 4765 event pairs, 235 based on Foata normal form. 12/1027 useless extension candidates. Maximal degree in co-relation 2330. Up to 646 conditions per place. [2023-01-27 18:02:56,927 INFO L137 encePairwiseOnDemand]: 213/216 looper letters, 28 selfloop transitions, 3 changer transitions 0/35 dead transitions. [2023-01-27 18:02:56,927 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 35 transitions, 175 flow [2023-01-27 18:02:56,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 18:02:56,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 18:02:56,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 330 transitions. [2023-01-27 18:02:56,928 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5092592592592593 [2023-01-27 18:02:56,929 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 330 transitions. [2023-01-27 18:02:56,929 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 330 transitions. [2023-01-27 18:02:56,929 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:02:56,929 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 330 transitions. [2023-01-27 18:02:56,930 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 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-01-27 18:02:56,931 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 216.0) internal successors, (864), 4 states have internal predecessors, (864), 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-01-27 18:02:56,932 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 216.0) internal successors, (864), 4 states have internal predecessors, (864), 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-01-27 18:02:56,932 INFO L175 Difference]: Start difference. First operand has 35 places, 25 transitions, 88 flow. Second operand 3 states and 330 transitions. [2023-01-27 18:02:56,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 35 transitions, 175 flow [2023-01-27 18:02:56,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 35 transitions, 169 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-27 18:02:56,934 INFO L231 Difference]: Finished difference. Result has 36 places, 25 transitions, 93 flow [2023-01-27 18:02:56,934 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=93, PETRI_PLACES=36, PETRI_TRANSITIONS=25} [2023-01-27 18:02:56,936 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 2 predicate places. [2023-01-27 18:02:56,936 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 25 transitions, 93 flow [2023-01-27 18:02:56,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 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-01-27 18:02:56,937 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:02:56,937 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:02:56,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-27 18:02:56,937 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:02:56,937 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:02:56,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1891951879, now seen corresponding path program 1 times [2023-01-27 18:02:56,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:02:56,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664186139] [2023-01-27 18:02:56,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:02:56,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:02:56,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:02:57,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:02:57,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:02:57,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664186139] [2023-01-27 18:02:57,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664186139] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:02:57,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:02:57,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 18:02:57,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085685418] [2023-01-27 18:02:57,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:02:57,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 18:02:57,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:02:57,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 18:02:57,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-27 18:02:57,234 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 216 [2023-01-27 18:02:57,234 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 25 transitions, 93 flow. Second operand has 4 states, 4 states have (on average 99.25) internal successors, (397), 4 states have internal predecessors, (397), 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-01-27 18:02:57,234 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:02:57,235 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 216 [2023-01-27 18:02:57,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:02:57,432 INFO L130 PetriNetUnfolder]: 448/792 cut-off events. [2023-01-27 18:02:57,432 INFO L131 PetriNetUnfolder]: For 187/191 co-relation queries the response was YES. [2023-01-27 18:02:57,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1820 conditions, 792 events. 448/792 cut-off events. For 187/191 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 3929 event pairs, 88 based on Foata normal form. 88/863 useless extension candidates. Maximal degree in co-relation 1805. Up to 437 conditions per place. [2023-01-27 18:02:57,437 INFO L137 encePairwiseOnDemand]: 210/216 looper letters, 43 selfloop transitions, 7 changer transitions 2/58 dead transitions. [2023-01-27 18:02:57,438 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 58 transitions, 279 flow [2023-01-27 18:02:57,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 18:02:57,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 18:02:57,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 532 transitions. [2023-01-27 18:02:57,440 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4925925925925926 [2023-01-27 18:02:57,440 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 532 transitions. [2023-01-27 18:02:57,440 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 532 transitions. [2023-01-27 18:02:57,441 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:02:57,441 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 532 transitions. [2023-01-27 18:02:57,442 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 106.4) internal successors, (532), 5 states have internal predecessors, (532), 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-01-27 18:02:57,445 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 216.0) internal successors, (1296), 6 states have internal predecessors, (1296), 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-01-27 18:02:57,446 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 216.0) internal successors, (1296), 6 states have internal predecessors, (1296), 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-01-27 18:02:57,447 INFO L175 Difference]: Start difference. First operand has 36 places, 25 transitions, 93 flow. Second operand 5 states and 532 transitions. [2023-01-27 18:02:57,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 58 transitions, 279 flow [2023-01-27 18:02:57,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 58 transitions, 273 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-27 18:02:57,452 INFO L231 Difference]: Finished difference. Result has 41 places, 31 transitions, 141 flow [2023-01-27 18:02:57,452 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=141, PETRI_PLACES=41, PETRI_TRANSITIONS=31} [2023-01-27 18:02:57,454 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 7 predicate places. [2023-01-27 18:02:57,455 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 141 flow [2023-01-27 18:02:57,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 99.25) internal successors, (397), 4 states have internal predecessors, (397), 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-01-27 18:02:57,455 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:02:57,455 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:02:57,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-27 18:02:57,456 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:02:57,456 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:02:57,456 INFO L85 PathProgramCache]: Analyzing trace with hash -236407342, now seen corresponding path program 1 times [2023-01-27 18:02:57,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:02:57,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155975510] [2023-01-27 18:02:57,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:02:57,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:02:57,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:02:57,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:02:57,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:02:57,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155975510] [2023-01-27 18:02:57,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155975510] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:02:57,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:02:57,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 18:02:57,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080733195] [2023-01-27 18:02:57,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:02:57,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 18:02:57,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:02:57,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 18:02:57,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-27 18:02:57,757 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 216 [2023-01-27 18:02:57,758 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 141 flow. Second operand has 5 states, 5 states have (on average 93.4) internal successors, (467), 5 states have internal predecessors, (467), 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-01-27 18:02:57,758 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:02:57,758 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 216 [2023-01-27 18:02:57,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:02:58,126 INFO L130 PetriNetUnfolder]: 1071/1751 cut-off events. [2023-01-27 18:02:58,127 INFO L131 PetriNetUnfolder]: For 1452/1452 co-relation queries the response was YES. [2023-01-27 18:02:58,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5523 conditions, 1751 events. 1071/1751 cut-off events. For 1452/1452 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 8503 event pairs, 103 based on Foata normal form. 18/1769 useless extension candidates. Maximal degree in co-relation 5505. Up to 1059 conditions per place. [2023-01-27 18:02:58,136 INFO L137 encePairwiseOnDemand]: 209/216 looper letters, 53 selfloop transitions, 9 changer transitions 20/82 dead transitions. [2023-01-27 18:02:58,136 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 82 transitions, 510 flow [2023-01-27 18:02:58,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-27 18:02:58,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-27 18:02:58,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 607 transitions. [2023-01-27 18:02:58,138 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4683641975308642 [2023-01-27 18:02:58,139 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 607 transitions. [2023-01-27 18:02:58,139 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 607 transitions. [2023-01-27 18:02:58,139 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:02:58,139 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 607 transitions. [2023-01-27 18:02:58,140 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 101.16666666666667) internal successors, (607), 6 states have internal predecessors, (607), 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-01-27 18:02:58,142 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 216.0) internal successors, (1512), 7 states have internal predecessors, (1512), 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-01-27 18:02:58,143 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 216.0) internal successors, (1512), 7 states have internal predecessors, (1512), 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-01-27 18:02:58,143 INFO L175 Difference]: Start difference. First operand has 41 places, 31 transitions, 141 flow. Second operand 6 states and 607 transitions. [2023-01-27 18:02:58,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 82 transitions, 510 flow [2023-01-27 18:02:58,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 82 transitions, 501 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-27 18:02:58,148 INFO L231 Difference]: Finished difference. Result has 47 places, 32 transitions, 161 flow [2023-01-27 18:02:58,148 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=161, PETRI_PLACES=47, PETRI_TRANSITIONS=32} [2023-01-27 18:02:58,148 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 13 predicate places. [2023-01-27 18:02:58,149 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 32 transitions, 161 flow [2023-01-27 18:02:58,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 93.4) internal successors, (467), 5 states have internal predecessors, (467), 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-01-27 18:02:58,149 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:02:58,149 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:02:58,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-27 18:02:58,149 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:02:58,150 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:02:58,150 INFO L85 PathProgramCache]: Analyzing trace with hash -831683230, now seen corresponding path program 2 times [2023-01-27 18:02:58,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:02:58,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761515746] [2023-01-27 18:02:58,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:02:58,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:02:58,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:02:58,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:02:58,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:02:58,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761515746] [2023-01-27 18:02:58,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761515746] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:02:58,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:02:58,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 18:02:58,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89647142] [2023-01-27 18:02:58,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:02:58,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 18:02:58,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:02:58,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 18:02:58,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-27 18:02:58,485 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 216 [2023-01-27 18:02:58,486 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 32 transitions, 161 flow. Second operand has 5 states, 5 states have (on average 98.8) internal successors, (494), 5 states have internal predecessors, (494), 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-01-27 18:02:58,486 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:02:58,486 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 216 [2023-01-27 18:02:58,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:02:58,670 INFO L130 PetriNetUnfolder]: 339/661 cut-off events. [2023-01-27 18:02:58,670 INFO L131 PetriNetUnfolder]: For 508/511 co-relation queries the response was YES. [2023-01-27 18:02:58,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1987 conditions, 661 events. 339/661 cut-off events. For 508/511 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3342 event pairs, 64 based on Foata normal form. 74/715 useless extension candidates. Maximal degree in co-relation 1966. Up to 252 conditions per place. [2023-01-27 18:02:58,678 INFO L137 encePairwiseOnDemand]: 210/216 looper letters, 45 selfloop transitions, 10 changer transitions 9/72 dead transitions. [2023-01-27 18:02:58,678 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 72 transitions, 437 flow [2023-01-27 18:02:58,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-27 18:02:58,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-27 18:02:58,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 639 transitions. [2023-01-27 18:02:58,681 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4930555555555556 [2023-01-27 18:02:58,681 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 639 transitions. [2023-01-27 18:02:58,681 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 639 transitions. [2023-01-27 18:02:58,682 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:02:58,682 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 639 transitions. [2023-01-27 18:02:58,683 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 106.5) internal successors, (639), 6 states have internal predecessors, (639), 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-01-27 18:02:58,685 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 216.0) internal successors, (1512), 7 states have internal predecessors, (1512), 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-01-27 18:02:58,686 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 216.0) internal successors, (1512), 7 states have internal predecessors, (1512), 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-01-27 18:02:58,686 INFO L175 Difference]: Start difference. First operand has 47 places, 32 transitions, 161 flow. Second operand 6 states and 639 transitions. [2023-01-27 18:02:58,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 72 transitions, 437 flow [2023-01-27 18:02:58,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 72 transitions, 429 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-01-27 18:02:58,692 INFO L231 Difference]: Finished difference. Result has 51 places, 38 transitions, 233 flow [2023-01-27 18:02:58,692 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=233, PETRI_PLACES=51, PETRI_TRANSITIONS=38} [2023-01-27 18:02:58,694 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 17 predicate places. [2023-01-27 18:02:58,694 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 38 transitions, 233 flow [2023-01-27 18:02:58,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 98.8) internal successors, (494), 5 states have internal predecessors, (494), 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-01-27 18:02:58,695 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:02:58,695 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-01-27 18:02:58,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-01-27 18:02:58,695 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:02:58,695 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:02:58,696 INFO L85 PathProgramCache]: Analyzing trace with hash -406954638, now seen corresponding path program 1 times [2023-01-27 18:02:58,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:02:58,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662007333] [2023-01-27 18:02:58,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:02:58,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:02:58,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:02:59,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:02:59,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:02:59,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662007333] [2023-01-27 18:02:59,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662007333] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:02:59,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:02:59,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-27 18:02:59,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115389855] [2023-01-27 18:02:59,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:02:59,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-27 18:02:59,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:02:59,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-27 18:02:59,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-01-27 18:02:59,026 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 216 [2023-01-27 18:02:59,027 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 38 transitions, 233 flow. Second operand has 6 states, 6 states have (on average 98.66666666666667) internal successors, (592), 6 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-01-27 18:02:59,027 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:02:59,027 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 216 [2023-01-27 18:02:59,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:02:59,238 INFO L130 PetriNetUnfolder]: 296/593 cut-off events. [2023-01-27 18:02:59,239 INFO L131 PetriNetUnfolder]: For 790/792 co-relation queries the response was YES. [2023-01-27 18:02:59,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2073 conditions, 593 events. 296/593 cut-off events. For 790/792 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3012 event pairs, 59 based on Foata normal form. 21/594 useless extension candidates. Maximal degree in co-relation 2049. Up to 225 conditions per place. [2023-01-27 18:02:59,242 INFO L137 encePairwiseOnDemand]: 210/216 looper letters, 34 selfloop transitions, 11 changer transitions 22/72 dead transitions. [2023-01-27 18:02:59,242 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 72 transitions, 483 flow [2023-01-27 18:02:59,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-27 18:02:59,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-01-27 18:02:59,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 831 transitions. [2023-01-27 18:02:59,245 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4809027777777778 [2023-01-27 18:02:59,245 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 831 transitions. [2023-01-27 18:02:59,245 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 831 transitions. [2023-01-27 18:02:59,246 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:02:59,246 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 831 transitions. [2023-01-27 18:02:59,247 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 103.875) internal successors, (831), 8 states have internal predecessors, (831), 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-01-27 18:02:59,250 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 216.0) internal successors, (1944), 9 states have internal predecessors, (1944), 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-01-27 18:02:59,250 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 216.0) internal successors, (1944), 9 states have internal predecessors, (1944), 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-01-27 18:02:59,250 INFO L175 Difference]: Start difference. First operand has 51 places, 38 transitions, 233 flow. Second operand 8 states and 831 transitions. [2023-01-27 18:02:59,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 72 transitions, 483 flow [2023-01-27 18:02:59,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 72 transitions, 434 flow, removed 15 selfloop flow, removed 4 redundant places. [2023-01-27 18:02:59,259 INFO L231 Difference]: Finished difference. Result has 57 places, 31 transitions, 182 flow [2023-01-27 18:02:59,259 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=182, PETRI_PLACES=57, PETRI_TRANSITIONS=31} [2023-01-27 18:02:59,260 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 23 predicate places. [2023-01-27 18:02:59,260 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 31 transitions, 182 flow [2023-01-27 18:02:59,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 98.66666666666667) internal successors, (592), 6 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-01-27 18:02:59,260 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:02:59,261 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:02:59,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-27 18:02:59,261 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:02:59,261 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:02:59,261 INFO L85 PathProgramCache]: Analyzing trace with hash 464481527, now seen corresponding path program 1 times [2023-01-27 18:02:59,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:02:59,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840758822] [2023-01-27 18:02:59,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:02:59,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:02:59,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:02:59,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:02:59,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:02:59,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840758822] [2023-01-27 18:02:59,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840758822] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:02:59,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:02:59,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 18:02:59,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689165584] [2023-01-27 18:02:59,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:02:59,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 18:02:59,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:02:59,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 18:02:59,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-27 18:02:59,573 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 216 [2023-01-27 18:02:59,574 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 31 transitions, 182 flow. Second operand has 4 states, 4 states have (on average 102.75) internal successors, (411), 4 states have internal predecessors, (411), 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-01-27 18:02:59,574 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:02:59,574 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 216 [2023-01-27 18:02:59,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:02:59,707 INFO L130 PetriNetUnfolder]: 239/526 cut-off events. [2023-01-27 18:02:59,708 INFO L131 PetriNetUnfolder]: For 931/932 co-relation queries the response was YES. [2023-01-27 18:02:59,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1776 conditions, 526 events. 239/526 cut-off events. For 931/932 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2706 event pairs, 65 based on Foata normal form. 1/520 useless extension candidates. Maximal degree in co-relation 1757. Up to 277 conditions per place. [2023-01-27 18:02:59,711 INFO L137 encePairwiseOnDemand]: 213/216 looper letters, 26 selfloop transitions, 1 changer transitions 31/61 dead transitions. [2023-01-27 18:02:59,711 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 61 transitions, 486 flow [2023-01-27 18:02:59,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-27 18:02:59,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-27 18:02:59,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 433 transitions. [2023-01-27 18:02:59,713 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5011574074074074 [2023-01-27 18:02:59,713 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 433 transitions. [2023-01-27 18:02:59,713 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 433 transitions. [2023-01-27 18:02:59,713 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:02:59,713 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 433 transitions. [2023-01-27 18:02:59,714 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 108.25) internal successors, (433), 4 states have internal predecessors, (433), 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-01-27 18:02:59,716 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 216.0) internal successors, (1080), 5 states have internal predecessors, (1080), 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-01-27 18:02:59,717 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 216.0) internal successors, (1080), 5 states have internal predecessors, (1080), 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-01-27 18:02:59,717 INFO L175 Difference]: Start difference. First operand has 57 places, 31 transitions, 182 flow. Second operand 4 states and 433 transitions. [2023-01-27 18:02:59,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 61 transitions, 486 flow [2023-01-27 18:02:59,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 61 transitions, 384 flow, removed 29 selfloop flow, removed 9 redundant places. [2023-01-27 18:02:59,724 INFO L231 Difference]: Finished difference. Result has 48 places, 28 transitions, 124 flow [2023-01-27 18:02:59,725 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=124, PETRI_PLACES=48, PETRI_TRANSITIONS=28} [2023-01-27 18:02:59,725 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 14 predicate places. [2023-01-27 18:02:59,725 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 28 transitions, 124 flow [2023-01-27 18:02:59,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 102.75) internal successors, (411), 4 states have internal predecessors, (411), 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-01-27 18:02:59,726 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:02:59,726 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:02:59,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-01-27 18:02:59,726 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:02:59,726 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:02:59,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1166520171, now seen corresponding path program 2 times [2023-01-27 18:02:59,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:02:59,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989553108] [2023-01-27 18:02:59,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:02:59,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:02:59,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:03:01,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:03:01,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:03:01,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989553108] [2023-01-27 18:03:01,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989553108] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:03:01,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:03:01,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-27 18:03:01,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762729051] [2023-01-27 18:03:01,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:03:01,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-01-27 18:03:01,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:03:01,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-01-27 18:03:01,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-01-27 18:03:01,070 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 216 [2023-01-27 18:03:01,071 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 28 transitions, 124 flow. Second operand has 8 states, 8 states have (on average 93.25) internal successors, (746), 8 states have internal predecessors, (746), 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-01-27 18:03:01,071 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:03:01,071 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 216 [2023-01-27 18:03:01,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:03:01,202 INFO L130 PetriNetUnfolder]: 68/170 cut-off events. [2023-01-27 18:03:01,202 INFO L131 PetriNetUnfolder]: For 223/223 co-relation queries the response was YES. [2023-01-27 18:03:01,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 544 conditions, 170 events. 68/170 cut-off events. For 223/223 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 614 event pairs, 13 based on Foata normal form. 1/167 useless extension candidates. Maximal degree in co-relation 529. Up to 65 conditions per place. [2023-01-27 18:03:01,203 INFO L137 encePairwiseOnDemand]: 210/216 looper letters, 24 selfloop transitions, 4 changer transitions 17/49 dead transitions. [2023-01-27 18:03:01,203 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 49 transitions, 325 flow [2023-01-27 18:03:01,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 18:03:01,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 18:03:01,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 669 transitions. [2023-01-27 18:03:01,205 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44246031746031744 [2023-01-27 18:03:01,206 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 669 transitions. [2023-01-27 18:03:01,206 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 669 transitions. [2023-01-27 18:03:01,206 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:03:01,206 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 669 transitions. [2023-01-27 18:03:01,207 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 95.57142857142857) internal successors, (669), 7 states have internal predecessors, (669), 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-01-27 18:03:01,209 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 216.0) internal successors, (1728), 8 states have internal predecessors, (1728), 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-01-27 18:03:01,210 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 216.0) internal successors, (1728), 8 states have internal predecessors, (1728), 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-01-27 18:03:01,210 INFO L175 Difference]: Start difference. First operand has 48 places, 28 transitions, 124 flow. Second operand 7 states and 669 transitions. [2023-01-27 18:03:01,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 49 transitions, 325 flow [2023-01-27 18:03:01,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 49 transitions, 312 flow, removed 3 selfloop flow, removed 4 redundant places. [2023-01-27 18:03:01,212 INFO L231 Difference]: Finished difference. Result has 49 places, 28 transitions, 130 flow [2023-01-27 18:03:01,212 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=130, PETRI_PLACES=49, PETRI_TRANSITIONS=28} [2023-01-27 18:03:01,213 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 15 predicate places. [2023-01-27 18:03:01,213 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 28 transitions, 130 flow [2023-01-27 18:03:01,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 93.25) internal successors, (746), 8 states have internal predecessors, (746), 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-01-27 18:03:01,213 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:03:01,213 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:03:01,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-01-27 18:03:01,214 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:03:01,214 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:03:01,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1923569367, now seen corresponding path program 3 times [2023-01-27 18:03:01,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:03:01,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488580072] [2023-01-27 18:03:01,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:03:01,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:03:01,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-27 18:03:01,259 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-27 18:03:01,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-27 18:03:01,328 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-27 18:03:01,328 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-27 18:03:01,329 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-01-27 18:03:01,330 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-01-27 18:03:01,331 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-01-27 18:03:01,331 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-01-27 18:03:01,331 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-01-27 18:03:01,331 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-01-27 18:03:01,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-01-27 18:03:01,331 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:03:01,336 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-27 18:03:01,336 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-27 18:03:01,420 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.01 06:03:01 BasicIcfg [2023-01-27 18:03:01,420 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-27 18:03:01,420 INFO L158 Benchmark]: Toolchain (without parser) took 13241.98ms. Allocated memory was 348.1MB in the beginning and 503.3MB in the end (delta: 155.2MB). Free memory was 306.4MB in the beginning and 357.0MB in the end (delta: -50.6MB). Peak memory consumption was 105.9MB. Max. memory is 16.0GB. [2023-01-27 18:03:01,421 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 255.9MB. Free memory is still 213.5MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-27 18:03:01,421 INFO L158 Benchmark]: CACSL2BoogieTranslator took 486.28ms. Allocated memory is still 348.1MB. Free memory was 306.1MB in the beginning and 282.3MB in the end (delta: 23.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-01-27 18:03:01,421 INFO L158 Benchmark]: Boogie Procedure Inliner took 86.22ms. Allocated memory is still 348.1MB. Free memory was 282.3MB in the beginning and 279.4MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-27 18:03:01,421 INFO L158 Benchmark]: Boogie Preprocessor took 55.92ms. Allocated memory is still 348.1MB. Free memory was 279.4MB in the beginning and 277.6MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-27 18:03:01,422 INFO L158 Benchmark]: RCFGBuilder took 769.16ms. Allocated memory is still 348.1MB. Free memory was 277.6MB in the beginning and 296.3MB in the end (delta: -18.8MB). Peak memory consumption was 20.8MB. Max. memory is 16.0GB. [2023-01-27 18:03:01,422 INFO L158 Benchmark]: TraceAbstraction took 11837.12ms. Allocated memory was 348.1MB in the beginning and 503.3MB in the end (delta: 155.2MB). Free memory was 295.6MB in the beginning and 357.0MB in the end (delta: -61.4MB). Peak memory consumption was 93.5MB. Max. memory is 16.0GB. [2023-01-27 18:03:01,423 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.13ms. Allocated memory is still 255.9MB. Free memory is still 213.5MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 486.28ms. Allocated memory is still 348.1MB. Free memory was 306.1MB in the beginning and 282.3MB in the end (delta: 23.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 86.22ms. Allocated memory is still 348.1MB. Free memory was 282.3MB in the beginning and 279.4MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 55.92ms. Allocated memory is still 348.1MB. Free memory was 279.4MB in the beginning and 277.6MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 769.16ms. Allocated memory is still 348.1MB. Free memory was 277.6MB in the beginning and 296.3MB in the end (delta: -18.8MB). Peak memory consumption was 20.8MB. Max. memory is 16.0GB. * TraceAbstraction took 11837.12ms. Allocated memory was 348.1MB in the beginning and 503.3MB in the end (delta: 155.2MB). Free memory was 295.6MB in the beginning and 357.0MB in the end (delta: -61.4MB). Peak memory consumption was 93.5MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.9s, 120 PlacesBefore, 34 PlacesAfterwards, 112 TransitionsBefore, 25 TransitionsAfterwards, 2096 CoEnabledTransitionPairs, 7 FixpointIterations, 43 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 1 ChoiceCompositions, 101 TotalNumberOfCompositions, 5803 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2993, independent: 2794, independent conditional: 0, independent unconditional: 2794, dependent: 199, dependent conditional: 0, dependent unconditional: 199, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1246, independent: 1205, independent conditional: 0, independent unconditional: 1205, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2993, independent: 1589, independent conditional: 0, independent unconditional: 1589, dependent: 158, dependent conditional: 0, dependent unconditional: 158, unknown: 1246, unknown conditional: 0, unknown unconditional: 1246] , Statistics on independence cache: Total cache size (in pairs): 111, Positive cache size: 97, Positive conditional cache size: 0, Positive unconditional cache size: 97, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14, 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_p0_EBX = 0; [L715] 0 int __unbuffered_p1_EAX = 0; [L717] 0 int __unbuffered_p1_EBX = 0; [L719] 0 int __unbuffered_p2_EAX = 0; [L721] 0 int __unbuffered_p2_EBX = 0; [L723] 0 int a = 0; [L724] 0 _Bool main$tmp_guard0; [L725] 0 _Bool main$tmp_guard1; [L727] 0 int x = 0; [L729] 0 int y = 0; [L731] 0 int z = 0; [L732] 0 _Bool z$flush_delayed; [L733] 0 int z$mem_tmp; [L734] 0 _Bool z$r_buff0_thd0; [L735] 0 _Bool z$r_buff0_thd1; [L736] 0 _Bool z$r_buff0_thd2; [L737] 0 _Bool z$r_buff0_thd3; [L738] 0 _Bool z$r_buff1_thd0; [L739] 0 _Bool z$r_buff1_thd1; [L740] 0 _Bool z$r_buff1_thd2; [L741] 0 _Bool z$r_buff1_thd3; [L742] 0 _Bool z$read_delayed; [L743] 0 int *z$read_delayed_var; [L744] 0 int z$w_buff0; [L745] 0 _Bool z$w_buff0_used; [L746] 0 int z$w_buff1; [L747] 0 _Bool z$w_buff1_used; [L748] 0 _Bool weak$$choice0; [L749] 0 _Bool weak$$choice2; [L858] 0 pthread_t t41; [L859] FCALL, FORK 0 pthread_create(&t41, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t41, ((void *)0), P0, ((void *)0))=-2, t41={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L860] 0 pthread_t t42; [L861] FCALL, FORK 0 pthread_create(&t42, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t42, ((void *)0), P1, ((void *)0))=-1, t41={5:0}, t42={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L862] 0 pthread_t t43; [L863] FCALL, FORK 0 pthread_create(&t43, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t43, ((void *)0), P2, ((void *)0))=0, t41={5:0}, t42={6:0}, t43={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L805] 3 z$w_buff1 = z$w_buff0 [L806] 3 z$w_buff0 = 1 [L807] 3 z$w_buff1_used = z$w_buff0_used [L808] 3 z$w_buff0_used = (_Bool)1 [L809] CALL 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L809] RET 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L810] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L811] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L812] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L813] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L814] 3 z$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L817] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L818] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L819] 3 z$flush_delayed = weak$$choice2 [L820] 3 z$mem_tmp = z [L821] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L822] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L823] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L824] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L825] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L826] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L827] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L828] 3 __unbuffered_p2_EAX = z [L829] 3 z = z$flush_delayed ? z$mem_tmp : z [L830] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L833] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L753] 1 a = 1 [L756] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L759] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L762] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L774] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L777] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L780] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L781] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L782] 2 z$flush_delayed = weak$$choice2 [L783] 2 z$mem_tmp = z [L784] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L785] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L786] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L787] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L788] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L789] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L790] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L791] 2 __unbuffered_p1_EBX = z [L792] 2 z = z$flush_delayed ? z$mem_tmp : z [L793] 2 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L836] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L837] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L838] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L839] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L840] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L843] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L845] 3 return 0; [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 1 return 0; [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L800] 2 return 0; [L865] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L867] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L867] RET 0 assume_abort_if_not(main$tmp_guard0) [L869] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L870] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L871] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L872] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L873] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t41={5:0}, t42={6:0}, t43={3:0}, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L876] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L878] 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=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 863]: 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: 861]: 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: 859]: 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, 144 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: 11.6s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 189 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 189 mSDsluCounter, 33 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 795 IncrementalHoareTripleChecker+Invalid, 808 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 20 mSDtfsCounter, 795 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=233occurred in iteration=8, InterpolantAutomatonStates: 51, 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, 3.9s InterpolantComputationTime, 185 NumberOfCodeBlocks, 185 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 152 ConstructedInterpolants, 0 QuantifiedInterpolants, 1059 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-01-27 18:03:01,445 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...