/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 AFTER -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix039.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-28 06:55:56,423 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-28 06:55:56,424 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-28 06:55:56,454 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-28 06:55:56,454 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-28 06:55:56,456 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-28 06:55:56,458 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-28 06:55:56,460 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-28 06:55:56,461 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-28 06:55:56,465 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-28 06:55:56,466 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-28 06:55:56,467 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-28 06:55:56,467 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-28 06:55:56,469 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-28 06:55:56,470 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-28 06:55:56,470 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-28 06:55:56,471 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-28 06:55:56,472 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-28 06:55:56,473 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-28 06:55:56,477 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-28 06:55:56,478 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-28 06:55:56,478 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-28 06:55:56,479 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-28 06:55:56,480 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-28 06:55:56,486 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-28 06:55:56,486 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-28 06:55:56,486 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-28 06:55:56,487 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-28 06:55:56,487 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-28 06:55:56,488 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-28 06:55:56,488 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-28 06:55:56,488 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-28 06:55:56,489 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-28 06:55:56,490 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-28 06:55:56,490 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-28 06:55:56,490 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-28 06:55:56,491 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-28 06:55:56,491 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-28 06:55:56,491 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-28 06:55:56,491 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-28 06:55:56,492 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-28 06:55:56,493 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 06:55:56,514 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-28 06:55:56,514 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-28 06:55:56,515 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-28 06:55:56,515 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-28 06:55:56,516 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-28 06:55:56,516 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-28 06:55:56,516 INFO L138 SettingsManager]: * Use SBE=true [2023-01-28 06:55:56,517 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-28 06:55:56,517 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-28 06:55:56,517 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-28 06:55:56,517 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-28 06:55:56,518 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-28 06:55:56,518 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-28 06:55:56,518 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-28 06:55:56,518 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-28 06:55:56,518 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-28 06:55:56,518 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-28 06:55:56,518 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-28 06:55:56,518 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-28 06:55:56,518 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-28 06:55:56,518 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-28 06:55:56,518 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-28 06:55:56,518 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-28 06:55:56,519 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 06:55:56,519 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-28 06:55:56,519 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-28 06:55:56,519 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-28 06:55:56,519 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-28 06:55:56,519 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-28 06:55:56,519 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-28 06:55:56,519 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-28 06:55:56,519 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 -> AFTER [2023-01-28 06:55:56,706 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-28 06:55:56,723 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-28 06:55:56,726 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-28 06:55:56,727 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-28 06:55:56,727 INFO L275 PluginConnector]: CDTParser initialized [2023-01-28 06:55:56,728 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix039.oepc.i [2023-01-28 06:55:57,798 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-28 06:55:57,970 INFO L351 CDTParser]: Found 1 translation units. [2023-01-28 06:55:57,971 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix039.oepc.i [2023-01-28 06:55:57,980 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8cf22bd1b/016cbf11db79451fb26c656d18976511/FLAG902032fbc [2023-01-28 06:55:57,992 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8cf22bd1b/016cbf11db79451fb26c656d18976511 [2023-01-28 06:55:57,994 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-28 06:55:57,994 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-28 06:55:57,995 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-28 06:55:57,995 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-28 06:55:57,997 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-28 06:55:57,997 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 06:55:57" (1/1) ... [2023-01-28 06:55:57,998 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54111230 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:55:57, skipping insertion in model container [2023-01-28 06:55:57,998 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 06:55:57" (1/1) ... [2023-01-28 06:55:58,007 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-28 06:55:58,035 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-28 06:55:58,120 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/mix039.oepc.i[945,958] [2023-01-28 06:55:58,267 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 06:55:58,277 INFO L203 MainTranslator]: Completed pre-run [2023-01-28 06:55:58,286 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/mix039.oepc.i[945,958] [2023-01-28 06:55:58,347 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 06:55:58,371 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 06:55:58,372 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 06:55:58,376 INFO L208 MainTranslator]: Completed translation [2023-01-28 06:55:58,377 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:55:58 WrapperNode [2023-01-28 06:55:58,377 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-28 06:55:58,378 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-28 06:55:58,378 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-28 06:55:58,378 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-28 06:55:58,382 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:55:58" (1/1) ... [2023-01-28 06:55:58,409 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:55:58" (1/1) ... [2023-01-28 06:55:58,438 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 146 [2023-01-28 06:55:58,438 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-28 06:55:58,438 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-28 06:55:58,438 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-28 06:55:58,439 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-28 06:55:58,445 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:55:58" (1/1) ... [2023-01-28 06:55:58,445 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:55:58" (1/1) ... [2023-01-28 06:55:58,456 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:55:58" (1/1) ... [2023-01-28 06:55:58,457 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:55:58" (1/1) ... [2023-01-28 06:55:58,462 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:55:58" (1/1) ... [2023-01-28 06:55:58,463 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:55:58" (1/1) ... [2023-01-28 06:55:58,465 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:55:58" (1/1) ... [2023-01-28 06:55:58,466 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:55:58" (1/1) ... [2023-01-28 06:55:58,468 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-28 06:55:58,469 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-28 06:55:58,469 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-28 06:55:58,469 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-28 06:55:58,469 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:55:58" (1/1) ... [2023-01-28 06:55:58,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 06:55:58,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 06:55:58,518 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 06:55:58,531 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 06:55:58,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-28 06:55:58,582 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-28 06:55:58,583 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-28 06:55:58,583 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-28 06:55:58,583 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-28 06:55:58,583 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-01-28 06:55:58,583 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-01-28 06:55:58,583 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-01-28 06:55:58,583 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-01-28 06:55:58,583 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-01-28 06:55:58,583 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-01-28 06:55:58,583 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-01-28 06:55:58,583 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-01-28 06:55:58,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-28 06:55:58,583 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-28 06:55:58,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-28 06:55:58,584 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-28 06:55:58,584 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 06:55:58,700 INFO L236 CfgBuilder]: Building ICFG [2023-01-28 06:55:58,702 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-28 06:55:58,950 INFO L277 CfgBuilder]: Performing block encoding [2023-01-28 06:55:59,078 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-28 06:55:59,078 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-01-28 06:55:59,080 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 06:55:59 BoogieIcfgContainer [2023-01-28 06:55:59,080 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-28 06:55:59,081 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-28 06:55:59,082 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-28 06:55:59,084 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-28 06:55:59,084 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 06:55:57" (1/3) ... [2023-01-28 06:55:59,084 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@514438b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 06:55:59, skipping insertion in model container [2023-01-28 06:55:59,084 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:55:58" (2/3) ... [2023-01-28 06:55:59,084 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@514438b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 06:55:59, skipping insertion in model container [2023-01-28 06:55:59,085 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 06:55:59" (3/3) ... [2023-01-28 06:55:59,085 INFO L112 eAbstractionObserver]: Analyzing ICFG mix039.oepc.i [2023-01-28 06:55:59,097 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-28 06:55:59,097 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-01-28 06:55:59,097 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-28 06:55:59,155 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-28 06:55:59,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 144 places, 133 transitions, 286 flow [2023-01-28 06:55:59,245 INFO L130 PetriNetUnfolder]: 2/129 cut-off events. [2023-01-28 06:55:59,245 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 06:55:59,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 129 events. 2/129 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 75 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2023-01-28 06:55:59,250 INFO L82 GeneralOperation]: Start removeDead. Operand has 144 places, 133 transitions, 286 flow [2023-01-28 06:55:59,260 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 140 places, 129 transitions, 270 flow [2023-01-28 06:55:59,263 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 06:55:59,274 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 140 places, 129 transitions, 270 flow [2023-01-28 06:55:59,277 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 140 places, 129 transitions, 270 flow [2023-01-28 06:55:59,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 129 transitions, 270 flow [2023-01-28 06:55:59,313 INFO L130 PetriNetUnfolder]: 2/129 cut-off events. [2023-01-28 06:55:59,314 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 06:55:59,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 129 events. 2/129 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 75 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2023-01-28 06:55:59,318 INFO L119 LiptonReduction]: Number of co-enabled transitions 3270 [2023-01-28 06:56:02,583 INFO L134 LiptonReduction]: Checked pairs total: 8894 [2023-01-28 06:56:02,583 INFO L136 LiptonReduction]: Total number of compositions: 109 [2023-01-28 06:56:02,593 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-28 06:56:02,597 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;@42b42963, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 06:56:02,598 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-01-28 06:56:02,599 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2023-01-28 06:56:02,599 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 06:56:02,599 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:56:02,600 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-01-28 06:56:02,600 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 06:56:02,603 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:56:02,603 INFO L85 PathProgramCache]: Analyzing trace with hash 553531, now seen corresponding path program 1 times [2023-01-28 06:56:02,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:56:02,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048844753] [2023-01-28 06:56:02,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:56:02,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:56:02,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:56:02,870 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 06:56:02,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:56:02,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048844753] [2023-01-28 06:56:02,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048844753] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:56:02,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:56:02,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-28 06:56:02,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007681427] [2023-01-28 06:56:02,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:56:02,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 06:56:02,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:56:02,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 06:56:02,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 06:56:02,896 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 242 [2023-01-28 06:56:02,900 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 31 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states 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 06:56:02,900 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:56:02,900 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 242 [2023-01-28 06:56:02,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:56:03,625 INFO L130 PetriNetUnfolder]: 5879/8109 cut-off events. [2023-01-28 06:56:03,625 INFO L131 PetriNetUnfolder]: For 77/77 co-relation queries the response was YES. [2023-01-28 06:56:03,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16253 conditions, 8109 events. 5879/8109 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 367. Compared 40514 event pairs, 2239 based on Foata normal form. 0/7719 useless extension candidates. Maximal degree in co-relation 16241. Up to 6367 conditions per place. [2023-01-28 06:56:03,663 INFO L137 encePairwiseOnDemand]: 238/242 looper letters, 43 selfloop transitions, 2 changer transitions 2/50 dead transitions. [2023-01-28 06:56:03,663 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 50 transitions, 215 flow [2023-01-28 06:56:03,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 06:56:03,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 06:56:03,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 401 transitions. [2023-01-28 06:56:03,673 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5523415977961432 [2023-01-28 06:56:03,673 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 401 transitions. [2023-01-28 06:56:03,674 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 401 transitions. [2023-01-28 06:56:03,675 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:56:03,676 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 401 transitions. [2023-01-28 06:56:03,679 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 0 states have call successors, (0), 0 states 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 06:56:03,682 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:03,683 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:03,684 INFO L175 Difference]: Start difference. First operand has 43 places, 31 transitions, 74 flow. Second operand 3 states and 401 transitions. [2023-01-28 06:56:03,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 50 transitions, 215 flow [2023-01-28 06:56:03,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 50 transitions, 208 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-01-28 06:56:03,687 INFO L231 Difference]: Finished difference. Result has 40 places, 28 transitions, 68 flow [2023-01-28 06:56:03,689 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=40, PETRI_TRANSITIONS=28} [2023-01-28 06:56:03,691 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -3 predicate places. [2023-01-28 06:56:03,691 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 28 transitions, 68 flow [2023-01-28 06:56:03,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states 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 06:56:03,691 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:56:03,691 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:56:03,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-28 06:56:03,692 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 06:56:03,692 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:56:03,692 INFO L85 PathProgramCache]: Analyzing trace with hash 276887586, now seen corresponding path program 1 times [2023-01-28 06:56:03,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:56:03,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098187095] [2023-01-28 06:56:03,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:56:03,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:56:03,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:56:03,998 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 06:56:03,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:56:04,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098187095] [2023-01-28 06:56:04,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098187095] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:56:04,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:56:04,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-28 06:56:04,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513295973] [2023-01-28 06:56:04,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:56:04,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 06:56:04,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:56:04,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 06:56:04,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 06:56:04,002 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 242 [2023-01-28 06:56:04,002 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 28 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states 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 06:56:04,002 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:56:04,002 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 242 [2023-01-28 06:56:04,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:56:05,323 INFO L130 PetriNetUnfolder]: 14423/19622 cut-off events. [2023-01-28 06:56:05,324 INFO L131 PetriNetUnfolder]: For 1011/1011 co-relation queries the response was YES. [2023-01-28 06:56:05,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40728 conditions, 19622 events. 14423/19622 cut-off events. For 1011/1011 co-relation queries the response was YES. Maximal size of possible extension queue 626. Compared 101314 event pairs, 5141 based on Foata normal form. 458/20080 useless extension candidates. Maximal degree in co-relation 40718. Up to 13627 conditions per place. [2023-01-28 06:56:05,402 INFO L137 encePairwiseOnDemand]: 234/242 looper letters, 46 selfloop transitions, 7 changer transitions 0/53 dead transitions. [2023-01-28 06:56:05,402 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 53 transitions, 232 flow [2023-01-28 06:56:05,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 06:56:05,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 06:56:05,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 375 transitions. [2023-01-28 06:56:05,405 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5165289256198347 [2023-01-28 06:56:05,405 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 375 transitions. [2023-01-28 06:56:05,405 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 375 transitions. [2023-01-28 06:56:05,405 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:56:05,405 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 375 transitions. [2023-01-28 06:56:05,406 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states 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 06:56:05,408 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:05,408 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:05,408 INFO L175 Difference]: Start difference. First operand has 40 places, 28 transitions, 68 flow. Second operand 3 states and 375 transitions. [2023-01-28 06:56:05,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 53 transitions, 232 flow [2023-01-28 06:56:05,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 53 transitions, 226 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 06:56:05,410 INFO L231 Difference]: Finished difference. Result has 41 places, 34 transitions, 118 flow [2023-01-28 06:56:05,410 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=118, PETRI_PLACES=41, PETRI_TRANSITIONS=34} [2023-01-28 06:56:05,411 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -2 predicate places. [2023-01-28 06:56:05,411 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 34 transitions, 118 flow [2023-01-28 06:56:05,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states 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 06:56:05,411 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:56:05,411 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:56:05,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-28 06:56:05,412 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 06:56:05,412 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:56:05,412 INFO L85 PathProgramCache]: Analyzing trace with hash -6420764, now seen corresponding path program 1 times [2023-01-28 06:56:05,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:56:05,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976866220] [2023-01-28 06:56:05,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:56:05,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:56:05,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:56:05,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:56:05,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:56:05,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976866220] [2023-01-28 06:56:05,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976866220] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:56:05,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:56:05,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 06:56:05,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140924450] [2023-01-28 06:56:05,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:56:05,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 06:56:05,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:56:05,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 06:56:05,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-28 06:56:05,568 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 242 [2023-01-28 06:56:05,569 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 34 transitions, 118 flow. Second operand has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 0 states 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 06:56:05,569 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:56:05,569 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 242 [2023-01-28 06:56:05,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:56:06,962 INFO L130 PetriNetUnfolder]: 13341/18172 cut-off events. [2023-01-28 06:56:06,962 INFO L131 PetriNetUnfolder]: For 6586/6586 co-relation queries the response was YES. [2023-01-28 06:56:06,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44397 conditions, 18172 events. 13341/18172 cut-off events. For 6586/6586 co-relation queries the response was YES. Maximal size of possible extension queue 564. Compared 90168 event pairs, 3866 based on Foata normal form. 230/18402 useless extension candidates. Maximal degree in co-relation 44385. Up to 9003 conditions per place. [2023-01-28 06:56:07,020 INFO L137 encePairwiseOnDemand]: 234/242 looper letters, 54 selfloop transitions, 8 changer transitions 0/62 dead transitions. [2023-01-28 06:56:07,020 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 62 transitions, 320 flow [2023-01-28 06:56:07,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 06:56:07,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 06:56:07,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 486 transitions. [2023-01-28 06:56:07,021 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5020661157024794 [2023-01-28 06:56:07,022 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 486 transitions. [2023-01-28 06:56:07,022 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 486 transitions. [2023-01-28 06:56:07,022 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:56:07,022 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 486 transitions. [2023-01-28 06:56:07,023 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 121.5) internal successors, (486), 4 states have internal predecessors, (486), 0 states have call successors, (0), 0 states 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 06:56:07,024 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:07,024 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:07,025 INFO L175 Difference]: Start difference. First operand has 41 places, 34 transitions, 118 flow. Second operand 4 states and 486 transitions. [2023-01-28 06:56:07,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 62 transitions, 320 flow [2023-01-28 06:56:07,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 62 transitions, 298 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 06:56:07,059 INFO L231 Difference]: Finished difference. Result has 45 places, 38 transitions, 162 flow [2023-01-28 06:56:07,059 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=162, PETRI_PLACES=45, PETRI_TRANSITIONS=38} [2023-01-28 06:56:07,060 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 2 predicate places. [2023-01-28 06:56:07,062 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 38 transitions, 162 flow [2023-01-28 06:56:07,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 0 states 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 06:56:07,063 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:56:07,063 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:56:07,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-28 06:56:07,063 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 06:56:07,064 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:56:07,064 INFO L85 PathProgramCache]: Analyzing trace with hash -269327850, now seen corresponding path program 1 times [2023-01-28 06:56:07,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:56:07,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183635673] [2023-01-28 06:56:07,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:56:07,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:56:07,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:56:07,185 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 06:56:07,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:56:07,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183635673] [2023-01-28 06:56:07,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183635673] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:56:07,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:56:07,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 06:56:07,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730540513] [2023-01-28 06:56:07,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:56:07,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 06:56:07,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:56:07,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 06:56:07,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-28 06:56:07,187 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 242 [2023-01-28 06:56:07,188 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 38 transitions, 162 flow. Second operand has 4 states, 4 states have (on average 110.25) internal successors, (441), 4 states have internal predecessors, (441), 0 states have call successors, (0), 0 states 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 06:56:07,188 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:56:07,188 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 242 [2023-01-28 06:56:07,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:56:08,339 INFO L130 PetriNetUnfolder]: 13066/17797 cut-off events. [2023-01-28 06:56:08,339 INFO L131 PetriNetUnfolder]: For 10868/10868 co-relation queries the response was YES. [2023-01-28 06:56:08,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46038 conditions, 17797 events. 13066/17797 cut-off events. For 10868/10868 co-relation queries the response was YES. Maximal size of possible extension queue 548. Compared 90844 event pairs, 1906 based on Foata normal form. 40/17837 useless extension candidates. Maximal degree in co-relation 46023. Up to 11755 conditions per place. [2023-01-28 06:56:08,410 INFO L137 encePairwiseOnDemand]: 234/242 looper letters, 60 selfloop transitions, 16 changer transitions 0/76 dead transitions. [2023-01-28 06:56:08,411 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 76 transitions, 434 flow [2023-01-28 06:56:08,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 06:56:08,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 06:56:08,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 496 transitions. [2023-01-28 06:56:08,412 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.512396694214876 [2023-01-28 06:56:08,412 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 496 transitions. [2023-01-28 06:56:08,412 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 496 transitions. [2023-01-28 06:56:08,413 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:56:08,413 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 496 transitions. [2023-01-28 06:56:08,414 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 124.0) internal successors, (496), 4 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 06:56:08,415 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:08,415 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:08,415 INFO L175 Difference]: Start difference. First operand has 45 places, 38 transitions, 162 flow. Second operand 4 states and 496 transitions. [2023-01-28 06:56:08,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 76 transitions, 434 flow [2023-01-28 06:56:08,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 76 transitions, 429 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 06:56:08,433 INFO L231 Difference]: Finished difference. Result has 49 places, 44 transitions, 255 flow [2023-01-28 06:56:08,433 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=255, PETRI_PLACES=49, PETRI_TRANSITIONS=44} [2023-01-28 06:56:08,434 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 6 predicate places. [2023-01-28 06:56:08,434 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 44 transitions, 255 flow [2023-01-28 06:56:08,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 110.25) internal successors, (441), 4 states have internal predecessors, (441), 0 states have call successors, (0), 0 states 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 06:56:08,434 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:56:08,434 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:56:08,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-28 06:56:08,434 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 06:56:08,435 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:56:08,435 INFO L85 PathProgramCache]: Analyzing trace with hash 240772694, now seen corresponding path program 1 times [2023-01-28 06:56:08,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:56:08,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436457382] [2023-01-28 06:56:08,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:56:08,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:56:08,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:56:08,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:56:08,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:56:08,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436457382] [2023-01-28 06:56:08,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436457382] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:56:08,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:56:08,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 06:56:08,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482121372] [2023-01-28 06:56:08,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:56:08,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 06:56:08,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:56:08,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 06:56:08,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 06:56:08,664 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 242 [2023-01-28 06:56:08,664 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 44 transitions, 255 flow. Second operand has 4 states, 4 states have (on average 111.5) internal successors, (446), 4 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:08,664 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:56:08,664 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 242 [2023-01-28 06:56:08,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:56:09,805 INFO L130 PetriNetUnfolder]: 8736/12786 cut-off events. [2023-01-28 06:56:09,805 INFO L131 PetriNetUnfolder]: For 10730/11330 co-relation queries the response was YES. [2023-01-28 06:56:09,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33939 conditions, 12786 events. 8736/12786 cut-off events. For 10730/11330 co-relation queries the response was YES. Maximal size of possible extension queue 605. Compared 76506 event pairs, 1478 based on Foata normal form. 1189/13750 useless extension candidates. Maximal degree in co-relation 33921. Up to 7904 conditions per place. [2023-01-28 06:56:09,875 INFO L137 encePairwiseOnDemand]: 235/242 looper letters, 88 selfloop transitions, 10 changer transitions 0/110 dead transitions. [2023-01-28 06:56:09,875 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 110 transitions, 750 flow [2023-01-28 06:56:09,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 06:56:09,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 06:56:09,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 616 transitions. [2023-01-28 06:56:09,877 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.509090909090909 [2023-01-28 06:56:09,877 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 616 transitions. [2023-01-28 06:56:09,877 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 616 transitions. [2023-01-28 06:56:09,877 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:56:09,877 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 616 transitions. [2023-01-28 06:56:09,878 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 123.2) internal successors, (616), 5 states have internal predecessors, (616), 0 states have call successors, (0), 0 states 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 06:56:09,880 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 242.0) internal successors, (1452), 6 states have internal predecessors, (1452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:09,880 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 242.0) internal successors, (1452), 6 states have internal predecessors, (1452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:09,881 INFO L175 Difference]: Start difference. First operand has 49 places, 44 transitions, 255 flow. Second operand 5 states and 616 transitions. [2023-01-28 06:56:09,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 110 transitions, 750 flow [2023-01-28 06:56:09,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 110 transitions, 750 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-01-28 06:56:09,895 INFO L231 Difference]: Finished difference. Result has 56 places, 53 transitions, 330 flow [2023-01-28 06:56:09,895 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=255, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=330, PETRI_PLACES=56, PETRI_TRANSITIONS=53} [2023-01-28 06:56:09,897 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 13 predicate places. [2023-01-28 06:56:09,897 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 53 transitions, 330 flow [2023-01-28 06:56:09,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.5) internal successors, (446), 4 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:09,897 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:56:09,897 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 06:56:09,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-28 06:56:09,898 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 06:56:09,898 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:56:09,898 INFO L85 PathProgramCache]: Analyzing trace with hash 783884324, now seen corresponding path program 1 times [2023-01-28 06:56:09,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:56:09,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808478034] [2023-01-28 06:56:09,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:56:09,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:56:09,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:56:10,094 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 06:56:10,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:56:10,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808478034] [2023-01-28 06:56:10,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808478034] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:56:10,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:56:10,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 06:56:10,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909399450] [2023-01-28 06:56:10,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:56:10,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 06:56:10,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:56:10,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 06:56:10,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-28 06:56:10,097 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 242 [2023-01-28 06:56:10,097 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 53 transitions, 330 flow. Second operand has 4 states, 4 states have (on average 111.25) internal successors, (445), 4 states have internal predecessors, (445), 0 states have call successors, (0), 0 states 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 06:56:10,097 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:56:10,097 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 242 [2023-01-28 06:56:10,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:56:11,456 INFO L130 PetriNetUnfolder]: 14422/20478 cut-off events. [2023-01-28 06:56:11,457 INFO L131 PetriNetUnfolder]: For 30676/30676 co-relation queries the response was YES. [2023-01-28 06:56:11,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69913 conditions, 20478 events. 14422/20478 cut-off events. For 30676/30676 co-relation queries the response was YES. Maximal size of possible extension queue 723. Compared 117498 event pairs, 3683 based on Foata normal form. 204/20682 useless extension candidates. Maximal degree in co-relation 69890. Up to 11392 conditions per place. [2023-01-28 06:56:11,575 INFO L137 encePairwiseOnDemand]: 236/242 looper letters, 67 selfloop transitions, 11 changer transitions 14/92 dead transitions. [2023-01-28 06:56:11,575 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 92 transitions, 671 flow [2023-01-28 06:56:11,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 06:56:11,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 06:56:11,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 492 transitions. [2023-01-28 06:56:11,577 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5082644628099173 [2023-01-28 06:56:11,577 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 492 transitions. [2023-01-28 06:56:11,577 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 492 transitions. [2023-01-28 06:56:11,577 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:56:11,577 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 492 transitions. [2023-01-28 06:56:11,578 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 123.0) internal successors, (492), 4 states have internal predecessors, (492), 0 states have call successors, (0), 0 states 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 06:56:11,579 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:11,579 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:11,579 INFO L175 Difference]: Start difference. First operand has 56 places, 53 transitions, 330 flow. Second operand 4 states and 492 transitions. [2023-01-28 06:56:11,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 92 transitions, 671 flow [2023-01-28 06:56:11,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 92 transitions, 662 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 06:56:11,678 INFO L231 Difference]: Finished difference. Result has 59 places, 46 transitions, 308 flow [2023-01-28 06:56:11,678 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=308, PETRI_PLACES=59, PETRI_TRANSITIONS=46} [2023-01-28 06:56:11,679 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 16 predicate places. [2023-01-28 06:56:11,679 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 46 transitions, 308 flow [2023-01-28 06:56:11,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.25) internal successors, (445), 4 states have internal predecessors, (445), 0 states have call successors, (0), 0 states 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 06:56:11,679 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:56:11,679 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 06:56:11,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-28 06:56:11,679 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 06:56:11,680 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:56:11,680 INFO L85 PathProgramCache]: Analyzing trace with hash 31700124, now seen corresponding path program 1 times [2023-01-28 06:56:11,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:56:11,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908538449] [2023-01-28 06:56:11,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:56:11,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:56:11,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:56:11,795 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 06:56:11,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:56:11,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908538449] [2023-01-28 06:56:11,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908538449] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:56:11,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:56:11,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 06:56:11,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913190785] [2023-01-28 06:56:11,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:56:11,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 06:56:11,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:56:11,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 06:56:11,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 06:56:11,797 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 242 [2023-01-28 06:56:11,798 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 46 transitions, 308 flow. Second operand has 4 states, 4 states have (on average 117.25) internal successors, (469), 4 states have internal predecessors, (469), 0 states have call successors, (0), 0 states 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 06:56:11,798 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:56:11,798 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 242 [2023-01-28 06:56:11,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:56:12,988 INFO L130 PetriNetUnfolder]: 11376/16832 cut-off events. [2023-01-28 06:56:12,988 INFO L131 PetriNetUnfolder]: For 24428/24617 co-relation queries the response was YES. [2023-01-28 06:56:13,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55031 conditions, 16832 events. 11376/16832 cut-off events. For 24428/24617 co-relation queries the response was YES. Maximal size of possible extension queue 774. Compared 105201 event pairs, 1974 based on Foata normal form. 267/16963 useless extension candidates. Maximal degree in co-relation 55006. Up to 8650 conditions per place. [2023-01-28 06:56:13,091 INFO L137 encePairwiseOnDemand]: 239/242 looper letters, 65 selfloop transitions, 3 changer transitions 7/83 dead transitions. [2023-01-28 06:56:13,091 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 83 transitions, 635 flow [2023-01-28 06:56:13,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 06:56:13,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 06:56:13,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 505 transitions. [2023-01-28 06:56:13,093 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5216942148760331 [2023-01-28 06:56:13,093 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 505 transitions. [2023-01-28 06:56:13,093 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 505 transitions. [2023-01-28 06:56:13,093 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:56:13,093 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 505 transitions. [2023-01-28 06:56:13,094 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 126.25) internal successors, (505), 4 states have internal predecessors, (505), 0 states have call successors, (0), 0 states 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 06:56:13,095 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:13,095 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:13,096 INFO L175 Difference]: Start difference. First operand has 59 places, 46 transitions, 308 flow. Second operand 4 states and 505 transitions. [2023-01-28 06:56:13,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 83 transitions, 635 flow [2023-01-28 06:56:13,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 83 transitions, 583 flow, removed 11 selfloop flow, removed 3 redundant places. [2023-01-28 06:56:13,260 INFO L231 Difference]: Finished difference. Result has 59 places, 47 transitions, 288 flow [2023-01-28 06:56:13,260 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=288, PETRI_PLACES=59, PETRI_TRANSITIONS=47} [2023-01-28 06:56:13,260 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 16 predicate places. [2023-01-28 06:56:13,260 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 47 transitions, 288 flow [2023-01-28 06:56:13,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 117.25) internal successors, (469), 4 states have internal predecessors, (469), 0 states have call successors, (0), 0 states 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 06:56:13,261 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:56:13,261 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 06:56:13,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-28 06:56:13,261 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 06:56:13,261 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:56:13,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1026078026, now seen corresponding path program 2 times [2023-01-28 06:56:13,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:56:13,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031984913] [2023-01-28 06:56:13,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:56:13,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:56:13,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:56:13,387 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 06:56:13,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:56:13,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031984913] [2023-01-28 06:56:13,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031984913] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:56:13,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:56:13,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 06:56:13,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751744993] [2023-01-28 06:56:13,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:56:13,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 06:56:13,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:56:13,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 06:56:13,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 06:56:13,388 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 242 [2023-01-28 06:56:13,389 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 47 transitions, 288 flow. Second operand has 5 states, 5 states have (on average 111.2) internal successors, (556), 5 states have internal predecessors, (556), 0 states have call successors, (0), 0 states 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 06:56:13,389 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:56:13,389 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 242 [2023-01-28 06:56:13,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:56:14,309 INFO L130 PetriNetUnfolder]: 7785/12161 cut-off events. [2023-01-28 06:56:14,309 INFO L131 PetriNetUnfolder]: For 10148/10276 co-relation queries the response was YES. [2023-01-28 06:56:14,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37927 conditions, 12161 events. 7785/12161 cut-off events. For 10148/10276 co-relation queries the response was YES. Maximal size of possible extension queue 600. Compared 79727 event pairs, 1198 based on Foata normal form. 1247/13273 useless extension candidates. Maximal degree in co-relation 37902. Up to 4641 conditions per place. [2023-01-28 06:56:14,355 INFO L137 encePairwiseOnDemand]: 235/242 looper letters, 99 selfloop transitions, 14 changer transitions 6/130 dead transitions. [2023-01-28 06:56:14,355 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 130 transitions, 956 flow [2023-01-28 06:56:14,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 06:56:14,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 06:56:14,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 742 transitions. [2023-01-28 06:56:14,357 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5110192837465565 [2023-01-28 06:56:14,358 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 742 transitions. [2023-01-28 06:56:14,358 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 742 transitions. [2023-01-28 06:56:14,358 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:56:14,358 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 742 transitions. [2023-01-28 06:56:14,359 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 123.66666666666667) internal successors, (742), 6 states have internal predecessors, (742), 0 states have call successors, (0), 0 states 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 06:56:14,361 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 242.0) internal successors, (1694), 7 states have internal predecessors, (1694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:14,361 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 242.0) internal successors, (1694), 7 states have internal predecessors, (1694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:14,361 INFO L175 Difference]: Start difference. First operand has 59 places, 47 transitions, 288 flow. Second operand 6 states and 742 transitions. [2023-01-28 06:56:14,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 130 transitions, 956 flow [2023-01-28 06:56:14,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 130 transitions, 951 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 06:56:14,374 INFO L231 Difference]: Finished difference. Result has 66 places, 56 transitions, 405 flow [2023-01-28 06:56:14,374 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=287, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=405, PETRI_PLACES=66, PETRI_TRANSITIONS=56} [2023-01-28 06:56:14,375 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 23 predicate places. [2023-01-28 06:56:14,375 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 56 transitions, 405 flow [2023-01-28 06:56:14,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 111.2) internal successors, (556), 5 states have internal predecessors, (556), 0 states have call successors, (0), 0 states 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 06:56:14,375 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:56:14,375 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 06:56:14,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-01-28 06:56:14,375 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 06:56:14,376 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:56:14,376 INFO L85 PathProgramCache]: Analyzing trace with hash -778512956, now seen corresponding path program 1 times [2023-01-28 06:56:14,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:56:14,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466965288] [2023-01-28 06:56:14,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:56:14,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:56:14,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:56:14,548 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 06:56:14,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:56:14,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466965288] [2023-01-28 06:56:14,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466965288] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:56:14,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:56:14,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 06:56:14,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199243707] [2023-01-28 06:56:14,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:56:14,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 06:56:14,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:56:14,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 06:56:14,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-01-28 06:56:14,553 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 242 [2023-01-28 06:56:14,553 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 56 transitions, 405 flow. Second operand has 6 states, 6 states have (on average 111.16666666666667) internal successors, (667), 6 states have internal predecessors, (667), 0 states have call successors, (0), 0 states 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 06:56:14,553 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:56:14,553 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 242 [2023-01-28 06:56:14,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:56:15,631 INFO L130 PetriNetUnfolder]: 6888/10826 cut-off events. [2023-01-28 06:56:15,631 INFO L131 PetriNetUnfolder]: For 16314/16438 co-relation queries the response was YES. [2023-01-28 06:56:15,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40784 conditions, 10826 events. 6888/10826 cut-off events. For 16314/16438 co-relation queries the response was YES. Maximal size of possible extension queue 565. Compared 70651 event pairs, 987 based on Foata normal form. 497/11191 useless extension candidates. Maximal degree in co-relation 40755. Up to 4284 conditions per place. [2023-01-28 06:56:15,677 INFO L137 encePairwiseOnDemand]: 235/242 looper letters, 107 selfloop transitions, 21 changer transitions 27/165 dead transitions. [2023-01-28 06:56:15,677 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 165 transitions, 1299 flow [2023-01-28 06:56:15,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-28 06:56:15,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-01-28 06:56:15,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 989 transitions. [2023-01-28 06:56:15,680 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5108471074380165 [2023-01-28 06:56:15,680 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 989 transitions. [2023-01-28 06:56:15,680 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 989 transitions. [2023-01-28 06:56:15,681 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:56:15,681 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 989 transitions. [2023-01-28 06:56:15,682 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 123.625) internal successors, (989), 8 states have internal predecessors, (989), 0 states have call successors, (0), 0 states 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 06:56:15,684 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 242.0) internal successors, (2178), 9 states have internal predecessors, (2178), 0 states have call successors, (0), 0 states 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 06:56:15,685 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 242.0) internal successors, (2178), 9 states have internal predecessors, (2178), 0 states have call successors, (0), 0 states 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 06:56:15,685 INFO L175 Difference]: Start difference. First operand has 66 places, 56 transitions, 405 flow. Second operand 8 states and 989 transitions. [2023-01-28 06:56:15,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 165 transitions, 1299 flow [2023-01-28 06:56:16,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 165 transitions, 1248 flow, removed 18 selfloop flow, removed 2 redundant places. [2023-01-28 06:56:16,408 INFO L231 Difference]: Finished difference. Result has 74 places, 62 transitions, 490 flow [2023-01-28 06:56:16,408 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=358, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=490, PETRI_PLACES=74, PETRI_TRANSITIONS=62} [2023-01-28 06:56:16,409 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 31 predicate places. [2023-01-28 06:56:16,409 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 62 transitions, 490 flow [2023-01-28 06:56:16,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 111.16666666666667) internal successors, (667), 6 states have internal predecessors, (667), 0 states have call successors, (0), 0 states 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 06:56:16,409 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:56:16,409 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 06:56:16,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-28 06:56:16,409 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 06:56:16,410 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:56:16,410 INFO L85 PathProgramCache]: Analyzing trace with hash 2086622499, now seen corresponding path program 1 times [2023-01-28 06:56:16,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:56:16,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142881711] [2023-01-28 06:56:16,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:56:16,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:56:16,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:56:17,121 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 06:56:17,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:56:17,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142881711] [2023-01-28 06:56:17,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142881711] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:56:17,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:56:17,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 06:56:17,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138635227] [2023-01-28 06:56:17,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:56:17,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 06:56:17,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:56:17,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 06:56:17,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-01-28 06:56:17,124 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 242 [2023-01-28 06:56:17,125 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 62 transitions, 490 flow. Second operand has 7 states, 7 states have (on average 101.42857142857143) internal successors, (710), 7 states have internal predecessors, (710), 0 states have call successors, (0), 0 states 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 06:56:17,125 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:56:17,125 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 242 [2023-01-28 06:56:17,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:56:18,854 INFO L130 PetriNetUnfolder]: 12590/19742 cut-off events. [2023-01-28 06:56:18,854 INFO L131 PetriNetUnfolder]: For 62238/62238 co-relation queries the response was YES. [2023-01-28 06:56:18,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81783 conditions, 19742 events. 12590/19742 cut-off events. For 62238/62238 co-relation queries the response was YES. Maximal size of possible extension queue 958. Compared 138447 event pairs, 943 based on Foata normal form. 11/19753 useless extension candidates. Maximal degree in co-relation 81751. Up to 5193 conditions per place. [2023-01-28 06:56:18,930 INFO L137 encePairwiseOnDemand]: 230/242 looper letters, 185 selfloop transitions, 45 changer transitions 109/339 dead transitions. [2023-01-28 06:56:18,931 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 339 transitions, 3378 flow [2023-01-28 06:56:18,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-28 06:56:18,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-01-28 06:56:18,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1059 transitions. [2023-01-28 06:56:18,933 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48622589531680444 [2023-01-28 06:56:18,933 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1059 transitions. [2023-01-28 06:56:18,933 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1059 transitions. [2023-01-28 06:56:18,934 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:56:18,934 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1059 transitions. [2023-01-28 06:56:18,935 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 117.66666666666667) internal successors, (1059), 9 states have internal predecessors, (1059), 0 states have call successors, (0), 0 states 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 06:56:18,937 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 242.0) internal successors, (2420), 10 states have internal predecessors, (2420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:18,938 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 242.0) internal successors, (2420), 10 states have internal predecessors, (2420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:18,938 INFO L175 Difference]: Start difference. First operand has 74 places, 62 transitions, 490 flow. Second operand 9 states and 1059 transitions. [2023-01-28 06:56:18,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 339 transitions, 3378 flow [2023-01-28 06:56:21,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 339 transitions, 2813 flow, removed 220 selfloop flow, removed 3 redundant places. [2023-01-28 06:56:21,362 INFO L231 Difference]: Finished difference. Result has 84 places, 87 transitions, 810 flow [2023-01-28 06:56:21,362 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=414, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=810, PETRI_PLACES=84, PETRI_TRANSITIONS=87} [2023-01-28 06:56:21,362 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 41 predicate places. [2023-01-28 06:56:21,362 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 87 transitions, 810 flow [2023-01-28 06:56:21,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 101.42857142857143) internal successors, (710), 7 states have internal predecessors, (710), 0 states have call successors, (0), 0 states 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 06:56:21,363 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:56:21,363 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 06:56:21,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-01-28 06:56:21,363 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 06:56:21,363 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:56:21,363 INFO L85 PathProgramCache]: Analyzing trace with hash -7539453, now seen corresponding path program 2 times [2023-01-28 06:56:21,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:56:21,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344715179] [2023-01-28 06:56:21,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:56:21,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:56:21,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:56:21,606 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 06:56:21,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:56:21,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344715179] [2023-01-28 06:56:21,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344715179] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:56:21,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:56:21,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-28 06:56:21,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499064892] [2023-01-28 06:56:21,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:56:21,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 06:56:21,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:56:21,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 06:56:21,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-01-28 06:56:21,608 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 242 [2023-01-28 06:56:21,608 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 87 transitions, 810 flow. Second operand has 7 states, 7 states have (on average 111.14285714285714) internal successors, (778), 7 states have internal predecessors, (778), 0 states have call successors, (0), 0 states 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 06:56:21,608 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:56:21,608 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 242 [2023-01-28 06:56:21,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:56:22,200 INFO L130 PetriNetUnfolder]: 3858/6194 cut-off events. [2023-01-28 06:56:22,201 INFO L131 PetriNetUnfolder]: For 16183/16447 co-relation queries the response was YES. [2023-01-28 06:56:22,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24753 conditions, 6194 events. 3858/6194 cut-off events. For 16183/16447 co-relation queries the response was YES. Maximal size of possible extension queue 280. Compared 37755 event pairs, 652 based on Foata normal form. 206/6330 useless extension candidates. Maximal degree in co-relation 24715. Up to 2454 conditions per place. [2023-01-28 06:56:22,226 INFO L137 encePairwiseOnDemand]: 235/242 looper letters, 86 selfloop transitions, 18 changer transitions 84/197 dead transitions. [2023-01-28 06:56:22,226 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 197 transitions, 2001 flow [2023-01-28 06:56:22,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-28 06:56:22,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-01-28 06:56:22,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 960 transitions. [2023-01-28 06:56:22,228 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49586776859504134 [2023-01-28 06:56:22,228 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 960 transitions. [2023-01-28 06:56:22,228 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 960 transitions. [2023-01-28 06:56:22,229 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:56:22,229 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 960 transitions. [2023-01-28 06:56:22,230 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 120.0) internal successors, (960), 8 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:22,232 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 242.0) internal successors, (2178), 9 states have internal predecessors, (2178), 0 states have call successors, (0), 0 states 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 06:56:22,232 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 242.0) internal successors, (2178), 9 states have internal predecessors, (2178), 0 states have call successors, (0), 0 states 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 06:56:22,232 INFO L175 Difference]: Start difference. First operand has 84 places, 87 transitions, 810 flow. Second operand 8 states and 960 transitions. [2023-01-28 06:56:22,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 197 transitions, 2001 flow [2023-01-28 06:56:22,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 197 transitions, 1795 flow, removed 31 selfloop flow, removed 8 redundant places. [2023-01-28 06:56:22,385 INFO L231 Difference]: Finished difference. Result has 82 places, 59 transitions, 450 flow [2023-01-28 06:56:22,385 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=673, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=450, PETRI_PLACES=82, PETRI_TRANSITIONS=59} [2023-01-28 06:56:22,385 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 39 predicate places. [2023-01-28 06:56:22,385 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 59 transitions, 450 flow [2023-01-28 06:56:22,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 111.14285714285714) internal successors, (778), 7 states have internal predecessors, (778), 0 states have call successors, (0), 0 states 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 06:56:22,386 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:56:22,386 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:56:22,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-01-28 06:56:22,386 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 06:56:22,386 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:56:22,386 INFO L85 PathProgramCache]: Analyzing trace with hash -97010353, now seen corresponding path program 1 times [2023-01-28 06:56:22,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:56:22,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345958939] [2023-01-28 06:56:22,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:56:22,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:56:22,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:56:23,186 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 06:56:23,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:56:23,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345958939] [2023-01-28 06:56:23,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345958939] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:56:23,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:56:23,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 06:56:23,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43488092] [2023-01-28 06:56:23,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:56:23,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 06:56:23,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:56:23,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 06:56:23,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-01-28 06:56:23,187 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 242 [2023-01-28 06:56:23,188 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 59 transitions, 450 flow. Second operand has 7 states, 7 states have (on average 110.57142857142857) internal successors, (774), 7 states have internal predecessors, (774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:23,188 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:56:23,188 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 242 [2023-01-28 06:56:23,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:56:23,733 INFO L130 PetriNetUnfolder]: 3130/5189 cut-off events. [2023-01-28 06:56:23,733 INFO L131 PetriNetUnfolder]: For 13853/13890 co-relation queries the response was YES. [2023-01-28 06:56:23,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22138 conditions, 5189 events. 3130/5189 cut-off events. For 13853/13890 co-relation queries the response was YES. Maximal size of possible extension queue 257. Compared 31379 event pairs, 556 based on Foata normal form. 12/5157 useless extension candidates. Maximal degree in co-relation 22103. Up to 1850 conditions per place. [2023-01-28 06:56:23,754 INFO L137 encePairwiseOnDemand]: 236/242 looper letters, 105 selfloop transitions, 6 changer transitions 40/158 dead transitions. [2023-01-28 06:56:23,755 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 158 transitions, 1460 flow [2023-01-28 06:56:23,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 06:56:23,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 06:56:23,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 728 transitions. [2023-01-28 06:56:23,773 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5013774104683195 [2023-01-28 06:56:23,773 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 728 transitions. [2023-01-28 06:56:23,773 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 728 transitions. [2023-01-28 06:56:23,773 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:56:23,773 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 728 transitions. [2023-01-28 06:56:23,774 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 121.33333333333333) internal successors, (728), 6 states have internal predecessors, (728), 0 states have call successors, (0), 0 states 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 06:56:23,776 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 242.0) internal successors, (1694), 7 states have internal predecessors, (1694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:23,776 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 242.0) internal successors, (1694), 7 states have internal predecessors, (1694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:23,776 INFO L175 Difference]: Start difference. First operand has 82 places, 59 transitions, 450 flow. Second operand 6 states and 728 transitions. [2023-01-28 06:56:23,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 158 transitions, 1460 flow [2023-01-28 06:56:23,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 158 transitions, 1167 flow, removed 71 selfloop flow, removed 11 redundant places. [2023-01-28 06:56:23,877 INFO L231 Difference]: Finished difference. Result has 77 places, 57 transitions, 353 flow [2023-01-28 06:56:23,877 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=354, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=353, PETRI_PLACES=77, PETRI_TRANSITIONS=57} [2023-01-28 06:56:23,877 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 34 predicate places. [2023-01-28 06:56:23,877 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 57 transitions, 353 flow [2023-01-28 06:56:23,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 110.57142857142857) internal successors, (774), 7 states have internal predecessors, (774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:23,878 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:56:23,878 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:56:23,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-01-28 06:56:23,878 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 06:56:23,878 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:56:23,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1168336319, now seen corresponding path program 2 times [2023-01-28 06:56:23,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:56:23,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093433649] [2023-01-28 06:56:23,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:56:23,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:56:23,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:56:24,263 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 06:56:24,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:56:24,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093433649] [2023-01-28 06:56:24,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093433649] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:56:24,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:56:24,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 06:56:24,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208661916] [2023-01-28 06:56:24,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:56:24,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 06:56:24,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:56:24,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 06:56:24,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-01-28 06:56:24,265 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 242 [2023-01-28 06:56:24,266 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 57 transitions, 353 flow. Second operand has 7 states, 7 states have (on average 106.0) internal successors, (742), 7 states have internal predecessors, (742), 0 states have call successors, (0), 0 states 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 06:56:24,266 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:56:24,266 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 242 [2023-01-28 06:56:24,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:56:24,901 INFO L130 PetriNetUnfolder]: 3735/5986 cut-off events. [2023-01-28 06:56:24,901 INFO L131 PetriNetUnfolder]: For 13465/13465 co-relation queries the response was YES. [2023-01-28 06:56:24,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23059 conditions, 5986 events. 3735/5986 cut-off events. For 13465/13465 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 34454 event pairs, 735 based on Foata normal form. 2/5988 useless extension candidates. Maximal degree in co-relation 23031. Up to 2914 conditions per place. [2023-01-28 06:56:24,921 INFO L137 encePairwiseOnDemand]: 229/242 looper letters, 126 selfloop transitions, 26 changer transitions 37/189 dead transitions. [2023-01-28 06:56:24,921 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 189 transitions, 1433 flow [2023-01-28 06:56:24,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-28 06:56:24,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-01-28 06:56:24,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1045 transitions. [2023-01-28 06:56:24,923 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4797979797979798 [2023-01-28 06:56:24,923 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1045 transitions. [2023-01-28 06:56:24,923 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1045 transitions. [2023-01-28 06:56:24,924 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:56:24,924 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1045 transitions. [2023-01-28 06:56:24,925 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 116.11111111111111) internal successors, (1045), 9 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states 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 06:56:24,927 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 242.0) internal successors, (2420), 10 states have internal predecessors, (2420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:24,927 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 242.0) internal successors, (2420), 10 states have internal predecessors, (2420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:24,927 INFO L175 Difference]: Start difference. First operand has 77 places, 57 transitions, 353 flow. Second operand 9 states and 1045 transitions. [2023-01-28 06:56:24,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 189 transitions, 1433 flow [2023-01-28 06:56:25,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 189 transitions, 1409 flow, removed 5 selfloop flow, removed 5 redundant places. [2023-01-28 06:56:25,030 INFO L231 Difference]: Finished difference. Result has 82 places, 74 transitions, 572 flow [2023-01-28 06:56:25,030 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=339, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=572, PETRI_PLACES=82, PETRI_TRANSITIONS=74} [2023-01-28 06:56:25,031 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 39 predicate places. [2023-01-28 06:56:25,031 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 74 transitions, 572 flow [2023-01-28 06:56:25,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 106.0) internal successors, (742), 7 states have internal predecessors, (742), 0 states have call successors, (0), 0 states 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 06:56:25,031 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:56:25,031 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:56:25,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-01-28 06:56:25,032 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 06:56:25,032 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:56:25,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1478578237, now seen corresponding path program 3 times [2023-01-28 06:56:25,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:56:25,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957399756] [2023-01-28 06:56:25,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:56:25,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:56:25,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:56:25,206 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 06:56:25,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:56:25,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957399756] [2023-01-28 06:56:25,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957399756] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:56:25,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:56:25,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 06:56:25,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461372746] [2023-01-28 06:56:25,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:56:25,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 06:56:25,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:56:25,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 06:56:25,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 06:56:25,207 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 242 [2023-01-28 06:56:25,208 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 74 transitions, 572 flow. Second operand has 5 states, 5 states have (on average 110.6) internal successors, (553), 5 states have internal predecessors, (553), 0 states have call successors, (0), 0 states 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 06:56:25,208 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:56:25,208 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 242 [2023-01-28 06:56:25,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:56:25,725 INFO L130 PetriNetUnfolder]: 3750/6007 cut-off events. [2023-01-28 06:56:25,725 INFO L131 PetriNetUnfolder]: For 18195/18195 co-relation queries the response was YES. [2023-01-28 06:56:25,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25004 conditions, 6007 events. 3750/6007 cut-off events. For 18195/18195 co-relation queries the response was YES. Maximal size of possible extension queue 247. Compared 34443 event pairs, 1018 based on Foata normal form. 2/6009 useless extension candidates. Maximal degree in co-relation 24971. Up to 3682 conditions per place. [2023-01-28 06:56:25,745 INFO L137 encePairwiseOnDemand]: 236/242 looper letters, 56 selfloop transitions, 6 changer transitions 84/146 dead transitions. [2023-01-28 06:56:25,746 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 146 transitions, 1297 flow [2023-01-28 06:56:25,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 06:56:25,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 06:56:25,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 712 transitions. [2023-01-28 06:56:25,747 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4903581267217631 [2023-01-28 06:56:25,747 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 712 transitions. [2023-01-28 06:56:25,747 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 712 transitions. [2023-01-28 06:56:25,748 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:56:25,748 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 712 transitions. [2023-01-28 06:56:25,749 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 118.66666666666667) internal successors, (712), 6 states have internal predecessors, (712), 0 states have call successors, (0), 0 states 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 06:56:25,750 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 242.0) internal successors, (1694), 7 states have internal predecessors, (1694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:25,750 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 242.0) internal successors, (1694), 7 states have internal predecessors, (1694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:25,750 INFO L175 Difference]: Start difference. First operand has 82 places, 74 transitions, 572 flow. Second operand 6 states and 712 transitions. [2023-01-28 06:56:25,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 146 transitions, 1297 flow [2023-01-28 06:56:25,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 146 transitions, 1273 flow, removed 9 selfloop flow, removed 3 redundant places. [2023-01-28 06:56:25,871 INFO L231 Difference]: Finished difference. Result has 84 places, 47 transitions, 322 flow [2023-01-28 06:56:25,872 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=556, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=322, PETRI_PLACES=84, PETRI_TRANSITIONS=47} [2023-01-28 06:56:25,872 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 41 predicate places. [2023-01-28 06:56:25,872 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 47 transitions, 322 flow [2023-01-28 06:56:25,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 110.6) internal successors, (553), 5 states have internal predecessors, (553), 0 states have call successors, (0), 0 states 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 06:56:25,872 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:56:25,872 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:56:25,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-01-28 06:56:25,873 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 06:56:25,873 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:56:25,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1563941025, now seen corresponding path program 4 times [2023-01-28 06:56:25,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:56:25,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41487479] [2023-01-28 06:56:25,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:56:25,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:56:25,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 06:56:25,903 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-28 06:56:25,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 06:56:25,948 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-28 06:56:25,949 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-28 06:56:25,949 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-01-28 06:56:25,950 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-01-28 06:56:25,951 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-01-28 06:56:25,951 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-01-28 06:56:25,951 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-01-28 06:56:25,951 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-01-28 06:56:25,951 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-01-28 06:56:25,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-01-28 06:56:25,952 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:56:25,955 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-28 06:56:25,955 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-28 06:56:26,023 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 06:56:26 BasicIcfg [2023-01-28 06:56:26,023 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-28 06:56:26,024 INFO L158 Benchmark]: Toolchain (without parser) took 28029.19ms. Allocated memory was 362.8MB in the beginning and 2.8GB in the end (delta: 2.4GB). Free memory was 321.1MB in the beginning and 1.8GB in the end (delta: -1.5GB). Peak memory consumption was 979.3MB. Max. memory is 16.0GB. [2023-01-28 06:56:26,024 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 362.8MB. Free memory is still 309.5MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-28 06:56:26,024 INFO L158 Benchmark]: CACSL2BoogieTranslator took 381.96ms. Allocated memory is still 362.8MB. Free memory was 321.1MB in the beginning and 297.0MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-01-28 06:56:26,024 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.32ms. Allocated memory is still 362.8MB. Free memory was 297.0MB in the beginning and 294.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 06:56:26,024 INFO L158 Benchmark]: Boogie Preprocessor took 29.97ms. Allocated memory is still 362.8MB. Free memory was 294.9MB in the beginning and 292.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 06:56:26,024 INFO L158 Benchmark]: RCFGBuilder took 611.13ms. Allocated memory is still 362.8MB. Free memory was 292.8MB in the beginning and 250.8MB in the end (delta: 41.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.0GB. [2023-01-28 06:56:26,025 INFO L158 Benchmark]: TraceAbstraction took 26941.87ms. Allocated memory was 362.8MB in the beginning and 2.8GB in the end (delta: 2.4GB). Free memory was 250.8MB in the beginning and 1.8GB in the end (delta: -1.5GB). Peak memory consumption was 910.1MB. Max. memory is 16.0GB. [2023-01-28 06:56:26,025 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 362.8MB. Free memory is still 309.5MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 381.96ms. Allocated memory is still 362.8MB. Free memory was 321.1MB in the beginning and 297.0MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 60.32ms. Allocated memory is still 362.8MB. Free memory was 297.0MB in the beginning and 294.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 29.97ms. Allocated memory is still 362.8MB. Free memory was 294.9MB in the beginning and 292.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 611.13ms. Allocated memory is still 362.8MB. Free memory was 292.8MB in the beginning and 250.8MB in the end (delta: 41.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.0GB. * TraceAbstraction took 26941.87ms. Allocated memory was 362.8MB in the beginning and 2.8GB in the end (delta: 2.4GB). Free memory was 250.8MB in the beginning and 1.8GB in the end (delta: -1.5GB). Peak memory consumption was 910.1MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.3s, 140 PlacesBefore, 43 PlacesAfterwards, 129 TransitionsBefore, 31 TransitionsAfterwards, 3270 CoEnabledTransitionPairs, 7 FixpointIterations, 44 TrivialSequentialCompositions, 54 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 1 ChoiceCompositions, 109 TotalNumberOfCompositions, 8894 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3196, independent: 2954, independent conditional: 0, independent unconditional: 2954, dependent: 242, dependent conditional: 0, dependent unconditional: 242, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1743, independent: 1690, independent conditional: 0, independent unconditional: 1690, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3196, independent: 1264, independent conditional: 0, independent unconditional: 1264, dependent: 189, dependent conditional: 0, dependent unconditional: 189, unknown: 1743, unknown conditional: 0, unknown unconditional: 1743] , Statistics on independence cache: Total cache size (in pairs): 176, Positive cache size: 152, Positive conditional cache size: 0, Positive unconditional cache size: 152, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L722] 0 int b = 0; [L723] 0 _Bool b$flush_delayed; [L724] 0 int b$mem_tmp; [L725] 0 _Bool b$r_buff0_thd0; [L726] 0 _Bool b$r_buff0_thd1; [L727] 0 _Bool b$r_buff0_thd2; [L728] 0 _Bool b$r_buff0_thd3; [L729] 0 _Bool b$r_buff0_thd4; [L730] 0 _Bool b$r_buff1_thd0; [L731] 0 _Bool b$r_buff1_thd1; [L732] 0 _Bool b$r_buff1_thd2; [L733] 0 _Bool b$r_buff1_thd3; [L734] 0 _Bool b$r_buff1_thd4; [L735] 0 _Bool b$read_delayed; [L736] 0 int *b$read_delayed_var; [L737] 0 int b$w_buff0; [L738] 0 _Bool b$w_buff0_used; [L739] 0 int b$w_buff1; [L740] 0 _Bool b$w_buff1_used; [L741] 0 _Bool main$tmp_guard0; [L742] 0 _Bool main$tmp_guard1; [L744] 0 int x = 0; [L746] 0 int y = 0; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L871] 0 pthread_t t1025; [L872] FCALL, FORK 0 pthread_create(&t1025, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1025, ((void *)0), P0, ((void *)0))=-1, t1025={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L873] 0 pthread_t t1026; [L754] 1 b$w_buff1 = b$w_buff0 [L755] 1 b$w_buff0 = 1 [L756] 1 b$w_buff1_used = b$w_buff0_used [L757] 1 b$w_buff0_used = (_Bool)1 [L758] CALL 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L758] RET 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L759] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L760] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L761] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L762] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L763] 1 b$r_buff1_thd4 = b$r_buff0_thd4 [L764] 1 b$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L874] FCALL, FORK 0 pthread_create(&t1026, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1026, ((void *)0), P1, ((void *)0))=0, t1025={5:0}, t1026={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L875] 0 pthread_t t1027; [L876] FCALL, FORK 0 pthread_create(&t1027, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1027, ((void *)0), P2, ((void *)0))=1, t1025={5:0}, t1026={6:0}, t1027={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L877] 0 pthread_t t1028; [L878] FCALL, FORK 0 pthread_create(&t1028, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1028, ((void *)0), P3, ((void *)0))=2, t1025={5:0}, t1026={6:0}, t1027={7:0}, t1028={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L767] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L784] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L787] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L804] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L807] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L824] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1] [L827] 4 a = 1 [L830] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1] [L833] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L834] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L835] 4 b$flush_delayed = weak$$choice2 [L836] 4 b$mem_tmp = b [L837] 4 b = !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L838] 4 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L839] 4 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L840] 4 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L841] 4 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] 4 b$r_buff0_thd4 = weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L843] 4 b$r_buff1_thd4 = weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L844] 4 __unbuffered_p3_EBX = b [L845] 4 b = b$flush_delayed ? b$mem_tmp : b [L846] 4 b$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=2, z=1] [L770] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L771] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L772] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L773] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L774] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=2, z=1] [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 1 return 0; [L810] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L811] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L812] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L813] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L814] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=2, z=1] [L790] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L791] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L792] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L793] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L794] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=2, z=1] [L817] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L819] 3 return 0; [L849] 4 b = b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L850] 4 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L851] 4 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L852] 4 b$r_buff0_thd4 = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L853] 4 b$r_buff1_thd4 = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=2, z=1] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L856] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L858] 4 return 0; [L880] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L882] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L882] RET 0 assume_abort_if_not(main$tmp_guard0) [L884] 0 b = b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L885] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L886] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L887] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L888] 0 b$r_buff1_thd0 = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1025={5:0}, t1026={6:0}, t1027={7:0}, t1028={3:0}, weak$$choice2=1, x=1, y=2, z=1] [L891] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L893] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y=2, 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: 874]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 876]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 872]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 878]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 171 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 26.8s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 19.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 691 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 691 mSDsluCounter, 76 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 38 mSDsCounter, 87 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2101 IncrementalHoareTripleChecker+Invalid, 2188 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 87 mSolverCounterUnsat, 38 mSDtfsCounter, 2101 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 69 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=810occurred in iteration=10, InterpolantAutomatonStates: 79, 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.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 284 NumberOfCodeBlocks, 284 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 242 ConstructedInterpolants, 0 QuantifiedInterpolants, 2279 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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 06:56:26,053 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...