/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/rfi006_pso.oepc_pso.opt_tso.oepc_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-27 18:15:43,455 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-27 18:15:43,457 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-27 18:15:43,483 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-27 18:15:43,483 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-27 18:15:43,485 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-27 18:15:43,487 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-27 18:15:43,489 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-27 18:15:43,491 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-27 18:15:43,494 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-27 18:15:43,495 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-27 18:15:43,497 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-27 18:15:43,497 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-27 18:15:43,500 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-27 18:15:43,501 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-27 18:15:43,502 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-27 18:15:43,502 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-27 18:15:43,503 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-27 18:15:43,504 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-27 18:15:43,508 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-27 18:15:43,508 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-27 18:15:43,509 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-27 18:15:43,510 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-27 18:15:43,511 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-27 18:15:43,517 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-27 18:15:43,517 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-27 18:15:43,517 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-27 18:15:43,518 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-27 18:15:43,518 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-27 18:15:43,519 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-27 18:15:43,519 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-27 18:15:43,519 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-27 18:15:43,520 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-27 18:15:43,521 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-27 18:15:43,521 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-27 18:15:43,521 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-27 18:15:43,522 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-27 18:15:43,522 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-27 18:15:43,522 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-27 18:15:43,523 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-27 18:15:43,523 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-27 18:15:43,524 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-01-27 18:15:43,552 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-27 18:15:43,552 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-27 18:15:43,553 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-27 18:15:43,553 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-27 18:15:43,554 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-27 18:15:43,554 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-27 18:15:43,554 INFO L138 SettingsManager]: * Use SBE=true [2023-01-27 18:15:43,554 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-27 18:15:43,555 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-27 18:15:43,555 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-27 18:15:43,555 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-27 18:15:43,555 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-27 18:15:43,555 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-27 18:15:43,555 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-27 18:15:43,556 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-27 18:15:43,556 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-27 18:15:43,556 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-27 18:15:43,556 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-27 18:15:43,556 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-27 18:15:43,556 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-27 18:15:43,556 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-27 18:15:43,556 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-27 18:15:43,556 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-27 18:15:43,556 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 18:15:43,557 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-27 18:15:43,557 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-27 18:15:43,557 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-27 18:15:43,557 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-27 18:15:43,557 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-27 18:15:43,557 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-27 18:15:43,557 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-27 18:15:43,557 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-01-27 18:15:43,760 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-27 18:15:43,775 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-27 18:15:43,777 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-27 18:15:43,777 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-27 18:15:43,778 INFO L275 PluginConnector]: CDTParser initialized [2023-01-27 18:15:43,778 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi006_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2023-01-27 18:15:44,795 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-27 18:15:45,025 INFO L351 CDTParser]: Found 1 translation units. [2023-01-27 18:15:45,025 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi006_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2023-01-27 18:15:45,045 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe251be2d/2a9e77153b9c41a9ade971df550544f2/FLAG360e18573 [2023-01-27 18:15:45,055 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe251be2d/2a9e77153b9c41a9ade971df550544f2 [2023-01-27 18:15:45,057 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-27 18:15:45,058 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-27 18:15:45,058 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-27 18:15:45,058 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-27 18:15:45,060 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-27 18:15:45,061 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 06:15:45" (1/1) ... [2023-01-27 18:15:45,062 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33945f71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:15:45, skipping insertion in model container [2023-01-27 18:15:45,062 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 06:15:45" (1/1) ... [2023-01-27 18:15:45,066 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-27 18:15:45,108 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-27 18:15:45,250 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/rfi006_pso.oepc_pso.opt_tso.oepc_tso.opt.i[974,987] [2023-01-27 18:15:45,441 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 18:15:45,450 INFO L203 MainTranslator]: Completed pre-run [2023-01-27 18:15:45,458 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/rfi006_pso.oepc_pso.opt_tso.oepc_tso.opt.i[974,987] [2023-01-27 18:15:45,515 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 18:15:45,540 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-27 18:15:45,541 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-27 18:15:45,546 INFO L208 MainTranslator]: Completed translation [2023-01-27 18:15:45,546 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:15:45 WrapperNode [2023-01-27 18:15:45,546 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-27 18:15:45,547 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-27 18:15:45,547 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-27 18:15:45,547 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-27 18:15:45,552 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:15:45" (1/1) ... [2023-01-27 18:15:45,578 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:15:45" (1/1) ... [2023-01-27 18:15:45,608 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 165 [2023-01-27 18:15:45,608 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-27 18:15:45,609 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-27 18:15:45,609 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-27 18:15:45,609 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-27 18:15:45,615 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:15:45" (1/1) ... [2023-01-27 18:15:45,615 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:15:45" (1/1) ... [2023-01-27 18:15:45,628 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:15:45" (1/1) ... [2023-01-27 18:15:45,629 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:15:45" (1/1) ... [2023-01-27 18:15:45,634 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:15:45" (1/1) ... [2023-01-27 18:15:45,643 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:15:45" (1/1) ... [2023-01-27 18:15:45,645 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:15:45" (1/1) ... [2023-01-27 18:15:45,646 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:15:45" (1/1) ... [2023-01-27 18:15:45,649 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-27 18:15:45,649 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-27 18:15:45,649 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-27 18:15:45,649 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-27 18:15:45,650 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:15:45" (1/1) ... [2023-01-27 18:15:45,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 18:15:45,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 18:15:45,690 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-01-27 18:15:45,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-01-27 18:15:45,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-27 18:15:45,714 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-27 18:15:45,714 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-27 18:15:45,714 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-27 18:15:45,714 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-27 18:15:45,714 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-01-27 18:15:45,714 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-01-27 18:15:45,714 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-01-27 18:15:45,715 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-01-27 18:15:45,715 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-01-27 18:15:45,715 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-01-27 18:15:45,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-27 18:15:45,715 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-27 18:15:45,715 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-27 18:15:45,715 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-27 18:15:45,716 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-01-27 18:15:45,850 INFO L236 CfgBuilder]: Building ICFG [2023-01-27 18:15:45,852 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-27 18:15:46,099 INFO L277 CfgBuilder]: Performing block encoding [2023-01-27 18:15:46,220 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-27 18:15:46,220 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-01-27 18:15:46,222 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 06:15:46 BoogieIcfgContainer [2023-01-27 18:15:46,222 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-27 18:15:46,224 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-27 18:15:46,224 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-27 18:15:46,226 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-27 18:15:46,226 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 06:15:45" (1/3) ... [2023-01-27 18:15:46,227 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f11c76f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 06:15:46, skipping insertion in model container [2023-01-27 18:15:46,227 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:15:45" (2/3) ... [2023-01-27 18:15:46,227 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f11c76f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 06:15:46, skipping insertion in model container [2023-01-27 18:15:46,228 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 06:15:46" (3/3) ... [2023-01-27 18:15:46,228 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi006_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2023-01-27 18:15:46,240 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-27 18:15:46,240 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-01-27 18:15:46,240 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-27 18:15:46,278 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-27 18:15:46,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 116 places, 108 transitions, 231 flow [2023-01-27 18:15:46,351 INFO L130 PetriNetUnfolder]: 2/105 cut-off events. [2023-01-27 18:15:46,352 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:15:46,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 105 events. 2/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 60 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2023-01-27 18:15:46,356 INFO L82 GeneralOperation]: Start removeDead. Operand has 116 places, 108 transitions, 231 flow [2023-01-27 18:15:46,359 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 113 places, 105 transitions, 219 flow [2023-01-27 18:15:46,362 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-27 18:15:46,369 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 113 places, 105 transitions, 219 flow [2023-01-27 18:15:46,371 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 113 places, 105 transitions, 219 flow [2023-01-27 18:15:46,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 105 transitions, 219 flow [2023-01-27 18:15:46,389 INFO L130 PetriNetUnfolder]: 2/105 cut-off events. [2023-01-27 18:15:46,389 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:15:46,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 105 events. 2/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 60 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2023-01-27 18:15:46,391 INFO L119 LiptonReduction]: Number of co-enabled transitions 1916 [2023-01-27 18:15:49,248 INFO L134 LiptonReduction]: Checked pairs total: 5105 [2023-01-27 18:15:49,249 INFO L136 LiptonReduction]: Total number of compositions: 90 [2023-01-27 18:15:49,258 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-27 18:15:49,262 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;@4f1e653d, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-27 18:15:49,263 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-01-27 18:15:49,264 INFO L130 PetriNetUnfolder]: 0/6 cut-off events. [2023-01-27 18:15:49,265 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:15:49,265 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:15:49,265 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-01-27 18:15:49,265 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:15:49,269 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:15:49,269 INFO L85 PathProgramCache]: Analyzing trace with hash 481970202, now seen corresponding path program 1 times [2023-01-27 18:15:49,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:15:49,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644265387] [2023-01-27 18:15:49,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:15:49,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:15:49,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:15:49,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-27 18:15:49,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:15:49,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644265387] [2023-01-27 18:15:49,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644265387] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:15:49,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:15:49,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-27 18:15:49,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420250331] [2023-01-27 18:15:49,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:15:49,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-27 18:15:49,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:15:49,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-27 18:15:49,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-27 18:15:49,633 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 198 [2023-01-27 18:15:49,635 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 59 flow. Second operand has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:15:49,635 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:15:49,635 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 198 [2023-01-27 18:15:49,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:15:49,945 INFO L130 PetriNetUnfolder]: 1093/1728 cut-off events. [2023-01-27 18:15:49,946 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2023-01-27 18:15:49,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3405 conditions, 1728 events. 1093/1728 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 8775 event pairs, 141 based on Foata normal form. 0/1647 useless extension candidates. Maximal degree in co-relation 3394. Up to 1369 conditions per place. [2023-01-27 18:15:49,956 INFO L137 encePairwiseOnDemand]: 194/198 looper letters, 30 selfloop transitions, 2 changer transitions 2/36 dead transitions. [2023-01-27 18:15:49,956 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 36 transitions, 152 flow [2023-01-27 18:15:49,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 18:15:49,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 18:15:49,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 316 transitions. [2023-01-27 18:15:49,965 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.531986531986532 [2023-01-27 18:15:49,966 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 316 transitions. [2023-01-27 18:15:49,966 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 316 transitions. [2023-01-27 18:15:49,967 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:15:49,969 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 316 transitions. [2023-01-27 18:15:49,972 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:15:49,976 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:15:49,976 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:15:49,978 INFO L175 Difference]: Start difference. First operand has 34 places, 25 transitions, 59 flow. Second operand 3 states and 316 transitions. [2023-01-27 18:15:49,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 36 transitions, 152 flow [2023-01-27 18:15:49,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 36 transitions, 148 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-01-27 18:15:49,981 INFO L231 Difference]: Finished difference. Result has 32 places, 22 transitions, 54 flow [2023-01-27 18:15:49,982 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=32, PETRI_TRANSITIONS=22} [2023-01-27 18:15:49,984 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2023-01-27 18:15:49,984 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 22 transitions, 54 flow [2023-01-27 18:15:49,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:15:49,985 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:15:49,985 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:15:49,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-27 18:15:49,985 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:15:49,985 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:15:49,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1469963573, now seen corresponding path program 1 times [2023-01-27 18:15:49,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:15:49,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236629418] [2023-01-27 18:15:49,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:15:49,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:15:50,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:15:50,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:15:50,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:15:50,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236629418] [2023-01-27 18:15:50,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236629418] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:15:50,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:15:50,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 18:15:50,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976101911] [2023-01-27 18:15:50,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:15:50,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 18:15:50,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:15:50,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 18:15:50,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-27 18:15:50,863 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 198 [2023-01-27 18:15:50,864 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 22 transitions, 54 flow. Second operand has 5 states, 5 states have (on average 79.0) internal successors, (395), 5 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:15:50,864 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:15:50,864 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 198 [2023-01-27 18:15:50,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:15:51,216 INFO L130 PetriNetUnfolder]: 1483/2226 cut-off events. [2023-01-27 18:15:51,217 INFO L131 PetriNetUnfolder]: For 121/121 co-relation queries the response was YES. [2023-01-27 18:15:51,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4650 conditions, 2226 events. 1483/2226 cut-off events. For 121/121 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 10201 event pairs, 245 based on Foata normal form. 120/2346 useless extension candidates. Maximal degree in co-relation 4640. Up to 1729 conditions per place. [2023-01-27 18:15:51,227 INFO L137 encePairwiseOnDemand]: 194/198 looper letters, 34 selfloop transitions, 2 changer transitions 21/57 dead transitions. [2023-01-27 18:15:51,227 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 57 transitions, 248 flow [2023-01-27 18:15:51,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 18:15:51,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 18:15:51,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 444 transitions. [2023-01-27 18:15:51,232 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4484848484848485 [2023-01-27 18:15:51,232 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 444 transitions. [2023-01-27 18:15:51,232 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 444 transitions. [2023-01-27 18:15:51,233 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:15:51,233 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 444 transitions. [2023-01-27 18:15:51,234 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 88.8) internal successors, (444), 5 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:15:51,237 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 198.0) internal successors, (1188), 6 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:15:51,237 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 198.0) internal successors, (1188), 6 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:15:51,237 INFO L175 Difference]: Start difference. First operand has 32 places, 22 transitions, 54 flow. Second operand 5 states and 444 transitions. [2023-01-27 18:15:51,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 57 transitions, 248 flow [2023-01-27 18:15:51,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 57 transitions, 238 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-27 18:15:51,239 INFO L231 Difference]: Finished difference. Result has 36 places, 22 transitions, 62 flow [2023-01-27 18:15:51,239 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=62, PETRI_PLACES=36, PETRI_TRANSITIONS=22} [2023-01-27 18:15:51,239 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 2 predicate places. [2023-01-27 18:15:51,240 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 22 transitions, 62 flow [2023-01-27 18:15:51,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 79.0) internal successors, (395), 5 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:15:51,240 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:15:51,240 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:15:51,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-27 18:15:51,241 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:15:51,242 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:15:51,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1675789258, now seen corresponding path program 1 times [2023-01-27 18:15:51,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:15:51,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949525848] [2023-01-27 18:15:51,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:15:51,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:15:51,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:15:51,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:15:51,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:15:51,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949525848] [2023-01-27 18:15:51,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949525848] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:15:51,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:15:51,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 18:15:51,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352088221] [2023-01-27 18:15:51,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:15:51,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 18:15:51,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:15:51,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 18:15:51,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-01-27 18:15:51,927 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 198 [2023-01-27 18:15:51,927 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 22 transitions, 62 flow. Second operand has 5 states, 5 states have (on average 77.2) internal successors, (386), 5 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:15:51,927 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:15:51,927 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 198 [2023-01-27 18:15:51,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:15:52,522 INFO L130 PetriNetUnfolder]: 1685/2512 cut-off events. [2023-01-27 18:15:52,522 INFO L131 PetriNetUnfolder]: For 701/701 co-relation queries the response was YES. [2023-01-27 18:15:52,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5607 conditions, 2512 events. 1685/2512 cut-off events. For 701/701 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 11311 event pairs, 176 based on Foata normal form. 116/2628 useless extension candidates. Maximal degree in co-relation 5594. Up to 1491 conditions per place. [2023-01-27 18:15:52,533 INFO L137 encePairwiseOnDemand]: 186/198 looper letters, 43 selfloop transitions, 18 changer transitions 37/98 dead transitions. [2023-01-27 18:15:52,533 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 98 transitions, 433 flow [2023-01-27 18:15:52,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-27 18:15:52,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-01-27 18:15:52,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 777 transitions. [2023-01-27 18:15:52,535 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43602693602693604 [2023-01-27 18:15:52,535 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 777 transitions. [2023-01-27 18:15:52,535 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 777 transitions. [2023-01-27 18:15:52,535 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:15:52,535 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 777 transitions. [2023-01-27 18:15:52,537 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 86.33333333333333) internal successors, (777), 9 states have internal predecessors, (777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:15:52,539 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 198.0) internal successors, (1980), 10 states have internal predecessors, (1980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:15:52,540 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 198.0) internal successors, (1980), 10 states have internal predecessors, (1980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:15:52,540 INFO L175 Difference]: Start difference. First operand has 36 places, 22 transitions, 62 flow. Second operand 9 states and 777 transitions. [2023-01-27 18:15:52,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 98 transitions, 433 flow [2023-01-27 18:15:52,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 98 transitions, 415 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-01-27 18:15:52,544 INFO L231 Difference]: Finished difference. Result has 45 places, 38 transitions, 214 flow [2023-01-27 18:15:52,544 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=214, PETRI_PLACES=45, PETRI_TRANSITIONS=38} [2023-01-27 18:15:52,545 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 11 predicate places. [2023-01-27 18:15:52,545 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 38 transitions, 214 flow [2023-01-27 18:15:52,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 77.2) internal successors, (386), 5 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:15:52,545 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:15:52,545 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:15:52,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-27 18:15:52,545 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:15:52,546 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:15:52,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1668422362, now seen corresponding path program 2 times [2023-01-27 18:15:52,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:15:52,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824648039] [2023-01-27 18:15:52,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:15:52,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:15:52,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:15:53,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:15:53,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:15:53,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824648039] [2023-01-27 18:15:53,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824648039] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:15:53,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:15:53,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 18:15:53,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150794750] [2023-01-27 18:15:53,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:15:53,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 18:15:53,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:15:53,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 18:15:53,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-27 18:15:53,231 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 198 [2023-01-27 18:15:53,231 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 38 transitions, 214 flow. Second operand has 5 states, 5 states have (on average 79.2) internal successors, (396), 5 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:15:53,231 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:15:53,231 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 198 [2023-01-27 18:15:53,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:15:53,580 INFO L130 PetriNetUnfolder]: 1497/2240 cut-off events. [2023-01-27 18:15:53,580 INFO L131 PetriNetUnfolder]: For 3494/3494 co-relation queries the response was YES. [2023-01-27 18:15:53,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8750 conditions, 2240 events. 1497/2240 cut-off events. For 3494/3494 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 9821 event pairs, 297 based on Foata normal form. 96/2336 useless extension candidates. Maximal degree in co-relation 8732. Up to 1525 conditions per place. [2023-01-27 18:15:53,593 INFO L137 encePairwiseOnDemand]: 194/198 looper letters, 52 selfloop transitions, 4 changer transitions 18/74 dead transitions. [2023-01-27 18:15:53,594 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 74 transitions, 554 flow [2023-01-27 18:15:53,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 18:15:53,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 18:15:53,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 438 transitions. [2023-01-27 18:15:53,595 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44242424242424244 [2023-01-27 18:15:53,595 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 438 transitions. [2023-01-27 18:15:53,595 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 438 transitions. [2023-01-27 18:15:53,596 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:15:53,596 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 438 transitions. [2023-01-27 18:15:53,597 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 87.6) internal successors, (438), 5 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:15:53,598 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 198.0) internal successors, (1188), 6 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:15:53,599 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 198.0) internal successors, (1188), 6 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:15:53,599 INFO L175 Difference]: Start difference. First operand has 45 places, 38 transitions, 214 flow. Second operand 5 states and 438 transitions. [2023-01-27 18:15:53,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 74 transitions, 554 flow [2023-01-27 18:15:53,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 74 transitions, 508 flow, removed 15 selfloop flow, removed 4 redundant places. [2023-01-27 18:15:53,609 INFO L231 Difference]: Finished difference. Result has 44 places, 38 transitions, 206 flow [2023-01-27 18:15:53,610 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=206, PETRI_PLACES=44, PETRI_TRANSITIONS=38} [2023-01-27 18:15:53,610 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 10 predicate places. [2023-01-27 18:15:53,610 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 38 transitions, 206 flow [2023-01-27 18:15:53,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 79.2) internal successors, (396), 5 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:15:53,611 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:15:53,611 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:15:53,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-27 18:15:53,611 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:15:53,611 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:15:53,611 INFO L85 PathProgramCache]: Analyzing trace with hash -702610837, now seen corresponding path program 1 times [2023-01-27 18:15:53,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:15:53,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016824579] [2023-01-27 18:15:53,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:15:53,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:15:53,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:15:53,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:15:53,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:15:53,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016824579] [2023-01-27 18:15:53,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016824579] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:15:53,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:15:53,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 18:15:53,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444885331] [2023-01-27 18:15:53,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:15:53,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 18:15:53,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:15:53,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 18:15:53,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-01-27 18:15:53,781 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 198 [2023-01-27 18:15:53,782 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 38 transitions, 206 flow. Second operand has 5 states, 5 states have (on average 87.6) internal successors, (438), 5 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:15:53,782 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:15:53,782 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 198 [2023-01-27 18:15:53,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:15:54,061 INFO L130 PetriNetUnfolder]: 1306/2040 cut-off events. [2023-01-27 18:15:54,061 INFO L131 PetriNetUnfolder]: For 3805/3805 co-relation queries the response was YES. [2023-01-27 18:15:54,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7547 conditions, 2040 events. 1306/2040 cut-off events. For 3805/3805 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 9776 event pairs, 224 based on Foata normal form. 48/2087 useless extension candidates. Maximal degree in co-relation 7528. Up to 1060 conditions per place. [2023-01-27 18:15:54,073 INFO L137 encePairwiseOnDemand]: 193/198 looper letters, 39 selfloop transitions, 5 changer transitions 29/74 dead transitions. [2023-01-27 18:15:54,073 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 74 transitions, 565 flow [2023-01-27 18:15:54,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-27 18:15:54,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-27 18:15:54,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 569 transitions. [2023-01-27 18:15:54,075 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47895622895622897 [2023-01-27 18:15:54,075 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 569 transitions. [2023-01-27 18:15:54,075 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 569 transitions. [2023-01-27 18:15:54,075 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:15:54,075 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 569 transitions. [2023-01-27 18:15:54,076 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 94.83333333333333) internal successors, (569), 6 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:15:54,079 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 198.0) internal successors, (1386), 7 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:15:54,079 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 198.0) internal successors, (1386), 7 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:15:54,079 INFO L175 Difference]: Start difference. First operand has 44 places, 38 transitions, 206 flow. Second operand 6 states and 569 transitions. [2023-01-27 18:15:54,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 74 transitions, 565 flow [2023-01-27 18:15:54,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 74 transitions, 549 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-01-27 18:15:54,085 INFO L231 Difference]: Finished difference. Result has 47 places, 29 transitions, 170 flow [2023-01-27 18:15:54,085 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=170, PETRI_PLACES=47, PETRI_TRANSITIONS=29} [2023-01-27 18:15:54,087 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 13 predicate places. [2023-01-27 18:15:54,087 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 29 transitions, 170 flow [2023-01-27 18:15:54,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 87.6) internal successors, (438), 5 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:15:54,087 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:15:54,087 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:15:54,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-27 18:15:54,088 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:15:54,088 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:15:54,088 INFO L85 PathProgramCache]: Analyzing trace with hash 465175792, now seen corresponding path program 1 times [2023-01-27 18:15:54,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:15:54,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761926799] [2023-01-27 18:15:54,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:15:54,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:15:54,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:15:54,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:15:54,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:15:54,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761926799] [2023-01-27 18:15:54,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761926799] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:15:54,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:15:54,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 18:15:54,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632576933] [2023-01-27 18:15:54,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:15:54,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 18:15:54,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:15:54,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 18:15:54,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-27 18:15:54,334 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 198 [2023-01-27 18:15:54,334 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 29 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 90.5) internal successors, (362), 4 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:15:54,335 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:15:54,335 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 198 [2023-01-27 18:15:54,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:15:54,475 INFO L130 PetriNetUnfolder]: 436/737 cut-off events. [2023-01-27 18:15:54,475 INFO L131 PetriNetUnfolder]: For 1886/1972 co-relation queries the response was YES. [2023-01-27 18:15:54,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2936 conditions, 737 events. 436/737 cut-off events. For 1886/1972 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3229 event pairs, 92 based on Foata normal form. 75/793 useless extension candidates. Maximal degree in co-relation 2915. Up to 436 conditions per place. [2023-01-27 18:15:54,479 INFO L137 encePairwiseOnDemand]: 192/198 looper letters, 46 selfloop transitions, 6 changer transitions 11/65 dead transitions. [2023-01-27 18:15:54,479 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 65 transitions, 515 flow [2023-01-27 18:15:54,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 18:15:54,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 18:15:54,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 490 transitions. [2023-01-27 18:15:54,481 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.494949494949495 [2023-01-27 18:15:54,481 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 490 transitions. [2023-01-27 18:15:54,481 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 490 transitions. [2023-01-27 18:15:54,482 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:15:54,482 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 490 transitions. [2023-01-27 18:15:54,483 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 98.0) internal successors, (490), 5 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:15:54,484 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 198.0) internal successors, (1188), 6 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:15:54,484 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 198.0) internal successors, (1188), 6 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:15:54,484 INFO L175 Difference]: Start difference. First operand has 47 places, 29 transitions, 170 flow. Second operand 5 states and 490 transitions. [2023-01-27 18:15:54,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 65 transitions, 515 flow [2023-01-27 18:15:54,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 65 transitions, 453 flow, removed 8 selfloop flow, removed 8 redundant places. [2023-01-27 18:15:54,487 INFO L231 Difference]: Finished difference. Result has 44 places, 32 transitions, 178 flow [2023-01-27 18:15:54,487 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=178, PETRI_PLACES=44, PETRI_TRANSITIONS=32} [2023-01-27 18:15:54,488 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 10 predicate places. [2023-01-27 18:15:54,489 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 32 transitions, 178 flow [2023-01-27 18:15:54,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 90.5) internal successors, (362), 4 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:15:54,489 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:15:54,490 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:15:54,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-27 18:15:54,490 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:15:54,490 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:15:54,490 INFO L85 PathProgramCache]: Analyzing trace with hash 152978892, now seen corresponding path program 1 times [2023-01-27 18:15:54,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:15:54,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947528629] [2023-01-27 18:15:54,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:15:54,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:15:54,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:15:54,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:15:54,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:15:54,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947528629] [2023-01-27 18:15:54,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947528629] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:15:54,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:15:54,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 18:15:54,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494928392] [2023-01-27 18:15:54,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:15:54,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 18:15:54,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:15:54,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 18:15:54,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-27 18:15:54,737 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 198 [2023-01-27 18:15:54,737 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 178 flow. Second operand has 5 states, 5 states have (on average 90.2) internal successors, (451), 5 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:15:54,737 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:15:54,737 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 198 [2023-01-27 18:15:54,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:15:54,906 INFO L130 PetriNetUnfolder]: 277/509 cut-off events. [2023-01-27 18:15:54,906 INFO L131 PetriNetUnfolder]: For 1427/1499 co-relation queries the response was YES. [2023-01-27 18:15:54,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2156 conditions, 509 events. 277/509 cut-off events. For 1427/1499 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2237 event pairs, 38 based on Foata normal form. 49/544 useless extension candidates. Maximal degree in co-relation 2138. Up to 282 conditions per place. [2023-01-27 18:15:54,909 INFO L137 encePairwiseOnDemand]: 192/198 looper letters, 57 selfloop transitions, 12 changer transitions 11/82 dead transitions. [2023-01-27 18:15:54,909 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 82 transitions, 653 flow [2023-01-27 18:15:54,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 18:15:54,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 18:15:54,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 681 transitions. [2023-01-27 18:15:54,911 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49134199134199136 [2023-01-27 18:15:54,911 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 681 transitions. [2023-01-27 18:15:54,911 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 681 transitions. [2023-01-27 18:15:54,911 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:15:54,911 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 681 transitions. [2023-01-27 18:15:54,913 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 97.28571428571429) internal successors, (681), 7 states have internal predecessors, (681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:15:54,914 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 198.0) internal successors, (1584), 8 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:15:54,914 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 198.0) internal successors, (1584), 8 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:15:54,915 INFO L175 Difference]: Start difference. First operand has 44 places, 32 transitions, 178 flow. Second operand 7 states and 681 transitions. [2023-01-27 18:15:54,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 82 transitions, 653 flow [2023-01-27 18:15:54,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 82 transitions, 653 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-01-27 18:15:54,919 INFO L231 Difference]: Finished difference. Result has 53 places, 38 transitions, 259 flow [2023-01-27 18:15:54,919 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=259, PETRI_PLACES=53, PETRI_TRANSITIONS=38} [2023-01-27 18:15:54,920 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 19 predicate places. [2023-01-27 18:15:54,920 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 38 transitions, 259 flow [2023-01-27 18:15:54,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.2) internal successors, (451), 5 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:15:54,920 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:15:54,920 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:15:54,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-27 18:15:54,920 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:15:54,921 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:15:54,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1842682289, now seen corresponding path program 1 times [2023-01-27 18:15:54,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:15:54,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223859772] [2023-01-27 18:15:54,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:15:54,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:15:54,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:15:55,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:15:55,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:15:55,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223859772] [2023-01-27 18:15:55,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223859772] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:15:55,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:15:55,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-27 18:15:55,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449581240] [2023-01-27 18:15:55,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:15:55,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-27 18:15:55,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:15:55,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-27 18:15:55,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-01-27 18:15:55,197 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 198 [2023-01-27 18:15:55,197 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 38 transitions, 259 flow. Second operand has 6 states, 6 states have (on average 90.0) internal successors, (540), 6 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:15:55,197 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:15:55,197 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 198 [2023-01-27 18:15:55,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:15:55,368 INFO L130 PetriNetUnfolder]: 242/448 cut-off events. [2023-01-27 18:15:55,369 INFO L131 PetriNetUnfolder]: For 1535/1603 co-relation queries the response was YES. [2023-01-27 18:15:55,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2126 conditions, 448 events. 242/448 cut-off events. For 1535/1603 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1993 event pairs, 31 based on Foata normal form. 19/453 useless extension candidates. Maximal degree in co-relation 2103. Up to 248 conditions per place. [2023-01-27 18:15:55,372 INFO L137 encePairwiseOnDemand]: 192/198 looper letters, 54 selfloop transitions, 16 changer transitions 10/82 dead transitions. [2023-01-27 18:15:55,372 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 82 transitions, 712 flow [2023-01-27 18:15:55,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-27 18:15:55,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-01-27 18:15:55,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 855 transitions. [2023-01-27 18:15:55,375 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4797979797979798 [2023-01-27 18:15:55,375 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 855 transitions. [2023-01-27 18:15:55,375 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 855 transitions. [2023-01-27 18:15:55,375 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:15:55,376 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 855 transitions. [2023-01-27 18:15:55,377 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 95.0) internal successors, (855), 9 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:15:55,380 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 198.0) internal successors, (1980), 10 states have internal predecessors, (1980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:15:55,380 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 198.0) internal successors, (1980), 10 states have internal predecessors, (1980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:15:55,381 INFO L175 Difference]: Start difference. First operand has 53 places, 38 transitions, 259 flow. Second operand 9 states and 855 transitions. [2023-01-27 18:15:55,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 82 transitions, 712 flow [2023-01-27 18:15:55,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 82 transitions, 659 flow, removed 15 selfloop flow, removed 4 redundant places. [2023-01-27 18:15:55,387 INFO L231 Difference]: Finished difference. Result has 60 places, 39 transitions, 273 flow [2023-01-27 18:15:55,387 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=219, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=273, PETRI_PLACES=60, PETRI_TRANSITIONS=39} [2023-01-27 18:15:55,387 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 26 predicate places. [2023-01-27 18:15:55,388 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 39 transitions, 273 flow [2023-01-27 18:15:55,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 90.0) internal successors, (540), 6 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:15:55,388 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:15:55,388 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:15:55,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-01-27 18:15:55,388 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:15:55,389 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:15:55,389 INFO L85 PathProgramCache]: Analyzing trace with hash 267226704, now seen corresponding path program 1 times [2023-01-27 18:15:55,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:15:55,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854703401] [2023-01-27 18:15:55,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:15:55,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:15:55,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:15:56,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:15:56,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:15:56,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854703401] [2023-01-27 18:15:56,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854703401] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:15:56,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:15:56,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-27 18:15:56,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213477006] [2023-01-27 18:15:56,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:15:56,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-01-27 18:15:56,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:15:56,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-01-27 18:15:56,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-01-27 18:15:56,317 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 198 [2023-01-27 18:15:56,317 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 39 transitions, 273 flow. Second operand has 8 states, 8 states have (on average 83.625) internal successors, (669), 8 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:15:56,317 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:15:56,317 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 198 [2023-01-27 18:15:56,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:15:56,504 INFO L130 PetriNetUnfolder]: 394/737 cut-off events. [2023-01-27 18:15:56,504 INFO L131 PetriNetUnfolder]: For 2174/2226 co-relation queries the response was YES. [2023-01-27 18:15:56,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3441 conditions, 737 events. 394/737 cut-off events. For 2174/2226 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3745 event pairs, 79 based on Foata normal form. 1/729 useless extension candidates. Maximal degree in co-relation 3416. Up to 405 conditions per place. [2023-01-27 18:15:56,507 INFO L137 encePairwiseOnDemand]: 190/198 looper letters, 56 selfloop transitions, 9 changer transitions 22/88 dead transitions. [2023-01-27 18:15:56,507 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 88 transitions, 824 flow [2023-01-27 18:15:56,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 18:15:56,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 18:15:56,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 618 transitions. [2023-01-27 18:15:56,509 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4458874458874459 [2023-01-27 18:15:56,509 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 618 transitions. [2023-01-27 18:15:56,509 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 618 transitions. [2023-01-27 18:15:56,510 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:15:56,510 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 618 transitions. [2023-01-27 18:15:56,511 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 88.28571428571429) internal successors, (618), 7 states have internal predecessors, (618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:15:56,512 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 198.0) internal successors, (1584), 8 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:15:56,512 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 198.0) internal successors, (1584), 8 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:15:56,513 INFO L175 Difference]: Start difference. First operand has 60 places, 39 transitions, 273 flow. Second operand 7 states and 618 transitions. [2023-01-27 18:15:56,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 88 transitions, 824 flow [2023-01-27 18:15:56,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 88 transitions, 665 flow, removed 40 selfloop flow, removed 9 redundant places. [2023-01-27 18:15:56,520 INFO L231 Difference]: Finished difference. Result has 60 places, 43 transitions, 272 flow [2023-01-27 18:15:56,520 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=272, PETRI_PLACES=60, PETRI_TRANSITIONS=43} [2023-01-27 18:15:56,520 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 26 predicate places. [2023-01-27 18:15:56,520 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 43 transitions, 272 flow [2023-01-27 18:15:56,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 83.625) internal successors, (669), 8 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:15:56,521 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:15:56,521 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:15:56,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-27 18:15:56,521 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:15:56,521 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:15:56,521 INFO L85 PathProgramCache]: Analyzing trace with hash -972932076, now seen corresponding path program 2 times [2023-01-27 18:15:56,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:15:56,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853158223] [2023-01-27 18:15:56,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:15:56,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:15:56,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:15:56,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:15:56,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:15:56,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853158223] [2023-01-27 18:15:56,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853158223] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:15:56,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:15:56,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 18:15:56,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167877287] [2023-01-27 18:15:56,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:15:56,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 18:15:56,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:15:56,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 18:15:56,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-01-27 18:15:56,756 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 198 [2023-01-27 18:15:56,757 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 43 transitions, 272 flow. Second operand has 5 states, 5 states have (on average 89.2) internal successors, (446), 5 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-27 18:15:56,757 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:15:56,757 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 198 [2023-01-27 18:15:56,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:15:56,933 INFO L130 PetriNetUnfolder]: 476/895 cut-off events. [2023-01-27 18:15:56,934 INFO L131 PetriNetUnfolder]: For 2161/2212 co-relation queries the response was YES. [2023-01-27 18:15:56,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3873 conditions, 895 events. 476/895 cut-off events. For 2161/2212 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 4674 event pairs, 152 based on Foata normal form. 3/881 useless extension candidates. Maximal degree in co-relation 3853. Up to 497 conditions per place. [2023-01-27 18:15:56,937 INFO L137 encePairwiseOnDemand]: 194/198 looper letters, 26 selfloop transitions, 1 changer transitions 43/71 dead transitions. [2023-01-27 18:15:56,937 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 71 transitions, 598 flow [2023-01-27 18:15:56,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 18:15:56,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 18:15:56,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 463 transitions. [2023-01-27 18:15:56,938 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4676767676767677 [2023-01-27 18:15:56,939 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 463 transitions. [2023-01-27 18:15:56,939 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 463 transitions. [2023-01-27 18:15:56,939 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:15:56,939 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 463 transitions. [2023-01-27 18:15:56,940 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 92.6) internal successors, (463), 5 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:15:56,941 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 198.0) internal successors, (1188), 6 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:15:56,941 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 198.0) internal successors, (1188), 6 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:15:56,941 INFO L175 Difference]: Start difference. First operand has 60 places, 43 transitions, 272 flow. Second operand 5 states and 463 transitions. [2023-01-27 18:15:56,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 71 transitions, 598 flow [2023-01-27 18:15:56,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 71 transitions, 577 flow, removed 6 selfloop flow, removed 4 redundant places. [2023-01-27 18:15:56,951 INFO L231 Difference]: Finished difference. Result has 61 places, 28 transitions, 167 flow [2023-01-27 18:15:56,951 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=259, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=167, PETRI_PLACES=61, PETRI_TRANSITIONS=28} [2023-01-27 18:15:56,951 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 27 predicate places. [2023-01-27 18:15:56,951 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 28 transitions, 167 flow [2023-01-27 18:15:56,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 89.2) internal successors, (446), 5 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-27 18:15:56,952 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:15:56,952 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:15:56,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-01-27 18:15:56,952 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:15:56,952 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:15:56,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1747208702, now seen corresponding path program 3 times [2023-01-27 18:15:56,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:15:56,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030547358] [2023-01-27 18:15:56,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:15:56,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:15:56,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-27 18:15:56,996 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-27 18:15:57,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-27 18:15:57,085 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-27 18:15:57,086 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-27 18:15:57,086 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-01-27 18:15:57,087 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-01-27 18:15:57,088 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-01-27 18:15:57,088 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-01-27 18:15:57,088 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-01-27 18:15:57,088 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-01-27 18:15:57,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-01-27 18:15:57,088 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1] [2023-01-27 18:15:57,092 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-27 18:15:57,092 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-27 18:15:57,152 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.01 06:15:57 BasicIcfg [2023-01-27 18:15:57,152 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-27 18:15:57,153 INFO L158 Benchmark]: Toolchain (without parser) took 12095.21ms. Allocated memory was 348.1MB in the beginning and 801.1MB in the end (delta: 453.0MB). Free memory was 305.7MB in the beginning and 593.1MB in the end (delta: -287.5MB). Peak memory consumption was 168.5MB. Max. memory is 16.0GB. [2023-01-27 18:15:57,153 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 255.9MB. Free memory is still 213.7MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-27 18:15:57,153 INFO L158 Benchmark]: CACSL2BoogieTranslator took 487.98ms. Allocated memory is still 348.1MB. Free memory was 305.5MB in the beginning and 281.0MB in the end (delta: 24.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. [2023-01-27 18:15:57,153 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.02ms. Allocated memory is still 348.1MB. Free memory was 281.0MB in the beginning and 278.3MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-27 18:15:57,153 INFO L158 Benchmark]: Boogie Preprocessor took 40.11ms. Allocated memory is still 348.1MB. Free memory was 277.9MB in the beginning and 276.2MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.0GB. [2023-01-27 18:15:57,153 INFO L158 Benchmark]: RCFGBuilder took 572.84ms. Allocated memory is still 348.1MB. Free memory was 276.2MB in the beginning and 296.8MB in the end (delta: -20.6MB). Peak memory consumption was 28.0MB. Max. memory is 16.0GB. [2023-01-27 18:15:57,154 INFO L158 Benchmark]: TraceAbstraction took 10928.35ms. Allocated memory was 348.1MB in the beginning and 801.1MB in the end (delta: 453.0MB). Free memory was 296.8MB in the beginning and 593.1MB in the end (delta: -296.3MB). Peak memory consumption was 157.3MB. Max. memory is 16.0GB. [2023-01-27 18:15:57,154 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.10ms. Allocated memory is still 255.9MB. Free memory is still 213.7MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 487.98ms. Allocated memory is still 348.1MB. Free memory was 305.5MB in the beginning and 281.0MB in the end (delta: 24.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 61.02ms. Allocated memory is still 348.1MB. Free memory was 281.0MB in the beginning and 278.3MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 40.11ms. Allocated memory is still 348.1MB. Free memory was 277.9MB in the beginning and 276.2MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.0GB. * RCFGBuilder took 572.84ms. Allocated memory is still 348.1MB. Free memory was 276.2MB in the beginning and 296.8MB in the end (delta: -20.6MB). Peak memory consumption was 28.0MB. Max. memory is 16.0GB. * TraceAbstraction took 10928.35ms. Allocated memory was 348.1MB in the beginning and 801.1MB in the end (delta: 453.0MB). Free memory was 296.8MB in the beginning and 593.1MB in the end (delta: -296.3MB). Peak memory consumption was 157.3MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.9s, 113 PlacesBefore, 34 PlacesAfterwards, 105 TransitionsBefore, 25 TransitionsAfterwards, 1916 CoEnabledTransitionPairs, 6 FixpointIterations, 38 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 90 TotalNumberOfCompositions, 5105 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2559, independent: 2397, independent conditional: 0, independent unconditional: 2397, dependent: 162, dependent conditional: 0, dependent unconditional: 162, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1055, independent: 1014, independent conditional: 0, independent unconditional: 1014, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2559, independent: 1383, independent conditional: 0, independent unconditional: 1383, dependent: 121, dependent conditional: 0, dependent unconditional: 121, unknown: 1055, unknown conditional: 0, unknown unconditional: 1055] , Statistics on independence cache: Total cache size (in pairs): 96, Positive cache size: 82, Positive conditional cache size: 0, Positive unconditional cache size: 82, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L721] 0 int y = 0; [L722] 0 _Bool y$flush_delayed; [L723] 0 int y$mem_tmp; [L724] 0 _Bool y$r_buff0_thd0; [L725] 0 _Bool y$r_buff0_thd1; [L726] 0 _Bool y$r_buff0_thd2; [L727] 0 _Bool y$r_buff0_thd3; [L728] 0 _Bool y$r_buff1_thd0; [L729] 0 _Bool y$r_buff1_thd1; [L730] 0 _Bool y$r_buff1_thd2; [L731] 0 _Bool y$r_buff1_thd3; [L732] 0 _Bool y$read_delayed; [L733] 0 int *y$read_delayed_var; [L734] 0 int y$w_buff0; [L735] 0 _Bool y$w_buff0_used; [L736] 0 int y$w_buff1; [L737] 0 _Bool y$w_buff1_used; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L833] 0 pthread_t t1687; [L834] FCALL, FORK 0 pthread_create(&t1687, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1687, ((void *)0), P0, ((void *)0))=-1, t1687={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L835] 0 pthread_t t1688; [L836] FCALL, FORK 0 pthread_create(&t1688, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1688, ((void *)0), P1, ((void *)0))=0, t1687={5:0}, t1688={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L837] 0 pthread_t t1689; [L763] 2 y$w_buff1 = y$w_buff0 [L764] 2 y$w_buff0 = 2 [L765] 2 y$w_buff1_used = y$w_buff0_used [L766] 2 y$w_buff0_used = (_Bool)1 [L767] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L767] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L768] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L769] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L770] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L771] 2 y$r_buff1_thd3 = y$r_buff0_thd3 [L772] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L838] FCALL, FORK 0 pthread_create(&t1689, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1689, ((void *)0), P2, ((void *)0))=1, t1687={5:0}, t1688={6:0}, t1689={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L775] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L776] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L777] 2 y$flush_delayed = weak$$choice2 [L778] 2 y$mem_tmp = y [L779] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L780] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L781] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L782] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L783] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L784] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L785] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L786] 2 __unbuffered_p1_EAX = y [L787] 2 y = y$flush_delayed ? y$mem_tmp : y [L788] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L791] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L808] 3 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L743] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L746] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L749] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L750] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L751] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L752] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L753] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L811] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L812] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L813] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L814] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L815] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L818] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 3 return 0; [L794] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L795] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L796] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L797] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L798] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L758] 1 return 0; [L801] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L803] 2 return 0; [L840] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L842] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L842] RET 0 assume_abort_if_not(main$tmp_guard0) [L844] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L845] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L846] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L847] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L848] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1687={5:0}, t1688={6:0}, t1689={3:0}, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L851] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L852] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L853] 0 y$flush_delayed = weak$$choice2 [L854] 0 y$mem_tmp = y [L855] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L856] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L857] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L858] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L859] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L860] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L861] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L862] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) [L863] 0 y = y$flush_delayed ? y$mem_tmp : y [L864] 0 y$flush_delayed = (_Bool)0 [L866] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 838]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 834]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 836]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 135 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 10.8s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 345 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 345 mSDsluCounter, 29 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 16 mSDsCounter, 33 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 943 IncrementalHoareTripleChecker+Invalid, 976 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33 mSolverCounterUnsat, 13 mSDtfsCounter, 943 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=273occurred in iteration=8, InterpolantAutomatonStates: 61, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 165 NumberOfCodeBlocks, 165 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 133 ConstructedInterpolants, 0 QuantifiedInterpolants, 1033 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-01-27 18:15:57,177 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...