/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/mix000.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-27 18:02:13,366 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-27 18:02:13,368 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-27 18:02:13,402 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-27 18:02:13,403 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-27 18:02:13,406 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-27 18:02:13,410 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-27 18:02:13,413 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-27 18:02:13,414 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-27 18:02:13,419 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-27 18:02:13,421 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-27 18:02:13,422 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-27 18:02:13,422 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-27 18:02:13,425 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-27 18:02:13,427 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-27 18:02:13,429 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-27 18:02:13,430 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-27 18:02:13,430 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-27 18:02:13,432 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-27 18:02:13,437 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-27 18:02:13,438 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-27 18:02:13,439 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-27 18:02:13,440 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-27 18:02:13,441 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-27 18:02:13,449 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-27 18:02:13,449 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-27 18:02:13,450 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-27 18:02:13,451 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-27 18:02:13,451 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-27 18:02:13,452 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-27 18:02:13,453 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-27 18:02:13,453 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-27 18:02:13,454 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-27 18:02:13,455 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-27 18:02:13,456 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-27 18:02:13,456 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-27 18:02:13,456 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-27 18:02:13,457 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-27 18:02:13,457 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-27 18:02:13,457 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-27 18:02:13,458 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-27 18:02:13,459 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:02:13,493 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-27 18:02:13,493 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-27 18:02:13,494 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-27 18:02:13,494 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-27 18:02:13,495 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-27 18:02:13,495 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-27 18:02:13,495 INFO L138 SettingsManager]: * Use SBE=true [2023-01-27 18:02:13,496 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-27 18:02:13,496 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-27 18:02:13,496 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-27 18:02:13,497 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-27 18:02:13,497 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-27 18:02:13,497 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-27 18:02:13,497 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-27 18:02:13,497 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-27 18:02:13,497 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-27 18:02:13,498 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-27 18:02:13,498 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-27 18:02:13,498 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-27 18:02:13,498 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-27 18:02:13,498 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-27 18:02:13,498 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-27 18:02:13,499 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-27 18:02:13,499 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 18:02:13,499 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-27 18:02:13,499 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-27 18:02:13,499 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-27 18:02:13,499 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-27 18:02:13,500 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-27 18:02:13,500 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-27 18:02:13,500 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-27 18:02:13,500 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:02:13,696 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-27 18:02:13,719 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-27 18:02:13,721 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-27 18:02:13,722 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-27 18:02:13,723 INFO L275 PluginConnector]: CDTParser initialized [2023-01-27 18:02:13,724 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix000.opt.i [2023-01-27 18:02:14,939 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-27 18:02:15,229 INFO L351 CDTParser]: Found 1 translation units. [2023-01-27 18:02:15,229 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix000.opt.i [2023-01-27 18:02:15,244 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8163b2020/b0a4595c8e4e427bac406aafc4686f8c/FLAG0a280abeb [2023-01-27 18:02:15,260 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8163b2020/b0a4595c8e4e427bac406aafc4686f8c [2023-01-27 18:02:15,263 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-27 18:02:15,265 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-27 18:02:15,267 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-27 18:02:15,267 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-27 18:02:15,270 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-27 18:02:15,271 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 06:02:15" (1/1) ... [2023-01-27 18:02:15,272 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3963d338 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:02:15, skipping insertion in model container [2023-01-27 18:02:15,272 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 06:02:15" (1/1) ... [2023-01-27 18:02:15,278 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-27 18:02:15,331 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-27 18:02:15,473 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/mix000.opt.i[987,1000] [2023-01-27 18:02:15,639 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 18:02:15,653 INFO L203 MainTranslator]: Completed pre-run [2023-01-27 18:02:15,664 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/mix000.opt.i[987,1000] [2023-01-27 18:02:15,705 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 18:02:15,747 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-27 18:02:15,747 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-27 18:02:15,754 INFO L208 MainTranslator]: Completed translation [2023-01-27 18:02:15,754 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:02:15 WrapperNode [2023-01-27 18:02:15,754 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-27 18:02:15,755 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-27 18:02:15,756 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-27 18:02:15,756 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-27 18:02:15,762 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:02:15" (1/1) ... [2023-01-27 18:02:15,792 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:02:15" (1/1) ... [2023-01-27 18:02:15,833 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 135 [2023-01-27 18:02:15,833 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-27 18:02:15,834 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-27 18:02:15,834 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-27 18:02:15,835 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-27 18:02:15,842 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:02:15" (1/1) ... [2023-01-27 18:02:15,843 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:02:15" (1/1) ... [2023-01-27 18:02:15,861 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:02:15" (1/1) ... [2023-01-27 18:02:15,861 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:02:15" (1/1) ... [2023-01-27 18:02:15,867 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:02:15" (1/1) ... [2023-01-27 18:02:15,869 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:02:15" (1/1) ... [2023-01-27 18:02:15,871 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:02:15" (1/1) ... [2023-01-27 18:02:15,872 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:02:15" (1/1) ... [2023-01-27 18:02:15,888 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-27 18:02:15,890 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-27 18:02:15,890 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-27 18:02:15,890 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-27 18:02:15,898 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:02:15" (1/1) ... [2023-01-27 18:02:15,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 18:02:15,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 18:02:15,932 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:02:15,956 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:02:15,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-27 18:02:15,973 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-27 18:02:15,973 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-27 18:02:15,973 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-27 18:02:15,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-27 18:02:15,974 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-01-27 18:02:15,974 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-01-27 18:02:15,975 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-01-27 18:02:15,975 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-01-27 18:02:15,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-27 18:02:15,976 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-27 18:02:15,976 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-27 18:02:15,976 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-27 18:02:15,977 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:02:16,093 INFO L236 CfgBuilder]: Building ICFG [2023-01-27 18:02:16,095 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-27 18:02:16,445 INFO L277 CfgBuilder]: Performing block encoding [2023-01-27 18:02:16,595 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-27 18:02:16,595 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-01-27 18:02:16,597 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 06:02:16 BoogieIcfgContainer [2023-01-27 18:02:16,597 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-27 18:02:16,600 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-27 18:02:16,600 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-27 18:02:16,603 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-27 18:02:16,603 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 06:02:15" (1/3) ... [2023-01-27 18:02:16,604 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ae9932c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 06:02:16, skipping insertion in model container [2023-01-27 18:02:16,604 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:02:15" (2/3) ... [2023-01-27 18:02:16,604 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ae9932c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 06:02:16, skipping insertion in model container [2023-01-27 18:02:16,604 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 06:02:16" (3/3) ... [2023-01-27 18:02:16,606 INFO L112 eAbstractionObserver]: Analyzing ICFG mix000.opt.i [2023-01-27 18:02:16,621 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-27 18:02:16,621 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-01-27 18:02:16,621 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-27 18:02:16,664 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-27 18:02:16,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 96 places, 91 transitions, 192 flow [2023-01-27 18:02:16,755 INFO L130 PetriNetUnfolder]: 2/89 cut-off events. [2023-01-27 18:02:16,756 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:02:16,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96 conditions, 89 events. 2/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 43 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 52. Up to 2 conditions per place. [2023-01-27 18:02:16,760 INFO L82 GeneralOperation]: Start removeDead. Operand has 96 places, 91 transitions, 192 flow [2023-01-27 18:02:16,764 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 94 places, 89 transitions, 184 flow [2023-01-27 18:02:16,767 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-27 18:02:16,776 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 94 places, 89 transitions, 184 flow [2023-01-27 18:02:16,778 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 94 places, 89 transitions, 184 flow [2023-01-27 18:02:16,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 89 transitions, 184 flow [2023-01-27 18:02:16,803 INFO L130 PetriNetUnfolder]: 2/89 cut-off events. [2023-01-27 18:02:16,803 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:02:16,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96 conditions, 89 events. 2/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 43 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 52. Up to 2 conditions per place. [2023-01-27 18:02:16,805 INFO L119 LiptonReduction]: Number of co-enabled transitions 1088 [2023-01-27 18:02:19,970 INFO L134 LiptonReduction]: Checked pairs total: 2899 [2023-01-27 18:02:19,971 INFO L136 LiptonReduction]: Total number of compositions: 85 [2023-01-27 18:02:19,986 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-27 18:02:19,992 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;@a87e154, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-27 18:02:19,993 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-01-27 18:02:19,997 INFO L130 PetriNetUnfolder]: 0/7 cut-off events. [2023-01-27 18:02:19,997 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:02:19,997 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:02:19,998 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-01-27 18:02:19,998 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-27 18:02:20,003 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:02:20,003 INFO L85 PathProgramCache]: Analyzing trace with hash 421097674, now seen corresponding path program 1 times [2023-01-27 18:02:20,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:02:20,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311255281] [2023-01-27 18:02:20,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:02:20,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:02:20,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:02:20,385 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:02:20,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:02:20,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311255281] [2023-01-27 18:02:20,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311255281] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:02:20,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:02:20,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-27 18:02:20,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10238332] [2023-01-27 18:02:20,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:02:20,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-27 18:02:20,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:02:20,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-27 18:02:20,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-27 18:02:20,431 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 176 [2023-01-27 18:02:20,433 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 19 transitions, 44 flow. Second operand has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 states 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:02:20,434 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:02:20,434 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 176 [2023-01-27 18:02:20,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:02:20,630 INFO L130 PetriNetUnfolder]: 142/273 cut-off events. [2023-01-27 18:02:20,631 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-01-27 18:02:20,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 538 conditions, 273 events. 142/273 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1102 event pairs, 18 based on Foata normal form. 0/252 useless extension candidates. Maximal degree in co-relation 528. Up to 205 conditions per place. [2023-01-27 18:02:20,635 INFO L137 encePairwiseOnDemand]: 172/176 looper letters, 18 selfloop transitions, 2 changer transitions 2/24 dead transitions. [2023-01-27 18:02:20,636 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 24 transitions, 98 flow [2023-01-27 18:02:20,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 18:02:20,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 18:02:20,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 262 transitions. [2023-01-27 18:02:20,654 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4962121212121212 [2023-01-27 18:02:20,655 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 262 transitions. [2023-01-27 18:02:20,656 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 262 transitions. [2023-01-27 18:02:20,659 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:02:20,661 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 262 transitions. [2023-01-27 18:02:20,665 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 0 states 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:02:20,669 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 176.0) internal successors, (704), 4 states have internal predecessors, (704), 0 states have call successors, (0), 0 states 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:02:20,669 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 176.0) internal successors, (704), 4 states have internal predecessors, (704), 0 states have call successors, (0), 0 states 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:02:20,671 INFO L175 Difference]: Start difference. First operand has 25 places, 19 transitions, 44 flow. Second operand 3 states and 262 transitions. [2023-01-27 18:02:20,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 24 transitions, 98 flow [2023-01-27 18:02:20,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 24 transitions, 96 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-27 18:02:20,677 INFO L231 Difference]: Finished difference. Result has 24 places, 16 transitions, 40 flow [2023-01-27 18:02:20,679 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=40, PETRI_PLACES=24, PETRI_TRANSITIONS=16} [2023-01-27 18:02:20,684 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, -1 predicate places. [2023-01-27 18:02:20,684 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 16 transitions, 40 flow [2023-01-27 18:02:20,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 states 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:02:20,684 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:02:20,685 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:02:20,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-27 18:02:20,685 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-27 18:02:20,687 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:02:20,688 INFO L85 PathProgramCache]: Analyzing trace with hash 947983461, now seen corresponding path program 1 times [2023-01-27 18:02:20,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:02:20,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738108539] [2023-01-27 18:02:20,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:02:20,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:02:20,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:02:21,014 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:02:21,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:02:21,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738108539] [2023-01-27 18:02:21,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738108539] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:02:21,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:02:21,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-27 18:02:21,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419582900] [2023-01-27 18:02:21,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:02:21,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-27 18:02:21,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:02:21,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-27 18:02:21,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-27 18:02:21,018 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 176 [2023-01-27 18:02:21,019 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 16 transitions, 40 flow. Second operand has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 0 states 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:02:21,019 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:02:21,019 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 176 [2023-01-27 18:02:21,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:02:21,110 INFO L130 PetriNetUnfolder]: 167/294 cut-off events. [2023-01-27 18:02:21,111 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2023-01-27 18:02:21,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 622 conditions, 294 events. 167/294 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 971 event pairs, 65 based on Foata normal form. 4/298 useless extension candidates. Maximal degree in co-relation 612. Up to 267 conditions per place. [2023-01-27 18:02:21,117 INFO L137 encePairwiseOnDemand]: 172/176 looper letters, 21 selfloop transitions, 3 changer transitions 0/24 dead transitions. [2023-01-27 18:02:21,117 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 24 transitions, 108 flow [2023-01-27 18:02:21,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 18:02:21,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 18:02:21,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 244 transitions. [2023-01-27 18:02:21,119 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4621212121212121 [2023-01-27 18:02:21,119 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 244 transitions. [2023-01-27 18:02:21,120 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 244 transitions. [2023-01-27 18:02:21,120 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:02:21,120 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 244 transitions. [2023-01-27 18:02:21,121 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 0 states have call successors, (0), 0 states 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:02:21,123 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 176.0) internal successors, (704), 4 states have internal predecessors, (704), 0 states have call successors, (0), 0 states 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:02:21,124 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 176.0) internal successors, (704), 4 states have internal predecessors, (704), 0 states have call successors, (0), 0 states 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:02:21,124 INFO L175 Difference]: Start difference. First operand has 24 places, 16 transitions, 40 flow. Second operand 3 states and 244 transitions. [2023-01-27 18:02:21,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 24 transitions, 108 flow [2023-01-27 18:02:21,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 24 transitions, 102 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-27 18:02:21,126 INFO L231 Difference]: Finished difference. Result has 24 places, 18 transitions, 55 flow [2023-01-27 18:02:21,126 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=55, PETRI_PLACES=24, PETRI_TRANSITIONS=18} [2023-01-27 18:02:21,127 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, -1 predicate places. [2023-01-27 18:02:21,127 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 18 transitions, 55 flow [2023-01-27 18:02:21,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 0 states 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:02:21,128 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:02:21,128 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:02:21,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-27 18:02:21,129 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-27 18:02:21,132 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:02:21,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1297324500, now seen corresponding path program 1 times [2023-01-27 18:02:21,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:02:21,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055789629] [2023-01-27 18:02:21,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:02:21,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:02:21,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:02:21,360 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:02:21,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:02:21,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055789629] [2023-01-27 18:02:21,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055789629] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:02:21,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:02:21,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-27 18:02:21,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104493916] [2023-01-27 18:02:21,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:02:21,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 18:02:21,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:02:21,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 18:02:21,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-27 18:02:21,366 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 176 [2023-01-27 18:02:21,366 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 18 transitions, 55 flow. Second operand has 4 states, 4 states have (on average 75.25) internal successors, (301), 4 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:02:21,366 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:02:21,366 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 176 [2023-01-27 18:02:21,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:02:21,442 INFO L130 PetriNetUnfolder]: 157/278 cut-off events. [2023-01-27 18:02:21,442 INFO L131 PetriNetUnfolder]: For 45/45 co-relation queries the response was YES. [2023-01-27 18:02:21,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 646 conditions, 278 events. 157/278 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 880 event pairs, 53 based on Foata normal form. 6/284 useless extension candidates. Maximal degree in co-relation 635. Up to 200 conditions per place. [2023-01-27 18:02:21,446 INFO L137 encePairwiseOnDemand]: 173/176 looper letters, 20 selfloop transitions, 3 changer transitions 0/23 dead transitions. [2023-01-27 18:02:21,446 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 23 transitions, 111 flow [2023-01-27 18:02:21,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 18:02:21,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 18:02:21,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 242 transitions. [2023-01-27 18:02:21,449 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2023-01-27 18:02:21,449 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 242 transitions. [2023-01-27 18:02:21,449 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 242 transitions. [2023-01-27 18:02:21,450 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:02:21,450 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 242 transitions. [2023-01-27 18:02:21,450 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 states 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:02:21,452 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 176.0) internal successors, (704), 4 states have internal predecessors, (704), 0 states have call successors, (0), 0 states 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:02:21,453 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 176.0) internal successors, (704), 4 states have internal predecessors, (704), 0 states have call successors, (0), 0 states 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:02:21,453 INFO L175 Difference]: Start difference. First operand has 24 places, 18 transitions, 55 flow. Second operand 3 states and 242 transitions. [2023-01-27 18:02:21,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 23 transitions, 111 flow [2023-01-27 18:02:21,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 23 transitions, 108 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-27 18:02:21,454 INFO L231 Difference]: Finished difference. Result has 26 places, 18 transitions, 63 flow [2023-01-27 18:02:21,454 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=63, PETRI_PLACES=26, PETRI_TRANSITIONS=18} [2023-01-27 18:02:21,456 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 1 predicate places. [2023-01-27 18:02:21,458 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 18 transitions, 63 flow [2023-01-27 18:02:21,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 75.25) internal successors, (301), 4 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:02:21,459 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:02:21,459 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:02:21,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-27 18:02:21,460 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-27 18:02:21,460 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:02:21,460 INFO L85 PathProgramCache]: Analyzing trace with hash 448608949, now seen corresponding path program 1 times [2023-01-27 18:02:21,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:02:21,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911141886] [2023-01-27 18:02:21,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:02:21,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:02:21,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:02:21,716 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:02:21,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:02:21,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911141886] [2023-01-27 18:02:21,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911141886] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:02:21,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:02:21,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-27 18:02:21,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173432909] [2023-01-27 18:02:21,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:02:21,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 18:02:21,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:02:21,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 18:02:21,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-27 18:02:21,721 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 176 [2023-01-27 18:02:21,721 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 18 transitions, 63 flow. Second operand has 4 states, 4 states have (on average 75.25) internal successors, (301), 4 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:02:21,721 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:02:21,721 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 176 [2023-01-27 18:02:21,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:02:21,806 INFO L130 PetriNetUnfolder]: 143/256 cut-off events. [2023-01-27 18:02:21,806 INFO L131 PetriNetUnfolder]: For 98/98 co-relation queries the response was YES. [2023-01-27 18:02:21,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 620 conditions, 256 events. 143/256 cut-off events. For 98/98 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 797 event pairs, 80 based on Foata normal form. 8/264 useless extension candidates. Maximal degree in co-relation 607. Up to 177 conditions per place. [2023-01-27 18:02:21,808 INFO L137 encePairwiseOnDemand]: 173/176 looper letters, 23 selfloop transitions, 3 changer transitions 0/26 dead transitions. [2023-01-27 18:02:21,809 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 26 transitions, 133 flow [2023-01-27 18:02:21,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 18:02:21,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 18:02:21,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 245 transitions. [2023-01-27 18:02:21,811 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4640151515151515 [2023-01-27 18:02:21,811 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 245 transitions. [2023-01-27 18:02:21,811 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 245 transitions. [2023-01-27 18:02:21,811 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:02:21,812 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 245 transitions. [2023-01-27 18:02:21,812 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 0 states have call successors, (0), 0 states 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:02:21,816 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 176.0) internal successors, (704), 4 states have internal predecessors, (704), 0 states have call successors, (0), 0 states 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:02:21,821 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 176.0) internal successors, (704), 4 states have internal predecessors, (704), 0 states have call successors, (0), 0 states 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:02:21,821 INFO L175 Difference]: Start difference. First operand has 26 places, 18 transitions, 63 flow. Second operand 3 states and 245 transitions. [2023-01-27 18:02:21,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 26 transitions, 133 flow [2023-01-27 18:02:21,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 26 transitions, 127 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-27 18:02:21,824 INFO L231 Difference]: Finished difference. Result has 27 places, 18 transitions, 68 flow [2023-01-27 18:02:21,824 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=57, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=27, PETRI_TRANSITIONS=18} [2023-01-27 18:02:21,826 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 2 predicate places. [2023-01-27 18:02:21,826 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 18 transitions, 68 flow [2023-01-27 18:02:21,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 75.25) internal successors, (301), 4 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:02:21,826 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:02:21,827 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:02:21,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-27 18:02:21,827 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-27 18:02:21,828 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:02:21,828 INFO L85 PathProgramCache]: Analyzing trace with hash 247100980, now seen corresponding path program 1 times [2023-01-27 18:02:21,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:02:21,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149762490] [2023-01-27 18:02:21,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:02:21,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:02:21,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:02:22,293 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:02:22,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:02:22,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149762490] [2023-01-27 18:02:22,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149762490] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:02:22,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:02:22,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 18:02:22,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635692362] [2023-01-27 18:02:22,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:02:22,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 18:02:22,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:02:22,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 18:02:22,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-27 18:02:22,298 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 176 [2023-01-27 18:02:22,298 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 18 transitions, 68 flow. Second operand has 4 states, 4 states have (on average 76.5) internal successors, (306), 4 states have internal predecessors, (306), 0 states have call successors, (0), 0 states 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:02:22,298 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:02:22,298 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 176 [2023-01-27 18:02:22,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:02:22,402 INFO L130 PetriNetUnfolder]: 63/151 cut-off events. [2023-01-27 18:02:22,403 INFO L131 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2023-01-27 18:02:22,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 359 conditions, 151 events. 63/151 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 543 event pairs, 29 based on Foata normal form. 23/173 useless extension candidates. Maximal degree in co-relation 345. Up to 64 conditions per place. [2023-01-27 18:02:22,405 INFO L137 encePairwiseOnDemand]: 171/176 looper letters, 28 selfloop transitions, 4 changer transitions 0/35 dead transitions. [2023-01-27 18:02:22,405 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 35 transitions, 174 flow [2023-01-27 18:02:22,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-27 18:02:22,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-27 18:02:22,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 329 transitions. [2023-01-27 18:02:22,407 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46732954545454547 [2023-01-27 18:02:22,407 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 329 transitions. [2023-01-27 18:02:22,407 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 329 transitions. [2023-01-27 18:02:22,408 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:02:22,408 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 329 transitions. [2023-01-27 18:02:22,409 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 82.25) internal successors, (329), 4 states have internal predecessors, (329), 0 states have call successors, (0), 0 states 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:02:22,410 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 176.0) internal successors, (880), 5 states have internal predecessors, (880), 0 states have call successors, (0), 0 states 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:02:22,411 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 176.0) internal successors, (880), 5 states have internal predecessors, (880), 0 states have call successors, (0), 0 states 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:02:22,411 INFO L175 Difference]: Start difference. First operand has 27 places, 18 transitions, 68 flow. Second operand 4 states and 329 transitions. [2023-01-27 18:02:22,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 35 transitions, 174 flow [2023-01-27 18:02:22,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 35 transitions, 168 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-27 18:02:22,414 INFO L231 Difference]: Finished difference. Result has 30 places, 21 transitions, 92 flow [2023-01-27 18:02:22,414 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=92, PETRI_PLACES=30, PETRI_TRANSITIONS=21} [2023-01-27 18:02:22,416 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 5 predicate places. [2023-01-27 18:02:22,416 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 21 transitions, 92 flow [2023-01-27 18:02:22,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 76.5) internal successors, (306), 4 states have internal predecessors, (306), 0 states have call successors, (0), 0 states 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:02:22,416 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:02:22,416 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:02:22,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-27 18:02:22,417 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-27 18:02:22,417 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:02:22,417 INFO L85 PathProgramCache]: Analyzing trace with hash 817851324, now seen corresponding path program 1 times [2023-01-27 18:02:22,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:02:22,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107501120] [2023-01-27 18:02:22,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:02:22,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:02:22,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:02:22,765 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:02:22,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:02:22,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107501120] [2023-01-27 18:02:22,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107501120] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:02:22,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:02:22,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 18:02:22,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868748811] [2023-01-27 18:02:22,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:02:22,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 18:02:22,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:02:22,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 18:02:22,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-27 18:02:22,773 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 176 [2023-01-27 18:02:22,774 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 21 transitions, 92 flow. Second operand has 5 states, 5 states have (on average 76.4) internal successors, (382), 5 states have internal predecessors, (382), 0 states have call successors, (0), 0 states 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:02:22,774 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:02:22,774 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 176 [2023-01-27 18:02:22,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:02:22,845 INFO L130 PetriNetUnfolder]: 51/128 cut-off events. [2023-01-27 18:02:22,845 INFO L131 PetriNetUnfolder]: For 55/55 co-relation queries the response was YES. [2023-01-27 18:02:22,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 373 conditions, 128 events. 51/128 cut-off events. For 55/55 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 448 event pairs, 29 based on Foata normal form. 9/136 useless extension candidates. Maximal degree in co-relation 357. Up to 64 conditions per place. [2023-01-27 18:02:22,846 INFO L137 encePairwiseOnDemand]: 171/176 looper letters, 20 selfloop transitions, 6 changer transitions 0/29 dead transitions. [2023-01-27 18:02:22,846 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 29 transitions, 168 flow [2023-01-27 18:02:22,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 18:02:22,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 18:02:22,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 397 transitions. [2023-01-27 18:02:22,848 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4511363636363636 [2023-01-27 18:02:22,848 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 397 transitions. [2023-01-27 18:02:22,849 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 397 transitions. [2023-01-27 18:02:22,849 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:02:22,849 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 397 transitions. [2023-01-27 18:02:22,850 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 79.4) internal successors, (397), 5 states have internal predecessors, (397), 0 states have call successors, (0), 0 states 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:02:22,852 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 176.0) internal successors, (1056), 6 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states 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:02:22,852 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 176.0) internal successors, (1056), 6 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states 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:02:22,852 INFO L175 Difference]: Start difference. First operand has 30 places, 21 transitions, 92 flow. Second operand 5 states and 397 transitions. [2023-01-27 18:02:22,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 29 transitions, 168 flow [2023-01-27 18:02:22,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 29 transitions, 152 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-01-27 18:02:22,855 INFO L231 Difference]: Finished difference. Result has 33 places, 22 transitions, 107 flow [2023-01-27 18:02:22,855 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=107, PETRI_PLACES=33, PETRI_TRANSITIONS=22} [2023-01-27 18:02:22,857 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 8 predicate places. [2023-01-27 18:02:22,857 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 22 transitions, 107 flow [2023-01-27 18:02:22,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 76.4) internal successors, (382), 5 states have internal predecessors, (382), 0 states have call successors, (0), 0 states 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:02:22,858 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:02:22,858 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:02:22,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-27 18:02:22,858 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-27 18:02:22,859 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:02:22,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1380798545, now seen corresponding path program 1 times [2023-01-27 18:02:22,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:02:22,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641846935] [2023-01-27 18:02:22,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:02:22,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:02:22,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:02:23,132 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:02:23,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:02:23,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641846935] [2023-01-27 18:02:23,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641846935] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:02:23,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:02:23,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 18:02:23,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114608828] [2023-01-27 18:02:23,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:02:23,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 18:02:23,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:02:23,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 18:02:23,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-27 18:02:23,137 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 176 [2023-01-27 18:02:23,138 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 22 transitions, 107 flow. Second operand has 4 states, 4 states have (on average 78.0) internal successors, (312), 4 states have internal predecessors, (312), 0 states have call successors, (0), 0 states 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:02:23,138 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:02:23,138 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 176 [2023-01-27 18:02:23,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:02:23,223 INFO L130 PetriNetUnfolder]: 95/211 cut-off events. [2023-01-27 18:02:23,223 INFO L131 PetriNetUnfolder]: For 327/327 co-relation queries the response was YES. [2023-01-27 18:02:23,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 672 conditions, 211 events. 95/211 cut-off events. For 327/327 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 805 event pairs, 11 based on Foata normal form. 1/212 useless extension candidates. Maximal degree in co-relation 655. Up to 130 conditions per place. [2023-01-27 18:02:23,224 INFO L137 encePairwiseOnDemand]: 173/176 looper letters, 19 selfloop transitions, 1 changer transitions 22/42 dead transitions. [2023-01-27 18:02:23,224 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 295 flow [2023-01-27 18:02:23,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-27 18:02:23,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-27 18:02:23,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 328 transitions. [2023-01-27 18:02:23,226 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4659090909090909 [2023-01-27 18:02:23,226 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 328 transitions. [2023-01-27 18:02:23,226 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 328 transitions. [2023-01-27 18:02:23,226 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:02:23,226 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 328 transitions. [2023-01-27 18:02:23,228 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 82.0) internal successors, (328), 4 states have internal predecessors, (328), 0 states have call successors, (0), 0 states 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:02:23,229 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 176.0) internal successors, (880), 5 states have internal predecessors, (880), 0 states have call successors, (0), 0 states 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:02:23,231 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 176.0) internal successors, (880), 5 states have internal predecessors, (880), 0 states have call successors, (0), 0 states 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:02:23,231 INFO L175 Difference]: Start difference. First operand has 33 places, 22 transitions, 107 flow. Second operand 4 states and 328 transitions. [2023-01-27 18:02:23,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 295 flow [2023-01-27 18:02:23,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 42 transitions, 278 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-01-27 18:02:23,236 INFO L231 Difference]: Finished difference. Result has 36 places, 18 transitions, 87 flow [2023-01-27 18:02:23,236 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=87, PETRI_PLACES=36, PETRI_TRANSITIONS=18} [2023-01-27 18:02:23,237 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 11 predicate places. [2023-01-27 18:02:23,237 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 18 transitions, 87 flow [2023-01-27 18:02:23,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 78.0) internal successors, (312), 4 states have internal predecessors, (312), 0 states have call successors, (0), 0 states 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:02:23,238 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:02:23,238 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:02:23,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-27 18:02:23,238 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-27 18:02:23,239 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:02:23,239 INFO L85 PathProgramCache]: Analyzing trace with hash 2093331019, now seen corresponding path program 2 times [2023-01-27 18:02:23,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:02:23,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794790672] [2023-01-27 18:02:23,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:02:23,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:02:23,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:02:24,718 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:02:24,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:02:24,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794790672] [2023-01-27 18:02:24,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794790672] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:02:24,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:02:24,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-27 18:02:24,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435596590] [2023-01-27 18:02:24,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:02:24,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-27 18:02:24,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:02:24,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-27 18:02:24,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-01-27 18:02:24,721 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 176 [2023-01-27 18:02:24,721 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 18 transitions, 87 flow. Second operand has 7 states, 7 states have (on average 71.0) internal successors, (497), 7 states have internal predecessors, (497), 0 states have call successors, (0), 0 states 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:02:24,722 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:02:24,722 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 176 [2023-01-27 18:02:24,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:02:24,885 INFO L130 PetriNetUnfolder]: 10/46 cut-off events. [2023-01-27 18:02:24,885 INFO L131 PetriNetUnfolder]: For 60/60 co-relation queries the response was YES. [2023-01-27 18:02:24,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 165 conditions, 46 events. 10/46 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 79 event pairs, 2 based on Foata normal form. 1/47 useless extension candidates. Maximal degree in co-relation 152. Up to 13 conditions per place. [2023-01-27 18:02:24,886 INFO L137 encePairwiseOnDemand]: 169/176 looper letters, 12 selfloop transitions, 5 changer transitions 10/29 dead transitions. [2023-01-27 18:02:24,886 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 29 transitions, 210 flow [2023-01-27 18:02:24,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-27 18:02:24,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-01-27 18:02:24,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 576 transitions. [2023-01-27 18:02:24,891 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4090909090909091 [2023-01-27 18:02:24,892 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 576 transitions. [2023-01-27 18:02:24,892 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 576 transitions. [2023-01-27 18:02:24,892 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:02:24,892 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 576 transitions. [2023-01-27 18:02:24,894 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 72.0) internal successors, (576), 8 states have internal predecessors, (576), 0 states have call successors, (0), 0 states 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:02:24,896 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 176.0) internal successors, (1584), 9 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:02:24,896 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 176.0) internal successors, (1584), 9 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:02:24,896 INFO L175 Difference]: Start difference. First operand has 36 places, 18 transitions, 87 flow. Second operand 8 states and 576 transitions. [2023-01-27 18:02:24,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 29 transitions, 210 flow [2023-01-27 18:02:24,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 29 transitions, 148 flow, removed 9 selfloop flow, removed 9 redundant places. [2023-01-27 18:02:24,899 INFO L231 Difference]: Finished difference. Result has 35 places, 18 transitions, 72 flow [2023-01-27 18:02:24,899 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=72, PETRI_PLACES=35, PETRI_TRANSITIONS=18} [2023-01-27 18:02:24,901 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 10 predicate places. [2023-01-27 18:02:24,901 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 18 transitions, 72 flow [2023-01-27 18:02:24,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 71.0) internal successors, (497), 7 states have internal predecessors, (497), 0 states have call successors, (0), 0 states 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:02:24,901 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:02:24,901 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:02:24,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-01-27 18:02:24,902 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-27 18:02:24,902 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:02:24,902 INFO L85 PathProgramCache]: Analyzing trace with hash 466078297, now seen corresponding path program 3 times [2023-01-27 18:02:24,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:02:24,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075010374] [2023-01-27 18:02:24,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:02:24,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:02:24,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-27 18:02:24,960 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-27 18:02:25,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-27 18:02:25,052 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-27 18:02:25,052 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-27 18:02:25,053 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-01-27 18:02:25,055 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-01-27 18:02:25,055 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2023-01-27 18:02:25,055 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2023-01-27 18:02:25,055 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-01-27 18:02:25,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-27 18:02:25,056 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1] [2023-01-27 18:02:25,061 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-27 18:02:25,061 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-27 18:02:25,128 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.01 06:02:25 BasicIcfg [2023-01-27 18:02:25,129 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-27 18:02:25,129 INFO L158 Benchmark]: Toolchain (without parser) took 9864.50ms. Allocated memory was 350.2MB in the beginning and 610.3MB in the end (delta: 260.0MB). Free memory was 299.2MB in the beginning and 454.8MB in the end (delta: -155.6MB). Peak memory consumption was 106.5MB. Max. memory is 16.0GB. [2023-01-27 18:02:25,129 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 350.2MB. Free memory is still 297.3MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-27 18:02:25,130 INFO L158 Benchmark]: CACSL2BoogieTranslator took 487.34ms. Allocated memory is still 350.2MB. Free memory was 299.2MB in the beginning and 275.6MB in the end (delta: 23.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. [2023-01-27 18:02:25,130 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.96ms. Allocated memory is still 350.2MB. Free memory was 275.6MB in the beginning and 273.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-27 18:02:25,130 INFO L158 Benchmark]: Boogie Preprocessor took 54.40ms. Allocated memory is still 350.2MB. Free memory was 273.0MB in the beginning and 270.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-27 18:02:25,131 INFO L158 Benchmark]: RCFGBuilder took 707.76ms. Allocated memory is still 350.2MB. Free memory was 270.9MB in the beginning and 233.1MB in the end (delta: 37.8MB). Peak memory consumption was 37.7MB. Max. memory is 16.0GB. [2023-01-27 18:02:25,131 INFO L158 Benchmark]: TraceAbstraction took 8529.03ms. Allocated memory was 350.2MB in the beginning and 610.3MB in the end (delta: 260.0MB). Free memory was 232.6MB in the beginning and 454.8MB in the end (delta: -222.2MB). Peak memory consumption was 39.4MB. Max. memory is 16.0GB. [2023-01-27 18:02:25,132 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.15ms. Allocated memory is still 350.2MB. Free memory is still 297.3MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 487.34ms. Allocated memory is still 350.2MB. Free memory was 299.2MB in the beginning and 275.6MB in the end (delta: 23.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 77.96ms. Allocated memory is still 350.2MB. Free memory was 275.6MB in the beginning and 273.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 54.40ms. Allocated memory is still 350.2MB. Free memory was 273.0MB in the beginning and 270.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 707.76ms. Allocated memory is still 350.2MB. Free memory was 270.9MB in the beginning and 233.1MB in the end (delta: 37.8MB). Peak memory consumption was 37.7MB. Max. memory is 16.0GB. * TraceAbstraction took 8529.03ms. Allocated memory was 350.2MB in the beginning and 610.3MB in the end (delta: 260.0MB). Free memory was 232.6MB in the beginning and 454.8MB in the end (delta: -222.2MB). Peak memory consumption was 39.4MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.2s, 94 PlacesBefore, 25 PlacesAfterwards, 89 TransitionsBefore, 19 TransitionsAfterwards, 1088 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 38 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 85 TotalNumberOfCompositions, 2899 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1287, independent: 1162, independent conditional: 0, independent unconditional: 1162, dependent: 125, dependent conditional: 0, dependent unconditional: 125, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 641, independent: 611, independent conditional: 0, independent unconditional: 611, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1287, independent: 551, independent conditional: 0, independent unconditional: 551, dependent: 95, dependent conditional: 0, dependent unconditional: 95, unknown: 641, unknown conditional: 0, unknown unconditional: 641] , Statistics on independence cache: Total cache size (in pairs): 50, Positive cache size: 39, Positive conditional cache size: 0, Positive unconditional cache size: 39, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 19]: 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_p0_EBX = 0; [L715] 0 int __unbuffered_p1_EAX = 0; [L717] 0 int __unbuffered_p1_EBX = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L722] 0 _Bool x$flush_delayed; [L723] 0 int x$mem_tmp; [L724] 0 _Bool x$r_buff0_thd0; [L725] 0 _Bool x$r_buff0_thd1; [L726] 0 _Bool x$r_buff0_thd2; [L727] 0 _Bool x$r_buff1_thd0; [L728] 0 _Bool x$r_buff1_thd1; [L729] 0 _Bool x$r_buff1_thd2; [L730] 0 _Bool x$read_delayed; [L731] 0 int *x$read_delayed_var; [L732] 0 int x$w_buff0; [L733] 0 _Bool x$w_buff0_used; [L734] 0 int x$w_buff1; [L735] 0 _Bool x$w_buff1_used; [L737] 0 int y = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L826] 0 pthread_t t0; [L827] FCALL, FORK 0 pthread_create(&t0, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t0, ((void *)0), P0, ((void *)0))=-2, t0={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L828] 0 pthread_t t1; [L829] FCALL, FORK 0 pthread_create(&t1, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1, ((void *)0), P1, ((void *)0))=-1, t0={5:0}, t1={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 1 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L785] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L786] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L787] 2 x$flush_delayed = weak$$choice2 [L788] 2 x$mem_tmp = x [L789] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L790] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L791] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L792] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L793] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L794] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L795] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L796] 2 __unbuffered_p1_EAX = x [L797] 2 x = x$flush_delayed ? x$mem_tmp : x [L798] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L801] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L743] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L746] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L749] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L750] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L751] 1 x$flush_delayed = weak$$choice2 [L752] 1 x$mem_tmp = x [L753] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L754] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L755] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L756] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L757] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L759] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 1 __unbuffered_p0_EBX = x [L761] 1 x = x$flush_delayed ? x$mem_tmp : x [L762] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L804] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L805] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L806] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L807] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L808] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1] [L811] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L813] 2 return 0; [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 1 return 0; [L831] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t0={5:0}, t1={3:0}, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1] [L833] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L833] RET 0 assume_abort_if_not(main$tmp_guard0) [L835] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L836] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L837] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L838] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L839] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t0={5:0}, t1={3:0}, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1] [L842] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L844] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1] - UnprovableResult [Line: 19]: 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: 829]: 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: 827]: 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 5 procedures, 110 locations, 5 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: 8.4s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 92 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 92 mSDsluCounter, 8 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 338 IncrementalHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 7 mSDtfsCounter, 338 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=107occurred in iteration=6, InterpolantAutomatonStates: 33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 102 NumberOfCodeBlocks, 102 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 78 ConstructedInterpolants, 0 QuantifiedInterpolants, 737 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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:02:25,158 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...