/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/mix008.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-27 18:05:10,584 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-27 18:05:10,585 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-27 18:05:10,604 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-27 18:05:10,604 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-27 18:05:10,605 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-27 18:05:10,606 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-27 18:05:10,607 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-27 18:05:10,608 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-27 18:05:10,608 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-27 18:05:10,609 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-27 18:05:10,610 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-27 18:05:10,610 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-27 18:05:10,610 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-27 18:05:10,611 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-27 18:05:10,612 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-27 18:05:10,612 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-27 18:05:10,613 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-27 18:05:10,614 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-27 18:05:10,615 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-27 18:05:10,616 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-27 18:05:10,617 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-27 18:05:10,618 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-27 18:05:10,618 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-27 18:05:10,621 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-27 18:05:10,621 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-27 18:05:10,621 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-27 18:05:10,622 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-27 18:05:10,622 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-27 18:05:10,623 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-27 18:05:10,623 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-27 18:05:10,623 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-27 18:05:10,624 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-27 18:05:10,624 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-27 18:05:10,625 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-27 18:05:10,625 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-27 18:05:10,626 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-27 18:05:10,626 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-27 18:05:10,626 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-27 18:05:10,627 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-27 18:05:10,627 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-27 18:05:10,628 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:05:10,641 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-27 18:05:10,642 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-27 18:05:10,642 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-27 18:05:10,642 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-27 18:05:10,643 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-27 18:05:10,643 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-27 18:05:10,643 INFO L138 SettingsManager]: * Use SBE=true [2023-01-27 18:05:10,643 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-27 18:05:10,643 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-27 18:05:10,643 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-27 18:05:10,643 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-27 18:05:10,643 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-27 18:05:10,644 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-27 18:05:10,644 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-27 18:05:10,644 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-27 18:05:10,644 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-27 18:05:10,644 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-27 18:05:10,644 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-27 18:05:10,644 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-27 18:05:10,644 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-27 18:05:10,644 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-27 18:05:10,644 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-27 18:05:10,645 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-27 18:05:10,645 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 18:05:10,645 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-27 18:05:10,645 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-27 18:05:10,645 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-27 18:05:10,645 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-27 18:05:10,645 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-27 18:05:10,645 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-27 18:05:10,645 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-27 18:05:10,645 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:05:10,784 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-27 18:05:10,797 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-27 18:05:10,799 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-27 18:05:10,800 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-27 18:05:10,800 INFO L275 PluginConnector]: CDTParser initialized [2023-01-27 18:05:10,801 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix008.opt.i [2023-01-27 18:05:11,839 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-27 18:05:12,073 INFO L351 CDTParser]: Found 1 translation units. [2023-01-27 18:05:12,073 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix008.opt.i [2023-01-27 18:05:12,089 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f66974f81/b3cd0f76884845f092304e5d00302ba7/FLAGfddafa80a [2023-01-27 18:05:12,107 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f66974f81/b3cd0f76884845f092304e5d00302ba7 [2023-01-27 18:05:12,108 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-27 18:05:12,110 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-27 18:05:12,113 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-27 18:05:12,113 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-27 18:05:12,115 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-27 18:05:12,115 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 06:05:12" (1/1) ... [2023-01-27 18:05:12,116 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5883fa32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:05:12, skipping insertion in model container [2023-01-27 18:05:12,116 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 06:05:12" (1/1) ... [2023-01-27 18:05:12,120 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-27 18:05:12,168 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-27 18:05:12,292 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/mix008.opt.i[944,957] [2023-01-27 18:05:12,476 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 18:05:12,486 INFO L203 MainTranslator]: Completed pre-run [2023-01-27 18:05:12,495 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/mix008.opt.i[944,957] [2023-01-27 18:05:12,547 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 18:05:12,577 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-27 18:05:12,578 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-27 18:05:12,583 INFO L208 MainTranslator]: Completed translation [2023-01-27 18:05:12,583 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:05:12 WrapperNode [2023-01-27 18:05:12,583 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-27 18:05:12,584 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-27 18:05:12,584 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-27 18:05:12,584 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-27 18:05:12,588 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:05:12" (1/1) ... [2023-01-27 18:05:12,599 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:05:12" (1/1) ... [2023-01-27 18:05:12,622 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 165 [2023-01-27 18:05:12,623 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-27 18:05:12,623 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-27 18:05:12,623 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-27 18:05:12,623 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-27 18:05:12,630 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:05:12" (1/1) ... [2023-01-27 18:05:12,630 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:05:12" (1/1) ... [2023-01-27 18:05:12,633 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:05:12" (1/1) ... [2023-01-27 18:05:12,633 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:05:12" (1/1) ... [2023-01-27 18:05:12,639 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:05:12" (1/1) ... [2023-01-27 18:05:12,650 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:05:12" (1/1) ... [2023-01-27 18:05:12,652 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:05:12" (1/1) ... [2023-01-27 18:05:12,653 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:05:12" (1/1) ... [2023-01-27 18:05:12,655 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-27 18:05:12,656 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-27 18:05:12,656 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-27 18:05:12,656 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-27 18:05:12,657 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:05:12" (1/1) ... [2023-01-27 18:05:12,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 18:05:12,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 18:05:12,685 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:05:12,699 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:05:12,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-27 18:05:12,710 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-27 18:05:12,710 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-27 18:05:12,710 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-27 18:05:12,711 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-27 18:05:12,711 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-01-27 18:05:12,711 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-01-27 18:05:12,711 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-01-27 18:05:12,711 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-01-27 18:05:12,711 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-01-27 18:05:12,711 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-01-27 18:05:12,711 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-01-27 18:05:12,711 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-01-27 18:05:12,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-27 18:05:12,711 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-27 18:05:12,711 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-27 18:05:12,712 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-27 18:05:12,713 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:05:12,807 INFO L236 CfgBuilder]: Building ICFG [2023-01-27 18:05:12,808 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-27 18:05:13,129 INFO L277 CfgBuilder]: Performing block encoding [2023-01-27 18:05:13,255 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-27 18:05:13,255 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-01-27 18:05:13,257 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 06:05:13 BoogieIcfgContainer [2023-01-27 18:05:13,257 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-27 18:05:13,260 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-27 18:05:13,260 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-27 18:05:13,263 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-27 18:05:13,263 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 06:05:12" (1/3) ... [2023-01-27 18:05:13,265 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68755c23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 06:05:13, skipping insertion in model container [2023-01-27 18:05:13,265 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:05:12" (2/3) ... [2023-01-27 18:05:13,265 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68755c23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 06:05:13, skipping insertion in model container [2023-01-27 18:05:13,265 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 06:05:13" (3/3) ... [2023-01-27 18:05:13,266 INFO L112 eAbstractionObserver]: Analyzing ICFG mix008.opt.i [2023-01-27 18:05:13,278 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-27 18:05:13,278 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-01-27 18:05:13,278 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-27 18:05:13,326 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-27 18:05:13,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 129 transitions, 278 flow [2023-01-27 18:05:13,410 INFO L130 PetriNetUnfolder]: 2/125 cut-off events. [2023-01-27 18:05:13,411 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:05:13,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 125 events. 2/125 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 66 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2023-01-27 18:05:13,416 INFO L82 GeneralOperation]: Start removeDead. Operand has 140 places, 129 transitions, 278 flow [2023-01-27 18:05:13,423 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 125 transitions, 262 flow [2023-01-27 18:05:13,426 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-27 18:05:13,436 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 125 transitions, 262 flow [2023-01-27 18:05:13,439 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 136 places, 125 transitions, 262 flow [2023-01-27 18:05:13,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 125 transitions, 262 flow [2023-01-27 18:05:13,471 INFO L130 PetriNetUnfolder]: 2/125 cut-off events. [2023-01-27 18:05:13,471 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:05:13,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 125 events. 2/125 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 66 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2023-01-27 18:05:13,475 INFO L119 LiptonReduction]: Number of co-enabled transitions 2836 [2023-01-27 18:05:16,514 INFO L134 LiptonReduction]: Checked pairs total: 7428 [2023-01-27 18:05:16,514 INFO L136 LiptonReduction]: Total number of compositions: 109 [2023-01-27 18:05:16,523 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-27 18:05:16,527 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;@30315438, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-27 18:05:16,527 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-01-27 18:05:16,531 INFO L130 PetriNetUnfolder]: 0/18 cut-off events. [2023-01-27 18:05:16,531 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:05:16,531 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:05:16,531 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:05:16,532 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:05:16,535 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:05:16,535 INFO L85 PathProgramCache]: Analyzing trace with hash -669899686, now seen corresponding path program 1 times [2023-01-27 18:05:16,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:05:16,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859606047] [2023-01-27 18:05:16,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:05:16,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:05:16,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:05:16,919 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:05:16,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:05:16,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859606047] [2023-01-27 18:05:16,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859606047] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:05:16,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:05:16,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-27 18:05:16,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43498055] [2023-01-27 18:05:16,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:05:16,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-27 18:05:16,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:05:16,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-27 18:05:16,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-27 18:05:16,966 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 238 [2023-01-27 18:05:16,970 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 29 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:05:16,970 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:05:16,970 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 238 [2023-01-27 18:05:16,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:05:17,322 INFO L130 PetriNetUnfolder]: 2594/3793 cut-off events. [2023-01-27 18:05:17,323 INFO L131 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2023-01-27 18:05:17,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7488 conditions, 3793 events. 2594/3793 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 20206 event pairs, 518 based on Foata normal form. 0/3600 useless extension candidates. Maximal degree in co-relation 7476. Up to 2797 conditions per place. [2023-01-27 18:05:17,348 INFO L137 encePairwiseOnDemand]: 234/238 looper letters, 30 selfloop transitions, 2 changer transitions 2/38 dead transitions. [2023-01-27 18:05:17,348 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 38 transitions, 156 flow [2023-01-27 18:05:17,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 18:05:17,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 18:05:17,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 382 transitions. [2023-01-27 18:05:17,361 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5350140056022409 [2023-01-27 18:05:17,361 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 382 transitions. [2023-01-27 18:05:17,362 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 382 transitions. [2023-01-27 18:05:17,364 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:05:17,365 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 382 transitions. [2023-01-27 18:05:17,369 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 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:05:17,374 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 238.0) internal successors, (952), 4 states have internal predecessors, (952), 0 states have call successors, (0), 0 states 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:05:17,375 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 238.0) internal successors, (952), 4 states have internal predecessors, (952), 0 states have call successors, (0), 0 states 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:05:17,376 INFO L175 Difference]: Start difference. First operand has 41 places, 29 transitions, 70 flow. Second operand 3 states and 382 transitions. [2023-01-27 18:05:17,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 38 transitions, 156 flow [2023-01-27 18:05:17,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 38 transitions, 152 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-01-27 18:05:17,381 INFO L231 Difference]: Finished difference. Result has 38 places, 26 transitions, 64 flow [2023-01-27 18:05:17,382 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=38, PETRI_TRANSITIONS=26} [2023-01-27 18:05:17,385 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -3 predicate places. [2023-01-27 18:05:17,385 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 26 transitions, 64 flow [2023-01-27 18:05:17,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:05:17,386 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:05:17,386 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:05:17,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-27 18:05:17,386 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:05:17,393 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:05:17,393 INFO L85 PathProgramCache]: Analyzing trace with hash 471579843, now seen corresponding path program 1 times [2023-01-27 18:05:17,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:05:17,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404388949] [2023-01-27 18:05:17,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:05:17,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:05:17,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:05:17,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:05:17,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:05:17,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404388949] [2023-01-27 18:05:17,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404388949] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:05:17,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:05:17,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-27 18:05:17,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119954992] [2023-01-27 18:05:17,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:05:17,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-27 18:05:17,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:05:17,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-27 18:05:17,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-27 18:05:17,727 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 238 [2023-01-27 18:05:17,727 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 26 transitions, 64 flow. Second operand has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states 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:05:17,727 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:05:17,728 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 238 [2023-01-27 18:05:17,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:05:18,673 INFO L130 PetriNetUnfolder]: 9457/13034 cut-off events. [2023-01-27 18:05:18,673 INFO L131 PetriNetUnfolder]: For 454/454 co-relation queries the response was YES. [2023-01-27 18:05:18,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26894 conditions, 13034 events. 9457/13034 cut-off events. For 454/454 co-relation queries the response was YES. Maximal size of possible extension queue 467. Compared 65998 event pairs, 3309 based on Foata normal form. 364/13398 useless extension candidates. Maximal degree in co-relation 26884. Up to 8217 conditions per place. [2023-01-27 18:05:18,730 INFO L137 encePairwiseOnDemand]: 228/238 looper letters, 38 selfloop transitions, 9 changer transitions 0/47 dead transitions. [2023-01-27 18:05:18,730 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 47 transitions, 206 flow [2023-01-27 18:05:18,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 18:05:18,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 18:05:18,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 357 transitions. [2023-01-27 18:05:18,732 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2023-01-27 18:05:18,732 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 357 transitions. [2023-01-27 18:05:18,732 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 357 transitions. [2023-01-27 18:05:18,732 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:05:18,732 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 357 transitions. [2023-01-27 18:05:18,733 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 states 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:05:18,734 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 238.0) internal successors, (952), 4 states have internal predecessors, (952), 0 states have call successors, (0), 0 states 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:05:18,734 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 238.0) internal successors, (952), 4 states have internal predecessors, (952), 0 states have call successors, (0), 0 states 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:05:18,734 INFO L175 Difference]: Start difference. First operand has 38 places, 26 transitions, 64 flow. Second operand 3 states and 357 transitions. [2023-01-27 18:05:18,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 47 transitions, 206 flow [2023-01-27 18:05:18,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 47 transitions, 200 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-27 18:05:18,743 INFO L231 Difference]: Finished difference. Result has 39 places, 34 transitions, 130 flow [2023-01-27 18:05:18,743 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=39, PETRI_TRANSITIONS=34} [2023-01-27 18:05:18,744 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -2 predicate places. [2023-01-27 18:05:18,744 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 34 transitions, 130 flow [2023-01-27 18:05:18,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states 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:05:18,744 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:05:18,745 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:05:18,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-27 18:05:18,745 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:05:18,747 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:05:18,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1734071157, now seen corresponding path program 1 times [2023-01-27 18:05:18,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:05:18,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184826956] [2023-01-27 18:05:18,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:05:18,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:05:18,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:05:18,876 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:05:18,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:05:18,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184826956] [2023-01-27 18:05:18,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184826956] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:05:18,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:05:18,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-27 18:05:18,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665179302] [2023-01-27 18:05:18,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:05:18,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 18:05:18,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:05:18,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 18:05:18,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-27 18:05:18,878 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 238 [2023-01-27 18:05:18,878 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 34 transitions, 130 flow. Second operand has 4 states, 4 states have (on average 106.0) internal successors, (424), 4 states have internal predecessors, (424), 0 states have call successors, (0), 0 states 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:05:18,878 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:05:18,879 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 238 [2023-01-27 18:05:18,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:05:19,760 INFO L130 PetriNetUnfolder]: 8597/11866 cut-off events. [2023-01-27 18:05:19,761 INFO L131 PetriNetUnfolder]: For 5625/5625 co-relation queries the response was YES. [2023-01-27 18:05:19,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31636 conditions, 11866 events. 8597/11866 cut-off events. For 5625/5625 co-relation queries the response was YES. Maximal size of possible extension queue 416. Compared 59937 event pairs, 2031 based on Foata normal form. 168/12034 useless extension candidates. Maximal degree in co-relation 31624. Up to 5317 conditions per place. [2023-01-27 18:05:19,824 INFO L137 encePairwiseOnDemand]: 229/238 looper letters, 56 selfloop transitions, 9 changer transitions 0/65 dead transitions. [2023-01-27 18:05:19,824 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 65 transitions, 356 flow [2023-01-27 18:05:19,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-27 18:05:19,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-27 18:05:19,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 471 transitions. [2023-01-27 18:05:19,825 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4947478991596639 [2023-01-27 18:05:19,825 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 471 transitions. [2023-01-27 18:05:19,825 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 471 transitions. [2023-01-27 18:05:19,826 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:05:19,826 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 471 transitions. [2023-01-27 18:05:19,826 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 117.75) internal successors, (471), 4 states have internal predecessors, (471), 0 states have call successors, (0), 0 states 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:05:19,828 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 238.0) internal successors, (1190), 5 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states 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:05:19,828 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 238.0) internal successors, (1190), 5 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states 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:05:19,828 INFO L175 Difference]: Start difference. First operand has 39 places, 34 transitions, 130 flow. Second operand 4 states and 471 transitions. [2023-01-27 18:05:19,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 65 transitions, 356 flow [2023-01-27 18:05:19,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 65 transitions, 328 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-27 18:05:19,850 INFO L231 Difference]: Finished difference. Result has 43 places, 39 transitions, 180 flow [2023-01-27 18:05:19,850 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=180, PETRI_PLACES=43, PETRI_TRANSITIONS=39} [2023-01-27 18:05:19,851 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 2 predicate places. [2023-01-27 18:05:19,853 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 39 transitions, 180 flow [2023-01-27 18:05:19,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 106.0) internal successors, (424), 4 states have internal predecessors, (424), 0 states have call successors, (0), 0 states 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:05:19,853 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:05:19,853 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:05:19,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-27 18:05:19,853 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:05:19,854 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:05:19,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1040524735, now seen corresponding path program 1 times [2023-01-27 18:05:19,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:05:19,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635261372] [2023-01-27 18:05:19,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:05:19,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:05:19,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:05:19,966 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:05:19,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:05:19,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635261372] [2023-01-27 18:05:19,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635261372] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:05:19,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:05:19,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-27 18:05:19,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785837600] [2023-01-27 18:05:19,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:05:19,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 18:05:19,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:05:19,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 18:05:19,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-27 18:05:19,968 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 238 [2023-01-27 18:05:19,968 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 39 transitions, 180 flow. Second operand has 4 states, 4 states have (on average 106.25) internal successors, (425), 4 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:05:19,968 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:05:19,969 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 238 [2023-01-27 18:05:19,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:05:20,845 INFO L130 PetriNetUnfolder]: 8399/11596 cut-off events. [2023-01-27 18:05:20,845 INFO L131 PetriNetUnfolder]: For 8854/8854 co-relation queries the response was YES. [2023-01-27 18:05:20,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33025 conditions, 11596 events. 8399/11596 cut-off events. For 8854/8854 co-relation queries the response was YES. Maximal size of possible extension queue 403. Compared 58667 event pairs, 1365 based on Foata normal form. 36/11632 useless extension candidates. Maximal degree in co-relation 33010. Up to 6647 conditions per place. [2023-01-27 18:05:20,894 INFO L137 encePairwiseOnDemand]: 228/238 looper letters, 58 selfloop transitions, 19 changer transitions 0/77 dead transitions. [2023-01-27 18:05:20,895 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 77 transitions, 458 flow [2023-01-27 18:05:20,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-27 18:05:20,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-27 18:05:20,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 480 transitions. [2023-01-27 18:05:20,896 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5042016806722689 [2023-01-27 18:05:20,896 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 480 transitions. [2023-01-27 18:05:20,896 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 480 transitions. [2023-01-27 18:05:20,897 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:05:20,897 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 480 transitions. [2023-01-27 18:05:20,897 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 120.0) internal successors, (480), 4 states have internal predecessors, (480), 0 states have call successors, (0), 0 states 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:05:20,899 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 238.0) internal successors, (1190), 5 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states 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:05:20,899 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 238.0) internal successors, (1190), 5 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states 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:05:20,899 INFO L175 Difference]: Start difference. First operand has 43 places, 39 transitions, 180 flow. Second operand 4 states and 480 transitions. [2023-01-27 18:05:20,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 77 transitions, 458 flow [2023-01-27 18:05:20,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 77 transitions, 454 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-27 18:05:20,924 INFO L231 Difference]: Finished difference. Result has 47 places, 46 transitions, 285 flow [2023-01-27 18:05:20,925 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=285, PETRI_PLACES=47, PETRI_TRANSITIONS=46} [2023-01-27 18:05:20,925 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 6 predicate places. [2023-01-27 18:05:20,925 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 46 transitions, 285 flow [2023-01-27 18:05:20,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 106.25) internal successors, (425), 4 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:05:20,926 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:05:20,926 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:05:20,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-27 18:05:20,926 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:05:20,926 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:05:20,926 INFO L85 PathProgramCache]: Analyzing trace with hash -4971793, now seen corresponding path program 1 times [2023-01-27 18:05:20,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:05:20,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536927274] [2023-01-27 18:05:20,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:05:20,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:05:20,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:05:21,072 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:05:21,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:05:21,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536927274] [2023-01-27 18:05:21,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536927274] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:05:21,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:05:21,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-27 18:05:21,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846412550] [2023-01-27 18:05:21,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:05:21,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 18:05:21,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:05:21,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 18:05:21,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-27 18:05:21,074 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 238 [2023-01-27 18:05:21,075 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 46 transitions, 285 flow. Second operand has 4 states, 4 states have (on average 106.5) internal successors, (426), 4 states have internal predecessors, (426), 0 states have call successors, (0), 0 states 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:05:21,075 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:05:21,075 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 238 [2023-01-27 18:05:21,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:05:21,807 INFO L130 PetriNetUnfolder]: 8021/11074 cut-off events. [2023-01-27 18:05:21,807 INFO L131 PetriNetUnfolder]: For 19032/19032 co-relation queries the response was YES. [2023-01-27 18:05:21,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36162 conditions, 11074 events. 8021/11074 cut-off events. For 19032/19032 co-relation queries the response was YES. Maximal size of possible extension queue 370. Compared 53258 event pairs, 1997 based on Foata normal form. 84/11158 useless extension candidates. Maximal degree in co-relation 36144. Up to 4843 conditions per place. [2023-01-27 18:05:21,862 INFO L137 encePairwiseOnDemand]: 228/238 looper letters, 60 selfloop transitions, 18 changer transitions 0/78 dead transitions. [2023-01-27 18:05:21,862 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 78 transitions, 617 flow [2023-01-27 18:05:21,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-27 18:05:21,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-27 18:05:21,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 466 transitions. [2023-01-27 18:05:21,864 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4894957983193277 [2023-01-27 18:05:21,864 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 466 transitions. [2023-01-27 18:05:21,864 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 466 transitions. [2023-01-27 18:05:21,864 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:05:21,864 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 466 transitions. [2023-01-27 18:05:21,865 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 116.5) internal successors, (466), 4 states have internal predecessors, (466), 0 states have call successors, (0), 0 states 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:05:21,867 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 238.0) internal successors, (1190), 5 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states 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:05:21,867 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 238.0) internal successors, (1190), 5 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states 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:05:21,867 INFO L175 Difference]: Start difference. First operand has 47 places, 46 transitions, 285 flow. Second operand 4 states and 466 transitions. [2023-01-27 18:05:21,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 78 transitions, 617 flow [2023-01-27 18:05:21,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 78 transitions, 617 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-01-27 18:05:21,915 INFO L231 Difference]: Finished difference. Result has 53 places, 57 transitions, 491 flow [2023-01-27 18:05:21,915 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=285, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=491, PETRI_PLACES=53, PETRI_TRANSITIONS=57} [2023-01-27 18:05:21,915 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 12 predicate places. [2023-01-27 18:05:21,915 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 57 transitions, 491 flow [2023-01-27 18:05:21,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 106.5) internal successors, (426), 4 states have internal predecessors, (426), 0 states have call successors, (0), 0 states 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:05:21,916 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:05:21,916 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:05:21,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-27 18:05:21,916 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:05:21,916 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:05:21,916 INFO L85 PathProgramCache]: Analyzing trace with hash -2064516572, now seen corresponding path program 1 times [2023-01-27 18:05:21,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:05:21,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710891424] [2023-01-27 18:05:21,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:05:21,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:05:21,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:05:22,166 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:05:22,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:05:22,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710891424] [2023-01-27 18:05:22,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710891424] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:05:22,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:05:22,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 18:05:22,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451282772] [2023-01-27 18:05:22,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:05:22,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 18:05:22,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:05:22,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 18:05:22,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-27 18:05:22,173 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 238 [2023-01-27 18:05:22,174 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 57 transitions, 491 flow. Second operand has 4 states, 4 states have (on average 109.75) internal successors, (439), 4 states have internal predecessors, (439), 0 states have call successors, (0), 0 states 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:05:22,174 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:05:22,174 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 238 [2023-01-27 18:05:22,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:05:22,925 INFO L130 PetriNetUnfolder]: 5404/8041 cut-off events. [2023-01-27 18:05:22,925 INFO L131 PetriNetUnfolder]: For 22101/23573 co-relation queries the response was YES. [2023-01-27 18:05:22,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27084 conditions, 8041 events. 5404/8041 cut-off events. For 22101/23573 co-relation queries the response was YES. Maximal size of possible extension queue 542. Compared 48472 event pairs, 818 based on Foata normal form. 1013/8687 useless extension candidates. Maximal degree in co-relation 27061. Up to 5080 conditions per place. [2023-01-27 18:05:22,974 INFO L137 encePairwiseOnDemand]: 231/238 looper letters, 102 selfloop transitions, 10 changer transitions 0/133 dead transitions. [2023-01-27 18:05:22,974 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 133 transitions, 1275 flow [2023-01-27 18:05:22,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 18:05:22,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 18:05:22,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 594 transitions. [2023-01-27 18:05:22,976 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4991596638655462 [2023-01-27 18:05:22,976 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 594 transitions. [2023-01-27 18:05:22,976 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 594 transitions. [2023-01-27 18:05:22,976 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:05:22,976 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 594 transitions. [2023-01-27 18:05:22,977 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 118.8) internal successors, (594), 5 states have internal predecessors, (594), 0 states have call successors, (0), 0 states 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:05:22,979 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 238.0) internal successors, (1428), 6 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states 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:05:22,979 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 238.0) internal successors, (1428), 6 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states 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:05:22,979 INFO L175 Difference]: Start difference. First operand has 53 places, 57 transitions, 491 flow. Second operand 5 states and 594 transitions. [2023-01-27 18:05:22,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 133 transitions, 1275 flow [2023-01-27 18:05:23,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 133 transitions, 1260 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-27 18:05:23,005 INFO L231 Difference]: Finished difference. Result has 59 places, 66 transitions, 561 flow [2023-01-27 18:05:23,005 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=486, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=561, PETRI_PLACES=59, PETRI_TRANSITIONS=66} [2023-01-27 18:05:23,006 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 18 predicate places. [2023-01-27 18:05:23,006 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 66 transitions, 561 flow [2023-01-27 18:05:23,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.75) internal successors, (439), 4 states have internal predecessors, (439), 0 states have call successors, (0), 0 states 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:05:23,006 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:05:23,006 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:05:23,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-27 18:05:23,007 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:05:23,007 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:05:23,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1718917561, now seen corresponding path program 1 times [2023-01-27 18:05:23,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:05:23,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957035593] [2023-01-27 18:05:23,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:05:23,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:05:23,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:05:23,161 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:05:23,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:05:23,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957035593] [2023-01-27 18:05:23,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957035593] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:05:23,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:05:23,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 18:05:23,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7058707] [2023-01-27 18:05:23,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:05:23,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 18:05:23,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:05:23,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 18:05:23,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-27 18:05:23,163 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 238 [2023-01-27 18:05:23,164 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 66 transitions, 561 flow. Second operand has 4 states, 4 states have (on average 107.5) internal successors, (430), 4 states have internal predecessors, (430), 0 states have call successors, (0), 0 states 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:05:23,164 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:05:23,164 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 238 [2023-01-27 18:05:23,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:05:24,183 INFO L130 PetriNetUnfolder]: 9878/14309 cut-off events. [2023-01-27 18:05:24,183 INFO L131 PetriNetUnfolder]: For 53092/53092 co-relation queries the response was YES. [2023-01-27 18:05:24,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63543 conditions, 14309 events. 9878/14309 cut-off events. For 53092/53092 co-relation queries the response was YES. Maximal size of possible extension queue 571. Compared 81926 event pairs, 2423 based on Foata normal form. 78/14387 useless extension candidates. Maximal degree in co-relation 63516. Up to 6109 conditions per place. [2023-01-27 18:05:24,254 INFO L137 encePairwiseOnDemand]: 228/238 looper letters, 78 selfloop transitions, 30 changer transitions 22/130 dead transitions. [2023-01-27 18:05:24,254 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 130 transitions, 1235 flow [2023-01-27 18:05:24,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-27 18:05:24,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-27 18:05:24,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 480 transitions. [2023-01-27 18:05:24,256 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5042016806722689 [2023-01-27 18:05:24,256 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 480 transitions. [2023-01-27 18:05:24,256 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 480 transitions. [2023-01-27 18:05:24,256 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:05:24,256 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 480 transitions. [2023-01-27 18:05:24,257 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 120.0) internal successors, (480), 4 states have internal predecessors, (480), 0 states have call successors, (0), 0 states 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:05:24,258 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 238.0) internal successors, (1190), 5 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states 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:05:24,258 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 238.0) internal successors, (1190), 5 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states 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:05:24,258 INFO L175 Difference]: Start difference. First operand has 59 places, 66 transitions, 561 flow. Second operand 4 states and 480 transitions. [2023-01-27 18:05:24,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 130 transitions, 1235 flow [2023-01-27 18:05:24,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 130 transitions, 1222 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-27 18:05:24,390 INFO L231 Difference]: Finished difference. Result has 64 places, 69 transitions, 776 flow [2023-01-27 18:05:24,390 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=556, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=776, PETRI_PLACES=64, PETRI_TRANSITIONS=69} [2023-01-27 18:05:24,391 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 23 predicate places. [2023-01-27 18:05:24,391 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 69 transitions, 776 flow [2023-01-27 18:05:24,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 107.5) internal successors, (430), 4 states have internal predecessors, (430), 0 states have call successors, (0), 0 states 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:05:24,391 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:05:24,391 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:05:24,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-27 18:05:24,391 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:05:24,391 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:05:24,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1950956631, now seen corresponding path program 1 times [2023-01-27 18:05:24,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:05:24,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025208048] [2023-01-27 18:05:24,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:05:24,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:05:24,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:05:24,578 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:05:24,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:05:24,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025208048] [2023-01-27 18:05:24,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025208048] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:05:24,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:05:24,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 18:05:24,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517902271] [2023-01-27 18:05:24,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:05:24,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 18:05:24,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:05:24,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 18:05:24,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-27 18:05:24,580 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 238 [2023-01-27 18:05:24,580 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 69 transitions, 776 flow. Second operand has 5 states, 5 states have (on average 109.2) internal successors, (546), 5 states have internal predecessors, (546), 0 states have call successors, (0), 0 states 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:05:24,581 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:05:24,581 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 238 [2023-01-27 18:05:24,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:05:25,163 INFO L130 PetriNetUnfolder]: 3960/6269 cut-off events. [2023-01-27 18:05:25,163 INFO L131 PetriNetUnfolder]: For 26318/27534 co-relation queries the response was YES. [2023-01-27 18:05:25,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27112 conditions, 6269 events. 3960/6269 cut-off events. For 26318/27534 co-relation queries the response was YES. Maximal size of possible extension queue 409. Compared 39923 event pairs, 352 based on Foata normal form. 1002/7042 useless extension candidates. Maximal degree in co-relation 27081. Up to 2695 conditions per place. [2023-01-27 18:05:25,193 INFO L137 encePairwiseOnDemand]: 231/238 looper letters, 137 selfloop transitions, 14 changer transitions 12/186 dead transitions. [2023-01-27 18:05:25,194 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 186 transitions, 2338 flow [2023-01-27 18:05:25,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-27 18:05:25,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-27 18:05:25,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 715 transitions. [2023-01-27 18:05:25,195 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5007002801120448 [2023-01-27 18:05:25,196 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 715 transitions. [2023-01-27 18:05:25,196 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 715 transitions. [2023-01-27 18:05:25,196 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:05:25,196 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 715 transitions. [2023-01-27 18:05:25,197 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 119.16666666666667) internal successors, (715), 6 states have internal predecessors, (715), 0 states have call successors, (0), 0 states 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:05:25,198 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 238.0) internal successors, (1666), 7 states have internal predecessors, (1666), 0 states have call successors, (0), 0 states 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:05:25,199 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 238.0) internal successors, (1666), 7 states have internal predecessors, (1666), 0 states have call successors, (0), 0 states 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:05:25,199 INFO L175 Difference]: Start difference. First operand has 64 places, 69 transitions, 776 flow. Second operand 6 states and 715 transitions. [2023-01-27 18:05:25,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 186 transitions, 2338 flow [2023-01-27 18:05:25,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 186 transitions, 2322 flow, removed 8 selfloop flow, removed 1 redundant places. [2023-01-27 18:05:25,246 INFO L231 Difference]: Finished difference. Result has 69 places, 78 transitions, 888 flow [2023-01-27 18:05:25,246 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=768, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=888, PETRI_PLACES=69, PETRI_TRANSITIONS=78} [2023-01-27 18:05:25,246 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 28 predicate places. [2023-01-27 18:05:25,247 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 78 transitions, 888 flow [2023-01-27 18:05:25,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.2) internal successors, (546), 5 states have internal predecessors, (546), 0 states have call successors, (0), 0 states 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:05:25,247 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:05:25,247 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:05:25,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-01-27 18:05:25,247 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:05:25,247 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:05:25,247 INFO L85 PathProgramCache]: Analyzing trace with hash 9547708, now seen corresponding path program 1 times [2023-01-27 18:05:25,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:05:25,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169404001] [2023-01-27 18:05:25,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:05:25,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:05:25,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:05:25,410 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:05:25,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:05:25,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169404001] [2023-01-27 18:05:25,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169404001] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:05:25,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:05:25,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 18:05:25,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549025486] [2023-01-27 18:05:25,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:05:25,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 18:05:25,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:05:25,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 18:05:25,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-01-27 18:05:25,412 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 238 [2023-01-27 18:05:25,412 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 78 transitions, 888 flow. Second operand has 5 states, 5 states have (on average 107.2) internal successors, (536), 5 states have internal predecessors, (536), 0 states have call successors, (0), 0 states 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:05:25,412 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:05:25,412 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 238 [2023-01-27 18:05:25,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:05:26,657 INFO L130 PetriNetUnfolder]: 8020/12448 cut-off events. [2023-01-27 18:05:26,658 INFO L131 PetriNetUnfolder]: For 71632/71632 co-relation queries the response was YES. [2023-01-27 18:05:26,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64539 conditions, 12448 events. 8020/12448 cut-off events. For 71632/71632 co-relation queries the response was YES. Maximal size of possible extension queue 563. Compared 78821 event pairs, 1604 based on Foata normal form. 78/12526 useless extension candidates. Maximal degree in co-relation 64504. Up to 5505 conditions per place. [2023-01-27 18:05:26,731 INFO L137 encePairwiseOnDemand]: 228/238 looper letters, 77 selfloop transitions, 30 changer transitions 69/176 dead transitions. [2023-01-27 18:05:26,731 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 176 transitions, 2047 flow [2023-01-27 18:05:26,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 18:05:26,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 18:05:26,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 598 transitions. [2023-01-27 18:05:26,733 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5025210084033613 [2023-01-27 18:05:26,734 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 598 transitions. [2023-01-27 18:05:26,734 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 598 transitions. [2023-01-27 18:05:26,734 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:05:26,734 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 598 transitions. [2023-01-27 18:05:26,735 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 119.6) internal successors, (598), 5 states have internal predecessors, (598), 0 states have call successors, (0), 0 states 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:05:26,736 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 238.0) internal successors, (1428), 6 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states 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:05:26,737 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 238.0) internal successors, (1428), 6 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states 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:05:26,737 INFO L175 Difference]: Start difference. First operand has 69 places, 78 transitions, 888 flow. Second operand 5 states and 598 transitions. [2023-01-27 18:05:26,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 176 transitions, 2047 flow [2023-01-27 18:05:27,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 176 transitions, 1877 flow, removed 68 selfloop flow, removed 2 redundant places. [2023-01-27 18:05:27,254 INFO L231 Difference]: Finished difference. Result has 73 places, 68 transitions, 790 flow [2023-01-27 18:05:27,255 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=844, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=790, PETRI_PLACES=73, PETRI_TRANSITIONS=68} [2023-01-27 18:05:27,255 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 32 predicate places. [2023-01-27 18:05:27,255 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 68 transitions, 790 flow [2023-01-27 18:05:27,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 107.2) internal successors, (536), 5 states have internal predecessors, (536), 0 states have call successors, (0), 0 states 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:05:27,256 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:05:27,256 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:05:27,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-27 18:05:27,256 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:05:27,256 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:05:27,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1348992873, now seen corresponding path program 1 times [2023-01-27 18:05:27,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:05:27,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709164412] [2023-01-27 18:05:27,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:05:27,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:05:27,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:05:27,451 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:05:27,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:05:27,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709164412] [2023-01-27 18:05:27,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709164412] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:05:27,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:05:27,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-27 18:05:27,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93896443] [2023-01-27 18:05:27,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:05:27,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-27 18:05:27,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:05:27,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-27 18:05:27,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-01-27 18:05:27,454 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 238 [2023-01-27 18:05:27,454 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 68 transitions, 790 flow. Second operand has 6 states, 6 states have (on average 109.0) internal successors, (654), 6 states have internal predecessors, (654), 0 states have call successors, (0), 0 states 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:05:27,454 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:05:27,454 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 238 [2023-01-27 18:05:27,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:05:27,881 INFO L130 PetriNetUnfolder]: 2096/3598 cut-off events. [2023-01-27 18:05:27,881 INFO L131 PetriNetUnfolder]: For 16867/17347 co-relation queries the response was YES. [2023-01-27 18:05:27,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16305 conditions, 3598 events. 2096/3598 cut-off events. For 16867/17347 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 22765 event pairs, 215 based on Foata normal form. 520/3997 useless extension candidates. Maximal degree in co-relation 16268. Up to 1241 conditions per place. [2023-01-27 18:05:27,900 INFO L137 encePairwiseOnDemand]: 231/238 looper letters, 118 selfloop transitions, 18 changer transitions 22/176 dead transitions. [2023-01-27 18:05:27,901 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 176 transitions, 2222 flow [2023-01-27 18:05:27,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 18:05:27,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 18:05:27,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 834 transitions. [2023-01-27 18:05:27,903 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5006002400960384 [2023-01-27 18:05:27,903 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 834 transitions. [2023-01-27 18:05:27,903 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 834 transitions. [2023-01-27 18:05:27,903 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:05:27,903 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 834 transitions. [2023-01-27 18:05:27,905 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 119.14285714285714) internal successors, (834), 7 states have internal predecessors, (834), 0 states have call successors, (0), 0 states 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:05:27,907 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 238.0) internal successors, (1904), 8 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states 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:05:27,907 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 238.0) internal successors, (1904), 8 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states 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:05:27,907 INFO L175 Difference]: Start difference. First operand has 73 places, 68 transitions, 790 flow. Second operand 7 states and 834 transitions. [2023-01-27 18:05:27,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 176 transitions, 2222 flow [2023-01-27 18:05:27,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 176 transitions, 2052 flow, removed 20 selfloop flow, removed 5 redundant places. [2023-01-27 18:05:27,925 INFO L231 Difference]: Finished difference. Result has 74 places, 76 transitions, 852 flow [2023-01-27 18:05:27,925 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=719, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=852, PETRI_PLACES=74, PETRI_TRANSITIONS=76} [2023-01-27 18:05:27,926 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 33 predicate places. [2023-01-27 18:05:27,926 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 76 transitions, 852 flow [2023-01-27 18:05:27,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 109.0) internal successors, (654), 6 states have internal predecessors, (654), 0 states have call successors, (0), 0 states 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:05:27,926 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:05:27,926 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:05:27,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-01-27 18:05:27,926 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:05:27,927 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:05:27,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1326425502, now seen corresponding path program 1 times [2023-01-27 18:05:27,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:05:27,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603298540] [2023-01-27 18:05:27,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:05:27,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:05:27,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:05:28,103 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:05:28,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:05:28,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603298540] [2023-01-27 18:05:28,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603298540] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:05:28,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:05:28,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-27 18:05:28,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350592881] [2023-01-27 18:05:28,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:05:28,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-27 18:05:28,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:05:28,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-27 18:05:28,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-01-27 18:05:28,105 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 238 [2023-01-27 18:05:28,105 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 76 transitions, 852 flow. Second operand has 7 states, 7 states have (on average 108.85714285714286) internal successors, (762), 7 states have internal predecessors, (762), 0 states have call successors, (0), 0 states 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:05:28,105 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:05:28,105 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 238 [2023-01-27 18:05:28,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:05:28,507 INFO L130 PetriNetUnfolder]: 2012/3443 cut-off events. [2023-01-27 18:05:28,507 INFO L131 PetriNetUnfolder]: For 13587/13921 co-relation queries the response was YES. [2023-01-27 18:05:28,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17065 conditions, 3443 events. 2012/3443 cut-off events. For 13587/13921 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 21762 event pairs, 201 based on Foata normal form. 233/3553 useless extension candidates. Maximal degree in co-relation 17028. Up to 1187 conditions per place. [2023-01-27 18:05:28,521 INFO L137 encePairwiseOnDemand]: 231/238 looper letters, 76 selfloop transitions, 22 changer transitions 70/176 dead transitions. [2023-01-27 18:05:28,522 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 176 transitions, 2133 flow [2023-01-27 18:05:28,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-27 18:05:28,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-01-27 18:05:28,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1047 transitions. [2023-01-27 18:05:28,524 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4887955182072829 [2023-01-27 18:05:28,524 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1047 transitions. [2023-01-27 18:05:28,524 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1047 transitions. [2023-01-27 18:05:28,525 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:05:28,525 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1047 transitions. [2023-01-27 18:05:28,526 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 116.33333333333333) internal successors, (1047), 9 states have internal predecessors, (1047), 0 states have call successors, (0), 0 states 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:05:28,528 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 238.0) internal successors, (2380), 10 states have internal predecessors, (2380), 0 states have call successors, (0), 0 states 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:05:28,529 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 238.0) internal successors, (2380), 10 states have internal predecessors, (2380), 0 states have call successors, (0), 0 states 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:05:28,529 INFO L175 Difference]: Start difference. First operand has 74 places, 76 transitions, 852 flow. Second operand 9 states and 1047 transitions. [2023-01-27 18:05:28,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 176 transitions, 2133 flow [2023-01-27 18:05:28,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 176 transitions, 2040 flow, removed 29 selfloop flow, removed 4 redundant places. [2023-01-27 18:05:28,622 INFO L231 Difference]: Finished difference. Result has 81 places, 54 transitions, 505 flow [2023-01-27 18:05:28,622 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=771, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=505, PETRI_PLACES=81, PETRI_TRANSITIONS=54} [2023-01-27 18:05:28,623 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 40 predicate places. [2023-01-27 18:05:28,623 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 54 transitions, 505 flow [2023-01-27 18:05:28,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 108.85714285714286) internal successors, (762), 7 states have internal predecessors, (762), 0 states have call successors, (0), 0 states 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:05:28,623 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:05:28,623 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:05:28,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-01-27 18:05:28,623 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:05:28,624 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:05:28,624 INFO L85 PathProgramCache]: Analyzing trace with hash 879309157, now seen corresponding path program 1 times [2023-01-27 18:05:28,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:05:28,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227720470] [2023-01-27 18:05:28,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:05:28,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:05:28,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:05:28,801 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:05:28,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:05:28,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227720470] [2023-01-27 18:05:28,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227720470] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:05:28,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:05:28,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 18:05:28,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114437890] [2023-01-27 18:05:28,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:05:28,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 18:05:28,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:05:28,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 18:05:28,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-27 18:05:28,803 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 238 [2023-01-27 18:05:28,804 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 54 transitions, 505 flow. Second operand has 4 states, 4 states have (on average 107.5) internal successors, (430), 4 states have internal predecessors, (430), 0 states have call successors, (0), 0 states 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:05:28,804 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:05:28,804 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 238 [2023-01-27 18:05:28,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:05:28,947 INFO L130 PetriNetUnfolder]: 590/1016 cut-off events. [2023-01-27 18:05:28,947 INFO L131 PetriNetUnfolder]: For 4181/4181 co-relation queries the response was YES. [2023-01-27 18:05:28,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4988 conditions, 1016 events. 590/1016 cut-off events. For 4181/4181 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 4320 event pairs, 77 based on Foata normal form. 1/1017 useless extension candidates. Maximal degree in co-relation 4949. Up to 604 conditions per place. [2023-01-27 18:05:28,952 INFO L137 encePairwiseOnDemand]: 227/238 looper letters, 63 selfloop transitions, 19 changer transitions 19/101 dead transitions. [2023-01-27 18:05:28,952 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 101 transitions, 1052 flow [2023-01-27 18:05:28,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 18:05:28,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 18:05:28,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 564 transitions. [2023-01-27 18:05:28,954 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47394957983193275 [2023-01-27 18:05:28,954 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 564 transitions. [2023-01-27 18:05:28,954 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 564 transitions. [2023-01-27 18:05:28,954 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:05:28,954 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 564 transitions. [2023-01-27 18:05:28,955 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 112.8) internal successors, (564), 5 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:05:28,957 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 238.0) internal successors, (1428), 6 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states 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:05:28,957 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 238.0) internal successors, (1428), 6 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states 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:05:28,957 INFO L175 Difference]: Start difference. First operand has 81 places, 54 transitions, 505 flow. Second operand 5 states and 564 transitions. [2023-01-27 18:05:28,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 101 transitions, 1052 flow [2023-01-27 18:05:28,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 101 transitions, 811 flow, removed 62 selfloop flow, removed 17 redundant places. [2023-01-27 18:05:28,966 INFO L231 Difference]: Finished difference. Result has 68 places, 58 transitions, 481 flow [2023-01-27 18:05:28,967 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=363, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=481, PETRI_PLACES=68, PETRI_TRANSITIONS=58} [2023-01-27 18:05:28,967 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 27 predicate places. [2023-01-27 18:05:28,967 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 58 transitions, 481 flow [2023-01-27 18:05:28,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 107.5) internal successors, (430), 4 states have internal predecessors, (430), 0 states have call successors, (0), 0 states 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:05:28,967 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:05:28,967 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:05:28,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-01-27 18:05:28,968 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:05:28,968 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:05:28,968 INFO L85 PathProgramCache]: Analyzing trace with hash 705819925, now seen corresponding path program 2 times [2023-01-27 18:05:28,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:05:28,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716255755] [2023-01-27 18:05:28,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:05:28,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:05:28,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:05:29,133 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:05:29,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:05:29,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716255755] [2023-01-27 18:05:29,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716255755] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:05:29,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:05:29,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 18:05:29,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127645770] [2023-01-27 18:05:29,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:05:29,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 18:05:29,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:05:29,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 18:05:29,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-27 18:05:29,135 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 238 [2023-01-27 18:05:29,135 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 58 transitions, 481 flow. Second operand has 5 states, 5 states have (on average 106.2) internal successors, (531), 5 states have internal predecessors, (531), 0 states have call successors, (0), 0 states 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:05:29,135 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:05:29,135 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 238 [2023-01-27 18:05:29,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:05:29,289 INFO L130 PetriNetUnfolder]: 574/971 cut-off events. [2023-01-27 18:05:29,289 INFO L131 PetriNetUnfolder]: For 2991/2991 co-relation queries the response was YES. [2023-01-27 18:05:29,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4378 conditions, 971 events. 574/971 cut-off events. For 2991/2991 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3983 event pairs, 63 based on Foata normal form. 1/972 useless extension candidates. Maximal degree in co-relation 4349. Up to 425 conditions per place. [2023-01-27 18:05:29,293 INFO L137 encePairwiseOnDemand]: 229/238 looper letters, 43 selfloop transitions, 7 changer transitions 56/106 dead transitions. [2023-01-27 18:05:29,293 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 106 transitions, 962 flow [2023-01-27 18:05:29,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-27 18:05:29,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-27 18:05:29,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 672 transitions. [2023-01-27 18:05:29,295 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47058823529411764 [2023-01-27 18:05:29,295 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 672 transitions. [2023-01-27 18:05:29,295 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 672 transitions. [2023-01-27 18:05:29,296 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:05:29,296 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 672 transitions. [2023-01-27 18:05:29,297 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 112.0) internal successors, (672), 6 states have internal predecessors, (672), 0 states have call successors, (0), 0 states 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:05:29,298 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 238.0) internal successors, (1666), 7 states have internal predecessors, (1666), 0 states have call successors, (0), 0 states 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:05:29,298 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 238.0) internal successors, (1666), 7 states have internal predecessors, (1666), 0 states have call successors, (0), 0 states 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:05:29,299 INFO L175 Difference]: Start difference. First operand has 68 places, 58 transitions, 481 flow. Second operand 6 states and 672 transitions. [2023-01-27 18:05:29,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 106 transitions, 962 flow [2023-01-27 18:05:29,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 106 transitions, 952 flow, removed 5 selfloop flow, removed 2 redundant places. [2023-01-27 18:05:29,306 INFO L231 Difference]: Finished difference. Result has 69 places, 38 transitions, 265 flow [2023-01-27 18:05:29,306 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=475, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=265, PETRI_PLACES=69, PETRI_TRANSITIONS=38} [2023-01-27 18:05:29,306 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 28 predicate places. [2023-01-27 18:05:29,306 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 38 transitions, 265 flow [2023-01-27 18:05:29,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 106.2) internal successors, (531), 5 states have internal predecessors, (531), 0 states have call successors, (0), 0 states 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:05:29,307 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:05:29,307 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:05:29,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-01-27 18:05:29,307 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:05:29,307 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:05:29,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1082682631, now seen corresponding path program 3 times [2023-01-27 18:05:29,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:05:29,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379677677] [2023-01-27 18:05:29,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:05:29,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:05:29,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:05:29,925 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:05:29,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:05:29,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379677677] [2023-01-27 18:05:29,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379677677] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:05:29,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:05:29,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-27 18:05:29,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486010076] [2023-01-27 18:05:29,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:05:29,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-27 18:05:29,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:05:29,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-27 18:05:29,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-01-27 18:05:29,928 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 238 [2023-01-27 18:05:29,928 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 38 transitions, 265 flow. Second operand has 7 states, 7 states have (on average 109.14285714285714) internal successors, (764), 7 states have internal predecessors, (764), 0 states have call successors, (0), 0 states 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:05:29,928 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:05:29,928 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 238 [2023-01-27 18:05:29,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:05:30,052 INFO L130 PetriNetUnfolder]: 108/222 cut-off events. [2023-01-27 18:05:30,052 INFO L131 PetriNetUnfolder]: For 926/947 co-relation queries the response was YES. [2023-01-27 18:05:30,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1060 conditions, 222 events. 108/222 cut-off events. For 926/947 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 748 event pairs, 12 based on Foata normal form. 2/220 useless extension candidates. Maximal degree in co-relation 1038. Up to 76 conditions per place. [2023-01-27 18:05:30,053 INFO L137 encePairwiseOnDemand]: 231/238 looper letters, 34 selfloop transitions, 4 changer transitions 32/74 dead transitions. [2023-01-27 18:05:30,053 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 74 transitions, 637 flow [2023-01-27 18:05:30,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-27 18:05:30,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-01-27 18:05:30,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 887 transitions. [2023-01-27 18:05:30,055 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46586134453781514 [2023-01-27 18:05:30,055 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 887 transitions. [2023-01-27 18:05:30,055 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 887 transitions. [2023-01-27 18:05:30,056 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:05:30,056 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 887 transitions. [2023-01-27 18:05:30,057 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 110.875) internal successors, (887), 8 states have internal predecessors, (887), 0 states have call successors, (0), 0 states 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:05:30,059 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 238.0) internal successors, (2142), 9 states have internal predecessors, (2142), 0 states have call successors, (0), 0 states 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:05:30,059 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 238.0) internal successors, (2142), 9 states have internal predecessors, (2142), 0 states have call successors, (0), 0 states 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:05:30,060 INFO L175 Difference]: Start difference. First operand has 69 places, 38 transitions, 265 flow. Second operand 8 states and 887 transitions. [2023-01-27 18:05:30,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 74 transitions, 637 flow [2023-01-27 18:05:30,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 74 transitions, 502 flow, removed 8 selfloop flow, removed 22 redundant places. [2023-01-27 18:05:30,062 INFO L231 Difference]: Finished difference. Result has 56 places, 38 transitions, 184 flow [2023-01-27 18:05:30,062 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=184, PETRI_PLACES=56, PETRI_TRANSITIONS=38} [2023-01-27 18:05:30,063 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 15 predicate places. [2023-01-27 18:05:30,063 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 38 transitions, 184 flow [2023-01-27 18:05:30,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 109.14285714285714) internal successors, (764), 7 states have internal predecessors, (764), 0 states have call successors, (0), 0 states 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:05:30,063 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:05:30,063 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:05:30,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-01-27 18:05:30,063 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:05:30,064 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:05:30,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1683182245, now seen corresponding path program 4 times [2023-01-27 18:05:30,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:05:30,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813030912] [2023-01-27 18:05:30,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:05:30,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:05:30,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-27 18:05:30,095 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-27 18:05:30,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-27 18:05:30,164 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-27 18:05:30,165 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-27 18:05:30,165 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-01-27 18:05:30,166 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-01-27 18:05:30,167 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-01-27 18:05:30,167 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-01-27 18:05:30,167 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-01-27 18:05:30,167 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-01-27 18:05:30,167 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-01-27 18:05:30,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-01-27 18:05:30,167 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:05:30,171 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-27 18:05:30,171 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-27 18:05:30,239 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.01 06:05:30 BasicIcfg [2023-01-27 18:05:30,240 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-27 18:05:30,240 INFO L158 Benchmark]: Toolchain (without parser) took 18130.23ms. Allocated memory was 323.0MB in the beginning and 2.1GB in the end (delta: 1.8GB). Free memory was 290.9MB in the beginning and 1.0GB in the end (delta: -750.4MB). Peak memory consumption was 1.0GB. Max. memory is 16.0GB. [2023-01-27 18:05:30,240 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 255.9MB. Free memory is still 213.1MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-27 18:05:30,240 INFO L158 Benchmark]: CACSL2BoogieTranslator took 470.57ms. Allocated memory is still 323.0MB. Free memory was 290.9MB in the beginning and 266.7MB in the end (delta: 24.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. [2023-01-27 18:05:30,240 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.13ms. Allocated memory is still 323.0MB. Free memory was 266.7MB in the beginning and 263.9MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-27 18:05:30,246 INFO L158 Benchmark]: Boogie Preprocessor took 32.02ms. Allocated memory is still 323.0MB. Free memory was 263.9MB in the beginning and 261.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-27 18:05:30,246 INFO L158 Benchmark]: RCFGBuilder took 601.03ms. Allocated memory is still 323.0MB. Free memory was 261.8MB in the beginning and 287.9MB in the end (delta: -26.1MB). Peak memory consumption was 38.5MB. Max. memory is 16.0GB. [2023-01-27 18:05:30,246 INFO L158 Benchmark]: TraceAbstraction took 16979.30ms. Allocated memory was 323.0MB in the beginning and 2.1GB in the end (delta: 1.8GB). Free memory was 286.7MB in the beginning and 1.0GB in the end (delta: -754.6MB). Peak memory consumption was 1.0GB. Max. memory is 16.0GB. [2023-01-27 18:05:30,248 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 255.9MB. Free memory is still 213.1MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 470.57ms. Allocated memory is still 323.0MB. Free memory was 290.9MB in the beginning and 266.7MB in the end (delta: 24.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 39.13ms. Allocated memory is still 323.0MB. Free memory was 266.7MB in the beginning and 263.9MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 32.02ms. Allocated memory is still 323.0MB. Free memory was 263.9MB in the beginning and 261.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 601.03ms. Allocated memory is still 323.0MB. Free memory was 261.8MB in the beginning and 287.9MB in the end (delta: -26.1MB). Peak memory consumption was 38.5MB. Max. memory is 16.0GB. * TraceAbstraction took 16979.30ms. Allocated memory was 323.0MB in the beginning and 2.1GB in the end (delta: 1.8GB). Free memory was 286.7MB in the beginning and 1.0GB in the end (delta: -754.6MB). Peak memory consumption was 1.0GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.1s, 136 PlacesBefore, 41 PlacesAfterwards, 125 TransitionsBefore, 29 TransitionsAfterwards, 2836 CoEnabledTransitionPairs, 7 FixpointIterations, 43 TrivialSequentialCompositions, 56 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 109 TotalNumberOfCompositions, 7428 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3216, independent: 2998, independent conditional: 0, independent unconditional: 2998, dependent: 218, dependent conditional: 0, dependent unconditional: 218, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1550, independent: 1503, independent conditional: 0, independent unconditional: 1503, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3216, independent: 1495, independent conditional: 0, independent unconditional: 1495, dependent: 171, dependent conditional: 0, dependent unconditional: 171, unknown: 1550, unknown conditional: 0, unknown unconditional: 1550] , Statistics on independence cache: Total cache size (in pairs): 147, Positive cache size: 125, Positive conditional cache size: 0, Positive unconditional cache size: 125, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p2_EAX = 0; [L714] 0 int __unbuffered_p2_EBX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L728] 0 int z = 0; [L729] 0 _Bool z$flush_delayed; [L730] 0 int z$mem_tmp; [L731] 0 _Bool z$r_buff0_thd0; [L732] 0 _Bool z$r_buff0_thd1; [L733] 0 _Bool z$r_buff0_thd2; [L734] 0 _Bool z$r_buff0_thd3; [L735] 0 _Bool z$r_buff0_thd4; [L736] 0 _Bool z$r_buff1_thd0; [L737] 0 _Bool z$r_buff1_thd1; [L738] 0 _Bool z$r_buff1_thd2; [L739] 0 _Bool z$r_buff1_thd3; [L740] 0 _Bool z$r_buff1_thd4; [L741] 0 _Bool z$read_delayed; [L742] 0 int *z$read_delayed_var; [L743] 0 int z$w_buff0; [L744] 0 _Bool z$w_buff0_used; [L745] 0 int z$w_buff1; [L746] 0 _Bool z$w_buff1_used; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L867] 0 pthread_t t213; [L868] FCALL, FORK 0 pthread_create(&t213, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t213, ((void *)0), P0, ((void *)0))=-1, t213={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L869] 0 pthread_t t214; [L870] FCALL, FORK 0 pthread_create(&t214, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t214, ((void *)0), P1, ((void *)0))=0, t213={5:0}, t214={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L871] 0 pthread_t t215; [L872] FCALL, FORK 0 pthread_create(&t215, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t215, ((void *)0), P2, ((void *)0))=1, t213={5:0}, t214={6:0}, t215={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L873] 0 pthread_t t216; [L874] FCALL, FORK 0 pthread_create(&t216, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t216, ((void *)0), P3, ((void *)0))=2, t213={5:0}, t214={6:0}, t215={7:0}, t216={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L813] 4 z$w_buff1 = z$w_buff0 [L814] 4 z$w_buff0 = 1 [L815] 4 z$w_buff1_used = z$w_buff0_used [L816] 4 z$w_buff0_used = (_Bool)1 [L817] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L817] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L818] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L819] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L820] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L821] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L822] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L823] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L826] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L827] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L828] 4 z$flush_delayed = weak$$choice2 [L829] 4 z$mem_tmp = z [L830] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L831] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L832] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L833] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L834] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L835] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L836] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L837] 4 __unbuffered_p3_EAX = z [L838] 4 z = z$flush_delayed ? z$mem_tmp : z [L839] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L842] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L752] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L767] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L770] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L782] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 1 return 0; [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 2 return 0; [L785] 3 __unbuffered_p2_EAX = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L788] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L789] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L790] 3 z$flush_delayed = weak$$choice2 [L791] 3 z$mem_tmp = z [L792] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L793] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L794] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L795] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L796] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L797] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L798] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L799] 3 __unbuffered_p2_EBX = z [L800] 3 z = z$flush_delayed ? z$mem_tmp : z [L801] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L845] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L846] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L847] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L848] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L849] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L806] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L808] 3 return 0; [L852] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L854] 4 return 0; [L876] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L878] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L878] RET 0 assume_abort_if_not(main$tmp_guard0) [L880] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L881] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L882] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L883] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L884] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t213={5:0}, t214={6:0}, t215={7:0}, t216={3:0}, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L887] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L889] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 874]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 870]: 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: 868]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 872]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 164 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 16.8s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 10.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 477 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 477 mSDsluCounter, 73 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 24 mSDsCounter, 49 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1268 IncrementalHoareTripleChecker+Invalid, 1317 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 49 mSolverCounterUnsat, 49 mSDtfsCounter, 1268 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 59 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=888occurred in iteration=8, InterpolantAutomatonStates: 73, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 279 NumberOfCodeBlocks, 279 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 239 ConstructedInterpolants, 0 QuantifiedInterpolants, 1620 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-01-27 18:05:30,266 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...