/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix011_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-28 00:36:32,996 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-28 00:36:32,997 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-28 00:36:33,018 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-28 00:36:33,018 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-28 00:36:33,019 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-28 00:36:33,020 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-28 00:36:33,021 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-28 00:36:33,022 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-28 00:36:33,022 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-28 00:36:33,023 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-28 00:36:33,023 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-28 00:36:33,024 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-28 00:36:33,024 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-28 00:36:33,025 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-28 00:36:33,025 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-28 00:36:33,026 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-28 00:36:33,026 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-28 00:36:33,027 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-28 00:36:33,028 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-28 00:36:33,029 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-28 00:36:33,030 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-28 00:36:33,030 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-28 00:36:33,031 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-28 00:36:33,033 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-28 00:36:33,033 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-28 00:36:33,033 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-28 00:36:33,034 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-28 00:36:33,034 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-28 00:36:33,034 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-28 00:36:33,035 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-28 00:36:33,035 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-28 00:36:33,035 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-28 00:36:33,036 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-28 00:36:33,036 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-28 00:36:33,036 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-28 00:36:33,037 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-28 00:36:33,037 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-28 00:36:33,037 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-28 00:36:33,038 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-28 00:36:33,038 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-28 00:36:33,039 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-01-28 00:36:33,056 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-28 00:36:33,057 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-28 00:36:33,058 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-28 00:36:33,058 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-28 00:36:33,059 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-28 00:36:33,059 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-28 00:36:33,059 INFO L138 SettingsManager]: * Use SBE=true [2023-01-28 00:36:33,059 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-28 00:36:33,059 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-28 00:36:33,059 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-28 00:36:33,059 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-28 00:36:33,059 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-28 00:36:33,059 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-28 00:36:33,060 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-28 00:36:33,060 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-28 00:36:33,060 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-28 00:36:33,060 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-28 00:36:33,060 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-28 00:36:33,060 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-28 00:36:33,060 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-28 00:36:33,060 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-28 00:36:33,060 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-28 00:36:33,060 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-28 00:36:33,060 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 00:36:33,061 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-28 00:36:33,061 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-28 00:36:33,061 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-28 00:36:33,061 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-28 00:36:33,061 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-28 00:36:33,061 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-28 00:36:33,061 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-28 00:36:33,061 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> BEFORE [2023-01-28 00:36:33,225 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-28 00:36:33,251 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-28 00:36:33,253 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-28 00:36:33,254 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-28 00:36:33,254 INFO L275 PluginConnector]: CDTParser initialized [2023-01-28 00:36:33,255 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix011_tso.oepc.i [2023-01-28 00:36:34,704 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-28 00:36:34,851 INFO L351 CDTParser]: Found 1 translation units. [2023-01-28 00:36:34,852 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix011_tso.oepc.i [2023-01-28 00:36:34,859 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c170c3e71/992e5dee5dee44b58fccf655ecbe89ef/FLAG9612c633b [2023-01-28 00:36:34,869 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c170c3e71/992e5dee5dee44b58fccf655ecbe89ef [2023-01-28 00:36:34,871 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-28 00:36:34,872 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-28 00:36:34,873 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-28 00:36:34,873 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-28 00:36:34,875 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-28 00:36:34,875 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 12:36:34" (1/1) ... [2023-01-28 00:36:34,875 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@87ac849 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:36:34, skipping insertion in model container [2023-01-28 00:36:34,876 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 12:36:34" (1/1) ... [2023-01-28 00:36:34,880 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-28 00:36:34,916 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-28 00:36:35,007 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/mix011_tso.oepc.i[949,962] [2023-01-28 00:36:35,105 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 00:36:35,111 INFO L203 MainTranslator]: Completed pre-run [2023-01-28 00:36:35,118 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/mix011_tso.oepc.i[949,962] [2023-01-28 00:36:35,154 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 00:36:35,175 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 00:36:35,176 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 00:36:35,180 INFO L208 MainTranslator]: Completed translation [2023-01-28 00:36:35,181 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:36:35 WrapperNode [2023-01-28 00:36:35,181 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-28 00:36:35,182 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-28 00:36:35,182 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-28 00:36:35,182 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-28 00:36:35,186 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:36:35" (1/1) ... [2023-01-28 00:36:35,204 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:36:35" (1/1) ... [2023-01-28 00:36:35,223 INFO L138 Inliner]: procedures = 176, calls = 60, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 154 [2023-01-28 00:36:35,223 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-28 00:36:35,224 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-28 00:36:35,224 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-28 00:36:35,224 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-28 00:36:35,232 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:36:35" (1/1) ... [2023-01-28 00:36:35,233 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:36:35" (1/1) ... [2023-01-28 00:36:35,248 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:36:35" (1/1) ... [2023-01-28 00:36:35,248 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:36:35" (1/1) ... [2023-01-28 00:36:35,253 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:36:35" (1/1) ... [2023-01-28 00:36:35,254 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:36:35" (1/1) ... [2023-01-28 00:36:35,256 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:36:35" (1/1) ... [2023-01-28 00:36:35,257 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:36:35" (1/1) ... [2023-01-28 00:36:35,259 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-28 00:36:35,259 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-28 00:36:35,259 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-28 00:36:35,259 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-28 00:36:35,260 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:36:35" (1/1) ... [2023-01-28 00:36:35,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 00:36:35,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 00:36:35,317 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-01-28 00:36:35,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-01-28 00:36:35,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-28 00:36:35,364 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-28 00:36:35,364 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-28 00:36:35,364 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-28 00:36:35,364 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-28 00:36:35,364 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-01-28 00:36:35,364 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-01-28 00:36:35,364 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-01-28 00:36:35,365 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-01-28 00:36:35,365 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-01-28 00:36:35,365 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-01-28 00:36:35,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-28 00:36:35,365 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-28 00:36:35,365 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-28 00:36:35,365 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-28 00:36:35,366 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-01-28 00:36:35,458 INFO L236 CfgBuilder]: Building ICFG [2023-01-28 00:36:35,459 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-28 00:36:35,694 INFO L277 CfgBuilder]: Performing block encoding [2023-01-28 00:36:35,776 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-28 00:36:35,776 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-01-28 00:36:35,777 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 12:36:35 BoogieIcfgContainer [2023-01-28 00:36:35,777 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-28 00:36:35,779 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-28 00:36:35,779 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-28 00:36:35,781 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-28 00:36:35,781 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 12:36:34" (1/3) ... [2023-01-28 00:36:35,781 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29d329a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 12:36:35, skipping insertion in model container [2023-01-28 00:36:35,782 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:36:35" (2/3) ... [2023-01-28 00:36:35,782 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29d329a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 12:36:35, skipping insertion in model container [2023-01-28 00:36:35,782 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 12:36:35" (3/3) ... [2023-01-28 00:36:35,783 INFO L112 eAbstractionObserver]: Analyzing ICFG mix011_tso.oepc.i [2023-01-28 00:36:35,796 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-28 00:36:35,796 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-01-28 00:36:35,796 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-28 00:36:35,832 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-28 00:36:35,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 122 places, 114 transitions, 243 flow [2023-01-28 00:36:35,916 INFO L130 PetriNetUnfolder]: 2/111 cut-off events. [2023-01-28 00:36:35,916 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 00:36:35,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 111 events. 2/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 63 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2023-01-28 00:36:35,920 INFO L82 GeneralOperation]: Start removeDead. Operand has 122 places, 114 transitions, 243 flow [2023-01-28 00:36:35,922 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 111 transitions, 231 flow [2023-01-28 00:36:35,927 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 00:36:35,940 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 111 transitions, 231 flow [2023-01-28 00:36:35,941 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 111 transitions, 231 flow [2023-01-28 00:36:35,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 111 transitions, 231 flow [2023-01-28 00:36:35,970 INFO L130 PetriNetUnfolder]: 2/111 cut-off events. [2023-01-28 00:36:35,970 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 00:36:35,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 111 events. 2/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 63 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2023-01-28 00:36:35,972 INFO L119 LiptonReduction]: Number of co-enabled transitions 2198 [2023-01-28 00:36:38,951 INFO L134 LiptonReduction]: Checked pairs total: 6126 [2023-01-28 00:36:38,951 INFO L136 LiptonReduction]: Total number of compositions: 96 [2023-01-28 00:36:38,961 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-28 00:36:38,965 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;@47b589b6, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 00:36:38,966 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-01-28 00:36:38,968 INFO L130 PetriNetUnfolder]: 0/7 cut-off events. [2023-01-28 00:36:38,968 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 00:36:38,968 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:36:38,968 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-01-28 00:36:38,969 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:36:38,972 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:36:38,972 INFO L85 PathProgramCache]: Analyzing trace with hash 469443053, now seen corresponding path program 1 times [2023-01-28 00:36:38,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:36:38,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028456722] [2023-01-28 00:36:38,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:36:38,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:36:39,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:36:39,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:36:39,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:36:39,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028456722] [2023-01-28 00:36:39,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028456722] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:36:39,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:36:39,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-28 00:36:39,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101028989] [2023-01-28 00:36:39,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:36:39,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 00:36:39,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:36:39,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 00:36:39,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 00:36:39,272 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 210 [2023-01-28 00:36:39,274 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 28 transitions, 65 flow. Second operand has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:36:39,274 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:36:39,274 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 210 [2023-01-28 00:36:39,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:36:39,490 INFO L130 PetriNetUnfolder]: 999/1737 cut-off events. [2023-01-28 00:36:39,491 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2023-01-28 00:36:39,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3272 conditions, 1737 events. 999/1737 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 10200 event pairs, 165 based on Foata normal form. 64/1652 useless extension candidates. Maximal degree in co-relation 3261. Up to 1195 conditions per place. [2023-01-28 00:36:39,503 INFO L137 encePairwiseOnDemand]: 206/210 looper letters, 29 selfloop transitions, 2 changer transitions 4/40 dead transitions. [2023-01-28 00:36:39,503 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 40 transitions, 162 flow [2023-01-28 00:36:39,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 00:36:39,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 00:36:39,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 338 transitions. [2023-01-28 00:36:39,518 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5365079365079365 [2023-01-28 00:36:39,518 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 338 transitions. [2023-01-28 00:36:39,518 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 338 transitions. [2023-01-28 00:36:39,519 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:36:39,521 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 338 transitions. [2023-01-28 00:36:39,523 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:36:39,525 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:36:39,526 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:36:39,527 INFO L175 Difference]: Start difference. First operand has 37 places, 28 transitions, 65 flow. Second operand 3 states and 338 transitions. [2023-01-28 00:36:39,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 40 transitions, 162 flow [2023-01-28 00:36:39,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 40 transitions, 158 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-01-28 00:36:39,530 INFO L231 Difference]: Finished difference. Result has 35 places, 24 transitions, 58 flow [2023-01-28 00:36:39,531 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=35, PETRI_TRANSITIONS=24} [2023-01-28 00:36:39,534 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, -2 predicate places. [2023-01-28 00:36:39,534 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 24 transitions, 58 flow [2023-01-28 00:36:39,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:36:39,534 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:36:39,534 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:36:39,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-28 00:36:39,535 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:36:39,535 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:36:39,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1746900338, now seen corresponding path program 1 times [2023-01-28 00:36:39,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:36:39,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198283214] [2023-01-28 00:36:39,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:36:39,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:36:39,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:36:40,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:36:40,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:36:40,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198283214] [2023-01-28 00:36:40,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198283214] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:36:40,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:36:40,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 00:36:40,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023785525] [2023-01-28 00:36:40,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:36:40,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 00:36:40,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:36:40,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 00:36:40,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 00:36:40,078 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 210 [2023-01-28 00:36:40,078 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 24 transitions, 58 flow. Second operand has 5 states, 5 states have (on average 85.0) internal successors, (425), 5 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:36:40,078 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:36:40,078 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 210 [2023-01-28 00:36:40,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:36:40,428 INFO L130 PetriNetUnfolder]: 2155/3186 cut-off events. [2023-01-28 00:36:40,428 INFO L131 PetriNetUnfolder]: For 127/127 co-relation queries the response was YES. [2023-01-28 00:36:40,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6578 conditions, 3186 events. 2155/3186 cut-off events. For 127/127 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 14489 event pairs, 539 based on Foata normal form. 180/3366 useless extension candidates. Maximal degree in co-relation 6568. Up to 2113 conditions per place. [2023-01-28 00:36:40,440 INFO L137 encePairwiseOnDemand]: 206/210 looper letters, 35 selfloop transitions, 2 changer transitions 24/61 dead transitions. [2023-01-28 00:36:40,440 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 61 transitions, 258 flow [2023-01-28 00:36:40,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 00:36:40,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 00:36:40,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 478 transitions. [2023-01-28 00:36:40,443 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4552380952380952 [2023-01-28 00:36:40,443 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 478 transitions. [2023-01-28 00:36:40,443 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 478 transitions. [2023-01-28 00:36:40,443 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:36:40,443 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 478 transitions. [2023-01-28 00:36:40,445 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 95.6) internal successors, (478), 5 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:36:40,448 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:36:40,449 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:36:40,449 INFO L175 Difference]: Start difference. First operand has 35 places, 24 transitions, 58 flow. Second operand 5 states and 478 transitions. [2023-01-28 00:36:40,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 61 transitions, 258 flow [2023-01-28 00:36:40,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 61 transitions, 252 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 00:36:40,451 INFO L231 Difference]: Finished difference. Result has 38 places, 24 transitions, 66 flow [2023-01-28 00:36:40,451 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=66, PETRI_PLACES=38, PETRI_TRANSITIONS=24} [2023-01-28 00:36:40,452 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 1 predicate places. [2023-01-28 00:36:40,452 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 24 transitions, 66 flow [2023-01-28 00:36:40,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 85.0) internal successors, (425), 5 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:36:40,453 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:36:40,453 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:36:40,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-28 00:36:40,453 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:36:40,455 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:36:40,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1380918308, now seen corresponding path program 1 times [2023-01-28 00:36:40,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:36:40,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485456902] [2023-01-28 00:36:40,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:36:40,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:36:40,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:36:40,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:36:40,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:36:40,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485456902] [2023-01-28 00:36:40,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485456902] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:36:40,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:36:40,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 00:36:40,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437397374] [2023-01-28 00:36:40,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:36:40,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 00:36:40,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:36:40,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 00:36:40,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-01-28 00:36:40,956 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 210 [2023-01-28 00:36:40,957 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 24 transitions, 66 flow. Second operand has 6 states, 6 states have (on average 92.83333333333333) internal successors, (557), 6 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:36:40,957 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:36:40,957 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 210 [2023-01-28 00:36:40,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:36:41,281 INFO L130 PetriNetUnfolder]: 916/1477 cut-off events. [2023-01-28 00:36:41,282 INFO L131 PetriNetUnfolder]: For 302/302 co-relation queries the response was YES. [2023-01-28 00:36:41,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3197 conditions, 1477 events. 916/1477 cut-off events. For 302/302 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 7165 event pairs, 409 based on Foata normal form. 60/1516 useless extension candidates. Maximal degree in co-relation 3184. Up to 1182 conditions per place. [2023-01-28 00:36:41,289 INFO L137 encePairwiseOnDemand]: 201/210 looper letters, 36 selfloop transitions, 12 changer transitions 20/72 dead transitions. [2023-01-28 00:36:41,289 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 72 transitions, 310 flow [2023-01-28 00:36:41,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-28 00:36:41,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-01-28 00:36:41,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 799 transitions. [2023-01-28 00:36:41,291 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47559523809523807 [2023-01-28 00:36:41,291 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 799 transitions. [2023-01-28 00:36:41,291 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 799 transitions. [2023-01-28 00:36:41,291 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:36:41,292 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 799 transitions. [2023-01-28 00:36:41,293 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 99.875) internal successors, (799), 8 states have internal predecessors, (799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:36:41,295 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 210.0) internal successors, (1890), 9 states have internal predecessors, (1890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:36:41,296 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 210.0) internal successors, (1890), 9 states have internal predecessors, (1890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:36:41,296 INFO L175 Difference]: Start difference. First operand has 38 places, 24 transitions, 66 flow. Second operand 8 states and 799 transitions. [2023-01-28 00:36:41,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 72 transitions, 310 flow [2023-01-28 00:36:41,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 72 transitions, 302 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-01-28 00:36:41,301 INFO L231 Difference]: Finished difference. Result has 45 places, 35 transitions, 144 flow [2023-01-28 00:36:41,301 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=144, PETRI_PLACES=45, PETRI_TRANSITIONS=35} [2023-01-28 00:36:41,302 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 8 predicate places. [2023-01-28 00:36:41,304 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 35 transitions, 144 flow [2023-01-28 00:36:41,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 92.83333333333333) internal successors, (557), 6 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:36:41,305 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:36:41,305 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:36:41,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-28 00:36:41,305 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:36:41,306 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:36:41,306 INFO L85 PathProgramCache]: Analyzing trace with hash -560277340, now seen corresponding path program 2 times [2023-01-28 00:36:41,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:36:41,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325554442] [2023-01-28 00:36:41,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:36:41,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:36:41,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:36:41,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-28 00:36:41,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:36:41,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325554442] [2023-01-28 00:36:41,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325554442] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:36:41,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:36:41,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 00:36:41,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767606690] [2023-01-28 00:36:41,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:36:41,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 00:36:41,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:36:41,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 00:36:41,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 00:36:41,666 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 210 [2023-01-28 00:36:41,666 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 35 transitions, 144 flow. Second operand has 5 states, 5 states have (on average 85.4) internal successors, (427), 5 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:36:41,666 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:36:41,666 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 210 [2023-01-28 00:36:41,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:36:41,957 INFO L130 PetriNetUnfolder]: 1989/2946 cut-off events. [2023-01-28 00:36:41,957 INFO L131 PetriNetUnfolder]: For 2910/2910 co-relation queries the response was YES. [2023-01-28 00:36:41,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8321 conditions, 2946 events. 1989/2946 cut-off events. For 2910/2910 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 12811 event pairs, 546 based on Foata normal form. 120/3066 useless extension candidates. Maximal degree in co-relation 8304. Up to 1834 conditions per place. [2023-01-28 00:36:41,971 INFO L137 encePairwiseOnDemand]: 206/210 looper letters, 52 selfloop transitions, 2 changer transitions 20/74 dead transitions. [2023-01-28 00:36:41,971 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 74 transitions, 435 flow [2023-01-28 00:36:41,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 00:36:41,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 00:36:41,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 472 transitions. [2023-01-28 00:36:41,973 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44952380952380955 [2023-01-28 00:36:41,973 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 472 transitions. [2023-01-28 00:36:41,976 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 472 transitions. [2023-01-28 00:36:41,976 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:36:41,977 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 472 transitions. [2023-01-28 00:36:41,978 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 94.4) internal successors, (472), 5 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:36:41,979 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:36:41,980 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:36:41,980 INFO L175 Difference]: Start difference. First operand has 45 places, 35 transitions, 144 flow. Second operand 5 states and 472 transitions. [2023-01-28 00:36:41,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 74 transitions, 435 flow [2023-01-28 00:36:41,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 74 transitions, 431 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-01-28 00:36:41,990 INFO L231 Difference]: Finished difference. Result has 47 places, 35 transitions, 152 flow [2023-01-28 00:36:41,990 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=152, PETRI_PLACES=47, PETRI_TRANSITIONS=35} [2023-01-28 00:36:41,992 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 10 predicate places. [2023-01-28 00:36:41,992 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 35 transitions, 152 flow [2023-01-28 00:36:41,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 85.4) internal successors, (427), 5 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:36:41,992 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:36:41,992 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:36:41,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-28 00:36:41,992 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:36:41,992 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:36:41,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1314519449, now seen corresponding path program 1 times [2023-01-28 00:36:41,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:36:41,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395666622] [2023-01-28 00:36:41,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:36:41,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:36:42,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:36:42,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:36:42,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:36:42,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395666622] [2023-01-28 00:36:42,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395666622] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:36:42,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:36:42,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 00:36:42,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193432643] [2023-01-28 00:36:42,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:36:42,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 00:36:42,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:36:42,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 00:36:42,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-01-28 00:36:42,331 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 210 [2023-01-28 00:36:42,332 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 35 transitions, 152 flow. Second operand has 6 states, 6 states have (on average 94.0) internal successors, (564), 6 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:36:42,332 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:36:42,332 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 210 [2023-01-28 00:36:42,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:36:42,518 INFO L130 PetriNetUnfolder]: 840/1392 cut-off events. [2023-01-28 00:36:42,518 INFO L131 PetriNetUnfolder]: For 1504/1593 co-relation queries the response was YES. [2023-01-28 00:36:42,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3959 conditions, 1392 events. 840/1392 cut-off events. For 1504/1593 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 6777 event pairs, 380 based on Foata normal form. 71/1443 useless extension candidates. Maximal degree in co-relation 3939. Up to 1041 conditions per place. [2023-01-28 00:36:42,523 INFO L137 encePairwiseOnDemand]: 203/210 looper letters, 42 selfloop transitions, 11 changer transitions 14/71 dead transitions. [2023-01-28 00:36:42,524 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 71 transitions, 408 flow [2023-01-28 00:36:42,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 00:36:42,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 00:36:42,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 610 transitions. [2023-01-28 00:36:42,525 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48412698412698413 [2023-01-28 00:36:42,525 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 610 transitions. [2023-01-28 00:36:42,525 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 610 transitions. [2023-01-28 00:36:42,526 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:36:42,526 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 610 transitions. [2023-01-28 00:36:42,527 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 101.66666666666667) internal successors, (610), 6 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:36:42,528 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 210.0) internal successors, (1470), 7 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:36:42,528 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 210.0) internal successors, (1470), 7 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:36:42,528 INFO L175 Difference]: Start difference. First operand has 47 places, 35 transitions, 152 flow. Second operand 6 states and 610 transitions. [2023-01-28 00:36:42,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 71 transitions, 408 flow [2023-01-28 00:36:42,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 71 transitions, 400 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-01-28 00:36:42,532 INFO L231 Difference]: Finished difference. Result has 50 places, 40 transitions, 217 flow [2023-01-28 00:36:42,532 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=217, PETRI_PLACES=50, PETRI_TRANSITIONS=40} [2023-01-28 00:36:42,532 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 13 predicate places. [2023-01-28 00:36:42,532 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 40 transitions, 217 flow [2023-01-28 00:36:42,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 94.0) internal successors, (564), 6 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:36:42,533 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:36:42,533 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:36:42,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-28 00:36:42,533 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:36:42,533 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:36:42,533 INFO L85 PathProgramCache]: Analyzing trace with hash 105135207, now seen corresponding path program 1 times [2023-01-28 00:36:42,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:36:42,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860029775] [2023-01-28 00:36:42,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:36:42,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:36:42,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:36:42,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:36:42,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:36:42,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860029775] [2023-01-28 00:36:42,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860029775] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:36:42,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:36:42,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 00:36:42,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907280736] [2023-01-28 00:36:42,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:36:42,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 00:36:42,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:36:42,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 00:36:42,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-01-28 00:36:42,932 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 210 [2023-01-28 00:36:42,933 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 40 transitions, 217 flow. Second operand has 7 states, 7 states have (on average 94.0) internal successors, (658), 7 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:36:42,933 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:36:42,933 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 210 [2023-01-28 00:36:42,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:36:43,165 INFO L130 PetriNetUnfolder]: 844/1422 cut-off events. [2023-01-28 00:36:43,165 INFO L131 PetriNetUnfolder]: For 2590/2714 co-relation queries the response was YES. [2023-01-28 00:36:43,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4747 conditions, 1422 events. 844/1422 cut-off events. For 2590/2714 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 7118 event pairs, 211 based on Foata normal form. 48/1445 useless extension candidates. Maximal degree in co-relation 4725. Up to 1011 conditions per place. [2023-01-28 00:36:43,172 INFO L137 encePairwiseOnDemand]: 201/210 looper letters, 53 selfloop transitions, 13 changer transitions 11/81 dead transitions. [2023-01-28 00:36:43,172 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 81 transitions, 555 flow [2023-01-28 00:36:43,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 00:36:43,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 00:36:43,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 708 transitions. [2023-01-28 00:36:43,174 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4816326530612245 [2023-01-28 00:36:43,174 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 708 transitions. [2023-01-28 00:36:43,174 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 708 transitions. [2023-01-28 00:36:43,174 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:36:43,174 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 708 transitions. [2023-01-28 00:36:43,175 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 101.14285714285714) internal successors, (708), 7 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:36:43,177 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 210.0) internal successors, (1680), 8 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:36:43,177 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 210.0) internal successors, (1680), 8 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:36:43,177 INFO L175 Difference]: Start difference. First operand has 50 places, 40 transitions, 217 flow. Second operand 7 states and 708 transitions. [2023-01-28 00:36:43,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 81 transitions, 555 flow [2023-01-28 00:36:43,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 81 transitions, 545 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-01-28 00:36:43,182 INFO L231 Difference]: Finished difference. Result has 56 places, 47 transitions, 317 flow [2023-01-28 00:36:43,182 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=317, PETRI_PLACES=56, PETRI_TRANSITIONS=47} [2023-01-28 00:36:43,182 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 19 predicate places. [2023-01-28 00:36:43,182 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 47 transitions, 317 flow [2023-01-28 00:36:43,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 94.0) internal successors, (658), 7 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:36:43,183 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:36:43,183 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:36:43,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-28 00:36:43,183 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:36:43,183 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:36:43,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1524310003, now seen corresponding path program 2 times [2023-01-28 00:36:43,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:36:43,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128008001] [2023-01-28 00:36:43,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:36:43,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:36:43,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:36:43,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:36:43,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:36:43,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128008001] [2023-01-28 00:36:43,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128008001] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:36:43,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:36:43,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 00:36:43,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975819359] [2023-01-28 00:36:43,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:36:43,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 00:36:43,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:36:43,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 00:36:43,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-01-28 00:36:43,644 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 210 [2023-01-28 00:36:43,644 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 47 transitions, 317 flow. Second operand has 7 states, 7 states have (on average 93.0) internal successors, (651), 7 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:36:43,645 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:36:43,645 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 210 [2023-01-28 00:36:43,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:36:43,934 INFO L130 PetriNetUnfolder]: 923/1567 cut-off events. [2023-01-28 00:36:43,934 INFO L131 PetriNetUnfolder]: For 6058/6249 co-relation queries the response was YES. [2023-01-28 00:36:43,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6315 conditions, 1567 events. 923/1567 cut-off events. For 6058/6249 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 8222 event pairs, 186 based on Foata normal form. 63/1621 useless extension candidates. Maximal degree in co-relation 6289. Up to 1051 conditions per place. [2023-01-28 00:36:43,943 INFO L137 encePairwiseOnDemand]: 201/210 looper letters, 61 selfloop transitions, 14 changer transitions 7/86 dead transitions. [2023-01-28 00:36:43,943 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 86 transitions, 718 flow [2023-01-28 00:36:43,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 00:36:43,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 00:36:43,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 605 transitions. [2023-01-28 00:36:43,945 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4801587301587302 [2023-01-28 00:36:43,945 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 605 transitions. [2023-01-28 00:36:43,945 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 605 transitions. [2023-01-28 00:36:43,945 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:36:43,946 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 605 transitions. [2023-01-28 00:36:43,947 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 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-28 00:36:43,948 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 210.0) internal successors, (1470), 7 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:36:43,949 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 210.0) internal successors, (1470), 7 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:36:43,949 INFO L175 Difference]: Start difference. First operand has 56 places, 47 transitions, 317 flow. Second operand 6 states and 605 transitions. [2023-01-28 00:36:43,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 86 transitions, 718 flow [2023-01-28 00:36:43,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 86 transitions, 660 flow, removed 24 selfloop flow, removed 2 redundant places. [2023-01-28 00:36:43,956 INFO L231 Difference]: Finished difference. Result has 59 places, 54 transitions, 391 flow [2023-01-28 00:36:43,956 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=391, PETRI_PLACES=59, PETRI_TRANSITIONS=54} [2023-01-28 00:36:43,957 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 22 predicate places. [2023-01-28 00:36:43,957 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 54 transitions, 391 flow [2023-01-28 00:36:43,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 93.0) internal successors, (651), 7 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:36:43,957 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:36:43,957 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:36:43,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-28 00:36:43,958 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:36:43,958 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:36:43,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1790432035, now seen corresponding path program 3 times [2023-01-28 00:36:43,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:36:43,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216052402] [2023-01-28 00:36:43,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:36:43,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:36:43,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:36:44,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:36:44,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:36:44,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216052402] [2023-01-28 00:36:44,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216052402] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:36:44,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:36:44,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-28 00:36:44,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730136674] [2023-01-28 00:36:44,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:36:44,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-01-28 00:36:44,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:36:44,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-01-28 00:36:44,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-01-28 00:36:44,403 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 210 [2023-01-28 00:36:44,403 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 54 transitions, 391 flow. Second operand has 8 states, 8 states have (on average 85.0) internal successors, (680), 8 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:36:44,403 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:36:44,403 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 210 [2023-01-28 00:36:44,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:36:44,934 INFO L130 PetriNetUnfolder]: 2452/3651 cut-off events. [2023-01-28 00:36:44,934 INFO L131 PetriNetUnfolder]: For 14203/14203 co-relation queries the response was YES. [2023-01-28 00:36:44,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14858 conditions, 3651 events. 2452/3651 cut-off events. For 14203/14203 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 17256 event pairs, 345 based on Foata normal form. 60/3711 useless extension candidates. Maximal degree in co-relation 14830. Up to 2403 conditions per place. [2023-01-28 00:36:44,950 INFO L137 encePairwiseOnDemand]: 200/210 looper letters, 77 selfloop transitions, 40 changer transitions 16/133 dead transitions. [2023-01-28 00:36:44,950 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 133 transitions, 1174 flow [2023-01-28 00:36:44,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-28 00:36:44,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-01-28 00:36:44,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 926 transitions. [2023-01-28 00:36:44,952 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44095238095238093 [2023-01-28 00:36:44,952 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 926 transitions. [2023-01-28 00:36:44,952 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 926 transitions. [2023-01-28 00:36:44,953 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:36:44,953 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 926 transitions. [2023-01-28 00:36:44,954 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 92.6) internal successors, (926), 10 states have internal predecessors, (926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:36:44,956 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 210.0) internal successors, (2310), 11 states have internal predecessors, (2310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:36:44,956 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 210.0) internal successors, (2310), 11 states have internal predecessors, (2310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:36:44,957 INFO L175 Difference]: Start difference. First operand has 59 places, 54 transitions, 391 flow. Second operand 10 states and 926 transitions. [2023-01-28 00:36:44,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 133 transitions, 1174 flow [2023-01-28 00:36:44,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 133 transitions, 1017 flow, removed 62 selfloop flow, removed 6 redundant places. [2023-01-28 00:36:44,981 INFO L231 Difference]: Finished difference. Result has 69 places, 77 transitions, 712 flow [2023-01-28 00:36:44,981 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=323, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=712, PETRI_PLACES=69, PETRI_TRANSITIONS=77} [2023-01-28 00:36:44,982 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 32 predicate places. [2023-01-28 00:36:44,982 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 77 transitions, 712 flow [2023-01-28 00:36:44,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 85.0) internal successors, (680), 8 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:36:44,982 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:36:44,982 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:36:44,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-01-28 00:36:44,983 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:36:44,983 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:36:44,983 INFO L85 PathProgramCache]: Analyzing trace with hash -2092816244, now seen corresponding path program 1 times [2023-01-28 00:36:44,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:36:44,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415600336] [2023-01-28 00:36:44,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:36:44,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:36:45,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:36:45,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:36:45,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:36:45,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415600336] [2023-01-28 00:36:45,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415600336] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:36:45,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:36:45,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 00:36:45,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499117179] [2023-01-28 00:36:45,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:36:45,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 00:36:45,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:36:45,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 00:36:45,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-01-28 00:36:45,247 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 210 [2023-01-28 00:36:45,249 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 77 transitions, 712 flow. Second operand has 6 states, 6 states have (on average 83.66666666666667) internal successors, (502), 6 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:36:45,249 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:36:45,250 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 210 [2023-01-28 00:36:45,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:36:45,834 INFO L130 PetriNetUnfolder]: 3240/4842 cut-off events. [2023-01-28 00:36:45,834 INFO L131 PetriNetUnfolder]: For 27147/27147 co-relation queries the response was YES. [2023-01-28 00:36:45,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21497 conditions, 4842 events. 3240/4842 cut-off events. For 27147/27147 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 24335 event pairs, 330 based on Foata normal form. 64/4906 useless extension candidates. Maximal degree in co-relation 21465. Up to 2633 conditions per place. [2023-01-28 00:36:45,857 INFO L137 encePairwiseOnDemand]: 201/210 looper letters, 127 selfloop transitions, 15 changer transitions 46/188 dead transitions. [2023-01-28 00:36:45,858 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 188 transitions, 2081 flow [2023-01-28 00:36:45,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 00:36:45,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 00:36:45,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 644 transitions. [2023-01-28 00:36:45,860 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4380952380952381 [2023-01-28 00:36:45,860 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 644 transitions. [2023-01-28 00:36:45,860 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 644 transitions. [2023-01-28 00:36:45,860 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:36:45,860 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 644 transitions. [2023-01-28 00:36:45,861 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 92.0) internal successors, (644), 7 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:36:45,863 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 210.0) internal successors, (1680), 8 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:36:45,863 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 210.0) internal successors, (1680), 8 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:36:45,863 INFO L175 Difference]: Start difference. First operand has 69 places, 77 transitions, 712 flow. Second operand 7 states and 644 transitions. [2023-01-28 00:36:45,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 188 transitions, 2081 flow [2023-01-28 00:36:45,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 188 transitions, 2014 flow, removed 33 selfloop flow, removed 3 redundant places. [2023-01-28 00:36:45,890 INFO L231 Difference]: Finished difference. Result has 75 places, 87 transitions, 830 flow [2023-01-28 00:36:45,890 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=679, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=830, PETRI_PLACES=75, PETRI_TRANSITIONS=87} [2023-01-28 00:36:45,891 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 38 predicate places. [2023-01-28 00:36:45,891 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 87 transitions, 830 flow [2023-01-28 00:36:45,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 83.66666666666667) internal successors, (502), 6 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:36:45,891 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:36:45,892 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:36:45,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-28 00:36:45,892 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:36:45,892 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:36:45,892 INFO L85 PathProgramCache]: Analyzing trace with hash -907411786, now seen corresponding path program 2 times [2023-01-28 00:36:45,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:36:45,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182485307] [2023-01-28 00:36:45,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:36:45,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:36:45,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:36:46,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:36:46,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:36:46,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182485307] [2023-01-28 00:36:46,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182485307] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:36:46,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:36:46,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 00:36:46,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300929367] [2023-01-28 00:36:46,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:36:46,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 00:36:46,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:36:46,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 00:36:46,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 00:36:46,010 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 210 [2023-01-28 00:36:46,010 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 87 transitions, 830 flow. Second operand has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:36:46,011 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:36:46,011 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 210 [2023-01-28 00:36:46,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:36:46,191 INFO L130 PetriNetUnfolder]: 740/1310 cut-off events. [2023-01-28 00:36:46,191 INFO L131 PetriNetUnfolder]: For 11114/11303 co-relation queries the response was YES. [2023-01-28 00:36:46,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6480 conditions, 1310 events. 740/1310 cut-off events. For 11114/11303 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 7154 event pairs, 139 based on Foata normal form. 146/1432 useless extension candidates. Maximal degree in co-relation 6444. Up to 1005 conditions per place. [2023-01-28 00:36:46,197 INFO L137 encePairwiseOnDemand]: 205/210 looper letters, 74 selfloop transitions, 4 changer transitions 0/90 dead transitions. [2023-01-28 00:36:46,197 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 90 transitions, 993 flow [2023-01-28 00:36:46,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 00:36:46,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 00:36:46,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 321 transitions. [2023-01-28 00:36:46,199 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5095238095238095 [2023-01-28 00:36:46,199 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 321 transitions. [2023-01-28 00:36:46,199 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 321 transitions. [2023-01-28 00:36:46,199 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:36:46,199 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 321 transitions. [2023-01-28 00:36:46,200 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:36:46,201 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:36:46,201 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:36:46,201 INFO L175 Difference]: Start difference. First operand has 75 places, 87 transitions, 830 flow. Second operand 3 states and 321 transitions. [2023-01-28 00:36:46,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 90 transitions, 993 flow [2023-01-28 00:36:46,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 90 transitions, 931 flow, removed 1 selfloop flow, removed 5 redundant places. [2023-01-28 00:36:46,211 INFO L231 Difference]: Finished difference. Result has 72 places, 69 transitions, 604 flow [2023-01-28 00:36:46,211 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=578, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=604, PETRI_PLACES=72, PETRI_TRANSITIONS=69} [2023-01-28 00:36:46,212 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 35 predicate places. [2023-01-28 00:36:46,212 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 69 transitions, 604 flow [2023-01-28 00:36:46,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:36:46,213 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:36:46,213 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:36:46,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-01-28 00:36:46,213 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:36:46,213 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:36:46,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1566867711, now seen corresponding path program 1 times [2023-01-28 00:36:46,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:36:46,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863425420] [2023-01-28 00:36:46,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:36:46,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:36:46,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:36:46,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:36:46,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:36:46,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863425420] [2023-01-28 00:36:46,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863425420] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:36:46,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:36:46,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 00:36:46,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326999253] [2023-01-28 00:36:46,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:36:46,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 00:36:46,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:36:46,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 00:36:46,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-28 00:36:46,371 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 210 [2023-01-28 00:36:46,372 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 69 transitions, 604 flow. Second operand has 4 states, 4 states have (on average 99.5) internal successors, (398), 4 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:36:46,372 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:36:46,372 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 210 [2023-01-28 00:36:46,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:36:46,493 INFO L130 PetriNetUnfolder]: 338/682 cut-off events. [2023-01-28 00:36:46,493 INFO L131 PetriNetUnfolder]: For 4754/4861 co-relation queries the response was YES. [2023-01-28 00:36:46,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3440 conditions, 682 events. 338/682 cut-off events. For 4754/4861 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3456 event pairs, 58 based on Foata normal form. 96/767 useless extension candidates. Maximal degree in co-relation 3406. Up to 216 conditions per place. [2023-01-28 00:36:46,496 INFO L137 encePairwiseOnDemand]: 205/210 looper letters, 80 selfloop transitions, 7 changer transitions 1/100 dead transitions. [2023-01-28 00:36:46,496 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 100 transitions, 1053 flow [2023-01-28 00:36:46,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 00:36:46,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 00:36:46,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 428 transitions. [2023-01-28 00:36:46,498 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5095238095238095 [2023-01-28 00:36:46,498 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 428 transitions. [2023-01-28 00:36:46,498 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 428 transitions. [2023-01-28 00:36:46,499 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:36:46,499 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 428 transitions. [2023-01-28 00:36:46,499 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 107.0) internal successors, (428), 4 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:36:46,500 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 210.0) internal successors, (1050), 5 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:36:46,501 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 210.0) internal successors, (1050), 5 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:36:46,501 INFO L175 Difference]: Start difference. First operand has 72 places, 69 transitions, 604 flow. Second operand 4 states and 428 transitions. [2023-01-28 00:36:46,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 100 transitions, 1053 flow [2023-01-28 00:36:46,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 100 transitions, 1015 flow, removed 17 selfloop flow, removed 1 redundant places. [2023-01-28 00:36:46,506 INFO L231 Difference]: Finished difference. Result has 75 places, 69 transitions, 603 flow [2023-01-28 00:36:46,506 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=563, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=603, PETRI_PLACES=75, PETRI_TRANSITIONS=69} [2023-01-28 00:36:46,507 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 38 predicate places. [2023-01-28 00:36:46,507 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 69 transitions, 603 flow [2023-01-28 00:36:46,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 99.5) internal successors, (398), 4 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:36:46,507 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:36:46,507 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:36:46,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-01-28 00:36:46,508 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:36:46,508 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:36:46,508 INFO L85 PathProgramCache]: Analyzing trace with hash -686732120, now seen corresponding path program 1 times [2023-01-28 00:36:46,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:36:46,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412814433] [2023-01-28 00:36:46,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:36:46,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:36:46,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:36:46,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:36:46,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:36:46,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412814433] [2023-01-28 00:36:46,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412814433] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:36:46,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:36:46,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 00:36:46,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853019252] [2023-01-28 00:36:46,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:36:46,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 00:36:46,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:36:46,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 00:36:46,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-01-28 00:36:46,710 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 210 [2023-01-28 00:36:46,710 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 69 transitions, 603 flow. Second operand has 5 states, 5 states have (on average 99.2) internal successors, (496), 5 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:36:46,710 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:36:46,711 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 210 [2023-01-28 00:36:46,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:36:46,804 INFO L130 PetriNetUnfolder]: 279/555 cut-off events. [2023-01-28 00:36:46,805 INFO L131 PetriNetUnfolder]: For 3530/3612 co-relation queries the response was YES. [2023-01-28 00:36:46,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2747 conditions, 555 events. 279/555 cut-off events. For 3530/3612 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2822 event pairs, 50 based on Foata normal form. 47/591 useless extension candidates. Maximal degree in co-relation 2711. Up to 204 conditions per place. [2023-01-28 00:36:46,807 INFO L137 encePairwiseOnDemand]: 205/210 looper letters, 54 selfloop transitions, 10 changer transitions 28/99 dead transitions. [2023-01-28 00:36:46,807 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 99 transitions, 1037 flow [2023-01-28 00:36:46,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 00:36:46,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 00:36:46,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 524 transitions. [2023-01-28 00:36:46,809 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4990476190476191 [2023-01-28 00:36:46,809 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 524 transitions. [2023-01-28 00:36:46,809 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 524 transitions. [2023-01-28 00:36:46,809 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:36:46,809 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 524 transitions. [2023-01-28 00:36:46,810 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 104.8) internal successors, (524), 5 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:36:46,811 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:36:46,811 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:36:46,811 INFO L175 Difference]: Start difference. First operand has 75 places, 69 transitions, 603 flow. Second operand 5 states and 524 transitions. [2023-01-28 00:36:46,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 99 transitions, 1037 flow [2023-01-28 00:36:46,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 99 transitions, 955 flow, removed 31 selfloop flow, removed 5 redundant places. [2023-01-28 00:36:46,818 INFO L231 Difference]: Finished difference. Result has 75 places, 48 transitions, 373 flow [2023-01-28 00:36:46,819 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=537, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=373, PETRI_PLACES=75, PETRI_TRANSITIONS=48} [2023-01-28 00:36:46,820 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 38 predicate places. [2023-01-28 00:36:46,820 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 48 transitions, 373 flow [2023-01-28 00:36:46,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 99.2) internal successors, (496), 5 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:36:46,821 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:36:46,821 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:36:46,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-01-28 00:36:46,821 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:36:46,821 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:36:46,821 INFO L85 PathProgramCache]: Analyzing trace with hash 103496180, now seen corresponding path program 1 times [2023-01-28 00:36:46,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:36:46,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156959932] [2023-01-28 00:36:46,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:36:46,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:36:46,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:36:47,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:36:47,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:36:47,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156959932] [2023-01-28 00:36:47,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156959932] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:36:47,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:36:47,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 00:36:47,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651222205] [2023-01-28 00:36:47,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:36:47,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 00:36:47,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:36:47,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 00:36:47,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-01-28 00:36:47,098 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 210 [2023-01-28 00:36:47,099 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 48 transitions, 373 flow. Second operand has 6 states, 6 states have (on average 85.0) internal successors, (510), 6 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:36:47,099 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:36:47,099 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 210 [2023-01-28 00:36:47,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:36:47,348 INFO L130 PetriNetUnfolder]: 505/904 cut-off events. [2023-01-28 00:36:47,349 INFO L131 PetriNetUnfolder]: For 3618/3618 co-relation queries the response was YES. [2023-01-28 00:36:47,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4168 conditions, 904 events. 505/904 cut-off events. For 3618/3618 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 4042 event pairs, 135 based on Foata normal form. 1/905 useless extension candidates. Maximal degree in co-relation 4138. Up to 586 conditions per place. [2023-01-28 00:36:47,351 INFO L137 encePairwiseOnDemand]: 203/210 looper letters, 46 selfloop transitions, 3 changer transitions 54/103 dead transitions. [2023-01-28 00:36:47,352 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 103 transitions, 979 flow [2023-01-28 00:36:47,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 00:36:47,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 00:36:47,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 628 transitions. [2023-01-28 00:36:47,353 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4272108843537415 [2023-01-28 00:36:47,353 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 628 transitions. [2023-01-28 00:36:47,353 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 628 transitions. [2023-01-28 00:36:47,353 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:36:47,354 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 628 transitions. [2023-01-28 00:36:47,354 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 89.71428571428571) internal successors, (628), 7 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:36:47,356 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 210.0) internal successors, (1680), 8 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:36:47,357 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 210.0) internal successors, (1680), 8 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:36:47,357 INFO L175 Difference]: Start difference. First operand has 75 places, 48 transitions, 373 flow. Second operand 7 states and 628 transitions. [2023-01-28 00:36:47,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 103 transitions, 979 flow [2023-01-28 00:36:47,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 103 transitions, 787 flow, removed 49 selfloop flow, removed 17 redundant places. [2023-01-28 00:36:47,364 INFO L231 Difference]: Finished difference. Result has 63 places, 39 transitions, 227 flow [2023-01-28 00:36:47,364 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=277, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=227, PETRI_PLACES=63, PETRI_TRANSITIONS=39} [2023-01-28 00:36:47,364 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 26 predicate places. [2023-01-28 00:36:47,365 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 39 transitions, 227 flow [2023-01-28 00:36:47,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 85.0) internal successors, (510), 6 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:36:47,365 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:36:47,365 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:36:47,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-01-28 00:36:47,365 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:36:47,365 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:36:47,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1125040908, now seen corresponding path program 2 times [2023-01-28 00:36:47,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:36:47,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571937814] [2023-01-28 00:36:47,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:36:47,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:36:47,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 00:36:47,394 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-28 00:36:47,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 00:36:47,452 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-28 00:36:47,452 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-28 00:36:47,453 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-01-28 00:36:47,454 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-01-28 00:36:47,454 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-01-28 00:36:47,454 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-01-28 00:36:47,454 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-01-28 00:36:47,454 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-01-28 00:36:47,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-01-28 00:36:47,454 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 1, 1, 1, 1, 1] [2023-01-28 00:36:47,460 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-28 00:36:47,460 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-28 00:36:47,516 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 12:36:47 BasicIcfg [2023-01-28 00:36:47,520 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-28 00:36:47,521 INFO L158 Benchmark]: Toolchain (without parser) took 12648.79ms. Allocated memory was 335.5MB in the beginning and 853.5MB in the end (delta: 518.0MB). Free memory was 287.8MB in the beginning and 707.9MB in the end (delta: -420.1MB). Peak memory consumption was 98.4MB. Max. memory is 16.0GB. [2023-01-28 00:36:47,521 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 255.9MB. Free memory is still 213.4MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-28 00:36:47,521 INFO L158 Benchmark]: CACSL2BoogieTranslator took 308.50ms. Allocated memory is still 335.5MB. Free memory was 287.4MB in the beginning and 264.2MB in the end (delta: 23.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-01-28 00:36:47,521 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.45ms. Allocated memory is still 335.5MB. Free memory was 264.2MB in the beginning and 261.4MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 00:36:47,521 INFO L158 Benchmark]: Boogie Preprocessor took 35.17ms. Allocated memory is still 335.5MB. Free memory was 261.4MB in the beginning and 259.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 00:36:47,521 INFO L158 Benchmark]: RCFGBuilder took 518.28ms. Allocated memory is still 335.5MB. Free memory was 259.7MB in the beginning and 291.7MB in the end (delta: -32.1MB). Peak memory consumption was 25.1MB. Max. memory is 16.0GB. [2023-01-28 00:36:47,522 INFO L158 Benchmark]: TraceAbstraction took 11741.42ms. Allocated memory was 335.5MB in the beginning and 853.5MB in the end (delta: 518.0MB). Free memory was 291.0MB in the beginning and 707.9MB in the end (delta: -416.9MB). Peak memory consumption was 100.5MB. Max. memory is 16.0GB. [2023-01-28 00:36:47,522 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.08ms. Allocated memory is still 255.9MB. Free memory is still 213.4MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 308.50ms. Allocated memory is still 335.5MB. Free memory was 287.4MB in the beginning and 264.2MB in the end (delta: 23.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 41.45ms. Allocated memory is still 335.5MB. Free memory was 264.2MB in the beginning and 261.4MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 35.17ms. Allocated memory is still 335.5MB. Free memory was 261.4MB in the beginning and 259.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 518.28ms. Allocated memory is still 335.5MB. Free memory was 259.7MB in the beginning and 291.7MB in the end (delta: -32.1MB). Peak memory consumption was 25.1MB. Max. memory is 16.0GB. * TraceAbstraction took 11741.42ms. Allocated memory was 335.5MB in the beginning and 853.5MB in the end (delta: 518.0MB). Free memory was 291.0MB in the beginning and 707.9MB in the end (delta: -416.9MB). Peak memory consumption was 100.5MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.0s, 119 PlacesBefore, 37 PlacesAfterwards, 111 TransitionsBefore, 28 TransitionsAfterwards, 2198 CoEnabledTransitionPairs, 6 FixpointIterations, 41 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 96 TotalNumberOfCompositions, 6126 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2675, independent: 2488, independent conditional: 0, independent unconditional: 2488, dependent: 187, dependent conditional: 0, dependent unconditional: 187, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1204, independent: 1169, independent conditional: 0, independent unconditional: 1169, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2675, independent: 1319, independent conditional: 0, independent unconditional: 1319, dependent: 152, dependent conditional: 0, dependent unconditional: 152, unknown: 1204, unknown conditional: 0, unknown unconditional: 1204] , Statistics on independence cache: Total cache size (in pairs): 114, Positive cache size: 96, Positive conditional cache size: 0, Positive unconditional cache size: 96, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p1_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L719] 0 int a = 0; [L720] 0 _Bool main$tmp_guard0; [L721] 0 _Bool main$tmp_guard1; [L723] 0 int x = 0; [L724] 0 _Bool x$flush_delayed; [L725] 0 int x$mem_tmp; [L726] 0 _Bool x$r_buff0_thd0; [L727] 0 _Bool x$r_buff0_thd1; [L728] 0 _Bool x$r_buff0_thd2; [L729] 0 _Bool x$r_buff0_thd3; [L730] 0 _Bool x$r_buff1_thd0; [L731] 0 _Bool x$r_buff1_thd1; [L732] 0 _Bool x$r_buff1_thd2; [L733] 0 _Bool x$r_buff1_thd3; [L734] 0 _Bool x$read_delayed; [L735] 0 int *x$read_delayed_var; [L736] 0 int x$w_buff0; [L737] 0 _Bool x$w_buff0_used; [L738] 0 int x$w_buff1; [L739] 0 _Bool x$w_buff1_used; [L741] 0 int y = 0; [L743] 0 int z = 0; [L744] 0 _Bool weak$$choice0; [L745] 0 _Bool weak$$choice2; [L835] 0 pthread_t t299; [L836] FCALL, FORK 0 pthread_create(&t299, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t299, ((void *)0), P0, ((void *)0))=-1, t299={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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L837] 0 pthread_t t300; [L838] FCALL, FORK 0 pthread_create(&t300, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t300, ((void *)0), P1, ((void *)0))=0, t299={5:0}, t300={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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L839] 0 pthread_t t301; [L840] FCALL, FORK 0 pthread_create(&t301, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t301, ((void *)0), P2, ((void *)0))=1, t299={5:0}, t300={6:0}, t301={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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L769] 2 x$w_buff1 = x$w_buff0 [L770] 2 x$w_buff0 = 2 [L771] 2 x$w_buff1_used = x$w_buff0_used [L772] 2 x$w_buff0_used = (_Bool)1 [L773] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L773] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L774] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L775] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L776] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L777] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L778] 2 x$r_buff0_thd2 = (_Bool)1 [L781] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L784] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L787] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L804] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L807] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L810] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L749] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L752] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L755] 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) [L756] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L757] 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 [L758] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L759] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L764] 1 return 0; [L790] 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) [L791] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L792] 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 [L793] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L794] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L813] 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) [L814] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L815] 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 [L816] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L817] 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 [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L822] 3 return 0; [L842] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L844] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L844] RET 0 assume_abort_if_not(main$tmp_guard0) [L846] 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) [L847] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L848] 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 [L849] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L850] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t299={5:0}, t300={6:0}, t301={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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L853] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L854] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L855] 0 x$flush_delayed = weak$$choice2 [L856] 0 x$mem_tmp = x [L857] 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) [L858] 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)) [L859] 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)) [L860] 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)) [L861] 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)) [L862] 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)) [L863] 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)) [L864] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L865] 0 x = x$flush_delayed ? x$mem_tmp : x [L866] 0 x$flush_delayed = (_Bool)0 [L868] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=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: 840]: 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: 836]: 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: 838]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 144 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 11.6s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 408 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 408 mSDsluCounter, 126 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 70 mSDsCounter, 62 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1479 IncrementalHoareTripleChecker+Invalid, 1541 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 62 mSolverCounterUnsat, 56 mSDtfsCounter, 1479 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 68 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=830occurred in iteration=9, InterpolantAutomatonStates: 76, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 218 NumberOfCodeBlocks, 218 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 181 ConstructedInterpolants, 0 QuantifiedInterpolants, 1920 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-01-28 00:36:47,541 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...