/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 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix046.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-28 00:42:35,132 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-28 00:42:35,134 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-28 00:42:35,163 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-28 00:42:35,164 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-28 00:42:35,166 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-28 00:42:35,169 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-28 00:42:35,171 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-28 00:42:35,172 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-28 00:42:35,176 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-28 00:42:35,177 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-28 00:42:35,178 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-28 00:42:35,178 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-28 00:42:35,180 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-28 00:42:35,181 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-28 00:42:35,181 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-28 00:42:35,182 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-28 00:42:35,182 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-28 00:42:35,184 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-28 00:42:35,187 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-28 00:42:35,188 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-28 00:42:35,189 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-28 00:42:35,189 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-28 00:42:35,190 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-28 00:42:35,196 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-28 00:42:35,196 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-28 00:42:35,196 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-28 00:42:35,197 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-28 00:42:35,198 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-28 00:42:35,198 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-28 00:42:35,198 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-28 00:42:35,199 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-28 00:42:35,200 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-28 00:42:35,200 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-28 00:42:35,201 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-28 00:42:35,201 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-28 00:42:35,201 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-28 00:42:35,201 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-28 00:42:35,201 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-28 00:42:35,202 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-28 00:42:35,202 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-28 00:42:35,203 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-28 00:42:35,224 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-28 00:42:35,224 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-28 00:42:35,225 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-28 00:42:35,225 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-28 00:42:35,225 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-28 00:42:35,226 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-28 00:42:35,226 INFO L138 SettingsManager]: * Use SBE=true [2023-01-28 00:42:35,226 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-28 00:42:35,226 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-28 00:42:35,226 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-28 00:42:35,227 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-28 00:42:35,227 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-28 00:42:35,227 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-28 00:42:35,227 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-28 00:42:35,227 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-28 00:42:35,227 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-28 00:42:35,227 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-28 00:42:35,227 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-28 00:42:35,227 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-28 00:42:35,227 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-28 00:42:35,228 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-28 00:42:35,228 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-28 00:42:35,228 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-28 00:42:35,228 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 00:42:35,228 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-28 00:42:35,228 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-28 00:42:35,228 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-28 00:42:35,228 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-28 00:42:35,228 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-28 00:42:35,229 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-28 00:42:35,229 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-28 00:42:35,229 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> BEFORE [2023-01-28 00:42:35,425 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-28 00:42:35,449 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-28 00:42:35,451 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-28 00:42:35,451 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-28 00:42:35,452 INFO L275 PluginConnector]: CDTParser initialized [2023-01-28 00:42:35,452 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix046.oepc.i [2023-01-28 00:42:36,511 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-28 00:42:36,730 INFO L351 CDTParser]: Found 1 translation units. [2023-01-28 00:42:36,734 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix046.oepc.i [2023-01-28 00:42:36,744 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5c4aadd6/2b6de283e0804b11ae8774413afc9baf/FLAGccb44bf4d [2023-01-28 00:42:37,046 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5c4aadd6/2b6de283e0804b11ae8774413afc9baf [2023-01-28 00:42:37,048 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-28 00:42:37,049 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-28 00:42:37,050 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-28 00:42:37,050 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-28 00:42:37,052 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-28 00:42:37,052 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 12:42:37" (1/1) ... [2023-01-28 00:42:37,053 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@183448e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:42:37, skipping insertion in model container [2023-01-28 00:42:37,053 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 12:42:37" (1/1) ... [2023-01-28 00:42:37,057 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-28 00:42:37,091 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-28 00:42:37,186 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/mix046.oepc.i[945,958] [2023-01-28 00:42:37,315 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 00:42:37,323 INFO L203 MainTranslator]: Completed pre-run [2023-01-28 00:42:37,331 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/mix046.oepc.i[945,958] [2023-01-28 00:42:37,381 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 00:42:37,403 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 00:42:37,403 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 00:42:37,408 INFO L208 MainTranslator]: Completed translation [2023-01-28 00:42:37,409 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:42:37 WrapperNode [2023-01-28 00:42:37,409 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-28 00:42:37,410 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-28 00:42:37,410 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-28 00:42:37,410 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-28 00:42:37,415 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:42:37" (1/1) ... [2023-01-28 00:42:37,442 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:42:37" (1/1) ... [2023-01-28 00:42:37,471 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 145 [2023-01-28 00:42:37,471 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-28 00:42:37,472 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-28 00:42:37,472 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-28 00:42:37,472 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-28 00:42:37,479 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:42:37" (1/1) ... [2023-01-28 00:42:37,480 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:42:37" (1/1) ... [2023-01-28 00:42:37,491 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:42:37" (1/1) ... [2023-01-28 00:42:37,491 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:42:37" (1/1) ... [2023-01-28 00:42:37,502 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:42:37" (1/1) ... [2023-01-28 00:42:37,503 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:42:37" (1/1) ... [2023-01-28 00:42:37,504 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:42:37" (1/1) ... [2023-01-28 00:42:37,505 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:42:37" (1/1) ... [2023-01-28 00:42:37,507 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-28 00:42:37,508 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-28 00:42:37,508 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-28 00:42:37,508 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-28 00:42:37,509 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:42:37" (1/1) ... [2023-01-28 00:42:37,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 00:42:37,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 00:42:37,561 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-01-28 00:42:37,567 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-28 00:42:37,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-28 00:42:37,587 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-28 00:42:37,587 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-28 00:42:37,587 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-28 00:42:37,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-28 00:42:37,587 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-01-28 00:42:37,588 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-01-28 00:42:37,588 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-01-28 00:42:37,588 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-01-28 00:42:37,588 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-01-28 00:42:37,588 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-01-28 00:42:37,588 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-01-28 00:42:37,588 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-01-28 00:42:37,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-28 00:42:37,588 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-28 00:42:37,588 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-28 00:42:37,588 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-28 00:42:37,589 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-01-28 00:42:37,730 INFO L236 CfgBuilder]: Building ICFG [2023-01-28 00:42:37,732 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-28 00:42:37,941 INFO L277 CfgBuilder]: Performing block encoding [2023-01-28 00:42:38,022 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-28 00:42:38,022 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-01-28 00:42:38,023 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 12:42:38 BoogieIcfgContainer [2023-01-28 00:42:38,024 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-28 00:42:38,025 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-28 00:42:38,025 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-28 00:42:38,027 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-28 00:42:38,027 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 12:42:37" (1/3) ... [2023-01-28 00:42:38,027 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@212b813e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 12:42:38, skipping insertion in model container [2023-01-28 00:42:38,028 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:42:37" (2/3) ... [2023-01-28 00:42:38,028 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@212b813e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 12:42:38, skipping insertion in model container [2023-01-28 00:42:38,028 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 12:42:38" (3/3) ... [2023-01-28 00:42:38,029 INFO L112 eAbstractionObserver]: Analyzing ICFG mix046.oepc.i [2023-01-28 00:42:38,040 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-28 00:42:38,040 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-01-28 00:42:38,040 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-28 00:42:38,079 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-28 00:42:38,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 143 places, 132 transitions, 284 flow [2023-01-28 00:42:38,143 INFO L130 PetriNetUnfolder]: 2/128 cut-off events. [2023-01-28 00:42:38,143 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 00:42:38,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 128 events. 2/128 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 73 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2023-01-28 00:42:38,149 INFO L82 GeneralOperation]: Start removeDead. Operand has 143 places, 132 transitions, 284 flow [2023-01-28 00:42:38,152 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 139 places, 128 transitions, 268 flow [2023-01-28 00:42:38,154 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 00:42:38,161 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 128 transitions, 268 flow [2023-01-28 00:42:38,163 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 139 places, 128 transitions, 268 flow [2023-01-28 00:42:38,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 128 transitions, 268 flow [2023-01-28 00:42:38,183 INFO L130 PetriNetUnfolder]: 2/128 cut-off events. [2023-01-28 00:42:38,183 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 00:42:38,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 128 events. 2/128 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 73 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2023-01-28 00:42:38,186 INFO L119 LiptonReduction]: Number of co-enabled transitions 3270 [2023-01-28 00:42:41,364 INFO L134 LiptonReduction]: Checked pairs total: 8670 [2023-01-28 00:42:41,364 INFO L136 LiptonReduction]: Total number of compositions: 110 [2023-01-28 00:42:41,382 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-28 00:42:41,387 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;@40631557, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 00:42:41,391 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-01-28 00:42:41,410 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2023-01-28 00:42:41,410 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 00:42:41,410 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:42:41,411 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-01-28 00:42:41,411 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 00:42:41,414 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:42:41,415 INFO L85 PathProgramCache]: Analyzing trace with hash 553466, now seen corresponding path program 1 times [2023-01-28 00:42:41,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:42:41,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457530146] [2023-01-28 00:42:41,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:42:41,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:42:41,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:42:41,684 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-28 00:42:41,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:42:41,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457530146] [2023-01-28 00:42:41,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457530146] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:42:41,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:42:41,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-28 00:42:41,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22996285] [2023-01-28 00:42:41,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:42:41,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 00:42:41,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:42:41,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 00:42:41,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 00:42:41,719 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 242 [2023-01-28 00:42:41,720 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 31 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 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-28 00:42:41,720 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:42:41,720 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 242 [2023-01-28 00:42:41,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:42:42,458 INFO L130 PetriNetUnfolder]: 5879/8107 cut-off events. [2023-01-28 00:42:42,458 INFO L131 PetriNetUnfolder]: For 73/73 co-relation queries the response was YES. [2023-01-28 00:42:42,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16251 conditions, 8107 events. 5879/8107 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 365. Compared 40886 event pairs, 2239 based on Foata normal form. 0/7719 useless extension candidates. Maximal degree in co-relation 16239. Up to 6367 conditions per place. [2023-01-28 00:42:42,496 INFO L137 encePairwiseOnDemand]: 238/242 looper letters, 43 selfloop transitions, 2 changer transitions 2/50 dead transitions. [2023-01-28 00:42:42,496 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 50 transitions, 215 flow [2023-01-28 00:42:42,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 00:42:42,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 00:42:42,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 398 transitions. [2023-01-28 00:42:42,510 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5482093663911846 [2023-01-28 00:42:42,510 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 398 transitions. [2023-01-28 00:42:42,511 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 398 transitions. [2023-01-28 00:42:42,514 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:42:42,515 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 398 transitions. [2023-01-28 00:42:42,519 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 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-28 00:42:42,522 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 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-28 00:42:42,523 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 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-28 00:42:42,524 INFO L175 Difference]: Start difference. First operand has 43 places, 31 transitions, 74 flow. Second operand 3 states and 398 transitions. [2023-01-28 00:42:42,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 50 transitions, 215 flow [2023-01-28 00:42:42,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 50 transitions, 208 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-01-28 00:42:42,531 INFO L231 Difference]: Finished difference. Result has 40 places, 28 transitions, 68 flow [2023-01-28 00:42:42,532 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=40, PETRI_TRANSITIONS=28} [2023-01-28 00:42:42,536 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -3 predicate places. [2023-01-28 00:42:42,536 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 28 transitions, 68 flow [2023-01-28 00:42:42,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 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-28 00:42:42,537 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:42:42,537 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:42:42,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-28 00:42:42,538 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 00:42:42,539 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:42:42,539 INFO L85 PathProgramCache]: Analyzing trace with hash -301813989, now seen corresponding path program 1 times [2023-01-28 00:42:42,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:42:42,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328334102] [2023-01-28 00:42:42,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:42:42,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:42:42,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:42:42,752 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-28 00:42:42,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:42:42,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328334102] [2023-01-28 00:42:42,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328334102] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:42:42,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:42:42,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-28 00:42:42,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263085784] [2023-01-28 00:42:42,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:42:42,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 00:42:42,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:42:42,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 00:42:42,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 00:42:42,755 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 242 [2023-01-28 00:42:42,755 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 28 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 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-28 00:42:42,755 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:42:42,755 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 242 [2023-01-28 00:42:42,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:42:43,350 INFO L130 PetriNetUnfolder]: 5847/7943 cut-off events. [2023-01-28 00:42:43,350 INFO L131 PetriNetUnfolder]: For 521/521 co-relation queries the response was YES. [2023-01-28 00:42:43,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16607 conditions, 7943 events. 5847/7943 cut-off events. For 521/521 co-relation queries the response was YES. Maximal size of possible extension queue 340. Compared 37764 event pairs, 1383 based on Foata normal form. 32/7969 useless extension candidates. Maximal degree in co-relation 16597. Up to 7393 conditions per place. [2023-01-28 00:42:43,383 INFO L137 encePairwiseOnDemand]: 238/242 looper letters, 36 selfloop transitions, 3 changer transitions 0/41 dead transitions. [2023-01-28 00:42:43,383 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 41 transitions, 176 flow [2023-01-28 00:42:43,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 00:42:43,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 00:42:43,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 379 transitions. [2023-01-28 00:42:43,385 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.522038567493113 [2023-01-28 00:42:43,385 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 379 transitions. [2023-01-28 00:42:43,385 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 379 transitions. [2023-01-28 00:42:43,385 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:42:43,385 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 379 transitions. [2023-01-28 00:42:43,386 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 126.33333333333333) internal successors, (379), 3 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-28 00:42:43,387 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 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-28 00:42:43,388 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 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-28 00:42:43,388 INFO L175 Difference]: Start difference. First operand has 40 places, 28 transitions, 68 flow. Second operand 3 states and 379 transitions. [2023-01-28 00:42:43,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 41 transitions, 176 flow [2023-01-28 00:42:43,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 41 transitions, 170 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 00:42:43,390 INFO L231 Difference]: Finished difference. Result has 40 places, 30 transitions, 83 flow [2023-01-28 00:42:43,390 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=83, PETRI_PLACES=40, PETRI_TRANSITIONS=30} [2023-01-28 00:42:43,390 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -3 predicate places. [2023-01-28 00:42:43,391 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 83 flow [2023-01-28 00:42:43,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 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-28 00:42:43,391 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:42:43,391 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:42:43,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-28 00:42:43,391 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 00:42:43,393 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:42:43,393 INFO L85 PathProgramCache]: Analyzing trace with hash -766301092, now seen corresponding path program 1 times [2023-01-28 00:42:43,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:42:43,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191495917] [2023-01-28 00:42:43,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:42:43,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:42:43,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:42:43,661 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-28 00:42:43,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:42:43,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191495917] [2023-01-28 00:42:43,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191495917] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:42:43,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:42:43,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 00:42:43,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121056538] [2023-01-28 00:42:43,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:42:43,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 00:42:43,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:42:43,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 00:42:43,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-28 00:42:43,666 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 242 [2023-01-28 00:42:43,666 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 83 flow. Second operand has 4 states, 4 states have (on average 108.0) internal successors, (432), 4 states have internal predecessors, (432), 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-28 00:42:43,666 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:42:43,666 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 242 [2023-01-28 00:42:43,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:42:44,801 INFO L130 PetriNetUnfolder]: 13113/17854 cut-off events. [2023-01-28 00:42:44,802 INFO L131 PetriNetUnfolder]: For 1835/1835 co-relation queries the response was YES. [2023-01-28 00:42:44,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38015 conditions, 17854 events. 13113/17854 cut-off events. For 1835/1835 co-relation queries the response was YES. Maximal size of possible extension queue 597. Compared 88866 event pairs, 2914 based on Foata normal form. 620/18474 useless extension candidates. Maximal degree in co-relation 38004. Up to 8372 conditions per place. [2023-01-28 00:42:44,876 INFO L137 encePairwiseOnDemand]: 234/242 looper letters, 54 selfloop transitions, 7 changer transitions 0/61 dead transitions. [2023-01-28 00:42:44,876 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 61 transitions, 271 flow [2023-01-28 00:42:44,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 00:42:44,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 00:42:44,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 481 transitions. [2023-01-28 00:42:44,878 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.496900826446281 [2023-01-28 00:42:44,878 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 481 transitions. [2023-01-28 00:42:44,878 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 481 transitions. [2023-01-28 00:42:44,878 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:42:44,878 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 481 transitions. [2023-01-28 00:42:44,879 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 120.25) internal successors, (481), 4 states have internal predecessors, (481), 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-28 00:42:44,880 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 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-28 00:42:44,881 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 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-28 00:42:44,881 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 83 flow. Second operand 4 states and 481 transitions. [2023-01-28 00:42:44,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 61 transitions, 271 flow [2023-01-28 00:42:44,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 61 transitions, 268 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 00:42:44,883 INFO L231 Difference]: Finished difference. Result has 45 places, 35 transitions, 134 flow [2023-01-28 00:42:44,884 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=134, PETRI_PLACES=45, PETRI_TRANSITIONS=35} [2023-01-28 00:42:44,884 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 2 predicate places. [2023-01-28 00:42:44,887 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 35 transitions, 134 flow [2023-01-28 00:42:44,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 108.0) internal successors, (432), 4 states have internal predecessors, (432), 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-28 00:42:44,887 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:42:44,887 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:42:44,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-28 00:42:44,888 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 00:42:44,888 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:42:44,888 INFO L85 PathProgramCache]: Analyzing trace with hash 2012133723, now seen corresponding path program 1 times [2023-01-28 00:42:44,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:42:44,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417319252] [2023-01-28 00:42:44,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:42:44,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:42:44,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:42:45,035 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-28 00:42:45,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:42:45,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417319252] [2023-01-28 00:42:45,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417319252] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:42:45,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:42:45,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-28 00:42:45,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750836766] [2023-01-28 00:42:45,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:42:45,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 00:42:45,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:42:45,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 00:42:45,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 00:42:45,039 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 242 [2023-01-28 00:42:45,039 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 35 transitions, 134 flow. Second operand has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 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-28 00:42:45,039 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:42:45,039 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 242 [2023-01-28 00:42:45,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:42:46,026 INFO L130 PetriNetUnfolder]: 10592/14921 cut-off events. [2023-01-28 00:42:46,026 INFO L131 PetriNetUnfolder]: For 6937/6976 co-relation queries the response was YES. [2023-01-28 00:42:46,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36857 conditions, 14921 events. 10592/14921 cut-off events. For 6937/6976 co-relation queries the response was YES. Maximal size of possible extension queue 626. Compared 83016 event pairs, 3378 based on Foata normal form. 34/14586 useless extension candidates. Maximal degree in co-relation 36842. Up to 13586 conditions per place. [2023-01-28 00:42:46,222 INFO L137 encePairwiseOnDemand]: 238/242 looper letters, 44 selfloop transitions, 4 changer transitions 0/53 dead transitions. [2023-01-28 00:42:46,222 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 53 transitions, 286 flow [2023-01-28 00:42:46,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 00:42:46,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 00:42:46,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 383 transitions. [2023-01-28 00:42:46,224 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5275482093663911 [2023-01-28 00:42:46,224 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 383 transitions. [2023-01-28 00:42:46,224 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 383 transitions. [2023-01-28 00:42:46,224 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:42:46,224 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 383 transitions. [2023-01-28 00:42:46,225 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 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-28 00:42:46,226 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 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-28 00:42:46,226 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 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-28 00:42:46,227 INFO L175 Difference]: Start difference. First operand has 45 places, 35 transitions, 134 flow. Second operand 3 states and 383 transitions. [2023-01-28 00:42:46,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 53 transitions, 286 flow [2023-01-28 00:42:46,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 53 transitions, 283 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 00:42:46,241 INFO L231 Difference]: Finished difference. Result has 47 places, 38 transitions, 166 flow [2023-01-28 00:42:46,241 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=166, PETRI_PLACES=47, PETRI_TRANSITIONS=38} [2023-01-28 00:42:46,242 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 4 predicate places. [2023-01-28 00:42:46,242 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 38 transitions, 166 flow [2023-01-28 00:42:46,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 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-28 00:42:46,242 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:42:46,242 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:42:46,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-28 00:42:46,243 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 00:42:46,243 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:42:46,243 INFO L85 PathProgramCache]: Analyzing trace with hash -2048365308, now seen corresponding path program 1 times [2023-01-28 00:42:46,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:42:46,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657003743] [2023-01-28 00:42:46,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:42:46,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:42:46,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:42:46,389 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-28 00:42:46,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:42:46,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657003743] [2023-01-28 00:42:46,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657003743] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:42:46,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:42:46,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 00:42:46,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275446119] [2023-01-28 00:42:46,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:42:46,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 00:42:46,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:42:46,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 00:42:46,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 00:42:46,391 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 242 [2023-01-28 00:42:46,392 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 166 flow. Second operand has 4 states, 4 states have (on average 110.5) internal successors, (442), 4 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:42:46,392 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:42:46,392 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 242 [2023-01-28 00:42:46,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:42:47,370 INFO L130 PetriNetUnfolder]: 8636/12594 cut-off events. [2023-01-28 00:42:47,371 INFO L131 PetriNetUnfolder]: For 6854/7046 co-relation queries the response was YES. [2023-01-28 00:42:47,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31177 conditions, 12594 events. 8636/12594 cut-off events. For 6854/7046 co-relation queries the response was YES. Maximal size of possible extension queue 642. Compared 75774 event pairs, 1565 based on Foata normal form. 1026/13313 useless extension candidates. Maximal degree in co-relation 31160. Up to 7706 conditions per place. [2023-01-28 00:42:47,415 INFO L137 encePairwiseOnDemand]: 235/242 looper letters, 80 selfloop transitions, 10 changer transitions 0/99 dead transitions. [2023-01-28 00:42:47,416 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 99 transitions, 552 flow [2023-01-28 00:42:47,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 00:42:47,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 00:42:47,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 611 transitions. [2023-01-28 00:42:47,417 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5049586776859504 [2023-01-28 00:42:47,417 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 611 transitions. [2023-01-28 00:42:47,417 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 611 transitions. [2023-01-28 00:42:47,418 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:42:47,418 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 611 transitions. [2023-01-28 00:42:47,419 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 122.2) internal successors, (611), 5 states have internal predecessors, (611), 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-28 00:42:47,420 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 242.0) internal successors, (1452), 6 states have internal predecessors, (1452), 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-28 00:42:47,421 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 242.0) internal successors, (1452), 6 states have internal predecessors, (1452), 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-28 00:42:47,421 INFO L175 Difference]: Start difference. First operand has 47 places, 38 transitions, 166 flow. Second operand 5 states and 611 transitions. [2023-01-28 00:42:47,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 99 transitions, 552 flow [2023-01-28 00:42:47,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 99 transitions, 545 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 00:42:47,424 INFO L231 Difference]: Finished difference. Result has 53 places, 47 transitions, 237 flow [2023-01-28 00:42:47,424 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=237, PETRI_PLACES=53, PETRI_TRANSITIONS=47} [2023-01-28 00:42:47,425 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 10 predicate places. [2023-01-28 00:42:47,425 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 47 transitions, 237 flow [2023-01-28 00:42:47,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 110.5) internal successors, (442), 4 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:42:47,425 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:42:47,425 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-28 00:42:47,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-28 00:42:47,425 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 00:42:47,426 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:42:47,426 INFO L85 PathProgramCache]: Analyzing trace with hash 723177800, now seen corresponding path program 1 times [2023-01-28 00:42:47,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:42:47,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503612661] [2023-01-28 00:42:47,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:42:47,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:42:47,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:42:47,851 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-28 00:42:47,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:42:47,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503612661] [2023-01-28 00:42:47,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503612661] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:42:47,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:42:47,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 00:42:47,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638042244] [2023-01-28 00:42:47,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:42:47,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 00:42:47,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:42:47,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 00:42:47,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-01-28 00:42:47,853 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 242 [2023-01-28 00:42:47,854 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 47 transitions, 237 flow. Second operand has 7 states, 7 states have (on average 110.57142857142857) internal successors, (774), 7 states have internal predecessors, (774), 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-28 00:42:47,854 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:42:47,854 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 242 [2023-01-28 00:42:47,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:42:49,597 INFO L130 PetriNetUnfolder]: 13873/20171 cut-off events. [2023-01-28 00:42:49,598 INFO L131 PetriNetUnfolder]: For 22292/22501 co-relation queries the response was YES. [2023-01-28 00:42:49,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64483 conditions, 20171 events. 13873/20171 cut-off events. For 22292/22501 co-relation queries the response was YES. Maximal size of possible extension queue 877. Compared 126114 event pairs, 3273 based on Foata normal form. 251/20365 useless extension candidates. Maximal degree in co-relation 64462. Up to 12801 conditions per place. [2023-01-28 00:42:49,698 INFO L137 encePairwiseOnDemand]: 232/242 looper letters, 116 selfloop transitions, 21 changer transitions 20/164 dead transitions. [2023-01-28 00:42:49,699 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 164 transitions, 1055 flow [2023-01-28 00:42:49,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 00:42:49,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 00:42:49,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 863 transitions. [2023-01-28 00:42:49,702 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5094451003541912 [2023-01-28 00:42:49,702 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 863 transitions. [2023-01-28 00:42:49,702 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 863 transitions. [2023-01-28 00:42:49,702 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:42:49,702 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 863 transitions. [2023-01-28 00:42:49,704 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 123.28571428571429) internal successors, (863), 7 states have internal predecessors, (863), 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-28 00:42:49,706 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 242.0) internal successors, (1936), 8 states have internal predecessors, (1936), 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-28 00:42:49,707 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 242.0) internal successors, (1936), 8 states have internal predecessors, (1936), 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-28 00:42:49,707 INFO L175 Difference]: Start difference. First operand has 53 places, 47 transitions, 237 flow. Second operand 7 states and 863 transitions. [2023-01-28 00:42:49,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 164 transitions, 1055 flow [2023-01-28 00:42:49,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 164 transitions, 1043 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 00:42:49,739 INFO L231 Difference]: Finished difference. Result has 62 places, 68 transitions, 395 flow [2023-01-28 00:42:49,739 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=395, PETRI_PLACES=62, PETRI_TRANSITIONS=68} [2023-01-28 00:42:49,741 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 19 predicate places. [2023-01-28 00:42:49,741 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 68 transitions, 395 flow [2023-01-28 00:42:49,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 110.57142857142857) internal successors, (774), 7 states have internal predecessors, (774), 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-28 00:42:49,741 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:42:49,741 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:42:49,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-28 00:42:49,742 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 00:42:49,742 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:42:49,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1262927896, now seen corresponding path program 1 times [2023-01-28 00:42:49,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:42:49,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96982704] [2023-01-28 00:42:49,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:42:49,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:42:49,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:42:49,913 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-28 00:42:49,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:42:49,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96982704] [2023-01-28 00:42:49,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96982704] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:42:49,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:42:49,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 00:42:49,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135180199] [2023-01-28 00:42:49,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:42:49,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 00:42:49,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:42:49,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 00:42:49,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 00:42:49,916 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 242 [2023-01-28 00:42:49,916 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 68 transitions, 395 flow. Second operand has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 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-28 00:42:49,916 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:42:49,916 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 242 [2023-01-28 00:42:49,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:42:51,999 INFO L130 PetriNetUnfolder]: 16134/23539 cut-off events. [2023-01-28 00:42:52,000 INFO L131 PetriNetUnfolder]: For 40200/40487 co-relation queries the response was YES. [2023-01-28 00:42:52,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85190 conditions, 23539 events. 16134/23539 cut-off events. For 40200/40487 co-relation queries the response was YES. Maximal size of possible extension queue 1056. Compared 153127 event pairs, 5395 based on Foata normal form. 367/23415 useless extension candidates. Maximal degree in co-relation 85164. Up to 12321 conditions per place. [2023-01-28 00:42:52,091 INFO L137 encePairwiseOnDemand]: 239/242 looper letters, 87 selfloop transitions, 6 changer transitions 17/116 dead transitions. [2023-01-28 00:42:52,092 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 116 transitions, 879 flow [2023-01-28 00:42:52,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 00:42:52,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 00:42:52,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 385 transitions. [2023-01-28 00:42:52,093 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5303030303030303 [2023-01-28 00:42:52,093 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 385 transitions. [2023-01-28 00:42:52,093 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 385 transitions. [2023-01-28 00:42:52,093 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:42:52,093 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 385 transitions. [2023-01-28 00:42:52,094 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 128.33333333333334) internal successors, (385), 3 states have internal predecessors, (385), 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-28 00:42:52,095 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 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-28 00:42:52,095 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 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-28 00:42:52,095 INFO L175 Difference]: Start difference. First operand has 62 places, 68 transitions, 395 flow. Second operand 3 states and 385 transitions. [2023-01-28 00:42:52,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 116 transitions, 879 flow [2023-01-28 00:42:52,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 116 transitions, 867 flow, removed 6 selfloop flow, removed 0 redundant places. [2023-01-28 00:42:52,142 INFO L231 Difference]: Finished difference. Result has 65 places, 63 transitions, 380 flow [2023-01-28 00:42:52,143 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=389, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=380, PETRI_PLACES=65, PETRI_TRANSITIONS=63} [2023-01-28 00:42:52,143 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 22 predicate places. [2023-01-28 00:42:52,143 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 63 transitions, 380 flow [2023-01-28 00:42:52,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 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-28 00:42:52,143 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:42:52,143 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:42:52,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-28 00:42:52,144 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 00:42:52,144 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:42:52,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1298934704, now seen corresponding path program 1 times [2023-01-28 00:42:52,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:42:52,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842443829] [2023-01-28 00:42:52,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:42:52,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:42:52,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:42:52,310 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-28 00:42:52,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:42:52,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842443829] [2023-01-28 00:42:52,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842443829] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:42:52,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:42:52,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 00:42:52,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734375023] [2023-01-28 00:42:52,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:42:52,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 00:42:52,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:42:52,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 00:42:52,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 00:42:52,315 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 242 [2023-01-28 00:42:52,315 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 63 transitions, 380 flow. Second operand has 5 states, 5 states have (on average 110.2) internal successors, (551), 5 states have internal predecessors, (551), 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-28 00:42:52,315 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:42:52,315 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 242 [2023-01-28 00:42:52,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:42:53,623 INFO L130 PetriNetUnfolder]: 9724/14518 cut-off events. [2023-01-28 00:42:53,624 INFO L131 PetriNetUnfolder]: For 24350/24620 co-relation queries the response was YES. [2023-01-28 00:42:53,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52228 conditions, 14518 events. 9724/14518 cut-off events. For 24350/24620 co-relation queries the response was YES. Maximal size of possible extension queue 730. Compared 94626 event pairs, 1113 based on Foata normal form. 1143/15205 useless extension candidates. Maximal degree in co-relation 52200. Up to 4554 conditions per place. [2023-01-28 00:42:53,685 INFO L137 encePairwiseOnDemand]: 235/242 looper letters, 156 selfloop transitions, 15 changer transitions 4/185 dead transitions. [2023-01-28 00:42:53,686 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 185 transitions, 1385 flow [2023-01-28 00:42:53,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 00:42:53,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 00:42:53,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 854 transitions. [2023-01-28 00:42:53,689 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5041322314049587 [2023-01-28 00:42:53,689 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 854 transitions. [2023-01-28 00:42:53,689 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 854 transitions. [2023-01-28 00:42:53,690 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:42:53,690 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 854 transitions. [2023-01-28 00:42:53,693 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 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-28 00:42:53,696 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 242.0) internal successors, (1936), 8 states have internal predecessors, (1936), 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-28 00:42:53,696 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 242.0) internal successors, (1936), 8 states have internal predecessors, (1936), 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-28 00:42:53,697 INFO L175 Difference]: Start difference. First operand has 65 places, 63 transitions, 380 flow. Second operand 7 states and 854 transitions. [2023-01-28 00:42:53,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 185 transitions, 1385 flow [2023-01-28 00:42:53,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 185 transitions, 1349 flow, removed 8 selfloop flow, removed 3 redundant places. [2023-01-28 00:42:53,767 INFO L231 Difference]: Finished difference. Result has 70 places, 68 transitions, 464 flow [2023-01-28 00:42:53,767 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=464, PETRI_PLACES=70, PETRI_TRANSITIONS=68} [2023-01-28 00:42:53,767 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 27 predicate places. [2023-01-28 00:42:53,767 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 68 transitions, 464 flow [2023-01-28 00:42:53,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 110.2) internal successors, (551), 5 states have internal predecessors, (551), 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-28 00:42:53,768 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:42:53,768 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] [2023-01-28 00:42:53,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-01-28 00:42:53,768 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 00:42:53,768 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:42:53,768 INFO L85 PathProgramCache]: Analyzing trace with hash -49535294, now seen corresponding path program 1 times [2023-01-28 00:42:53,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:42:53,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518780644] [2023-01-28 00:42:53,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:42:53,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:42:53,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:42:53,957 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-28 00:42:53,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:42:53,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518780644] [2023-01-28 00:42:53,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518780644] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:42:53,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:42:53,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 00:42:53,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344699178] [2023-01-28 00:42:53,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:42:53,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 00:42:53,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:42:53,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 00:42:53,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-01-28 00:42:53,961 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 242 [2023-01-28 00:42:53,962 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 68 transitions, 464 flow. Second operand has 6 states, 6 states have (on average 110.16666666666667) internal successors, (661), 6 states have internal predecessors, (661), 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-28 00:42:53,962 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:42:53,962 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 242 [2023-01-28 00:42:53,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:42:55,452 INFO L130 PetriNetUnfolder]: 9016/13444 cut-off events. [2023-01-28 00:42:55,452 INFO L131 PetriNetUnfolder]: For 26772/27008 co-relation queries the response was YES. [2023-01-28 00:42:55,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53611 conditions, 13444 events. 9016/13444 cut-off events. For 26772/27008 co-relation queries the response was YES. Maximal size of possible extension queue 728. Compared 87257 event pairs, 949 based on Foata normal form. 470/13474 useless extension candidates. Maximal degree in co-relation 53581. Up to 4323 conditions per place. [2023-01-28 00:42:55,525 INFO L137 encePairwiseOnDemand]: 235/242 looper letters, 168 selfloop transitions, 24 changer transitions 18/220 dead transitions. [2023-01-28 00:42:55,525 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 220 transitions, 1715 flow [2023-01-28 00:42:55,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-28 00:42:55,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-01-28 00:42:55,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1099 transitions. [2023-01-28 00:42:55,529 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5045913682277319 [2023-01-28 00:42:55,529 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1099 transitions. [2023-01-28 00:42:55,529 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1099 transitions. [2023-01-28 00:42:55,529 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:42:55,529 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1099 transitions. [2023-01-28 00:42:55,531 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 122.11111111111111) internal successors, (1099), 9 states have internal predecessors, (1099), 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-28 00:42:55,533 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 242.0) internal successors, (2420), 10 states have internal predecessors, (2420), 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-28 00:42:55,534 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 242.0) internal successors, (2420), 10 states have internal predecessors, (2420), 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-28 00:42:55,534 INFO L175 Difference]: Start difference. First operand has 70 places, 68 transitions, 464 flow. Second operand 9 states and 1099 transitions. [2023-01-28 00:42:55,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 220 transitions, 1715 flow [2023-01-28 00:42:56,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 220 transitions, 1670 flow, removed 17 selfloop flow, removed 2 redundant places. [2023-01-28 00:42:56,341 INFO L231 Difference]: Finished difference. Result has 79 places, 77 transitions, 589 flow [2023-01-28 00:42:56,342 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=419, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=589, PETRI_PLACES=79, PETRI_TRANSITIONS=77} [2023-01-28 00:42:56,342 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 36 predicate places. [2023-01-28 00:42:56,342 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 77 transitions, 589 flow [2023-01-28 00:42:56,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 110.16666666666667) internal successors, (661), 6 states have internal predecessors, (661), 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-28 00:42:56,342 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:42:56,343 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:42:56,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-28 00:42:56,343 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 00:42:56,343 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:42:56,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1844135116, now seen corresponding path program 1 times [2023-01-28 00:42:56,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:42:56,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116055427] [2023-01-28 00:42:56,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:42:56,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:42:56,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:42:56,964 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-28 00:42:56,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:42:56,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116055427] [2023-01-28 00:42:56,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116055427] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:42:56,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:42:56,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 00:42:56,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052966050] [2023-01-28 00:42:56,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:42:56,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 00:42:56,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:42:56,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 00:42:56,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-01-28 00:42:56,967 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 242 [2023-01-28 00:42:56,967 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 77 transitions, 589 flow. Second operand has 7 states, 7 states have (on average 110.14285714285714) internal successors, (771), 7 states have internal predecessors, (771), 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-28 00:42:56,967 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:42:56,967 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 242 [2023-01-28 00:42:56,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:42:59,110 INFO L130 PetriNetUnfolder]: 12606/19866 cut-off events. [2023-01-28 00:42:59,110 INFO L131 PetriNetUnfolder]: For 60120/60512 co-relation queries the response was YES. [2023-01-28 00:42:59,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84810 conditions, 19866 events. 12606/19866 cut-off events. For 60120/60512 co-relation queries the response was YES. Maximal size of possible extension queue 953. Compared 145362 event pairs, 2508 based on Foata normal form. 249/19891 useless extension candidates. Maximal degree in co-relation 84777. Up to 7979 conditions per place. [2023-01-28 00:42:59,222 INFO L137 encePairwiseOnDemand]: 235/242 looper letters, 147 selfloop transitions, 11 changer transitions 77/245 dead transitions. [2023-01-28 00:42:59,222 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 245 transitions, 2468 flow [2023-01-28 00:42:59,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 00:42:59,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 00:42:59,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 839 transitions. [2023-01-28 00:42:59,224 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4952774498229044 [2023-01-28 00:42:59,224 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 839 transitions. [2023-01-28 00:42:59,224 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 839 transitions. [2023-01-28 00:42:59,225 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:42:59,225 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 839 transitions. [2023-01-28 00:42:59,226 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 119.85714285714286) internal successors, (839), 7 states have internal predecessors, (839), 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-28 00:42:59,228 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 242.0) internal successors, (1936), 8 states have internal predecessors, (1936), 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-28 00:42:59,228 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 242.0) internal successors, (1936), 8 states have internal predecessors, (1936), 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-28 00:42:59,228 INFO L175 Difference]: Start difference. First operand has 79 places, 77 transitions, 589 flow. Second operand 7 states and 839 transitions. [2023-01-28 00:42:59,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 245 transitions, 2468 flow [2023-01-28 00:43:00,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 245 transitions, 2052 flow, removed 162 selfloop flow, removed 3 redundant places. [2023-01-28 00:43:00,931 INFO L231 Difference]: Finished difference. Result has 85 places, 85 transitions, 609 flow [2023-01-28 00:43:00,931 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=501, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=609, PETRI_PLACES=85, PETRI_TRANSITIONS=85} [2023-01-28 00:43:00,932 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 42 predicate places. [2023-01-28 00:43:00,932 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 85 transitions, 609 flow [2023-01-28 00:43:00,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 110.14285714285714) internal successors, (771), 7 states have internal predecessors, (771), 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-28 00:43:00,932 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:43:00,932 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:43:00,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-01-28 00:43:00,932 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 00:43:00,933 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:43:00,933 INFO L85 PathProgramCache]: Analyzing trace with hash 705164732, now seen corresponding path program 2 times [2023-01-28 00:43:00,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:43:00,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209666407] [2023-01-28 00:43:00,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:43:00,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:43:00,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:43:01,139 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-28 00:43:01,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:43:01,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209666407] [2023-01-28 00:43:01,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209666407] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:43:01,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:43:01,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-28 00:43:01,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503539752] [2023-01-28 00:43:01,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:43:01,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 00:43:01,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:43:01,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 00:43:01,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-01-28 00:43:01,141 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 242 [2023-01-28 00:43:01,142 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 85 transitions, 609 flow. Second operand has 7 states, 7 states have (on average 110.14285714285714) internal successors, (771), 7 states have internal predecessors, (771), 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-28 00:43:01,142 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:43:01,142 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 242 [2023-01-28 00:43:01,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:43:02,689 INFO L130 PetriNetUnfolder]: 10789/16441 cut-off events. [2023-01-28 00:43:02,689 INFO L131 PetriNetUnfolder]: For 41227/41495 co-relation queries the response was YES. [2023-01-28 00:43:02,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67816 conditions, 16441 events. 10789/16441 cut-off events. For 41227/41495 co-relation queries the response was YES. Maximal size of possible extension queue 871. Compared 114785 event pairs, 1019 based on Foata normal form. 242/16190 useless extension candidates. Maximal degree in co-relation 67783. Up to 4137 conditions per place. [2023-01-28 00:43:02,765 INFO L137 encePairwiseOnDemand]: 235/242 looper letters, 171 selfloop transitions, 28 changer transitions 41/248 dead transitions. [2023-01-28 00:43:02,765 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 248 transitions, 2081 flow [2023-01-28 00:43:02,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-01-28 00:43:02,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-01-28 00:43:02,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1314 transitions. [2023-01-28 00:43:02,768 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49361382419233657 [2023-01-28 00:43:02,768 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1314 transitions. [2023-01-28 00:43:02,768 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1314 transitions. [2023-01-28 00:43:02,768 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:43:02,769 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1314 transitions. [2023-01-28 00:43:02,770 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 119.45454545454545) internal successors, (1314), 11 states have internal predecessors, (1314), 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-28 00:43:02,773 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 242.0) internal successors, (2904), 12 states have internal predecessors, (2904), 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-28 00:43:02,773 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 242.0) internal successors, (2904), 12 states have internal predecessors, (2904), 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-28 00:43:02,773 INFO L175 Difference]: Start difference. First operand has 85 places, 85 transitions, 609 flow. Second operand 11 states and 1314 transitions. [2023-01-28 00:43:02,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 248 transitions, 2081 flow [2023-01-28 00:43:03,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 248 transitions, 2035 flow, removed 18 selfloop flow, removed 3 redundant places. [2023-01-28 00:43:03,665 INFO L231 Difference]: Finished difference. Result has 93 places, 81 transitions, 634 flow [2023-01-28 00:43:03,666 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=577, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=634, PETRI_PLACES=93, PETRI_TRANSITIONS=81} [2023-01-28 00:43:03,666 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 50 predicate places. [2023-01-28 00:43:03,666 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 81 transitions, 634 flow [2023-01-28 00:43:03,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 110.14285714285714) internal successors, (771), 7 states have internal predecessors, (771), 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-28 00:43:03,666 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:43:03,667 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:43:03,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-01-28 00:43:03,667 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 00:43:03,667 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:43:03,667 INFO L85 PathProgramCache]: Analyzing trace with hash 10147915, now seen corresponding path program 1 times [2023-01-28 00:43:03,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:43:03,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710086952] [2023-01-28 00:43:03,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:43:03,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:43:03,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:43:04,425 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-28 00:43:04,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:43:04,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710086952] [2023-01-28 00:43:04,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710086952] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:43:04,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:43:04,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-28 00:43:04,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192120341] [2023-01-28 00:43:04,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:43:04,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-01-28 00:43:04,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:43:04,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-01-28 00:43:04,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-01-28 00:43:04,428 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 242 [2023-01-28 00:43:04,428 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 81 transitions, 634 flow. Second operand has 8 states, 8 states have (on average 110.125) internal successors, (881), 8 states have internal predecessors, (881), 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-28 00:43:04,428 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:43:04,428 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 242 [2023-01-28 00:43:04,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:43:05,427 INFO L130 PetriNetUnfolder]: 6243/9938 cut-off events. [2023-01-28 00:43:05,427 INFO L131 PetriNetUnfolder]: For 29385/29605 co-relation queries the response was YES. [2023-01-28 00:43:05,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43626 conditions, 9938 events. 6243/9938 cut-off events. For 29385/29605 co-relation queries the response was YES. Maximal size of possible extension queue 489. Compared 66637 event pairs, 866 based on Foata normal form. 152/9928 useless extension candidates. Maximal degree in co-relation 43587. Up to 3517 conditions per place. [2023-01-28 00:43:05,476 INFO L137 encePairwiseOnDemand]: 236/242 looper letters, 147 selfloop transitions, 5 changer transitions 72/232 dead transitions. [2023-01-28 00:43:05,476 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 232 transitions, 2264 flow [2023-01-28 00:43:05,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 00:43:05,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 00:43:05,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 731 transitions. [2023-01-28 00:43:05,478 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5034435261707989 [2023-01-28 00:43:05,478 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 731 transitions. [2023-01-28 00:43:05,478 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 731 transitions. [2023-01-28 00:43:05,479 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:43:05,479 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 731 transitions. [2023-01-28 00:43:05,480 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 121.83333333333333) internal successors, (731), 6 states have internal predecessors, (731), 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-28 00:43:05,481 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 242.0) internal successors, (1694), 7 states have internal predecessors, (1694), 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-28 00:43:05,481 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 242.0) internal successors, (1694), 7 states have internal predecessors, (1694), 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-28 00:43:05,481 INFO L175 Difference]: Start difference. First operand has 93 places, 81 transitions, 634 flow. Second operand 6 states and 731 transitions. [2023-01-28 00:43:05,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 232 transitions, 2264 flow [2023-01-28 00:43:05,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 232 transitions, 1861 flow, removed 86 selfloop flow, removed 12 redundant places. [2023-01-28 00:43:05,786 INFO L231 Difference]: Finished difference. Result has 87 places, 76 transitions, 493 flow [2023-01-28 00:43:05,786 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=516, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=493, PETRI_PLACES=87, PETRI_TRANSITIONS=76} [2023-01-28 00:43:05,787 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 44 predicate places. [2023-01-28 00:43:05,787 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 76 transitions, 493 flow [2023-01-28 00:43:05,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 110.125) internal successors, (881), 8 states have internal predecessors, (881), 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-28 00:43:05,787 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:43:05,787 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:43:05,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-01-28 00:43:05,787 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 00:43:05,788 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:43:05,788 INFO L85 PathProgramCache]: Analyzing trace with hash 584122205, now seen corresponding path program 2 times [2023-01-28 00:43:05,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:43:05,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584368629] [2023-01-28 00:43:05,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:43:05,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:43:05,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:43:05,950 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-28 00:43:05,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:43:05,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584368629] [2023-01-28 00:43:05,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584368629] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:43:05,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:43:05,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 00:43:05,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027575193] [2023-01-28 00:43:05,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:43:05,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 00:43:05,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:43:05,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 00:43:05,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-28 00:43:05,952 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 242 [2023-01-28 00:43:05,952 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 76 transitions, 493 flow. Second operand has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 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-28 00:43:05,952 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:43:05,952 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 242 [2023-01-28 00:43:05,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:43:06,994 INFO L130 PetriNetUnfolder]: 8127/12652 cut-off events. [2023-01-28 00:43:06,994 INFO L131 PetriNetUnfolder]: For 34102/34102 co-relation queries the response was YES. [2023-01-28 00:43:07,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52326 conditions, 12652 events. 8127/12652 cut-off events. For 34102/34102 co-relation queries the response was YES. Maximal size of possible extension queue 525. Compared 79979 event pairs, 1525 based on Foata normal form. 2/12654 useless extension candidates. Maximal degree in co-relation 52295. Up to 5969 conditions per place. [2023-01-28 00:43:07,029 INFO L137 encePairwiseOnDemand]: 233/242 looper letters, 93 selfloop transitions, 6 changer transitions 77/176 dead transitions. [2023-01-28 00:43:07,029 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 176 transitions, 1490 flow [2023-01-28 00:43:07,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 00:43:07,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 00:43:07,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 487 transitions. [2023-01-28 00:43:07,036 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.503099173553719 [2023-01-28 00:43:07,036 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 487 transitions. [2023-01-28 00:43:07,037 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 487 transitions. [2023-01-28 00:43:07,037 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:43:07,037 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 487 transitions. [2023-01-28 00:43:07,038 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 121.75) internal successors, (487), 4 states have internal predecessors, (487), 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-28 00:43:07,039 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 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-28 00:43:07,039 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 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-28 00:43:07,039 INFO L175 Difference]: Start difference. First operand has 87 places, 76 transitions, 493 flow. Second operand 4 states and 487 transitions. [2023-01-28 00:43:07,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 176 transitions, 1490 flow [2023-01-28 00:43:07,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 176 transitions, 1449 flow, removed 5 selfloop flow, removed 5 redundant places. [2023-01-28 00:43:07,278 INFO L231 Difference]: Finished difference. Result has 86 places, 58 transitions, 371 flow [2023-01-28 00:43:07,278 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=475, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=371, PETRI_PLACES=86, PETRI_TRANSITIONS=58} [2023-01-28 00:43:07,279 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 43 predicate places. [2023-01-28 00:43:07,279 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 58 transitions, 371 flow [2023-01-28 00:43:07,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 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-28 00:43:07,280 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:43:07,280 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:43:07,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-01-28 00:43:07,280 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 00:43:07,280 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:43:07,280 INFO L85 PathProgramCache]: Analyzing trace with hash 669502323, now seen corresponding path program 3 times [2023-01-28 00:43:07,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:43:07,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911697714] [2023-01-28 00:43:07,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:43:07,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:43:07,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:43:07,492 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-28 00:43:07,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:43:07,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911697714] [2023-01-28 00:43:07,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911697714] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:43:07,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:43:07,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 00:43:07,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51202154] [2023-01-28 00:43:07,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:43:07,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 00:43:07,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:43:07,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 00:43:07,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 00:43:07,494 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 242 [2023-01-28 00:43:07,495 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 58 transitions, 371 flow. Second operand has 4 states, 4 states have (on average 118.5) internal successors, (474), 4 states have internal predecessors, (474), 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-28 00:43:07,495 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:43:07,495 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 242 [2023-01-28 00:43:07,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:43:07,795 INFO L130 PetriNetUnfolder]: 1956/3174 cut-off events. [2023-01-28 00:43:07,795 INFO L131 PetriNetUnfolder]: For 6919/6940 co-relation queries the response was YES. [2023-01-28 00:43:07,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12540 conditions, 3174 events. 1956/3174 cut-off events. For 6919/6940 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 16401 event pairs, 603 based on Foata normal form. 2/3168 useless extension candidates. Maximal degree in co-relation 12504. Up to 1542 conditions per place. [2023-01-28 00:43:07,806 INFO L137 encePairwiseOnDemand]: 239/242 looper letters, 46 selfloop transitions, 1 changer transitions 49/98 dead transitions. [2023-01-28 00:43:07,807 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 98 transitions, 791 flow [2023-01-28 00:43:07,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 00:43:07,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 00:43:07,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 499 transitions. [2023-01-28 00:43:07,808 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.515495867768595 [2023-01-28 00:43:07,808 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 499 transitions. [2023-01-28 00:43:07,808 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 499 transitions. [2023-01-28 00:43:07,808 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:43:07,808 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 499 transitions. [2023-01-28 00:43:07,809 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 124.75) internal successors, (499), 4 states have internal predecessors, (499), 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-28 00:43:07,810 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 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-28 00:43:07,810 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 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-28 00:43:07,810 INFO L175 Difference]: Start difference. First operand has 86 places, 58 transitions, 371 flow. Second operand 4 states and 499 transitions. [2023-01-28 00:43:07,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 98 transitions, 791 flow [2023-01-28 00:43:07,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 98 transitions, 722 flow, removed 28 selfloop flow, removed 10 redundant places. [2023-01-28 00:43:07,838 INFO L231 Difference]: Finished difference. Result has 70 places, 45 transitions, 253 flow [2023-01-28 00:43:07,838 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=323, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=253, PETRI_PLACES=70, PETRI_TRANSITIONS=45} [2023-01-28 00:43:07,839 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 27 predicate places. [2023-01-28 00:43:07,839 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 45 transitions, 253 flow [2023-01-28 00:43:07,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 118.5) internal successors, (474), 4 states have internal predecessors, (474), 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-28 00:43:07,839 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:43:07,839 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:43:07,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-01-28 00:43:07,839 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 00:43:07,840 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:43:07,840 INFO L85 PathProgramCache]: Analyzing trace with hash 398974387, now seen corresponding path program 4 times [2023-01-28 00:43:07,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:43:07,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900564768] [2023-01-28 00:43:07,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:43:07,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:43:07,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:43:08,362 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-28 00:43:08,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:43:08,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900564768] [2023-01-28 00:43:08,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900564768] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:43:08,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:43:08,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-28 00:43:08,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735579581] [2023-01-28 00:43:08,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:43:08,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-01-28 00:43:08,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:43:08,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-01-28 00:43:08,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-01-28 00:43:08,364 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 242 [2023-01-28 00:43:08,364 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 45 transitions, 253 flow. Second operand has 8 states, 8 states have (on average 109.125) internal successors, (873), 8 states have internal predecessors, (873), 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-28 00:43:08,364 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:43:08,364 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 242 [2023-01-28 00:43:08,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:43:08,573 INFO L130 PetriNetUnfolder]: 588/990 cut-off events. [2023-01-28 00:43:08,573 INFO L131 PetriNetUnfolder]: For 1609/1621 co-relation queries the response was YES. [2023-01-28 00:43:08,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3677 conditions, 990 events. 588/990 cut-off events. For 1609/1621 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 4143 event pairs, 82 based on Foata normal form. 13/1003 useless extension candidates. Maximal degree in co-relation 3653. Up to 427 conditions per place. [2023-01-28 00:43:08,576 INFO L137 encePairwiseOnDemand]: 235/242 looper letters, 72 selfloop transitions, 6 changer transitions 31/112 dead transitions. [2023-01-28 00:43:08,576 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 112 transitions, 810 flow [2023-01-28 00:43:08,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 00:43:08,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 00:43:08,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 806 transitions. [2023-01-28 00:43:08,578 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4757969303423849 [2023-01-28 00:43:08,578 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 806 transitions. [2023-01-28 00:43:08,578 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 806 transitions. [2023-01-28 00:43:08,578 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:43:08,578 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 806 transitions. [2023-01-28 00:43:08,579 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 115.14285714285714) internal successors, (806), 7 states have internal predecessors, (806), 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-28 00:43:08,581 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 242.0) internal successors, (1936), 8 states have internal predecessors, (1936), 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-28 00:43:08,581 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 242.0) internal successors, (1936), 8 states have internal predecessors, (1936), 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-28 00:43:08,581 INFO L175 Difference]: Start difference. First operand has 70 places, 45 transitions, 253 flow. Second operand 7 states and 806 transitions. [2023-01-28 00:43:08,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 112 transitions, 810 flow [2023-01-28 00:43:08,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 112 transitions, 759 flow, removed 11 selfloop flow, removed 10 redundant places. [2023-01-28 00:43:08,587 INFO L231 Difference]: Finished difference. Result has 68 places, 45 transitions, 236 flow [2023-01-28 00:43:08,588 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=236, PETRI_PLACES=68, PETRI_TRANSITIONS=45} [2023-01-28 00:43:08,588 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 25 predicate places. [2023-01-28 00:43:08,588 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 45 transitions, 236 flow [2023-01-28 00:43:08,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 109.125) internal successors, (873), 8 states have internal predecessors, (873), 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-28 00:43:08,589 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:43:08,589 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:43:08,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-01-28 00:43:08,589 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 00:43:08,589 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:43:08,589 INFO L85 PathProgramCache]: Analyzing trace with hash 737174925, now seen corresponding path program 5 times [2023-01-28 00:43:08,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:43:08,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210690642] [2023-01-28 00:43:08,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:43:08,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:43:08,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 00:43:08,625 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-28 00:43:08,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 00:43:08,703 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-28 00:43:08,704 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-28 00:43:08,706 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-01-28 00:43:08,707 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-01-28 00:43:08,708 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-01-28 00:43:08,710 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-01-28 00:43:08,710 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-01-28 00:43:08,710 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-01-28 00:43:08,710 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-01-28 00:43:08,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-01-28 00:43:08,710 INFO L445 BasicCegarLoop]: Path program histogram: [5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:43:08,715 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-28 00:43:08,715 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-28 00:43:08,783 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 12:43:08 BasicIcfg [2023-01-28 00:43:08,783 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-28 00:43:08,783 INFO L158 Benchmark]: Toolchain (without parser) took 31734.55ms. Allocated memory was 388.0MB in the beginning and 4.8GB in the end (delta: 4.4GB). Free memory was 342.3MB in the beginning and 3.2GB in the end (delta: -2.9GB). Peak memory consumption was 1.5GB. Max. memory is 16.0GB. [2023-01-28 00:43:08,784 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 388.0MB. Free memory is still 334.4MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-28 00:43:08,784 INFO L158 Benchmark]: CACSL2BoogieTranslator took 359.36ms. Allocated memory is still 388.0MB. Free memory was 342.3MB in the beginning and 318.0MB in the end (delta: 24.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. [2023-01-28 00:43:08,784 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.37ms. Allocated memory is still 388.0MB. Free memory was 318.0MB in the beginning and 315.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 00:43:08,784 INFO L158 Benchmark]: Boogie Preprocessor took 35.80ms. Allocated memory is still 388.0MB. Free memory was 315.9MB in the beginning and 313.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 00:43:08,784 INFO L158 Benchmark]: RCFGBuilder took 515.57ms. Allocated memory is still 388.0MB. Free memory was 313.8MB in the beginning and 273.3MB in the end (delta: 40.5MB). Peak memory consumption was 39.8MB. Max. memory is 16.0GB. [2023-01-28 00:43:08,789 INFO L158 Benchmark]: TraceAbstraction took 30758.26ms. Allocated memory was 388.0MB in the beginning and 4.8GB in the end (delta: 4.4GB). Free memory was 272.5MB in the beginning and 3.2GB in the end (delta: -3.0GB). Peak memory consumption was 1.4GB. Max. memory is 16.0GB. [2023-01-28 00:43:08,790 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.09ms. Allocated memory is still 388.0MB. Free memory is still 334.4MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 359.36ms. Allocated memory is still 388.0MB. Free memory was 342.3MB in the beginning and 318.0MB in the end (delta: 24.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 61.37ms. Allocated memory is still 388.0MB. Free memory was 318.0MB in the beginning and 315.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 35.80ms. Allocated memory is still 388.0MB. Free memory was 315.9MB in the beginning and 313.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 515.57ms. Allocated memory is still 388.0MB. Free memory was 313.8MB in the beginning and 273.3MB in the end (delta: 40.5MB). Peak memory consumption was 39.8MB. Max. memory is 16.0GB. * TraceAbstraction took 30758.26ms. Allocated memory was 388.0MB in the beginning and 4.8GB in the end (delta: 4.4GB). Free memory was 272.5MB in the beginning and 3.2GB in the end (delta: -3.0GB). Peak memory consumption was 1.4GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.2s, 139 PlacesBefore, 43 PlacesAfterwards, 128 TransitionsBefore, 31 TransitionsAfterwards, 3270 CoEnabledTransitionPairs, 6 FixpointIterations, 43 TrivialSequentialCompositions, 57 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 110 TotalNumberOfCompositions, 8670 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3431, independent: 3211, independent conditional: 0, independent unconditional: 3211, dependent: 220, dependent conditional: 0, dependent unconditional: 220, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1766, independent: 1718, independent conditional: 0, independent unconditional: 1718, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3431, independent: 1493, independent conditional: 0, independent unconditional: 1493, dependent: 172, dependent conditional: 0, dependent unconditional: 172, unknown: 1766, unknown conditional: 0, unknown unconditional: 1766] , Statistics on independence cache: Total cache size (in pairs): 169, Positive cache size: 148, Positive conditional cache size: 0, Positive unconditional cache size: 148, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L720] 0 int b = 0; [L721] 0 _Bool b$flush_delayed; [L722] 0 int b$mem_tmp; [L723] 0 _Bool b$r_buff0_thd0; [L724] 0 _Bool b$r_buff0_thd1; [L725] 0 _Bool b$r_buff0_thd2; [L726] 0 _Bool b$r_buff0_thd3; [L727] 0 _Bool b$r_buff0_thd4; [L728] 0 _Bool b$r_buff1_thd0; [L729] 0 _Bool b$r_buff1_thd1; [L730] 0 _Bool b$r_buff1_thd2; [L731] 0 _Bool b$r_buff1_thd3; [L732] 0 _Bool b$r_buff1_thd4; [L733] 0 _Bool b$read_delayed; [L734] 0 int *b$read_delayed_var; [L735] 0 int b$w_buff0; [L736] 0 _Bool b$w_buff0_used; [L737] 0 int b$w_buff1; [L738] 0 _Bool b$w_buff1_used; [L739] 0 _Bool main$tmp_guard0; [L740] 0 _Bool main$tmp_guard1; [L742] 0 int x = 0; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L869] 0 pthread_t t1217; [L870] FCALL, FORK 0 pthread_create(&t1217, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1217, ((void *)0), P0, ((void *)0))=-3, t1217={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L871] 0 pthread_t t1218; [L872] FCALL, FORK 0 pthread_create(&t1218, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1218, ((void *)0), P1, ((void *)0))=-2, t1217={5:0}, t1218={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L873] 0 pthread_t t1219; [L874] FCALL, FORK 0 pthread_create(&t1219, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1219, ((void *)0), P2, ((void *)0))=-1, t1217={5:0}, t1218={6:0}, t1219={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L875] 0 pthread_t t1220; [L876] FCALL, FORK 0 pthread_create(&t1220, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1220, ((void *)0), P3, ((void *)0))=0, t1217={5:0}, t1218={6:0}, t1219={7:0}, t1220={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L752] 1 b$w_buff1 = b$w_buff0 [L753] 1 b$w_buff0 = 1 [L754] 1 b$w_buff1_used = b$w_buff0_used [L755] 1 b$w_buff0_used = (_Bool)1 [L756] CALL 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L756] RET 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L757] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L758] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L759] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L760] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L761] 1 b$r_buff1_thd4 = b$r_buff0_thd4 [L762] 1 b$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L765] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L782] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L785] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L788] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L789] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L790] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L791] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L792] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 2 return 0; [L802] 3 y = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L805] 3 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1] [L808] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L809] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L810] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L811] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L812] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1] [L822] 4 z = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2] [L825] 4 a = 1 [L828] 4 __unbuffered_p3_EAX = a VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2] [L831] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 4 b$flush_delayed = weak$$choice2 [L834] 4 b$mem_tmp = b [L835] 4 b = !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L836] 4 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L837] 4 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L838] 4 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L839] 4 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L840] 4 b$r_buff0_thd4 = weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L841] 4 b$r_buff1_thd4 = weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] 4 __unbuffered_p3_EBX = b [L843] 4 b = b$flush_delayed ? b$mem_tmp : b [L844] 4 b$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z=2] [L847] 4 b = b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L848] 4 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L849] 4 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L850] 4 b$r_buff0_thd4 = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L851] 4 b$r_buff1_thd4 = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z=2] [L768] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L769] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L770] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L771] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L772] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z=2] [L775] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 1 return 0; [L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L817] 3 return 0; [L854] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L856] 4 return 0; [L878] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L880] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L880] RET 0 assume_abort_if_not(main$tmp_guard0) [L882] 0 b = b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L883] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L884] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L885] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L886] 0 b$r_buff1_thd0 = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1217={5:0}, t1218={6:0}, t1219={7:0}, t1220={3:0}, weak$$choice2=0, x=1, y=2, z=2] [L889] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L891] 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}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z=2] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 874]: 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: 876]: 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: 872]: 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: 870]: 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 9 procedures, 170 locations, 7 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: 30.6s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 22.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 662 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 662 mSDsluCounter, 22 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10 mSDsCounter, 89 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2143 IncrementalHoareTripleChecker+Invalid, 2232 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 89 mSolverCounterUnsat, 12 mSDtfsCounter, 2143 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=634occurred in iteration=11, InterpolantAutomatonStates: 83, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 314 NumberOfCodeBlocks, 314 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 271 ConstructedInterpolants, 0 QuantifiedInterpolants, 1967 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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-28 00:43:08,821 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...