/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix018_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-27 18:08:04,201 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-27 18:08:04,202 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-27 18:08:04,223 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-27 18:08:04,223 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-27 18:08:04,224 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-27 18:08:04,225 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-27 18:08:04,226 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-27 18:08:04,227 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-27 18:08:04,227 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-27 18:08:04,228 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-27 18:08:04,229 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-27 18:08:04,229 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-27 18:08:04,230 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-27 18:08:04,231 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-27 18:08:04,231 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-27 18:08:04,232 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-27 18:08:04,240 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-27 18:08:04,242 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-27 18:08:04,244 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-27 18:08:04,244 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-27 18:08:04,248 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-27 18:08:04,249 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-27 18:08:04,249 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-27 18:08:04,251 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-27 18:08:04,251 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-27 18:08:04,251 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-27 18:08:04,252 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-27 18:08:04,252 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-27 18:08:04,253 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-27 18:08:04,253 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-27 18:08:04,253 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-27 18:08:04,254 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-27 18:08:04,254 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-27 18:08:04,255 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-27 18:08:04,255 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-27 18:08:04,256 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-27 18:08:04,256 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-27 18:08:04,256 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-27 18:08:04,265 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-27 18:08:04,266 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-27 18:08:04,267 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-01-27 18:08:04,285 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-27 18:08:04,286 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-27 18:08:04,286 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-27 18:08:04,286 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-27 18:08:04,287 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-27 18:08:04,287 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-27 18:08:04,287 INFO L138 SettingsManager]: * Use SBE=true [2023-01-27 18:08:04,287 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-27 18:08:04,287 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-27 18:08:04,287 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-27 18:08:04,287 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-27 18:08:04,287 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-27 18:08:04,287 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-27 18:08:04,287 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-27 18:08:04,287 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-27 18:08:04,287 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-27 18:08:04,288 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-27 18:08:04,288 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-27 18:08:04,288 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-27 18:08:04,288 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-27 18:08:04,288 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-27 18:08:04,288 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-27 18:08:04,288 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-27 18:08:04,288 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 18:08:04,288 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-27 18:08:04,290 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-27 18:08:04,290 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-27 18:08:04,291 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-27 18:08:04,291 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-27 18:08:04,291 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-27 18:08:04,291 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-27 18:08:04,291 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-01-27 18:08:04,479 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-27 18:08:04,508 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-27 18:08:04,510 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-27 18:08:04,511 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-27 18:08:04,511 INFO L275 PluginConnector]: CDTParser initialized [2023-01-27 18:08:04,512 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix018_tso.oepc.i [2023-01-27 18:08:05,597 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-27 18:08:05,788 INFO L351 CDTParser]: Found 1 translation units. [2023-01-27 18:08:05,788 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix018_tso.oepc.i [2023-01-27 18:08:05,804 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba5f13711/2bcf7251e1eb438988ab4d5a63ec61cb/FLAGec5e59df6 [2023-01-27 18:08:05,817 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba5f13711/2bcf7251e1eb438988ab4d5a63ec61cb [2023-01-27 18:08:05,819 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-27 18:08:05,821 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-27 18:08:05,822 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-27 18:08:05,822 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-27 18:08:05,825 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-27 18:08:05,826 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 06:08:05" (1/1) ... [2023-01-27 18:08:05,827 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1284853 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:08:05, skipping insertion in model container [2023-01-27 18:08:05,829 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 06:08:05" (1/1) ... [2023-01-27 18:08:05,834 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-27 18:08:05,879 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-27 18:08:05,970 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/mix018_tso.oepc.i[949,962] [2023-01-27 18:08:06,074 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 18:08:06,081 INFO L203 MainTranslator]: Completed pre-run [2023-01-27 18:08:06,088 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/mix018_tso.oepc.i[949,962] [2023-01-27 18:08:06,117 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 18:08:06,135 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-27 18:08:06,135 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-27 18:08:06,139 INFO L208 MainTranslator]: Completed translation [2023-01-27 18:08:06,140 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:08:06 WrapperNode [2023-01-27 18:08:06,140 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-27 18:08:06,141 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-27 18:08:06,141 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-27 18:08:06,141 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-27 18:08:06,145 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:08:06" (1/1) ... [2023-01-27 18:08:06,156 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:08:06" (1/1) ... [2023-01-27 18:08:06,174 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 162 [2023-01-27 18:08:06,175 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-27 18:08:06,175 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-27 18:08:06,175 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-27 18:08:06,175 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-27 18:08:06,182 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:08:06" (1/1) ... [2023-01-27 18:08:06,182 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:08:06" (1/1) ... [2023-01-27 18:08:06,184 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:08:06" (1/1) ... [2023-01-27 18:08:06,184 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:08:06" (1/1) ... [2023-01-27 18:08:06,189 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:08:06" (1/1) ... [2023-01-27 18:08:06,191 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:08:06" (1/1) ... [2023-01-27 18:08:06,192 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:08:06" (1/1) ... [2023-01-27 18:08:06,193 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:08:06" (1/1) ... [2023-01-27 18:08:06,195 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-27 18:08:06,196 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-27 18:08:06,196 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-27 18:08:06,196 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-27 18:08:06,196 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:08:06" (1/1) ... [2023-01-27 18:08:06,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 18:08:06,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 18:08:06,234 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-01-27 18:08:06,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-01-27 18:08:06,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-27 18:08:06,350 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-27 18:08:06,351 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-27 18:08:06,351 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-27 18:08:06,351 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-27 18:08:06,351 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-01-27 18:08:06,351 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-01-27 18:08:06,352 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-01-27 18:08:06,352 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-01-27 18:08:06,352 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-01-27 18:08:06,352 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-01-27 18:08:06,352 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-01-27 18:08:06,352 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-01-27 18:08:06,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-27 18:08:06,353 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-27 18:08:06,353 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-27 18:08:06,353 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-27 18:08:06,354 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-01-27 18:08:06,451 INFO L236 CfgBuilder]: Building ICFG [2023-01-27 18:08:06,452 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-27 18:08:06,717 INFO L277 CfgBuilder]: Performing block encoding [2023-01-27 18:08:06,824 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-27 18:08:06,824 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-01-27 18:08:06,828 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 06:08:06 BoogieIcfgContainer [2023-01-27 18:08:06,828 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-27 18:08:06,829 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-27 18:08:06,830 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-27 18:08:06,832 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-27 18:08:06,832 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 06:08:05" (1/3) ... [2023-01-27 18:08:06,832 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32083f6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 06:08:06, skipping insertion in model container [2023-01-27 18:08:06,832 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:08:06" (2/3) ... [2023-01-27 18:08:06,833 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32083f6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 06:08:06, skipping insertion in model container [2023-01-27 18:08:06,833 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 06:08:06" (3/3) ... [2023-01-27 18:08:06,834 INFO L112 eAbstractionObserver]: Analyzing ICFG mix018_tso.oepc.i [2023-01-27 18:08:06,847 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-27 18:08:06,848 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-01-27 18:08:06,848 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-27 18:08:06,915 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-27 18:08:06,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 142 places, 131 transitions, 282 flow [2023-01-27 18:08:07,000 INFO L130 PetriNetUnfolder]: 2/127 cut-off events. [2023-01-27 18:08:07,000 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:08:07,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 127 events. 2/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 68 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 88. Up to 2 conditions per place. [2023-01-27 18:08:07,009 INFO L82 GeneralOperation]: Start removeDead. Operand has 142 places, 131 transitions, 282 flow [2023-01-27 18:08:07,013 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 138 places, 127 transitions, 266 flow [2023-01-27 18:08:07,016 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-27 18:08:07,026 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 138 places, 127 transitions, 266 flow [2023-01-27 18:08:07,028 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 138 places, 127 transitions, 266 flow [2023-01-27 18:08:07,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 127 transitions, 266 flow [2023-01-27 18:08:07,052 INFO L130 PetriNetUnfolder]: 2/127 cut-off events. [2023-01-27 18:08:07,052 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:08:07,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 127 events. 2/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 68 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 88. Up to 2 conditions per place. [2023-01-27 18:08:07,054 INFO L119 LiptonReduction]: Number of co-enabled transitions 3150 [2023-01-27 18:08:10,379 INFO L134 LiptonReduction]: Checked pairs total: 9485 [2023-01-27 18:08:10,379 INFO L136 LiptonReduction]: Total number of compositions: 106 [2023-01-27 18:08:10,389 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-27 18:08:10,394 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;@4cf98c6, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-27 18:08:10,394 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-01-27 18:08:10,397 INFO L130 PetriNetUnfolder]: 0/6 cut-off events. [2023-01-27 18:08:10,397 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:08:10,397 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:08:10,398 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-01-27 18:08:10,398 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:08:10,401 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:08:10,402 INFO L85 PathProgramCache]: Analyzing trace with hash 525331520, now seen corresponding path program 1 times [2023-01-27 18:08:10,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:08:10,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875262356] [2023-01-27 18:08:10,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:08:10,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:08:10,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:08:10,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:08:10,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:08:10,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875262356] [2023-01-27 18:08:10,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875262356] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:08:10,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:08:10,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-27 18:08:10,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183966547] [2023-01-27 18:08:10,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:08:10,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-27 18:08:10,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:08:10,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-27 18:08:10,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-27 18:08:10,691 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 237 [2023-01-27 18:08:10,693 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 33 transitions, 78 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-27 18:08:10,694 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:08:10,694 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 237 [2023-01-27 18:08:10,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:08:11,565 INFO L130 PetriNetUnfolder]: 5463/7946 cut-off events. [2023-01-27 18:08:11,566 INFO L131 PetriNetUnfolder]: For 76/76 co-relation queries the response was YES. [2023-01-27 18:08:11,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15546 conditions, 7946 events. 5463/7946 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 422. Compared 47748 event pairs, 1005 based on Foata normal form. 256/7609 useless extension candidates. Maximal degree in co-relation 15534. Up to 5923 conditions per place. [2023-01-27 18:08:11,603 INFO L137 encePairwiseOnDemand]: 233/237 looper letters, 39 selfloop transitions, 2 changer transitions 4/50 dead transitions. [2023-01-27 18:08:11,603 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 50 transitions, 208 flow [2023-01-27 18:08:11,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 18:08:11,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 18:08:11,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 393 transitions. [2023-01-27 18:08:11,613 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5527426160337553 [2023-01-27 18:08:11,613 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 393 transitions. [2023-01-27 18:08:11,613 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 393 transitions. [2023-01-27 18:08:11,614 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:08:11,616 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 393 transitions. [2023-01-27 18:08:11,619 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:08:11,622 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 237.0) internal successors, (948), 4 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:08:11,623 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 237.0) internal successors, (948), 4 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:08:11,624 INFO L175 Difference]: Start difference. First operand has 45 places, 33 transitions, 78 flow. Second operand 3 states and 393 transitions. [2023-01-27 18:08:11,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 50 transitions, 208 flow [2023-01-27 18:08:11,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 50 transitions, 202 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-01-27 18:08:11,628 INFO L231 Difference]: Finished difference. Result has 42 places, 29 transitions, 70 flow [2023-01-27 18:08:11,629 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=42, PETRI_TRANSITIONS=29} [2023-01-27 18:08:11,632 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -3 predicate places. [2023-01-27 18:08:11,632 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 29 transitions, 70 flow [2023-01-27 18:08:11,632 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-27 18:08:11,632 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:08:11,632 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:08:11,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-27 18:08:11,633 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:08:11,633 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:08:11,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1984922790, now seen corresponding path program 1 times [2023-01-27 18:08:11,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:08:11,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429906180] [2023-01-27 18:08:11,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:08:11,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:08:11,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:08:12,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:08:12,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:08:12,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429906180] [2023-01-27 18:08:12,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429906180] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:08:12,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:08:12,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 18:08:12,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991582993] [2023-01-27 18:08:12,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:08:12,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 18:08:12,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:08:12,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 18:08:12,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-27 18:08:12,466 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 237 [2023-01-27 18:08:12,467 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 70 flow. Second operand has 5 states, 5 states have (on average 102.4) internal successors, (512), 5 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:08:12,467 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:08:12,467 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 237 [2023-01-27 18:08:12,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:08:14,008 INFO L130 PetriNetUnfolder]: 13697/18490 cut-off events. [2023-01-27 18:08:14,009 INFO L131 PetriNetUnfolder]: For 940/940 co-relation queries the response was YES. [2023-01-27 18:08:14,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38244 conditions, 18490 events. 13697/18490 cut-off events. For 940/940 co-relation queries the response was YES. Maximal size of possible extension queue 559. Compared 94665 event pairs, 2277 based on Foata normal form. 776/19266 useless extension candidates. Maximal degree in co-relation 38234. Up to 15071 conditions per place. [2023-01-27 18:08:14,095 INFO L137 encePairwiseOnDemand]: 226/237 looper letters, 58 selfloop transitions, 10 changer transitions 42/110 dead transitions. [2023-01-27 18:08:14,095 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 110 transitions, 474 flow [2023-01-27 18:08:14,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 18:08:14,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 18:08:14,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 813 transitions. [2023-01-27 18:08:14,099 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49005424954792043 [2023-01-27 18:08:14,099 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 813 transitions. [2023-01-27 18:08:14,099 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 813 transitions. [2023-01-27 18:08:14,100 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:08:14,100 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 813 transitions. [2023-01-27 18:08:14,102 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 116.14285714285714) internal successors, (813), 7 states have internal predecessors, (813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:08:14,106 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 237.0) internal successors, (1896), 8 states have internal predecessors, (1896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:08:14,106 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 237.0) internal successors, (1896), 8 states have internal predecessors, (1896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:08:14,107 INFO L175 Difference]: Start difference. First operand has 42 places, 29 transitions, 70 flow. Second operand 7 states and 813 transitions. [2023-01-27 18:08:14,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 110 transitions, 474 flow [2023-01-27 18:08:14,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 110 transitions, 460 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-27 18:08:14,110 INFO L231 Difference]: Finished difference. Result has 49 places, 38 transitions, 155 flow [2023-01-27 18:08:14,110 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, 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=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=155, PETRI_PLACES=49, PETRI_TRANSITIONS=38} [2023-01-27 18:08:14,112 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 4 predicate places. [2023-01-27 18:08:14,112 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 38 transitions, 155 flow [2023-01-27 18:08:14,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 102.4) internal successors, (512), 5 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:08:14,113 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:08:14,113 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:08:14,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-27 18:08:14,114 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:08:14,115 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:08:14,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1403056288, now seen corresponding path program 1 times [2023-01-27 18:08:14,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:08:14,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825876818] [2023-01-27 18:08:14,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:08:14,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:08:14,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:08:14,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:08:14,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:08:14,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825876818] [2023-01-27 18:08:14,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825876818] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:08:14,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:08:14,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 18:08:14,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125946335] [2023-01-27 18:08:14,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:08:14,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 18:08:14,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:08:14,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 18:08:14,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-27 18:08:14,446 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 237 [2023-01-27 18:08:14,446 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 38 transitions, 155 flow. Second operand has 5 states, 5 states have (on average 100.6) internal successors, (503), 5 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:08:14,447 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:08:14,447 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 237 [2023-01-27 18:08:14,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:08:15,673 INFO L130 PetriNetUnfolder]: 12058/16301 cut-off events. [2023-01-27 18:08:15,673 INFO L131 PetriNetUnfolder]: For 11775/11775 co-relation queries the response was YES. [2023-01-27 18:08:15,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47497 conditions, 16301 events. 12058/16301 cut-off events. For 11775/11775 co-relation queries the response was YES. Maximal size of possible extension queue 471. Compared 77418 event pairs, 2994 based on Foata normal form. 678/16979 useless extension candidates. Maximal degree in co-relation 47482. Up to 10149 conditions per place. [2023-01-27 18:08:15,757 INFO L137 encePairwiseOnDemand]: 233/237 looper letters, 55 selfloop transitions, 3 changer transitions 30/88 dead transitions. [2023-01-27 18:08:15,757 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 88 transitions, 520 flow [2023-01-27 18:08:15,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 18:08:15,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 18:08:15,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 565 transitions. [2023-01-27 18:08:15,759 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4767932489451477 [2023-01-27 18:08:15,759 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 565 transitions. [2023-01-27 18:08:15,759 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 565 transitions. [2023-01-27 18:08:15,759 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:08:15,759 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 565 transitions. [2023-01-27 18:08:15,760 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 113.0) internal successors, (565), 5 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:08:15,762 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 237.0) internal successors, (1422), 6 states have internal predecessors, (1422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:08:15,763 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 237.0) internal successors, (1422), 6 states have internal predecessors, (1422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:08:15,763 INFO L175 Difference]: Start difference. First operand has 49 places, 38 transitions, 155 flow. Second operand 5 states and 565 transitions. [2023-01-27 18:08:15,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 88 transitions, 520 flow [2023-01-27 18:08:15,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 88 transitions, 518 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-01-27 18:08:15,860 INFO L231 Difference]: Finished difference. Result has 52 places, 38 transitions, 168 flow [2023-01-27 18:08:15,861 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=168, PETRI_PLACES=52, PETRI_TRANSITIONS=38} [2023-01-27 18:08:15,862 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 7 predicate places. [2023-01-27 18:08:15,864 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 38 transitions, 168 flow [2023-01-27 18:08:15,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 100.6) internal successors, (503), 5 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:08:15,864 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:08:15,864 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:08:15,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-27 18:08:15,865 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:08:15,865 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:08:15,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1493290429, now seen corresponding path program 1 times [2023-01-27 18:08:15,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:08:15,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525223971] [2023-01-27 18:08:15,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:08:15,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:08:15,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:08:16,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:08:16,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:08:16,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525223971] [2023-01-27 18:08:16,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525223971] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:08:16,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:08:16,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-27 18:08:16,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016285740] [2023-01-27 18:08:16,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:08:16,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-27 18:08:16,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:08:16,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-27 18:08:16,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-01-27 18:08:16,570 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 237 [2023-01-27 18:08:16,571 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 38 transitions, 168 flow. Second operand has 7 states, 7 states have (on average 100.14285714285714) internal successors, (701), 7 states have internal predecessors, (701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:08:16,571 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:08:16,571 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 237 [2023-01-27 18:08:16,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:08:18,349 INFO L130 PetriNetUnfolder]: 12734/17197 cut-off events. [2023-01-27 18:08:18,350 INFO L131 PetriNetUnfolder]: For 22771/22771 co-relation queries the response was YES. [2023-01-27 18:08:18,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51493 conditions, 17197 events. 12734/17197 cut-off events. For 22771/22771 co-relation queries the response was YES. Maximal size of possible extension queue 489. Compared 86385 event pairs, 1599 based on Foata normal form. 494/17691 useless extension candidates. Maximal degree in co-relation 51474. Up to 12824 conditions per place. [2023-01-27 18:08:18,461 INFO L137 encePairwiseOnDemand]: 223/237 looper letters, 80 selfloop transitions, 22 changer transitions 37/139 dead transitions. [2023-01-27 18:08:18,461 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 139 transitions, 841 flow [2023-01-27 18:08:18,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-27 18:08:18,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-01-27 18:08:18,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 913 transitions. [2023-01-27 18:08:18,464 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48154008438818563 [2023-01-27 18:08:18,464 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 913 transitions. [2023-01-27 18:08:18,464 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 913 transitions. [2023-01-27 18:08:18,465 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:08:18,465 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 913 transitions. [2023-01-27 18:08:18,466 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 114.125) internal successors, (913), 8 states have internal predecessors, (913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:08:18,469 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 237.0) internal successors, (2133), 9 states have internal predecessors, (2133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:08:18,469 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 237.0) internal successors, (2133), 9 states have internal predecessors, (2133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:08:18,469 INFO L175 Difference]: Start difference. First operand has 52 places, 38 transitions, 168 flow. Second operand 8 states and 913 transitions. [2023-01-27 18:08:18,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 139 transitions, 841 flow [2023-01-27 18:08:18,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 139 transitions, 823 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-01-27 18:08:18,548 INFO L231 Difference]: Finished difference. Result has 58 places, 57 transitions, 382 flow [2023-01-27 18:08:18,549 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=382, PETRI_PLACES=58, PETRI_TRANSITIONS=57} [2023-01-27 18:08:18,549 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 13 predicate places. [2023-01-27 18:08:18,549 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 57 transitions, 382 flow [2023-01-27 18:08:18,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 100.14285714285714) internal successors, (701), 7 states have internal predecessors, (701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:08:18,550 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:08:18,550 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:08:18,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-27 18:08:18,550 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:08:18,550 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:08:18,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1173095407, now seen corresponding path program 1 times [2023-01-27 18:08:18,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:08:18,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78295297] [2023-01-27 18:08:18,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:08:18,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:08:18,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:08:18,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:08:18,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:08:18,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78295297] [2023-01-27 18:08:18,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78295297] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:08:18,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:08:18,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 18:08:18,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979420935] [2023-01-27 18:08:18,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:08:18,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-27 18:08:18,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:08:18,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-27 18:08:18,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-01-27 18:08:18,790 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 237 [2023-01-27 18:08:18,791 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 57 transitions, 382 flow. Second operand has 6 states, 6 states have (on average 111.5) internal successors, (669), 6 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:08:18,791 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:08:18,791 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 237 [2023-01-27 18:08:18,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:08:20,110 INFO L130 PetriNetUnfolder]: 10253/14382 cut-off events. [2023-01-27 18:08:20,110 INFO L131 PetriNetUnfolder]: For 52193/53936 co-relation queries the response was YES. [2023-01-27 18:08:20,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59720 conditions, 14382 events. 10253/14382 cut-off events. For 52193/53936 co-relation queries the response was YES. Maximal size of possible extension queue 614. Compared 81124 event pairs, 2156 based on Foata normal form. 456/14269 useless extension candidates. Maximal degree in co-relation 59698. Up to 9832 conditions per place. [2023-01-27 18:08:20,234 INFO L137 encePairwiseOnDemand]: 228/237 looper letters, 63 selfloop transitions, 15 changer transitions 18/110 dead transitions. [2023-01-27 18:08:20,234 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 110 transitions, 864 flow [2023-01-27 18:08:20,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-27 18:08:20,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-27 18:08:20,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 733 transitions. [2023-01-27 18:08:20,236 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5154711673699015 [2023-01-27 18:08:20,236 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 733 transitions. [2023-01-27 18:08:20,237 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 733 transitions. [2023-01-27 18:08:20,237 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:08:20,237 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 733 transitions. [2023-01-27 18:08:20,238 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 122.16666666666667) internal successors, (733), 6 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:08:20,240 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 237.0) internal successors, (1659), 7 states have internal predecessors, (1659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:08:20,240 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 237.0) internal successors, (1659), 7 states have internal predecessors, (1659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:08:20,240 INFO L175 Difference]: Start difference. First operand has 58 places, 57 transitions, 382 flow. Second operand 6 states and 733 transitions. [2023-01-27 18:08:20,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 110 transitions, 864 flow [2023-01-27 18:08:20,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 110 transitions, 841 flow, removed 10 selfloop flow, removed 2 redundant places. [2023-01-27 18:08:20,345 INFO L231 Difference]: Finished difference. Result has 61 places, 64 transitions, 474 flow [2023-01-27 18:08:20,345 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=361, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=474, PETRI_PLACES=61, PETRI_TRANSITIONS=64} [2023-01-27 18:08:20,347 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 16 predicate places. [2023-01-27 18:08:20,347 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 64 transitions, 474 flow [2023-01-27 18:08:20,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 111.5) internal successors, (669), 6 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:08:20,348 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:08:20,348 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:08:20,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-27 18:08:20,348 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:08:20,348 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:08:20,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1198638787, now seen corresponding path program 2 times [2023-01-27 18:08:20,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:08:20,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132287498] [2023-01-27 18:08:20,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:08:20,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:08:20,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:08:20,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:08:20,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:08:20,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132287498] [2023-01-27 18:08:20,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132287498] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:08:20,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:08:20,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 18:08:20,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693820758] [2023-01-27 18:08:20,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:08:20,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-27 18:08:20,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:08:20,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-27 18:08:20,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-01-27 18:08:20,773 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 237 [2023-01-27 18:08:20,773 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 64 transitions, 474 flow. Second operand has 6 states, 6 states have (on average 110.5) internal successors, (663), 6 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:08:20,773 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:08:20,773 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 237 [2023-01-27 18:08:20,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:08:22,150 INFO L130 PetriNetUnfolder]: 10434/14563 cut-off events. [2023-01-27 18:08:22,150 INFO L131 PetriNetUnfolder]: For 68661/70400 co-relation queries the response was YES. [2023-01-27 18:08:22,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65344 conditions, 14563 events. 10434/14563 cut-off events. For 68661/70400 co-relation queries the response was YES. Maximal size of possible extension queue 615. Compared 80680 event pairs, 2468 based on Foata normal form. 462/14440 useless extension candidates. Maximal degree in co-relation 65319. Up to 9937 conditions per place. [2023-01-27 18:08:22,251 INFO L137 encePairwiseOnDemand]: 229/237 looper letters, 62 selfloop transitions, 20 changer transitions 25/121 dead transitions. [2023-01-27 18:08:22,251 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 121 transitions, 1056 flow [2023-01-27 18:08:22,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 18:08:22,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 18:08:22,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 843 transitions. [2023-01-27 18:08:22,254 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5081374321880651 [2023-01-27 18:08:22,254 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 843 transitions. [2023-01-27 18:08:22,254 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 843 transitions. [2023-01-27 18:08:22,254 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:08:22,254 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 843 transitions. [2023-01-27 18:08:22,255 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 120.42857142857143) internal successors, (843), 7 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:08:22,257 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 237.0) internal successors, (1896), 8 states have internal predecessors, (1896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:08:22,258 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 237.0) internal successors, (1896), 8 states have internal predecessors, (1896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:08:22,258 INFO L175 Difference]: Start difference. First operand has 61 places, 64 transitions, 474 flow. Second operand 7 states and 843 transitions. [2023-01-27 18:08:22,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 121 transitions, 1056 flow [2023-01-27 18:08:22,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 121 transitions, 1025 flow, removed 11 selfloop flow, removed 4 redundant places. [2023-01-27 18:08:22,404 INFO L231 Difference]: Finished difference. Result has 65 places, 68 transitions, 578 flow [2023-01-27 18:08:22,404 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=452, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=578, PETRI_PLACES=65, PETRI_TRANSITIONS=68} [2023-01-27 18:08:22,406 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 20 predicate places. [2023-01-27 18:08:22,406 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 68 transitions, 578 flow [2023-01-27 18:08:22,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 110.5) internal successors, (663), 6 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:08:22,406 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:08:22,406 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:08:22,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-27 18:08:22,406 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:08:22,407 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:08:22,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1810368067, now seen corresponding path program 1 times [2023-01-27 18:08:22,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:08:22,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366788577] [2023-01-27 18:08:22,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:08:22,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:08:22,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:08:22,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:08:22,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:08:22,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366788577] [2023-01-27 18:08:22,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366788577] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:08:22,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:08:22,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 18:08:22,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494553806] [2023-01-27 18:08:22,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:08:22,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-27 18:08:22,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:08:22,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-27 18:08:22,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-01-27 18:08:22,876 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 237 [2023-01-27 18:08:22,877 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 68 transitions, 578 flow. Second operand has 6 states, 6 states have (on average 110.66666666666667) internal successors, (664), 6 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:08:22,877 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:08:22,877 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 237 [2023-01-27 18:08:22,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:08:24,433 INFO L130 PetriNetUnfolder]: 11926/16643 cut-off events. [2023-01-27 18:08:24,433 INFO L131 PetriNetUnfolder]: For 106168/107943 co-relation queries the response was YES. [2023-01-27 18:08:24,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80526 conditions, 16643 events. 11926/16643 cut-off events. For 106168/107943 co-relation queries the response was YES. Maximal size of possible extension queue 726. Compared 93795 event pairs, 2146 based on Foata normal form. 552/16596 useless extension candidates. Maximal degree in co-relation 80499. Up to 10343 conditions per place. [2023-01-27 18:08:24,697 INFO L137 encePairwiseOnDemand]: 228/237 looper letters, 87 selfloop transitions, 15 changer transitions 27/143 dead transitions. [2023-01-27 18:08:24,697 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 143 transitions, 1357 flow [2023-01-27 18:08:24,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-27 18:08:24,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-01-27 18:08:24,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 965 transitions. [2023-01-27 18:08:24,700 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5089662447257384 [2023-01-27 18:08:24,700 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 965 transitions. [2023-01-27 18:08:24,700 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 965 transitions. [2023-01-27 18:08:24,701 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:08:24,701 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 965 transitions. [2023-01-27 18:08:24,702 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 120.625) internal successors, (965), 8 states have internal predecessors, (965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:08:24,706 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 237.0) internal successors, (2133), 9 states have internal predecessors, (2133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:08:24,706 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 237.0) internal successors, (2133), 9 states have internal predecessors, (2133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:08:24,706 INFO L175 Difference]: Start difference. First operand has 65 places, 68 transitions, 578 flow. Second operand 8 states and 965 transitions. [2023-01-27 18:08:24,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 143 transitions, 1357 flow [2023-01-27 18:08:24,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 143 transitions, 1295 flow, removed 27 selfloop flow, removed 4 redundant places. [2023-01-27 18:08:24,969 INFO L231 Difference]: Finished difference. Result has 70 places, 75 transitions, 706 flow [2023-01-27 18:08:24,970 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=551, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=706, PETRI_PLACES=70, PETRI_TRANSITIONS=75} [2023-01-27 18:08:24,970 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 25 predicate places. [2023-01-27 18:08:24,970 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 75 transitions, 706 flow [2023-01-27 18:08:24,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 110.66666666666667) internal successors, (664), 6 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:08:24,971 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:08:24,971 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:08:24,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-27 18:08:24,971 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:08:24,971 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:08:24,971 INFO L85 PathProgramCache]: Analyzing trace with hash 916204621, now seen corresponding path program 1 times [2023-01-27 18:08:24,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:08:24,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753152797] [2023-01-27 18:08:24,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:08:24,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:08:24,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:08:25,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:08:25,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:08:25,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753152797] [2023-01-27 18:08:25,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753152797] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:08:25,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:08:25,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-27 18:08:25,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721055031] [2023-01-27 18:08:25,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:08:25,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-01-27 18:08:25,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:08:25,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-01-27 18:08:25,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-01-27 18:08:25,418 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 237 [2023-01-27 18:08:25,419 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 75 transitions, 706 flow. Second operand has 8 states, 8 states have (on average 100.125) internal successors, (801), 8 states have internal predecessors, (801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:08:25,420 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:08:25,420 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 237 [2023-01-27 18:08:25,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:08:27,435 INFO L130 PetriNetUnfolder]: 15181/20502 cut-off events. [2023-01-27 18:08:27,435 INFO L131 PetriNetUnfolder]: For 142425/142425 co-relation queries the response was YES. [2023-01-27 18:08:27,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103018 conditions, 20502 events. 15181/20502 cut-off events. For 142425/142425 co-relation queries the response was YES. Maximal size of possible extension queue 577. Compared 105136 event pairs, 1751 based on Foata normal form. 308/20810 useless extension candidates. Maximal degree in co-relation 102988. Up to 11393 conditions per place. [2023-01-27 18:08:27,556 INFO L137 encePairwiseOnDemand]: 228/237 looper letters, 89 selfloop transitions, 26 changer transitions 24/139 dead transitions. [2023-01-27 18:08:27,556 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 139 transitions, 1490 flow [2023-01-27 18:08:27,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 18:08:27,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 18:08:27,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 783 transitions. [2023-01-27 18:08:27,558 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4719710669077758 [2023-01-27 18:08:27,558 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 783 transitions. [2023-01-27 18:08:27,558 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 783 transitions. [2023-01-27 18:08:27,558 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:08:27,559 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 783 transitions. [2023-01-27 18:08:27,560 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 111.85714285714286) internal successors, (783), 7 states have internal predecessors, (783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:08:27,562 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 237.0) internal successors, (1896), 8 states have internal predecessors, (1896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:08:27,562 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 237.0) internal successors, (1896), 8 states have internal predecessors, (1896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:08:27,562 INFO L175 Difference]: Start difference. First operand has 70 places, 75 transitions, 706 flow. Second operand 7 states and 783 transitions. [2023-01-27 18:08:27,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 139 transitions, 1490 flow [2023-01-27 18:08:27,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 139 transitions, 1456 flow, removed 11 selfloop flow, removed 4 redundant places. [2023-01-27 18:08:27,788 INFO L231 Difference]: Finished difference. Result has 72 places, 79 transitions, 845 flow [2023-01-27 18:08:27,788 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=676, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=845, PETRI_PLACES=72, PETRI_TRANSITIONS=79} [2023-01-27 18:08:27,789 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 27 predicate places. [2023-01-27 18:08:27,789 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 79 transitions, 845 flow [2023-01-27 18:08:27,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 100.125) internal successors, (801), 8 states have internal predecessors, (801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:08:27,789 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:08:27,790 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:08:27,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-01-27 18:08:27,790 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:08:27,790 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:08:27,790 INFO L85 PathProgramCache]: Analyzing trace with hash 2086680806, now seen corresponding path program 1 times [2023-01-27 18:08:27,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:08:27,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410212115] [2023-01-27 18:08:27,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:08:27,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:08:27,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:08:27,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:08:27,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:08:27,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410212115] [2023-01-27 18:08:27,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410212115] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:08:27,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:08:27,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-27 18:08:27,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345649149] [2023-01-27 18:08:27,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:08:27,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-27 18:08:27,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:08:27,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-27 18:08:27,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-27 18:08:27,912 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 237 [2023-01-27 18:08:27,912 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 79 transitions, 845 flow. Second operand has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:08:27,912 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:08:27,912 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 237 [2023-01-27 18:08:27,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:08:28,846 INFO L130 PetriNetUnfolder]: 6954/9928 cut-off events. [2023-01-27 18:08:28,846 INFO L131 PetriNetUnfolder]: For 133753/137399 co-relation queries the response was YES. [2023-01-27 18:08:28,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59696 conditions, 9928 events. 6954/9928 cut-off events. For 133753/137399 co-relation queries the response was YES. Maximal size of possible extension queue 443. Compared 53992 event pairs, 1892 based on Foata normal form. 730/10136 useless extension candidates. Maximal degree in co-relation 59665. Up to 7243 conditions per place. [2023-01-27 18:08:29,101 INFO L137 encePairwiseOnDemand]: 231/237 looper letters, 102 selfloop transitions, 5 changer transitions 0/124 dead transitions. [2023-01-27 18:08:29,102 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 124 transitions, 1577 flow [2023-01-27 18:08:29,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 18:08:29,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 18:08:29,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 373 transitions. [2023-01-27 18:08:29,103 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5246132208157525 [2023-01-27 18:08:29,104 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 373 transitions. [2023-01-27 18:08:29,104 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 373 transitions. [2023-01-27 18:08:29,104 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:08:29,104 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 373 transitions. [2023-01-27 18:08:29,105 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:08:29,105 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 237.0) internal successors, (948), 4 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:08:29,106 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 237.0) internal successors, (948), 4 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:08:29,106 INFO L175 Difference]: Start difference. First operand has 72 places, 79 transitions, 845 flow. Second operand 3 states and 373 transitions. [2023-01-27 18:08:29,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 124 transitions, 1577 flow [2023-01-27 18:08:29,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 124 transitions, 1503 flow, removed 31 selfloop flow, removed 4 redundant places. [2023-01-27 18:08:29,163 INFO L231 Difference]: Finished difference. Result has 69 places, 83 transitions, 834 flow [2023-01-27 18:08:29,164 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=801, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=834, PETRI_PLACES=69, PETRI_TRANSITIONS=83} [2023-01-27 18:08:29,164 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 24 predicate places. [2023-01-27 18:08:29,164 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 83 transitions, 834 flow [2023-01-27 18:08:29,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:08:29,165 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:08:29,165 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:08:29,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-27 18:08:29,165 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:08:29,165 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:08:29,165 INFO L85 PathProgramCache]: Analyzing trace with hash 750499950, now seen corresponding path program 1 times [2023-01-27 18:08:29,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:08:29,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445528422] [2023-01-27 18:08:29,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:08:29,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:08:29,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:08:29,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:08:29,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:08:29,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445528422] [2023-01-27 18:08:29,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445528422] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:08:29,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:08:29,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 18:08:29,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654473156] [2023-01-27 18:08:29,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:08:29,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 18:08:29,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:08:29,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 18:08:29,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-27 18:08:29,291 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 237 [2023-01-27 18:08:29,291 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 83 transitions, 834 flow. Second operand has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:08:29,291 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:08:29,291 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 237 [2023-01-27 18:08:29,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:08:29,840 INFO L130 PetriNetUnfolder]: 3513/5283 cut-off events. [2023-01-27 18:08:29,840 INFO L131 PetriNetUnfolder]: For 49790/51494 co-relation queries the response was YES. [2023-01-27 18:08:29,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30509 conditions, 5283 events. 3513/5283 cut-off events. For 49790/51494 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 28250 event pairs, 820 based on Foata normal form. 636/5686 useless extension candidates. Maximal degree in co-relation 30479. Up to 2315 conditions per place. [2023-01-27 18:08:29,875 INFO L137 encePairwiseOnDemand]: 231/237 looper letters, 122 selfloop transitions, 9 changer transitions 0/145 dead transitions. [2023-01-27 18:08:29,876 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 145 transitions, 1797 flow [2023-01-27 18:08:29,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-27 18:08:29,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-27 18:08:29,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 499 transitions. [2023-01-27 18:08:29,897 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5263713080168776 [2023-01-27 18:08:29,897 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 499 transitions. [2023-01-27 18:08:29,897 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 499 transitions. [2023-01-27 18:08:29,897 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:08:29,897 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 499 transitions. [2023-01-27 18:08:29,898 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-27 18:08:29,899 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 237.0) internal successors, (1185), 5 states have internal predecessors, (1185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:08:29,899 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 237.0) internal successors, (1185), 5 states have internal predecessors, (1185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:08:29,899 INFO L175 Difference]: Start difference. First operand has 69 places, 83 transitions, 834 flow. Second operand 4 states and 499 transitions. [2023-01-27 18:08:29,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 145 transitions, 1797 flow [2023-01-27 18:08:29,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 145 transitions, 1771 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-27 18:08:29,949 INFO L231 Difference]: Finished difference. Result has 71 places, 77 transitions, 763 flow [2023-01-27 18:08:29,950 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=711, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=763, PETRI_PLACES=71, PETRI_TRANSITIONS=77} [2023-01-27 18:08:29,951 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 26 predicate places. [2023-01-27 18:08:29,951 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 77 transitions, 763 flow [2023-01-27 18:08:29,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:08:29,951 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:08:29,951 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:08:29,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-01-27 18:08:29,952 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:08:29,952 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:08:29,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1754834736, now seen corresponding path program 1 times [2023-01-27 18:08:29,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:08:29,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646142902] [2023-01-27 18:08:29,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:08:29,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:08:30,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:08:30,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:08:30,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:08:30,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646142902] [2023-01-27 18:08:30,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646142902] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:08:30,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:08:30,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 18:08:30,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597727846] [2023-01-27 18:08:30,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:08:30,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 18:08:30,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:08:30,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 18:08:30,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-01-27 18:08:30,145 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 237 [2023-01-27 18:08:30,145 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 77 transitions, 763 flow. Second operand has 5 states, 5 states have (on average 113.6) internal successors, (568), 5 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:08:30,145 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:08:30,145 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 237 [2023-01-27 18:08:30,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:08:30,570 INFO L130 PetriNetUnfolder]: 2696/4038 cut-off events. [2023-01-27 18:08:30,570 INFO L131 PetriNetUnfolder]: For 40482/41876 co-relation queries the response was YES. [2023-01-27 18:08:30,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24349 conditions, 4038 events. 2696/4038 cut-off events. For 40482/41876 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 21246 event pairs, 610 based on Foata normal form. 374/4221 useless extension candidates. Maximal degree in co-relation 24317. Up to 1718 conditions per place. [2023-01-27 18:08:30,595 INFO L137 encePairwiseOnDemand]: 231/237 looper letters, 130 selfloop transitions, 13 changer transitions 0/157 dead transitions. [2023-01-27 18:08:30,595 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 157 transitions, 1936 flow [2023-01-27 18:08:30,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 18:08:30,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 18:08:30,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 623 transitions. [2023-01-27 18:08:30,597 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5257383966244725 [2023-01-27 18:08:30,597 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 623 transitions. [2023-01-27 18:08:30,597 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 623 transitions. [2023-01-27 18:08:30,598 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:08:30,598 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 623 transitions. [2023-01-27 18:08:30,599 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 124.6) internal successors, (623), 5 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:08:30,600 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 237.0) internal successors, (1422), 6 states have internal predecessors, (1422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:08:30,601 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 237.0) internal successors, (1422), 6 states have internal predecessors, (1422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:08:30,601 INFO L175 Difference]: Start difference. First operand has 71 places, 77 transitions, 763 flow. Second operand 5 states and 623 transitions. [2023-01-27 18:08:30,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 157 transitions, 1936 flow [2023-01-27 18:08:30,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 157 transitions, 1851 flow, removed 17 selfloop flow, removed 4 redundant places. [2023-01-27 18:08:30,642 INFO L231 Difference]: Finished difference. Result has 72 places, 77 transitions, 749 flow [2023-01-27 18:08:30,642 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=681, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=749, PETRI_PLACES=72, PETRI_TRANSITIONS=77} [2023-01-27 18:08:30,644 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 27 predicate places. [2023-01-27 18:08:30,644 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 77 transitions, 749 flow [2023-01-27 18:08:30,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 113.6) internal successors, (568), 5 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:08:30,644 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:08:30,645 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] [2023-01-27 18:08:30,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-01-27 18:08:30,645 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:08:30,645 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:08:30,645 INFO L85 PathProgramCache]: Analyzing trace with hash -2020522005, now seen corresponding path program 1 times [2023-01-27 18:08:30,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:08:30,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369263213] [2023-01-27 18:08:30,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:08:30,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:08:30,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:08:30,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:08:30,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:08:30,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369263213] [2023-01-27 18:08:30,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369263213] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:08:30,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:08:30,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-27 18:08:30,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002295180] [2023-01-27 18:08:30,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:08:30,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-27 18:08:30,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:08:30,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-27 18:08:30,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-01-27 18:08:30,943 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 237 [2023-01-27 18:08:30,943 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 77 transitions, 749 flow. Second operand has 6 states, 6 states have (on average 100.16666666666667) internal successors, (601), 6 states have internal predecessors, (601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:08:30,943 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:08:30,943 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 237 [2023-01-27 18:08:30,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:08:31,798 INFO L130 PetriNetUnfolder]: 5036/7361 cut-off events. [2023-01-27 18:08:31,798 INFO L131 PetriNetUnfolder]: For 41868/41868 co-relation queries the response was YES. [2023-01-27 18:08:31,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41386 conditions, 7361 events. 5036/7361 cut-off events. For 41868/41868 co-relation queries the response was YES. Maximal size of possible extension queue 269. Compared 37151 event pairs, 903 based on Foata normal form. 14/7375 useless extension candidates. Maximal degree in co-relation 41355. Up to 4751 conditions per place. [2023-01-27 18:08:31,848 INFO L137 encePairwiseOnDemand]: 228/237 looper letters, 122 selfloop transitions, 14 changer transitions 73/209 dead transitions. [2023-01-27 18:08:31,848 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 209 transitions, 2372 flow [2023-01-27 18:08:31,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 18:08:31,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 18:08:31,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 777 transitions. [2023-01-27 18:08:31,850 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46835443037974683 [2023-01-27 18:08:31,850 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 777 transitions. [2023-01-27 18:08:31,850 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 777 transitions. [2023-01-27 18:08:31,851 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:08:31,851 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 777 transitions. [2023-01-27 18:08:31,852 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 111.0) internal successors, (777), 7 states have internal predecessors, (777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:08:31,853 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 237.0) internal successors, (1896), 8 states have internal predecessors, (1896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:08:31,854 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 237.0) internal successors, (1896), 8 states have internal predecessors, (1896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:08:31,854 INFO L175 Difference]: Start difference. First operand has 72 places, 77 transitions, 749 flow. Second operand 7 states and 777 transitions. [2023-01-27 18:08:31,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 209 transitions, 2372 flow [2023-01-27 18:08:31,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 209 transitions, 2282 flow, removed 22 selfloop flow, removed 3 redundant places. [2023-01-27 18:08:31,942 INFO L231 Difference]: Finished difference. Result has 80 places, 87 transitions, 888 flow [2023-01-27 18:08:31,942 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=715, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=888, PETRI_PLACES=80, PETRI_TRANSITIONS=87} [2023-01-27 18:08:31,942 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 35 predicate places. [2023-01-27 18:08:31,942 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 87 transitions, 888 flow [2023-01-27 18:08:31,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 100.16666666666667) internal successors, (601), 6 states have internal predecessors, (601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:08:31,943 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:08:31,943 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] [2023-01-27 18:08:31,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-01-27 18:08:31,943 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:08:31,943 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:08:31,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1503813271, now seen corresponding path program 2 times [2023-01-27 18:08:31,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:08:31,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085612488] [2023-01-27 18:08:31,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:08:31,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:08:31,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:08:32,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:08:32,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:08:32,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085612488] [2023-01-27 18:08:32,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085612488] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:08:32,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:08:32,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-27 18:08:32,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353507293] [2023-01-27 18:08:32,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:08:32,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-27 18:08:32,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:08:32,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-27 18:08:32,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-01-27 18:08:32,132 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 237 [2023-01-27 18:08:32,133 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 87 transitions, 888 flow. Second operand has 6 states, 6 states have (on average 113.5) internal successors, (681), 6 states have internal predecessors, (681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:08:32,133 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:08:32,133 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 237 [2023-01-27 18:08:32,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:08:32,743 INFO L130 PetriNetUnfolder]: 3512/5234 cut-off events. [2023-01-27 18:08:32,743 INFO L131 PetriNetUnfolder]: For 52175/53918 co-relation queries the response was YES. [2023-01-27 18:08:32,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32255 conditions, 5234 events. 3512/5234 cut-off events. For 52175/53918 co-relation queries the response was YES. Maximal size of possible extension queue 293. Compared 28831 event pairs, 530 based on Foata normal form. 308/5317 useless extension candidates. Maximal degree in co-relation 32222. Up to 2312 conditions per place. [2023-01-27 18:08:32,768 INFO L137 encePairwiseOnDemand]: 231/237 looper letters, 119 selfloop transitions, 17 changer transitions 19/167 dead transitions. [2023-01-27 18:08:32,769 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 167 transitions, 2069 flow [2023-01-27 18:08:32,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-27 18:08:32,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-27 18:08:32,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 733 transitions. [2023-01-27 18:08:32,771 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5154711673699015 [2023-01-27 18:08:32,771 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 733 transitions. [2023-01-27 18:08:32,771 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 733 transitions. [2023-01-27 18:08:32,771 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:08:32,771 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 733 transitions. [2023-01-27 18:08:32,772 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 122.16666666666667) internal successors, (733), 6 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:08:32,774 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 237.0) internal successors, (1659), 7 states have internal predecessors, (1659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:08:32,774 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 237.0) internal successors, (1659), 7 states have internal predecessors, (1659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:08:32,774 INFO L175 Difference]: Start difference. First operand has 80 places, 87 transitions, 888 flow. Second operand 6 states and 733 transitions. [2023-01-27 18:08:32,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 167 transitions, 2069 flow [2023-01-27 18:08:32,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 167 transitions, 1927 flow, removed 62 selfloop flow, removed 3 redundant places. [2023-01-27 18:08:32,886 INFO L231 Difference]: Finished difference. Result has 82 places, 76 transitions, 722 flow [2023-01-27 18:08:32,886 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=804, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=722, PETRI_PLACES=82, PETRI_TRANSITIONS=76} [2023-01-27 18:08:32,887 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 37 predicate places. [2023-01-27 18:08:32,887 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 76 transitions, 722 flow [2023-01-27 18:08:32,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 113.5) internal successors, (681), 6 states have internal predecessors, (681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:08:32,887 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:08:32,887 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:08:32,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-01-27 18:08:32,887 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:08:32,888 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:08:32,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1707836661, now seen corresponding path program 1 times [2023-01-27 18:08:32,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:08:32,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033609243] [2023-01-27 18:08:32,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:08:32,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:08:32,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:08:33,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:08:33,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:08:33,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033609243] [2023-01-27 18:08:33,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033609243] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:08:33,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:08:33,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-27 18:08:33,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295994942] [2023-01-27 18:08:33,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:08:33,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-27 18:08:33,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:08:33,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-27 18:08:33,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-01-27 18:08:33,237 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 237 [2023-01-27 18:08:33,237 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 76 transitions, 722 flow. Second operand has 6 states, 6 states have (on average 100.83333333333333) internal successors, (605), 6 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:08:33,237 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:08:33,237 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 237 [2023-01-27 18:08:33,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:08:34,020 INFO L130 PetriNetUnfolder]: 4547/6707 cut-off events. [2023-01-27 18:08:34,020 INFO L131 PetriNetUnfolder]: For 43135/43135 co-relation queries the response was YES. [2023-01-27 18:08:34,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38133 conditions, 6707 events. 4547/6707 cut-off events. For 43135/43135 co-relation queries the response was YES. Maximal size of possible extension queue 281. Compared 35860 event pairs, 378 based on Foata normal form. 1/6708 useless extension candidates. Maximal degree in co-relation 38100. Up to 3443 conditions per place. [2023-01-27 18:08:34,045 INFO L137 encePairwiseOnDemand]: 229/237 looper letters, 100 selfloop transitions, 4 changer transitions 72/176 dead transitions. [2023-01-27 18:08:34,045 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 176 transitions, 1993 flow [2023-01-27 18:08:34,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 18:08:34,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 18:08:34,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 750 transitions. [2023-01-27 18:08:34,047 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45207956600361665 [2023-01-27 18:08:34,047 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 750 transitions. [2023-01-27 18:08:34,047 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 750 transitions. [2023-01-27 18:08:34,048 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:08:34,048 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 750 transitions. [2023-01-27 18:08:34,049 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 107.14285714285714) internal successors, (750), 7 states have internal predecessors, (750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:08:34,050 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 237.0) internal successors, (1896), 8 states have internal predecessors, (1896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:08:34,051 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 237.0) internal successors, (1896), 8 states have internal predecessors, (1896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:08:34,051 INFO L175 Difference]: Start difference. First operand has 82 places, 76 transitions, 722 flow. Second operand 7 states and 750 transitions. [2023-01-27 18:08:34,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 176 transitions, 1993 flow [2023-01-27 18:08:34,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 176 transitions, 1667 flow, removed 127 selfloop flow, removed 10 redundant places. [2023-01-27 18:08:34,146 INFO L231 Difference]: Finished difference. Result has 79 places, 68 transitions, 523 flow [2023-01-27 18:08:34,146 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=580, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=523, PETRI_PLACES=79, PETRI_TRANSITIONS=68} [2023-01-27 18:08:34,146 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 34 predicate places. [2023-01-27 18:08:34,147 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 68 transitions, 523 flow [2023-01-27 18:08:34,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 100.83333333333333) internal successors, (605), 6 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:08:34,147 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:08:34,147 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:08:34,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-01-27 18:08:34,147 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:08:34,147 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:08:34,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1180648067, now seen corresponding path program 2 times [2023-01-27 18:08:34,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:08:34,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758849776] [2023-01-27 18:08:34,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:08:34,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:08:34,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:08:34,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:08:34,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:08:34,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758849776] [2023-01-27 18:08:34,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758849776] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:08:34,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:08:34,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-27 18:08:34,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185287528] [2023-01-27 18:08:34,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:08:34,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-27 18:08:34,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:08:34,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-27 18:08:34,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-01-27 18:08:34,486 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 237 [2023-01-27 18:08:34,487 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 68 transitions, 523 flow. Second operand has 6 states, 6 states have (on average 100.83333333333333) internal successors, (605), 6 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:08:34,487 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:08:34,487 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 237 [2023-01-27 18:08:34,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:08:35,174 INFO L130 PetriNetUnfolder]: 2998/4644 cut-off events. [2023-01-27 18:08:35,175 INFO L131 PetriNetUnfolder]: For 15365/15365 co-relation queries the response was YES. [2023-01-27 18:08:35,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21982 conditions, 4644 events. 2998/4644 cut-off events. For 15365/15365 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 24809 event pairs, 517 based on Foata normal form. 1/4645 useless extension candidates. Maximal degree in co-relation 21957. Up to 1983 conditions per place. [2023-01-27 18:08:35,192 INFO L137 encePairwiseOnDemand]: 230/237 looper letters, 62 selfloop transitions, 3 changer transitions 87/152 dead transitions. [2023-01-27 18:08:35,192 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 152 transitions, 1484 flow [2023-01-27 18:08:35,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 18:08:35,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 18:08:35,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 737 transitions. [2023-01-27 18:08:35,194 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44424352019288726 [2023-01-27 18:08:35,194 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 737 transitions. [2023-01-27 18:08:35,194 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 737 transitions. [2023-01-27 18:08:35,194 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:08:35,194 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 737 transitions. [2023-01-27 18:08:35,195 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 105.28571428571429) internal successors, (737), 7 states have internal predecessors, (737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:08:35,197 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 237.0) internal successors, (1896), 8 states have internal predecessors, (1896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:08:35,197 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 237.0) internal successors, (1896), 8 states have internal predecessors, (1896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:08:35,197 INFO L175 Difference]: Start difference. First operand has 79 places, 68 transitions, 523 flow. Second operand 7 states and 737 transitions. [2023-01-27 18:08:35,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 152 transitions, 1484 flow [2023-01-27 18:08:35,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 152 transitions, 1430 flow, removed 17 selfloop flow, removed 6 redundant places. [2023-01-27 18:08:35,256 INFO L231 Difference]: Finished difference. Result has 79 places, 53 transitions, 365 flow [2023-01-27 18:08:35,256 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=496, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=365, PETRI_PLACES=79, PETRI_TRANSITIONS=53} [2023-01-27 18:08:35,256 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 34 predicate places. [2023-01-27 18:08:35,256 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 53 transitions, 365 flow [2023-01-27 18:08:35,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 100.83333333333333) internal successors, (605), 6 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:08:35,257 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:08:35,257 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:08:35,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-01-27 18:08:35,257 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:08:35,257 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:08:35,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1585118157, now seen corresponding path program 3 times [2023-01-27 18:08:35,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:08:35,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766659893] [2023-01-27 18:08:35,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:08:35,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:08:35,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:08:35,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:08:35,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:08:35,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766659893] [2023-01-27 18:08:35,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766659893] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:08:35,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:08:35,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-27 18:08:35,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091962272] [2023-01-27 18:08:35,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:08:35,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-01-27 18:08:35,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:08:35,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-01-27 18:08:35,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-01-27 18:08:35,897 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 237 [2023-01-27 18:08:35,898 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 53 transitions, 365 flow. Second operand has 8 states, 8 states have (on average 100.625) internal successors, (805), 8 states have internal predecessors, (805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:08:35,898 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:08:35,898 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 237 [2023-01-27 18:08:35,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:08:36,426 INFO L130 PetriNetUnfolder]: 2073/3312 cut-off events. [2023-01-27 18:08:36,427 INFO L131 PetriNetUnfolder]: For 7891/7891 co-relation queries the response was YES. [2023-01-27 18:08:36,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14013 conditions, 3312 events. 2073/3312 cut-off events. For 7891/7891 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 17365 event pairs, 401 based on Foata normal form. 1/3313 useless extension candidates. Maximal degree in co-relation 13988. Up to 2070 conditions per place. [2023-01-27 18:08:36,440 INFO L137 encePairwiseOnDemand]: 226/237 looper letters, 62 selfloop transitions, 14 changer transitions 23/99 dead transitions. [2023-01-27 18:08:36,441 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 99 transitions, 804 flow [2023-01-27 18:08:36,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 18:08:36,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 18:08:36,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 744 transitions. [2023-01-27 18:08:36,443 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4484629294755877 [2023-01-27 18:08:36,443 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 744 transitions. [2023-01-27 18:08:36,443 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 744 transitions. [2023-01-27 18:08:36,443 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:08:36,443 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 744 transitions. [2023-01-27 18:08:36,444 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 106.28571428571429) internal successors, (744), 7 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:08:36,446 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 237.0) internal successors, (1896), 8 states have internal predecessors, (1896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:08:36,446 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 237.0) internal successors, (1896), 8 states have internal predecessors, (1896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:08:36,446 INFO L175 Difference]: Start difference. First operand has 79 places, 53 transitions, 365 flow. Second operand 7 states and 744 transitions. [2023-01-27 18:08:36,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 99 transitions, 804 flow [2023-01-27 18:08:36,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 99 transitions, 762 flow, removed 16 selfloop flow, removed 8 redundant places. [2023-01-27 18:08:36,481 INFO L231 Difference]: Finished difference. Result has 74 places, 56 transitions, 406 flow [2023-01-27 18:08:36,481 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=329, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=406, PETRI_PLACES=74, PETRI_TRANSITIONS=56} [2023-01-27 18:08:36,481 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 29 predicate places. [2023-01-27 18:08:36,481 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 56 transitions, 406 flow [2023-01-27 18:08:36,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 100.625) internal successors, (805), 8 states have internal predecessors, (805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:08:36,482 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:08:36,482 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:08:36,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-01-27 18:08:36,482 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:08:36,482 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:08:36,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1333469467, now seen corresponding path program 4 times [2023-01-27 18:08:36,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:08:36,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453996766] [2023-01-27 18:08:36,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:08:36,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:08:36,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:08:37,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:08:37,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:08:37,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453996766] [2023-01-27 18:08:37,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453996766] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:08:37,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:08:37,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-27 18:08:37,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315942698] [2023-01-27 18:08:37,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:08:37,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-01-27 18:08:37,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:08:37,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-01-27 18:08:37,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-01-27 18:08:37,218 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 237 [2023-01-27 18:08:37,219 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 56 transitions, 406 flow. Second operand has 8 states, 8 states have (on average 108.125) internal successors, (865), 8 states have internal predecessors, (865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:08:37,219 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:08:37,219 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 237 [2023-01-27 18:08:37,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:08:37,643 INFO L130 PetriNetUnfolder]: 1573/2529 cut-off events. [2023-01-27 18:08:37,643 INFO L131 PetriNetUnfolder]: For 6822/7008 co-relation queries the response was YES. [2023-01-27 18:08:37,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11214 conditions, 2529 events. 1573/2529 cut-off events. For 6822/7008 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 12929 event pairs, 170 based on Foata normal form. 34/2488 useless extension candidates. Maximal degree in co-relation 11189. Up to 1403 conditions per place. [2023-01-27 18:08:37,654 INFO L137 encePairwiseOnDemand]: 229/237 looper letters, 73 selfloop transitions, 18 changer transitions 19/114 dead transitions. [2023-01-27 18:08:37,654 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 114 transitions, 925 flow [2023-01-27 18:08:37,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 18:08:37,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 18:08:37,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 800 transitions. [2023-01-27 18:08:37,656 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4822182037371911 [2023-01-27 18:08:37,656 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 800 transitions. [2023-01-27 18:08:37,656 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 800 transitions. [2023-01-27 18:08:37,656 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:08:37,656 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 800 transitions. [2023-01-27 18:08:37,658 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 114.28571428571429) internal successors, (800), 7 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:08:37,660 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 237.0) internal successors, (1896), 8 states have internal predecessors, (1896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:08:37,660 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 237.0) internal successors, (1896), 8 states have internal predecessors, (1896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:08:37,660 INFO L175 Difference]: Start difference. First operand has 74 places, 56 transitions, 406 flow. Second operand 7 states and 800 transitions. [2023-01-27 18:08:37,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 114 transitions, 925 flow [2023-01-27 18:08:37,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 114 transitions, 903 flow, removed 5 selfloop flow, removed 6 redundant places. [2023-01-27 18:08:37,682 INFO L231 Difference]: Finished difference. Result has 75 places, 59 transitions, 464 flow [2023-01-27 18:08:37,682 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=384, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=464, PETRI_PLACES=75, PETRI_TRANSITIONS=59} [2023-01-27 18:08:37,682 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 30 predicate places. [2023-01-27 18:08:37,683 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 59 transitions, 464 flow [2023-01-27 18:08:37,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 108.125) internal successors, (865), 8 states have internal predecessors, (865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:08:37,683 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:08:37,683 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:08:37,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-01-27 18:08:37,684 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:08:37,684 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:08:37,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1912619821, now seen corresponding path program 5 times [2023-01-27 18:08:37,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:08:37,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479260521] [2023-01-27 18:08:37,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:08:37,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:08:37,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:08:38,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:08:38,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:08:38,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479260521] [2023-01-27 18:08:38,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479260521] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:08:38,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:08:38,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-01-27 18:08:38,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831084696] [2023-01-27 18:08:38,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:08:38,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-01-27 18:08:38,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:08:38,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-01-27 18:08:38,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2023-01-27 18:08:38,777 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 237 [2023-01-27 18:08:38,778 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 59 transitions, 464 flow. Second operand has 11 states, 11 states have (on average 103.27272727272727) internal successors, (1136), 11 states have internal predecessors, (1136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:08:38,778 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:08:38,778 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 237 [2023-01-27 18:08:38,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:08:39,225 INFO L130 PetriNetUnfolder]: 1678/2724 cut-off events. [2023-01-27 18:08:39,225 INFO L131 PetriNetUnfolder]: For 9064/9233 co-relation queries the response was YES. [2023-01-27 18:08:39,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12597 conditions, 2724 events. 1678/2724 cut-off events. For 9064/9233 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 14217 event pairs, 366 based on Foata normal form. 39/2689 useless extension candidates. Maximal degree in co-relation 12573. Up to 1127 conditions per place. [2023-01-27 18:08:39,233 INFO L137 encePairwiseOnDemand]: 231/237 looper letters, 62 selfloop transitions, 7 changer transitions 42/115 dead transitions. [2023-01-27 18:08:39,233 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 115 transitions, 1031 flow [2023-01-27 18:08:39,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 18:08:39,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 18:08:39,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 767 transitions. [2023-01-27 18:08:39,235 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46232670283303196 [2023-01-27 18:08:39,235 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 767 transitions. [2023-01-27 18:08:39,235 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 767 transitions. [2023-01-27 18:08:39,235 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:08:39,236 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 767 transitions. [2023-01-27 18:08:39,236 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 109.57142857142857) internal successors, (767), 7 states have internal predecessors, (767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:08:39,238 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 237.0) internal successors, (1896), 8 states have internal predecessors, (1896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:08:39,238 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 237.0) internal successors, (1896), 8 states have internal predecessors, (1896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:08:39,238 INFO L175 Difference]: Start difference. First operand has 75 places, 59 transitions, 464 flow. Second operand 7 states and 767 transitions. [2023-01-27 18:08:39,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 115 transitions, 1031 flow [2023-01-27 18:08:39,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 115 transitions, 1003 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-01-27 18:08:39,262 INFO L231 Difference]: Finished difference. Result has 79 places, 58 transitions, 458 flow [2023-01-27 18:08:39,262 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=443, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=458, PETRI_PLACES=79, PETRI_TRANSITIONS=58} [2023-01-27 18:08:39,262 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 34 predicate places. [2023-01-27 18:08:39,262 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 58 transitions, 458 flow [2023-01-27 18:08:39,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 103.27272727272727) internal successors, (1136), 11 states have internal predecessors, (1136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:08:39,263 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:08:39,263 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:08:39,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-01-27 18:08:39,263 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:08:39,263 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:08:39,263 INFO L85 PathProgramCache]: Analyzing trace with hash 987104253, now seen corresponding path program 6 times [2023-01-27 18:08:39,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:08:39,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784022405] [2023-01-27 18:08:39,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:08:39,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:08:39,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-27 18:08:39,297 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-27 18:08:39,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-27 18:08:39,364 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-27 18:08:39,364 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-27 18:08:39,365 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-01-27 18:08:39,367 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-01-27 18:08:39,367 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-01-27 18:08:39,367 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-01-27 18:08:39,367 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-01-27 18:08:39,367 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-01-27 18:08:39,367 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-01-27 18:08:39,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-01-27 18:08:39,367 INFO L445 BasicCegarLoop]: Path program histogram: [6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:08:39,371 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-27 18:08:39,371 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-27 18:08:39,452 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.01 06:08:39 BasicIcfg [2023-01-27 18:08:39,452 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-27 18:08:39,453 INFO L158 Benchmark]: Toolchain (without parser) took 33630.90ms. Allocated memory was 492.8MB in the beginning and 4.4GB in the end (delta: 3.9GB). Free memory was 444.3MB in the beginning and 4.1GB in the end (delta: -3.7GB). Peak memory consumption was 214.4MB. Max. memory is 16.0GB. [2023-01-27 18:08:39,453 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 350.2MB. Free memory is still 302.1MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-27 18:08:39,454 INFO L158 Benchmark]: CACSL2BoogieTranslator took 317.62ms. Allocated memory is still 492.8MB. Free memory was 444.0MB in the beginning and 420.3MB in the end (delta: 23.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-01-27 18:08:39,454 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.29ms. Allocated memory is still 492.8MB. Free memory was 420.2MB in the beginning and 417.3MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-01-27 18:08:39,454 INFO L158 Benchmark]: Boogie Preprocessor took 19.79ms. Allocated memory is still 492.8MB. Free memory was 417.3MB in the beginning and 415.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-27 18:08:39,454 INFO L158 Benchmark]: RCFGBuilder took 632.40ms. Allocated memory is still 492.8MB. Free memory was 415.2MB in the beginning and 421.4MB in the end (delta: -6.1MB). Peak memory consumption was 9.5MB. Max. memory is 16.0GB. [2023-01-27 18:08:39,454 INFO L158 Benchmark]: TraceAbstraction took 32622.38ms. Allocated memory was 492.8MB in the beginning and 4.4GB in the end (delta: 3.9GB). Free memory was 421.2MB in the beginning and 4.1GB in the end (delta: -3.7GB). Peak memory consumption was 190.2MB. Max. memory is 16.0GB. [2023-01-27 18:08:39,455 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.11ms. Allocated memory is still 350.2MB. Free memory is still 302.1MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 317.62ms. Allocated memory is still 492.8MB. Free memory was 444.0MB in the beginning and 420.3MB in the end (delta: 23.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 34.29ms. Allocated memory is still 492.8MB. Free memory was 420.2MB in the beginning and 417.3MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 19.79ms. Allocated memory is still 492.8MB. Free memory was 417.3MB in the beginning and 415.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 632.40ms. Allocated memory is still 492.8MB. Free memory was 415.2MB in the beginning and 421.4MB in the end (delta: -6.1MB). Peak memory consumption was 9.5MB. Max. memory is 16.0GB. * TraceAbstraction took 32622.38ms. Allocated memory was 492.8MB in the beginning and 4.4GB in the end (delta: 3.9GB). Free memory was 421.2MB in the beginning and 4.1GB in the end (delta: -3.7GB). Peak memory consumption was 190.2MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.4s, 138 PlacesBefore, 45 PlacesAfterwards, 127 TransitionsBefore, 33 TransitionsAfterwards, 3150 CoEnabledTransitionPairs, 7 FixpointIterations, 43 TrivialSequentialCompositions, 55 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 106 TotalNumberOfCompositions, 9485 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3554, independent: 3302, independent conditional: 0, independent unconditional: 3302, dependent: 252, dependent conditional: 0, dependent unconditional: 252, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1589, independent: 1552, independent conditional: 0, independent unconditional: 1552, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3554, independent: 1750, independent conditional: 0, independent unconditional: 1750, dependent: 215, dependent conditional: 0, dependent unconditional: 215, unknown: 1589, unknown conditional: 0, unknown unconditional: 1589] , Statistics on independence cache: Total cache size (in pairs): 169, Positive cache size: 147, Positive conditional cache size: 0, Positive unconditional cache size: 147, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22, 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_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L725] 0 _Bool x$flush_delayed; [L726] 0 int x$mem_tmp; [L727] 0 _Bool x$r_buff0_thd0; [L728] 0 _Bool x$r_buff0_thd1; [L729] 0 _Bool x$r_buff0_thd2; [L730] 0 _Bool x$r_buff0_thd3; [L731] 0 _Bool x$r_buff0_thd4; [L732] 0 _Bool x$r_buff1_thd0; [L733] 0 _Bool x$r_buff1_thd1; [L734] 0 _Bool x$r_buff1_thd2; [L735] 0 _Bool x$r_buff1_thd3; [L736] 0 _Bool x$r_buff1_thd4; [L737] 0 _Bool x$read_delayed; [L738] 0 int *x$read_delayed_var; [L739] 0 int x$w_buff0; [L740] 0 _Bool x$w_buff0_used; [L741] 0 int x$w_buff1; [L742] 0 _Bool x$w_buff1_used; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L853] 0 pthread_t t489; [L854] FCALL, FORK 0 pthread_create(&t489, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t489, ((void *)0), P0, ((void *)0))=-2, t489={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L855] 0 pthread_t t490; [L856] FCALL, FORK 0 pthread_create(&t490, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t490, ((void *)0), P1, ((void *)0))=-1, t489={5:0}, t490={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L857] 0 pthread_t t491; [L858] FCALL, FORK 0 pthread_create(&t491, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t491, ((void *)0), P2, ((void *)0))=0, t489={5:0}, t490={6:0}, t491={7:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L859] 0 pthread_t t492; [L860] FCALL, FORK 0 pthread_create(&t492, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t492, ((void *)0), P3, ((void *)0))=1, t489={5:0}, t490={6:0}, t491={7:0}, t492={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L772] 2 x$w_buff1 = x$w_buff0 [L773] 2 x$w_buff0 = 2 [L774] 2 x$w_buff1_used = x$w_buff0_used [L775] 2 x$w_buff0_used = (_Bool)1 [L776] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L776] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L777] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L778] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L779] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L780] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L781] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L782] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L785] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L802] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L805] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L822] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L825] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L828] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L752] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L788] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L789] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L790] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L791] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L792] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 2 return 0; [L758] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L759] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L760] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L761] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L762] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L808] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L809] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L810] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L811] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L812] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L831] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L832] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L833] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L834] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L835] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L817] 3 return 0; [L838] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L840] 4 return 0; [L862] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L864] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L864] RET 0 assume_abort_if_not(main$tmp_guard0) [L866] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L867] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L868] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L869] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L870] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_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}, main$tmp_guard0=1, main$tmp_guard1=0, t489={5:0}, t490={6:0}, t491={7:0}, t492={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L873] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L874] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L875] 0 x$flush_delayed = weak$$choice2 [L876] 0 x$mem_tmp = x [L877] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L878] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L879] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L880] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L881] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L882] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L883] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L884] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L885] 0 x = x$flush_delayed ? x$mem_tmp : x [L886] 0 x$flush_delayed = (_Bool)0 [L888] 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_p1_EAX=0, __unbuffered_p2_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}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 856]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 860]: 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: 858]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 168 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: 32.4s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 21.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 816 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 816 mSDsluCounter, 273 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 184 mSDsCounter, 138 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2812 IncrementalHoareTripleChecker+Invalid, 2950 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 138 mSolverCounterUnsat, 89 mSDtfsCounter, 2812 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 117 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=888occurred in iteration=12, InterpolantAutomatonStates: 111, 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, 7.1s InterpolantComputationTime, 391 NumberOfCodeBlocks, 391 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 344 ConstructedInterpolants, 0 QuantifiedInterpolants, 3874 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-01-27 18:08:39,473 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...