/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/safe004_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-27 18:16:56,525 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-27 18:16:56,527 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-27 18:16:56,564 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-27 18:16:56,564 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-27 18:16:56,566 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-27 18:16:56,569 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-27 18:16:56,571 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-27 18:16:56,573 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-27 18:16:56,577 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-27 18:16:56,578 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-27 18:16:56,579 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-27 18:16:56,580 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-27 18:16:56,582 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-27 18:16:56,583 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-27 18:16:56,584 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-27 18:16:56,585 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-27 18:16:56,585 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-27 18:16:56,587 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-27 18:16:56,591 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-27 18:16:56,593 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-27 18:16:56,594 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-27 18:16:56,594 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-27 18:16:56,595 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-27 18:16:56,603 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-27 18:16:56,603 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-27 18:16:56,604 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-27 18:16:56,605 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-27 18:16:56,606 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-27 18:16:56,606 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-27 18:16:56,606 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-27 18:16:56,607 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-27 18:16:56,608 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-27 18:16:56,609 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-27 18:16:56,609 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-27 18:16:56,609 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-27 18:16:56,610 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-27 18:16:56,610 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-27 18:16:56,610 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-27 18:16:56,611 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-27 18:16:56,611 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-27 18:16:56,613 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:16:56,638 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-27 18:16:56,639 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-27 18:16:56,640 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-27 18:16:56,640 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-27 18:16:56,641 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-27 18:16:56,641 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-27 18:16:56,641 INFO L138 SettingsManager]: * Use SBE=true [2023-01-27 18:16:56,641 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-27 18:16:56,641 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-27 18:16:56,641 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-27 18:16:56,642 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-27 18:16:56,642 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-27 18:16:56,642 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-27 18:16:56,642 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-27 18:16:56,642 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-27 18:16:56,643 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-27 18:16:56,643 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-27 18:16:56,643 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-27 18:16:56,643 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-27 18:16:56,643 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-27 18:16:56,643 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-27 18:16:56,643 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-27 18:16:56,643 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-27 18:16:56,644 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 18:16:56,644 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-27 18:16:56,644 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-27 18:16:56,644 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-27 18:16:56,644 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-27 18:16:56,644 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-27 18:16:56,644 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-27 18:16:56,644 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-27 18:16:56,644 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:16:56,852 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-27 18:16:56,871 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-27 18:16:56,873 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-27 18:16:56,874 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-27 18:16:56,874 INFO L275 PluginConnector]: CDTParser initialized [2023-01-27 18:16:56,875 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe004_power.oepc_pso.oepc_rmo.oepc.i [2023-01-27 18:16:58,032 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-27 18:16:58,277 INFO L351 CDTParser]: Found 1 translation units. [2023-01-27 18:16:58,277 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe004_power.oepc_pso.oepc_rmo.oepc.i [2023-01-27 18:16:58,292 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52eea5a07/aa6e147c4bae446dbf9122ac756f984f/FLAGe30e51943 [2023-01-27 18:16:58,303 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52eea5a07/aa6e147c4bae446dbf9122ac756f984f [2023-01-27 18:16:58,306 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-27 18:16:58,307 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-27 18:16:58,308 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-27 18:16:58,308 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-27 18:16:58,310 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-27 18:16:58,311 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 06:16:58" (1/1) ... [2023-01-27 18:16:58,312 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f74d57d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:16:58, skipping insertion in model container [2023-01-27 18:16:58,312 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 06:16:58" (1/1) ... [2023-01-27 18:16:58,317 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-27 18:16:58,364 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-27 18:16:58,504 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/safe004_power.oepc_pso.oepc_rmo.oepc.i[970,983] [2023-01-27 18:16:58,711 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 18:16:58,723 INFO L203 MainTranslator]: Completed pre-run [2023-01-27 18:16:58,735 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/safe004_power.oepc_pso.oepc_rmo.oepc.i[970,983] [2023-01-27 18:16:58,812 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 18:16:58,848 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-27 18:16:58,848 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-27 18:16:58,853 INFO L208 MainTranslator]: Completed translation [2023-01-27 18:16:58,853 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:16:58 WrapperNode [2023-01-27 18:16:58,853 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-27 18:16:58,854 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-27 18:16:58,854 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-27 18:16:58,854 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-27 18:16:58,859 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:16:58" (1/1) ... [2023-01-27 18:16:58,880 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:16:58" (1/1) ... [2023-01-27 18:16:58,901 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 144 [2023-01-27 18:16:58,902 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-27 18:16:58,902 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-27 18:16:58,903 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-27 18:16:58,903 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-27 18:16:58,918 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:16:58" (1/1) ... [2023-01-27 18:16:58,918 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:16:58" (1/1) ... [2023-01-27 18:16:58,924 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:16:58" (1/1) ... [2023-01-27 18:16:58,924 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:16:58" (1/1) ... [2023-01-27 18:16:58,940 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:16:58" (1/1) ... [2023-01-27 18:16:58,943 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:16:58" (1/1) ... [2023-01-27 18:16:58,945 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:16:58" (1/1) ... [2023-01-27 18:16:58,946 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:16:58" (1/1) ... [2023-01-27 18:16:58,949 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-27 18:16:58,950 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-27 18:16:58,950 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-27 18:16:58,950 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-27 18:16:58,951 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:16:58" (1/1) ... [2023-01-27 18:16:58,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 18:16:58,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 18:16:59,002 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:16:59,029 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:16:59,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-27 18:16:59,045 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-27 18:16:59,045 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-27 18:16:59,045 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-27 18:16:59,045 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-27 18:16:59,045 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-01-27 18:16:59,045 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-01-27 18:16:59,046 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-01-27 18:16:59,047 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-01-27 18:16:59,047 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-01-27 18:16:59,047 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-01-27 18:16:59,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-27 18:16:59,047 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-27 18:16:59,048 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-27 18:16:59,048 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-27 18:16:59,049 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:16:59,193 INFO L236 CfgBuilder]: Building ICFG [2023-01-27 18:16:59,195 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-27 18:16:59,515 INFO L277 CfgBuilder]: Performing block encoding [2023-01-27 18:16:59,794 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-27 18:16:59,794 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-01-27 18:16:59,796 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 06:16:59 BoogieIcfgContainer [2023-01-27 18:16:59,796 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-27 18:16:59,798 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-27 18:16:59,798 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-27 18:16:59,800 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-27 18:16:59,801 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 06:16:58" (1/3) ... [2023-01-27 18:16:59,801 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c52d0c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 06:16:59, skipping insertion in model container [2023-01-27 18:16:59,801 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:16:58" (2/3) ... [2023-01-27 18:16:59,802 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c52d0c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 06:16:59, skipping insertion in model container [2023-01-27 18:16:59,802 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 06:16:59" (3/3) ... [2023-01-27 18:16:59,803 INFO L112 eAbstractionObserver]: Analyzing ICFG safe004_power.oepc_pso.oepc_rmo.oepc.i [2023-01-27 18:16:59,817 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-27 18:16:59,817 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-01-27 18:16:59,817 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-27 18:16:59,876 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-27 18:16:59,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 107 transitions, 229 flow [2023-01-27 18:16:59,972 INFO L130 PetriNetUnfolder]: 2/104 cut-off events. [2023-01-27 18:16:59,973 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:16:59,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 104 events. 2/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2023-01-27 18:16:59,978 INFO L82 GeneralOperation]: Start removeDead. Operand has 115 places, 107 transitions, 229 flow [2023-01-27 18:16:59,980 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 112 places, 104 transitions, 217 flow [2023-01-27 18:16:59,983 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-27 18:16:59,992 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 112 places, 104 transitions, 217 flow [2023-01-27 18:16:59,994 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 104 transitions, 217 flow [2023-01-27 18:16:59,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 104 transitions, 217 flow [2023-01-27 18:17:00,030 INFO L130 PetriNetUnfolder]: 2/104 cut-off events. [2023-01-27 18:17:00,030 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:17:00,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 104 events. 2/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2023-01-27 18:17:00,033 INFO L119 LiptonReduction]: Number of co-enabled transitions 1920 [2023-01-27 18:17:03,386 INFO L134 LiptonReduction]: Checked pairs total: 5019 [2023-01-27 18:17:03,386 INFO L136 LiptonReduction]: Total number of compositions: 91 [2023-01-27 18:17:03,398 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-27 18:17:03,404 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;@631c3a32, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-27 18:17:03,404 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-01-27 18:17:03,406 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2023-01-27 18:17:03,406 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:17:03,406 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:17:03,407 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-01-27 18:17:03,407 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:17:03,411 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:17:03,411 INFO L85 PathProgramCache]: Analyzing trace with hash 534214, now seen corresponding path program 1 times [2023-01-27 18:17:03,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:17:03,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901051576] [2023-01-27 18:17:03,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:17:03,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:17:03,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:17:03,763 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:17:03,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:17:03,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901051576] [2023-01-27 18:17:03,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901051576] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:17:03,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:17:03,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-27 18:17:03,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088572498] [2023-01-27 18:17:03,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:17:03,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-27 18:17:03,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:17:03,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-27 18:17:03,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-27 18:17:03,802 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 198 [2023-01-27 18:17:03,805 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 26 transitions, 61 flow. Second operand has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 0 states 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:17:03,806 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:17:03,806 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 198 [2023-01-27 18:17:03,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:17:04,146 INFO L130 PetriNetUnfolder]: 1263/2016 cut-off events. [2023-01-27 18:17:04,147 INFO L131 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2023-01-27 18:17:04,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3927 conditions, 2016 events. 1263/2016 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 10879 event pairs, 204 based on Foata normal form. 80/1935 useless extension candidates. Maximal degree in co-relation 3916. Up to 1510 conditions per place. [2023-01-27 18:17:04,163 INFO L137 encePairwiseOnDemand]: 194/198 looper letters, 33 selfloop transitions, 2 changer transitions 4/41 dead transitions. [2023-01-27 18:17:04,163 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 41 transitions, 175 flow [2023-01-27 18:17:04,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 18:17:04,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 18:17:04,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 315 transitions. [2023-01-27 18:17:04,175 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5303030303030303 [2023-01-27 18:17:04,176 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 315 transitions. [2023-01-27 18:17:04,176 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 315 transitions. [2023-01-27 18:17:04,177 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:17:04,179 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 315 transitions. [2023-01-27 18:17:04,183 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states 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:17:04,187 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:17:04,188 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:17:04,189 INFO L175 Difference]: Start difference. First operand has 35 places, 26 transitions, 61 flow. Second operand 3 states and 315 transitions. [2023-01-27 18:17:04,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 41 transitions, 175 flow [2023-01-27 18:17:04,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 41 transitions, 170 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-01-27 18:17:04,194 INFO L231 Difference]: Finished difference. Result has 33 places, 22 transitions, 54 flow [2023-01-27 18:17:04,195 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=33, PETRI_TRANSITIONS=22} [2023-01-27 18:17:04,198 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, -2 predicate places. [2023-01-27 18:17:04,198 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 22 transitions, 54 flow [2023-01-27 18:17:04,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 0 states 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:17:04,198 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:17:04,199 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:17:04,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-27 18:17:04,199 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:17:04,199 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:17:04,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1598286958, now seen corresponding path program 1 times [2023-01-27 18:17:04,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:17:04,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251816124] [2023-01-27 18:17:04,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:17:04,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:17:04,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:17:05,297 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:17:05,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:17:05,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251816124] [2023-01-27 18:17:05,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251816124] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:17:05,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:17:05,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 18:17:05,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590200414] [2023-01-27 18:17:05,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:17:05,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 18:17:05,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:17:05,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 18:17:05,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-27 18:17:05,301 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 198 [2023-01-27 18:17:05,301 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 22 transitions, 54 flow. Second operand has 5 states, 5 states have (on average 79.0) internal successors, (395), 5 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:17:05,301 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:17:05,302 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 198 [2023-01-27 18:17:05,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:17:05,963 INFO L130 PetriNetUnfolder]: 1800/2681 cut-off events. [2023-01-27 18:17:05,963 INFO L131 PetriNetUnfolder]: For 151/151 co-relation queries the response was YES. [2023-01-27 18:17:05,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5580 conditions, 2681 events. 1800/2681 cut-off events. For 151/151 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 11994 event pairs, 334 based on Foata normal form. 145/2826 useless extension candidates. Maximal degree in co-relation 5570. Up to 1761 conditions per place. [2023-01-27 18:17:05,976 INFO L137 encePairwiseOnDemand]: 187/198 looper letters, 34 selfloop transitions, 9 changer transitions 30/73 dead transitions. [2023-01-27 18:17:05,976 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 73 transitions, 308 flow [2023-01-27 18:17:05,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 18:17:05,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 18:17:05,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 615 transitions. [2023-01-27 18:17:05,980 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44372294372294374 [2023-01-27 18:17:05,981 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 615 transitions. [2023-01-27 18:17:05,981 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 615 transitions. [2023-01-27 18:17:05,981 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:17:05,981 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 615 transitions. [2023-01-27 18:17:05,983 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 87.85714285714286) internal successors, (615), 7 states have internal predecessors, (615), 0 states have call successors, (0), 0 states 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:17:05,986 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 198.0) internal successors, (1584), 8 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:17:05,986 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 198.0) internal successors, (1584), 8 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:17:05,987 INFO L175 Difference]: Start difference. First operand has 33 places, 22 transitions, 54 flow. Second operand 7 states and 615 transitions. [2023-01-27 18:17:05,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 73 transitions, 308 flow [2023-01-27 18:17:05,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 73 transitions, 298 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-27 18:17:05,988 INFO L231 Difference]: Finished difference. Result has 41 places, 29 transitions, 136 flow [2023-01-27 18:17:05,989 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=136, PETRI_PLACES=41, PETRI_TRANSITIONS=29} [2023-01-27 18:17:05,989 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 6 predicate places. [2023-01-27 18:17:05,989 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 29 transitions, 136 flow [2023-01-27 18:17:05,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 79.0) internal successors, (395), 5 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:17:05,990 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:17:05,990 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:17:05,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-27 18:17:05,990 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:17:05,991 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:17:05,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1992708335, now seen corresponding path program 1 times [2023-01-27 18:17:05,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:17:05,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965254597] [2023-01-27 18:17:05,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:17:05,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:17:06,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:17:06,841 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:17:06,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:17:06,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965254597] [2023-01-27 18:17:06,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965254597] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:17:06,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:17:06,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 18:17:06,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023297398] [2023-01-27 18:17:06,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:17:06,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 18:17:06,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:17:06,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 18:17:06,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-27 18:17:06,844 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 198 [2023-01-27 18:17:06,845 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 29 transitions, 136 flow. Second operand has 5 states, 5 states have (on average 79.2) internal successors, (396), 5 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:17:06,845 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:17:06,845 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 198 [2023-01-27 18:17:06,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:17:07,441 INFO L130 PetriNetUnfolder]: 1587/2383 cut-off events. [2023-01-27 18:17:07,442 INFO L131 PetriNetUnfolder]: For 2173/2173 co-relation queries the response was YES. [2023-01-27 18:17:07,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7619 conditions, 2383 events. 1587/2383 cut-off events. For 2173/2173 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 10444 event pairs, 450 based on Foata normal form. 120/2503 useless extension candidates. Maximal degree in co-relation 7603. Up to 1311 conditions per place. [2023-01-27 18:17:07,460 INFO L137 encePairwiseOnDemand]: 188/198 looper letters, 39 selfloop transitions, 9 changer transitions 31/79 dead transitions. [2023-01-27 18:17:07,460 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 79 transitions, 510 flow [2023-01-27 18:17:07,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 18:17:07,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 18:17:07,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 611 transitions. [2023-01-27 18:17:07,462 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44083694083694086 [2023-01-27 18:17:07,462 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 611 transitions. [2023-01-27 18:17:07,463 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 611 transitions. [2023-01-27 18:17:07,463 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:17:07,463 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 611 transitions. [2023-01-27 18:17:07,464 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 87.28571428571429) internal successors, (611), 7 states have internal predecessors, (611), 0 states have call successors, (0), 0 states 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:17:07,467 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 198.0) internal successors, (1584), 8 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:17:07,467 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 198.0) internal successors, (1584), 8 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:17:07,467 INFO L175 Difference]: Start difference. First operand has 41 places, 29 transitions, 136 flow. Second operand 7 states and 611 transitions. [2023-01-27 18:17:07,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 79 transitions, 510 flow [2023-01-27 18:17:07,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 79 transitions, 500 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-01-27 18:17:07,489 INFO L231 Difference]: Finished difference. Result has 48 places, 34 transitions, 222 flow [2023-01-27 18:17:07,489 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=222, PETRI_PLACES=48, PETRI_TRANSITIONS=34} [2023-01-27 18:17:07,490 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 13 predicate places. [2023-01-27 18:17:07,493 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 34 transitions, 222 flow [2023-01-27 18:17:07,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 79.2) internal successors, (396), 5 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:17:07,493 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:17:07,494 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:17:07,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-27 18:17:07,494 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:17:07,495 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:17:07,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1577430061, now seen corresponding path program 1 times [2023-01-27 18:17:07,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:17:07,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547694973] [2023-01-27 18:17:07,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:17:07,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:17:07,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:17:08,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:17:08,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:17:08,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547694973] [2023-01-27 18:17:08,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547694973] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:17:08,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:17:08,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 18:17:08,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116806379] [2023-01-27 18:17:08,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:17:08,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-27 18:17:08,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:17:08,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-27 18:17:08,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-01-27 18:17:08,363 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 198 [2023-01-27 18:17:08,363 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 34 transitions, 222 flow. Second operand has 6 states, 6 states have (on average 79.0) internal successors, (474), 6 states have internal predecessors, (474), 0 states have call successors, (0), 0 states 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:17:08,363 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:17:08,364 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 198 [2023-01-27 18:17:08,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:17:08,988 INFO L130 PetriNetUnfolder]: 2276/3384 cut-off events. [2023-01-27 18:17:08,988 INFO L131 PetriNetUnfolder]: For 5458/5458 co-relation queries the response was YES. [2023-01-27 18:17:08,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12248 conditions, 3384 events. 2276/3384 cut-off events. For 5458/5458 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 16107 event pairs, 432 based on Foata normal form. 90/3474 useless extension candidates. Maximal degree in co-relation 12226. Up to 1638 conditions per place. [2023-01-27 18:17:09,008 INFO L137 encePairwiseOnDemand]: 185/198 looper letters, 40 selfloop transitions, 17 changer transitions 33/90 dead transitions. [2023-01-27 18:17:09,008 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 90 transitions, 729 flow [2023-01-27 18:17:09,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-27 18:17:09,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-27 18:17:09,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 532 transitions. [2023-01-27 18:17:09,010 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4478114478114478 [2023-01-27 18:17:09,010 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 532 transitions. [2023-01-27 18:17:09,010 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 532 transitions. [2023-01-27 18:17:09,011 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:17:09,011 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 532 transitions. [2023-01-27 18:17:09,012 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 88.66666666666667) internal successors, (532), 6 states have internal predecessors, (532), 0 states have call successors, (0), 0 states 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:17:09,014 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 198.0) internal successors, (1386), 7 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:17:09,015 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 198.0) internal successors, (1386), 7 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:17:09,015 INFO L175 Difference]: Start difference. First operand has 48 places, 34 transitions, 222 flow. Second operand 6 states and 532 transitions. [2023-01-27 18:17:09,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 90 transitions, 729 flow [2023-01-27 18:17:09,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 90 transitions, 702 flow, removed 9 selfloop flow, removed 4 redundant places. [2023-01-27 18:17:09,049 INFO L231 Difference]: Finished difference. Result has 49 places, 37 transitions, 269 flow [2023-01-27 18:17:09,049 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=269, PETRI_PLACES=49, PETRI_TRANSITIONS=37} [2023-01-27 18:17:09,051 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 14 predicate places. [2023-01-27 18:17:09,051 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 37 transitions, 269 flow [2023-01-27 18:17:09,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 79.0) internal successors, (474), 6 states have internal predecessors, (474), 0 states have call successors, (0), 0 states 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:17:09,051 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:17:09,051 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:17:09,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-27 18:17:09,052 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:17:09,053 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:17:09,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1644459811, now seen corresponding path program 2 times [2023-01-27 18:17:09,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:17:09,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770984145] [2023-01-27 18:17:09,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:17:09,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:17:09,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:17:10,053 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:17:10,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:17:10,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770984145] [2023-01-27 18:17:10,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770984145] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:17:10,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:17:10,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-27 18:17:10,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821507997] [2023-01-27 18:17:10,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:17:10,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-27 18:17:10,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:17:10,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-27 18:17:10,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-01-27 18:17:10,056 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 198 [2023-01-27 18:17:10,056 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 37 transitions, 269 flow. Second operand has 7 states, 7 states have (on average 76.71428571428571) internal successors, (537), 7 states have internal predecessors, (537), 0 states have call successors, (0), 0 states 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:17:10,057 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:17:10,057 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 198 [2023-01-27 18:17:10,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:17:10,709 INFO L130 PetriNetUnfolder]: 2088/3135 cut-off events. [2023-01-27 18:17:10,709 INFO L131 PetriNetUnfolder]: For 5348/5348 co-relation queries the response was YES. [2023-01-27 18:17:10,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12605 conditions, 3135 events. 2088/3135 cut-off events. For 5348/5348 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 15130 event pairs, 231 based on Foata normal form. 107/3242 useless extension candidates. Maximal degree in co-relation 12582. Up to 1541 conditions per place. [2023-01-27 18:17:10,727 INFO L137 encePairwiseOnDemand]: 185/198 looper letters, 48 selfloop transitions, 21 changer transitions 64/133 dead transitions. [2023-01-27 18:17:10,727 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 133 transitions, 1208 flow [2023-01-27 18:17:10,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-27 18:17:10,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-01-27 18:17:10,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 775 transitions. [2023-01-27 18:17:10,730 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43490460157126826 [2023-01-27 18:17:10,730 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 775 transitions. [2023-01-27 18:17:10,730 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 775 transitions. [2023-01-27 18:17:10,731 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:17:10,731 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 775 transitions. [2023-01-27 18:17:10,732 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 86.11111111111111) internal successors, (775), 9 states have internal predecessors, (775), 0 states have call successors, (0), 0 states 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:17:10,736 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 198.0) internal successors, (1980), 10 states have internal predecessors, (1980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:17:10,737 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 198.0) internal successors, (1980), 10 states have internal predecessors, (1980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:17:10,737 INFO L175 Difference]: Start difference. First operand has 49 places, 37 transitions, 269 flow. Second operand 9 states and 775 transitions. [2023-01-27 18:17:10,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 133 transitions, 1208 flow [2023-01-27 18:17:10,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 133 transitions, 1078 flow, removed 17 selfloop flow, removed 6 redundant places. [2023-01-27 18:17:10,755 INFO L231 Difference]: Finished difference. Result has 56 places, 42 transitions, 339 flow [2023-01-27 18:17:10,755 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=339, PETRI_PLACES=56, PETRI_TRANSITIONS=42} [2023-01-27 18:17:10,757 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 21 predicate places. [2023-01-27 18:17:10,757 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 42 transitions, 339 flow [2023-01-27 18:17:10,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 76.71428571428571) internal successors, (537), 7 states have internal predecessors, (537), 0 states have call successors, (0), 0 states 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:17:10,758 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:17:10,758 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:17:10,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-27 18:17:10,758 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:17:10,758 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:17:10,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1711533748, now seen corresponding path program 1 times [2023-01-27 18:17:10,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:17:10,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666863276] [2023-01-27 18:17:10,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:17:10,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:17:10,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:17:11,487 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:17:11,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:17:11,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666863276] [2023-01-27 18:17:11,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666863276] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:17:11,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:17:11,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 18:17:11,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578667431] [2023-01-27 18:17:11,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:17:11,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 18:17:11,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:17:11,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 18:17:11,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-27 18:17:11,489 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 198 [2023-01-27 18:17:11,490 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 42 transitions, 339 flow. Second operand has 5 states, 5 states have (on average 79.6) internal successors, (398), 5 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:17:11,490 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:17:11,490 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 198 [2023-01-27 18:17:11,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:17:11,958 INFO L130 PetriNetUnfolder]: 1275/1955 cut-off events. [2023-01-27 18:17:11,958 INFO L131 PetriNetUnfolder]: For 6375/6375 co-relation queries the response was YES. [2023-01-27 18:17:11,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8799 conditions, 1955 events. 1275/1955 cut-off events. For 6375/6375 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 8487 event pairs, 558 based on Foata normal form. 74/2029 useless extension candidates. Maximal degree in co-relation 8773. Up to 1565 conditions per place. [2023-01-27 18:17:11,977 INFO L137 encePairwiseOnDemand]: 187/198 looper letters, 51 selfloop transitions, 25 changer transitions 21/97 dead transitions. [2023-01-27 18:17:11,977 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 97 transitions, 910 flow [2023-01-27 18:17:11,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 18:17:11,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 18:17:11,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 614 transitions. [2023-01-27 18:17:11,979 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.443001443001443 [2023-01-27 18:17:11,979 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 614 transitions. [2023-01-27 18:17:11,979 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 614 transitions. [2023-01-27 18:17:11,980 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:17:11,980 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 614 transitions. [2023-01-27 18:17:11,981 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 87.71428571428571) internal successors, (614), 7 states have internal predecessors, (614), 0 states have call successors, (0), 0 states 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:17:11,983 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 198.0) internal successors, (1584), 8 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:17:11,983 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 198.0) internal successors, (1584), 8 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:17:11,983 INFO L175 Difference]: Start difference. First operand has 56 places, 42 transitions, 339 flow. Second operand 7 states and 614 transitions. [2023-01-27 18:17:11,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 97 transitions, 910 flow [2023-01-27 18:17:11,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 97 transitions, 828 flow, removed 9 selfloop flow, removed 5 redundant places. [2023-01-27 18:17:11,997 INFO L231 Difference]: Finished difference. Result has 59 places, 53 transitions, 474 flow [2023-01-27 18:17:11,997 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=295, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=474, PETRI_PLACES=59, PETRI_TRANSITIONS=53} [2023-01-27 18:17:11,998 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 24 predicate places. [2023-01-27 18:17:11,998 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 53 transitions, 474 flow [2023-01-27 18:17:11,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 79.6) internal successors, (398), 5 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:17:11,999 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:17:11,999 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:17:11,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-27 18:17:11,999 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:17:11,999 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:17:11,999 INFO L85 PathProgramCache]: Analyzing trace with hash 681217372, now seen corresponding path program 1 times [2023-01-27 18:17:11,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:17:12,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442877386] [2023-01-27 18:17:12,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:17:12,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:17:12,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:17:12,759 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:17:12,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:17:12,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442877386] [2023-01-27 18:17:12,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442877386] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:17:12,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:17:12,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 18:17:12,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907604462] [2023-01-27 18:17:12,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:17:12,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 18:17:12,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:17:12,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 18:17:12,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-27 18:17:12,761 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 198 [2023-01-27 18:17:12,762 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 53 transitions, 474 flow. Second operand has 5 states, 5 states have (on average 79.8) internal successors, (399), 5 states have internal predecessors, (399), 0 states have call successors, (0), 0 states 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:17:12,762 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:17:12,762 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 198 [2023-01-27 18:17:12,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:17:13,230 INFO L130 PetriNetUnfolder]: 1707/2632 cut-off events. [2023-01-27 18:17:13,230 INFO L131 PetriNetUnfolder]: For 11580/11580 co-relation queries the response was YES. [2023-01-27 18:17:13,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12458 conditions, 2632 events. 1707/2632 cut-off events. For 11580/11580 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 12383 event pairs, 589 based on Foata normal form. 81/2713 useless extension candidates. Maximal degree in co-relation 12428. Up to 1265 conditions per place. [2023-01-27 18:17:13,260 INFO L137 encePairwiseOnDemand]: 191/198 looper letters, 58 selfloop transitions, 12 changer transitions 24/94 dead transitions. [2023-01-27 18:17:13,261 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 94 transitions, 916 flow [2023-01-27 18:17:13,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-27 18:17:13,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-27 18:17:13,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 527 transitions. [2023-01-27 18:17:13,263 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4436026936026936 [2023-01-27 18:17:13,263 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 527 transitions. [2023-01-27 18:17:13,263 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 527 transitions. [2023-01-27 18:17:13,263 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:17:13,263 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 527 transitions. [2023-01-27 18:17:13,264 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 87.83333333333333) internal successors, (527), 6 states have internal predecessors, (527), 0 states have call successors, (0), 0 states 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:17:13,266 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 198.0) internal successors, (1386), 7 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:17:13,266 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 198.0) internal successors, (1386), 7 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:17:13,267 INFO L175 Difference]: Start difference. First operand has 59 places, 53 transitions, 474 flow. Second operand 6 states and 527 transitions. [2023-01-27 18:17:13,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 94 transitions, 916 flow [2023-01-27 18:17:13,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 94 transitions, 904 flow, removed 6 selfloop flow, removed 3 redundant places. [2023-01-27 18:17:13,301 INFO L231 Difference]: Finished difference. Result has 62 places, 49 transitions, 466 flow [2023-01-27 18:17:13,301 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=468, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=466, PETRI_PLACES=62, PETRI_TRANSITIONS=49} [2023-01-27 18:17:13,302 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 27 predicate places. [2023-01-27 18:17:13,302 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 49 transitions, 466 flow [2023-01-27 18:17:13,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 79.8) internal successors, (399), 5 states have internal predecessors, (399), 0 states have call successors, (0), 0 states 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:17:13,302 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:17:13,302 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:17:13,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-27 18:17:13,303 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:17:13,303 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:17:13,303 INFO L85 PathProgramCache]: Analyzing trace with hash -268845576, now seen corresponding path program 1 times [2023-01-27 18:17:13,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:17:13,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24933003] [2023-01-27 18:17:13,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:17:13,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:17:13,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:17:13,820 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:17:13,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:17:13,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24933003] [2023-01-27 18:17:13,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24933003] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:17:13,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:17:13,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-27 18:17:13,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806144217] [2023-01-27 18:17:13,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:17:13,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-27 18:17:13,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:17:13,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-27 18:17:13,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-01-27 18:17:13,823 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 198 [2023-01-27 18:17:13,824 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 49 transitions, 466 flow. Second operand has 7 states, 7 states have (on average 85.0) internal successors, (595), 7 states have internal predecessors, (595), 0 states have call successors, (0), 0 states 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:17:13,824 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:17:13,824 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 198 [2023-01-27 18:17:13,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:17:14,274 INFO L130 PetriNetUnfolder]: 1392/2231 cut-off events. [2023-01-27 18:17:14,274 INFO L131 PetriNetUnfolder]: For 10937/11009 co-relation queries the response was YES. [2023-01-27 18:17:14,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10607 conditions, 2231 events. 1392/2231 cut-off events. For 10937/11009 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 11145 event pairs, 230 based on Foata normal form. 154/2380 useless extension candidates. Maximal degree in co-relation 10574. Up to 1391 conditions per place. [2023-01-27 18:17:14,291 INFO L137 encePairwiseOnDemand]: 192/198 looper letters, 47 selfloop transitions, 10 changer transitions 37/96 dead transitions. [2023-01-27 18:17:14,291 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 96 transitions, 1049 flow [2023-01-27 18:17:14,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-27 18:17:14,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-27 18:17:14,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 560 transitions. [2023-01-27 18:17:14,294 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4713804713804714 [2023-01-27 18:17:14,294 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 560 transitions. [2023-01-27 18:17:14,294 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 560 transitions. [2023-01-27 18:17:14,294 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:17:14,294 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 560 transitions. [2023-01-27 18:17:14,296 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 93.33333333333333) internal successors, (560), 6 states have internal predecessors, (560), 0 states have call successors, (0), 0 states 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:17:14,298 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 198.0) internal successors, (1386), 7 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:17:14,299 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 198.0) internal successors, (1386), 7 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:17:14,299 INFO L175 Difference]: Start difference. First operand has 62 places, 49 transitions, 466 flow. Second operand 6 states and 560 transitions. [2023-01-27 18:17:14,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 96 transitions, 1049 flow [2023-01-27 18:17:14,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 96 transitions, 1025 flow, removed 5 selfloop flow, removed 3 redundant places. [2023-01-27 18:17:14,316 INFO L231 Difference]: Finished difference. Result has 66 places, 44 transitions, 437 flow [2023-01-27 18:17:14,317 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=444, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=437, PETRI_PLACES=66, PETRI_TRANSITIONS=44} [2023-01-27 18:17:14,318 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 31 predicate places. [2023-01-27 18:17:14,319 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 44 transitions, 437 flow [2023-01-27 18:17:14,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 85.0) internal successors, (595), 7 states have internal predecessors, (595), 0 states have call successors, (0), 0 states 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:17:14,319 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:17:14,319 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:17:14,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-01-27 18:17:14,320 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:17:14,324 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:17:14,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1533629952, now seen corresponding path program 1 times [2023-01-27 18:17:14,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:17:14,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108043633] [2023-01-27 18:17:14,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:17:14,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:17:14,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:17:15,001 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:17:15,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:17:15,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108043633] [2023-01-27 18:17:15,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108043633] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:17:15,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:17:15,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-27 18:17:15,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902155839] [2023-01-27 18:17:15,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:17:15,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-01-27 18:17:15,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:17:15,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-01-27 18:17:15,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-01-27 18:17:15,004 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 198 [2023-01-27 18:17:15,005 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 44 transitions, 437 flow. Second operand has 8 states, 8 states have (on average 83.75) internal successors, (670), 8 states have internal predecessors, (670), 0 states have call successors, (0), 0 states 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:17:15,005 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:17:15,005 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 198 [2023-01-27 18:17:15,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:17:15,398 INFO L130 PetriNetUnfolder]: 1115/1778 cut-off events. [2023-01-27 18:17:15,399 INFO L131 PetriNetUnfolder]: For 10428/10446 co-relation queries the response was YES. [2023-01-27 18:17:15,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8888 conditions, 1778 events. 1115/1778 cut-off events. For 10428/10446 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 8130 event pairs, 652 based on Foata normal form. 62/1840 useless extension candidates. Maximal degree in co-relation 8852. Up to 1499 conditions per place. [2023-01-27 18:17:15,411 INFO L137 encePairwiseOnDemand]: 193/198 looper letters, 51 selfloop transitions, 7 changer transitions 15/75 dead transitions. [2023-01-27 18:17:15,411 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 75 transitions, 792 flow [2023-01-27 18:17:15,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-27 18:17:15,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-27 18:17:15,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 546 transitions. [2023-01-27 18:17:15,413 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4595959595959596 [2023-01-27 18:17:15,415 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 546 transitions. [2023-01-27 18:17:15,415 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 546 transitions. [2023-01-27 18:17:15,415 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:17:15,415 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 546 transitions. [2023-01-27 18:17:15,417 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 91.0) internal successors, (546), 6 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:17:15,418 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 198.0) internal successors, (1386), 7 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:17:15,419 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 198.0) internal successors, (1386), 7 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:17:15,419 INFO L175 Difference]: Start difference. First operand has 66 places, 44 transitions, 437 flow. Second operand 6 states and 546 transitions. [2023-01-27 18:17:15,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 75 transitions, 792 flow [2023-01-27 18:17:15,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 75 transitions, 687 flow, removed 17 selfloop flow, removed 10 redundant places. [2023-01-27 18:17:15,438 INFO L231 Difference]: Finished difference. Result has 62 places, 44 transitions, 387 flow [2023-01-27 18:17:15,438 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=387, PETRI_PLACES=62, PETRI_TRANSITIONS=44} [2023-01-27 18:17:15,439 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 27 predicate places. [2023-01-27 18:17:15,439 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 44 transitions, 387 flow [2023-01-27 18:17:15,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 83.75) internal successors, (670), 8 states have internal predecessors, (670), 0 states have call successors, (0), 0 states 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:17:15,439 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:17:15,440 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:17:15,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-27 18:17:15,440 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:17:15,440 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:17:15,440 INFO L85 PathProgramCache]: Analyzing trace with hash 798857469, now seen corresponding path program 1 times [2023-01-27 18:17:15,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:17:15,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80949218] [2023-01-27 18:17:15,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:17:15,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:17:15,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:17:16,617 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:17:16,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:17:16,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80949218] [2023-01-27 18:17:16,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80949218] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:17:16,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:17:16,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-01-27 18:17:16,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459918563] [2023-01-27 18:17:16,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:17:16,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-01-27 18:17:16,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:17:16,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-01-27 18:17:16,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-01-27 18:17:16,620 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 198 [2023-01-27 18:17:16,620 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 44 transitions, 387 flow. Second operand has 9 states, 9 states have (on average 79.66666666666667) internal successors, (717), 9 states have internal predecessors, (717), 0 states have call successors, (0), 0 states 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:17:16,621 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:17:16,621 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 198 [2023-01-27 18:17:16,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:17:17,318 INFO L130 PetriNetUnfolder]: 1272/2027 cut-off events. [2023-01-27 18:17:17,318 INFO L131 PetriNetUnfolder]: For 10297/10319 co-relation queries the response was YES. [2023-01-27 18:17:17,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9438 conditions, 2027 events. 1272/2027 cut-off events. For 10297/10319 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 9636 event pairs, 512 based on Foata normal form. 92/2119 useless extension candidates. Maximal degree in co-relation 9405. Up to 1466 conditions per place. [2023-01-27 18:17:17,330 INFO L137 encePairwiseOnDemand]: 188/198 looper letters, 65 selfloop transitions, 27 changer transitions 25/119 dead transitions. [2023-01-27 18:17:17,331 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 119 transitions, 1128 flow [2023-01-27 18:17:17,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-01-27 18:17:17,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-01-27 18:17:17,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 950 transitions. [2023-01-27 18:17:17,334 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4361799816345271 [2023-01-27 18:17:17,334 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 950 transitions. [2023-01-27 18:17:17,334 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 950 transitions. [2023-01-27 18:17:17,334 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:17:17,334 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 950 transitions. [2023-01-27 18:17:17,336 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 86.36363636363636) internal successors, (950), 11 states have internal predecessors, (950), 0 states have call successors, (0), 0 states 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:17:17,339 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 198.0) internal successors, (2376), 12 states have internal predecessors, (2376), 0 states have call successors, (0), 0 states 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:17:17,339 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 198.0) internal successors, (2376), 12 states have internal predecessors, (2376), 0 states have call successors, (0), 0 states 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:17:17,339 INFO L175 Difference]: Start difference. First operand has 62 places, 44 transitions, 387 flow. Second operand 11 states and 950 transitions. [2023-01-27 18:17:17,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 119 transitions, 1128 flow [2023-01-27 18:17:17,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 119 transitions, 1080 flow, removed 18 selfloop flow, removed 6 redundant places. [2023-01-27 18:17:17,359 INFO L231 Difference]: Finished difference. Result has 70 places, 61 transitions, 626 flow [2023-01-27 18:17:17,360 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=626, PETRI_PLACES=70, PETRI_TRANSITIONS=61} [2023-01-27 18:17:17,361 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 35 predicate places. [2023-01-27 18:17:17,361 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 61 transitions, 626 flow [2023-01-27 18:17:17,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 79.66666666666667) internal successors, (717), 9 states have internal predecessors, (717), 0 states have call successors, (0), 0 states 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:17:17,361 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:17:17,361 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:17:17,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-01-27 18:17:17,361 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:17:17,362 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:17:17,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1925820901, now seen corresponding path program 2 times [2023-01-27 18:17:17,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:17:17,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766196393] [2023-01-27 18:17:17,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:17:17,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:17:17,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:17:18,144 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:17:18,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:17:18,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766196393] [2023-01-27 18:17:18,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766196393] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:17:18,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:17:18,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-01-27 18:17:18,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043145240] [2023-01-27 18:17:18,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:17:18,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-01-27 18:17:18,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:17:18,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-01-27 18:17:18,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-01-27 18:17:18,148 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 198 [2023-01-27 18:17:18,149 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 61 transitions, 626 flow. Second operand has 9 states, 9 states have (on average 82.66666666666667) internal successors, (744), 9 states have internal predecessors, (744), 0 states have call successors, (0), 0 states 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:17:18,149 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:17:18,149 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 198 [2023-01-27 18:17:18,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:17:18,815 INFO L130 PetriNetUnfolder]: 1298/2093 cut-off events. [2023-01-27 18:17:18,815 INFO L131 PetriNetUnfolder]: For 12860/12883 co-relation queries the response was YES. [2023-01-27 18:17:18,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11061 conditions, 2093 events. 1298/2093 cut-off events. For 12860/12883 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 10192 event pairs, 555 based on Foata normal form. 68/2161 useless extension candidates. Maximal degree in co-relation 11026. Up to 1550 conditions per place. [2023-01-27 18:17:18,828 INFO L137 encePairwiseOnDemand]: 190/198 looper letters, 71 selfloop transitions, 19 changer transitions 27/119 dead transitions. [2023-01-27 18:17:18,829 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 119 transitions, 1304 flow [2023-01-27 18:17:18,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-27 18:17:18,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-01-27 18:17:18,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 810 transitions. [2023-01-27 18:17:18,831 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45454545454545453 [2023-01-27 18:17:18,831 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 810 transitions. [2023-01-27 18:17:18,831 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 810 transitions. [2023-01-27 18:17:18,832 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:17:18,832 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 810 transitions. [2023-01-27 18:17:18,833 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 90.0) internal successors, (810), 9 states have internal predecessors, (810), 0 states have call successors, (0), 0 states 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:17:18,836 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 198.0) internal successors, (1980), 10 states have internal predecessors, (1980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:17:18,837 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 198.0) internal successors, (1980), 10 states have internal predecessors, (1980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:17:18,837 INFO L175 Difference]: Start difference. First operand has 70 places, 61 transitions, 626 flow. Second operand 9 states and 810 transitions. [2023-01-27 18:17:18,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 119 transitions, 1304 flow [2023-01-27 18:17:18,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 119 transitions, 1259 flow, removed 19 selfloop flow, removed 4 redundant places. [2023-01-27 18:17:18,859 INFO L231 Difference]: Finished difference. Result has 75 places, 62 transitions, 682 flow [2023-01-27 18:17:18,860 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=591, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=682, PETRI_PLACES=75, PETRI_TRANSITIONS=62} [2023-01-27 18:17:18,860 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 40 predicate places. [2023-01-27 18:17:18,860 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 62 transitions, 682 flow [2023-01-27 18:17:18,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 82.66666666666667) internal successors, (744), 9 states have internal predecessors, (744), 0 states have call successors, (0), 0 states 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:17:18,861 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:17:18,861 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:17:18,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-01-27 18:17:18,861 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:17:18,861 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:17:18,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1923085713, now seen corresponding path program 1 times [2023-01-27 18:17:18,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:17:18,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507256698] [2023-01-27 18:17:18,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:17:18,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:17:18,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:17:19,577 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:17:19,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:17:19,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507256698] [2023-01-27 18:17:19,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507256698] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:17:19,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:17:19,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-01-27 18:17:19,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694768829] [2023-01-27 18:17:19,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:17:19,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-01-27 18:17:19,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:17:19,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-01-27 18:17:19,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-01-27 18:17:19,580 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 198 [2023-01-27 18:17:19,580 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 62 transitions, 682 flow. Second operand has 9 states, 9 states have (on average 80.66666666666667) internal successors, (726), 9 states have internal predecessors, (726), 0 states have call successors, (0), 0 states 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:17:19,581 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:17:19,581 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 198 [2023-01-27 18:17:19,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:17:20,221 INFO L130 PetriNetUnfolder]: 1307/2116 cut-off events. [2023-01-27 18:17:20,221 INFO L131 PetriNetUnfolder]: For 15120/15138 co-relation queries the response was YES. [2023-01-27 18:17:20,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11639 conditions, 2116 events. 1307/2116 cut-off events. For 15120/15138 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 10428 event pairs, 252 based on Foata normal form. 52/2168 useless extension candidates. Maximal degree in co-relation 11602. Up to 992 conditions per place. [2023-01-27 18:17:20,242 INFO L137 encePairwiseOnDemand]: 189/198 looper letters, 95 selfloop transitions, 34 changer transitions 23/154 dead transitions. [2023-01-27 18:17:20,242 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 154 transitions, 1850 flow [2023-01-27 18:17:20,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-01-27 18:17:20,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-01-27 18:17:20,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 968 transitions. [2023-01-27 18:17:20,246 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2023-01-27 18:17:20,246 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 968 transitions. [2023-01-27 18:17:20,246 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 968 transitions. [2023-01-27 18:17:20,247 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:17:20,247 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 968 transitions. [2023-01-27 18:17:20,248 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 88.0) internal successors, (968), 11 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:17:20,251 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 198.0) internal successors, (2376), 12 states have internal predecessors, (2376), 0 states have call successors, (0), 0 states 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:17:20,252 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 198.0) internal successors, (2376), 12 states have internal predecessors, (2376), 0 states have call successors, (0), 0 states 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:17:20,252 INFO L175 Difference]: Start difference. First operand has 75 places, 62 transitions, 682 flow. Second operand 11 states and 968 transitions. [2023-01-27 18:17:20,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 154 transitions, 1850 flow [2023-01-27 18:17:20,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 154 transitions, 1795 flow, removed 9 selfloop flow, removed 5 redundant places. [2023-01-27 18:17:20,281 INFO L231 Difference]: Finished difference. Result has 84 places, 84 transitions, 1087 flow [2023-01-27 18:17:20,281 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=643, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1087, PETRI_PLACES=84, PETRI_TRANSITIONS=84} [2023-01-27 18:17:20,282 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 49 predicate places. [2023-01-27 18:17:20,282 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 84 transitions, 1087 flow [2023-01-27 18:17:20,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 80.66666666666667) internal successors, (726), 9 states have internal predecessors, (726), 0 states have call successors, (0), 0 states 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:17:20,283 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:17:20,283 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:17:20,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-01-27 18:17:20,283 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:17:20,283 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:17:20,283 INFO L85 PathProgramCache]: Analyzing trace with hash 222767061, now seen corresponding path program 2 times [2023-01-27 18:17:20,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:17:20,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244623651] [2023-01-27 18:17:20,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:17:20,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:17:20,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:17:20,776 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:17:20,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:17:20,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244623651] [2023-01-27 18:17:20,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244623651] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:17:20,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:17:20,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-27 18:17:20,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399559141] [2023-01-27 18:17:20,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:17:20,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-01-27 18:17:20,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:17:20,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-01-27 18:17:20,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-01-27 18:17:20,779 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 198 [2023-01-27 18:17:20,780 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 84 transitions, 1087 flow. Second operand has 8 states, 8 states have (on average 82.875) internal successors, (663), 8 states have internal predecessors, (663), 0 states have call successors, (0), 0 states 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:17:20,780 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:17:20,780 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 198 [2023-01-27 18:17:20,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:17:21,303 INFO L130 PetriNetUnfolder]: 1176/1943 cut-off events. [2023-01-27 18:17:21,303 INFO L131 PetriNetUnfolder]: For 21180/21198 co-relation queries the response was YES. [2023-01-27 18:17:21,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11923 conditions, 1943 events. 1176/1943 cut-off events. For 21180/21198 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 9674 event pairs, 366 based on Foata normal form. 48/1991 useless extension candidates. Maximal degree in co-relation 11882. Up to 1135 conditions per place. [2023-01-27 18:17:21,318 INFO L137 encePairwiseOnDemand]: 189/198 looper letters, 75 selfloop transitions, 42 changer transitions 40/159 dead transitions. [2023-01-27 18:17:21,318 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 159 transitions, 2241 flow [2023-01-27 18:17:21,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-27 18:17:21,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-01-27 18:17:21,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 729 transitions. [2023-01-27 18:17:21,321 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4602272727272727 [2023-01-27 18:17:21,321 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 729 transitions. [2023-01-27 18:17:21,321 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 729 transitions. [2023-01-27 18:17:21,321 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:17:21,322 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 729 transitions. [2023-01-27 18:17:21,323 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 91.125) internal successors, (729), 8 states have internal predecessors, (729), 0 states have call successors, (0), 0 states 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:17:21,325 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 198.0) internal successors, (1782), 9 states have internal predecessors, (1782), 0 states have call successors, (0), 0 states 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:17:21,326 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 198.0) internal successors, (1782), 9 states have internal predecessors, (1782), 0 states have call successors, (0), 0 states 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:17:21,326 INFO L175 Difference]: Start difference. First operand has 84 places, 84 transitions, 1087 flow. Second operand 8 states and 729 transitions. [2023-01-27 18:17:21,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 159 transitions, 2241 flow [2023-01-27 18:17:21,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 159 transitions, 2103 flow, removed 57 selfloop flow, removed 3 redundant places. [2023-01-27 18:17:21,361 INFO L231 Difference]: Finished difference. Result has 91 places, 94 transitions, 1359 flow [2023-01-27 18:17:21,362 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=1019, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1359, PETRI_PLACES=91, PETRI_TRANSITIONS=94} [2023-01-27 18:17:21,362 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 56 predicate places. [2023-01-27 18:17:21,362 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 94 transitions, 1359 flow [2023-01-27 18:17:21,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 82.875) internal successors, (663), 8 states have internal predecessors, (663), 0 states have call successors, (0), 0 states 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:17:21,363 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:17:21,363 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:17:21,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-01-27 18:17:21,363 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:17:21,363 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:17:21,363 INFO L85 PathProgramCache]: Analyzing trace with hash 636761603, now seen corresponding path program 1 times [2023-01-27 18:17:21,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:17:21,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441834249] [2023-01-27 18:17:21,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:17:21,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:17:21,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:17:22,457 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:17:22,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:17:22,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441834249] [2023-01-27 18:17:22,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441834249] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:17:22,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:17:22,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-01-27 18:17:22,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477970487] [2023-01-27 18:17:22,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:17:22,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-01-27 18:17:22,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:17:22,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-01-27 18:17:22,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-01-27 18:17:22,459 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 198 [2023-01-27 18:17:22,460 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 94 transitions, 1359 flow. Second operand has 10 states, 10 states have (on average 78.6) internal successors, (786), 10 states have internal predecessors, (786), 0 states have call successors, (0), 0 states 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:17:22,460 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:17:22,460 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 198 [2023-01-27 18:17:22,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:17:23,474 INFO L130 PetriNetUnfolder]: 1202/2046 cut-off events. [2023-01-27 18:17:23,474 INFO L131 PetriNetUnfolder]: For 25367/25395 co-relation queries the response was YES. [2023-01-27 18:17:23,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13043 conditions, 2046 events. 1202/2046 cut-off events. For 25367/25395 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 10771 event pairs, 167 based on Foata normal form. 84/2124 useless extension candidates. Maximal degree in co-relation 12998. Up to 1021 conditions per place. [2023-01-27 18:17:23,491 INFO L137 encePairwiseOnDemand]: 189/198 looper letters, 118 selfloop transitions, 43 changer transitions 29/192 dead transitions. [2023-01-27 18:17:23,491 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 192 transitions, 2862 flow [2023-01-27 18:17:23,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-01-27 18:17:23,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-01-27 18:17:23,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1188 transitions. [2023-01-27 18:17:23,495 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2023-01-27 18:17:23,495 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1188 transitions. [2023-01-27 18:17:23,495 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1188 transitions. [2023-01-27 18:17:23,496 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:17:23,496 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1188 transitions. [2023-01-27 18:17:23,498 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 84.85714285714286) internal successors, (1188), 14 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:17:23,502 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 198.0) internal successors, (2970), 15 states have internal predecessors, (2970), 0 states have call successors, (0), 0 states 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:17:23,502 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 198.0) internal successors, (2970), 15 states have internal predecessors, (2970), 0 states have call successors, (0), 0 states 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:17:23,502 INFO L175 Difference]: Start difference. First operand has 91 places, 94 transitions, 1359 flow. Second operand 14 states and 1188 transitions. [2023-01-27 18:17:23,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 192 transitions, 2862 flow [2023-01-27 18:17:23,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 192 transitions, 2701 flow, removed 80 selfloop flow, removed 5 redundant places. [2023-01-27 18:17:23,547 INFO L231 Difference]: Finished difference. Result has 104 places, 106 transitions, 1650 flow [2023-01-27 18:17:23,547 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=1288, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1650, PETRI_PLACES=104, PETRI_TRANSITIONS=106} [2023-01-27 18:17:23,548 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 69 predicate places. [2023-01-27 18:17:23,548 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 106 transitions, 1650 flow [2023-01-27 18:17:23,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 78.6) internal successors, (786), 10 states have internal predecessors, (786), 0 states have call successors, (0), 0 states 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:17:23,548 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:17:23,549 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:17:23,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-01-27 18:17:23,549 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:17:23,549 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:17:23,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1211780200, now seen corresponding path program 1 times [2023-01-27 18:17:23,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:17:23,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103668908] [2023-01-27 18:17:23,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:17:23,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:17:23,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:17:25,025 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:17:25,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:17:25,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103668908] [2023-01-27 18:17:25,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103668908] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:17:25,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:17:25,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-01-27 18:17:25,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362663106] [2023-01-27 18:17:25,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:17:25,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-01-27 18:17:25,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:17:25,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-01-27 18:17:25,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2023-01-27 18:17:25,027 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 198 [2023-01-27 18:17:25,028 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 106 transitions, 1650 flow. Second operand has 10 states, 10 states have (on average 81.6) internal successors, (816), 10 states have internal predecessors, (816), 0 states have call successors, (0), 0 states 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:17:25,028 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:17:25,028 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 198 [2023-01-27 18:17:25,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:17:25,656 INFO L130 PetriNetUnfolder]: 1042/1818 cut-off events. [2023-01-27 18:17:25,656 INFO L131 PetriNetUnfolder]: For 23201/23217 co-relation queries the response was YES. [2023-01-27 18:17:25,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11697 conditions, 1818 events. 1042/1818 cut-off events. For 23201/23217 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 9596 event pairs, 409 based on Foata normal form. 56/1868 useless extension candidates. Maximal degree in co-relation 11647. Up to 1435 conditions per place. [2023-01-27 18:17:25,670 INFO L137 encePairwiseOnDemand]: 190/198 looper letters, 97 selfloop transitions, 38 changer transitions 15/152 dead transitions. [2023-01-27 18:17:25,671 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 152 transitions, 2406 flow [2023-01-27 18:17:25,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-27 18:17:25,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-01-27 18:17:25,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 796 transitions. [2023-01-27 18:17:25,673 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44668911335578004 [2023-01-27 18:17:25,673 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 796 transitions. [2023-01-27 18:17:25,673 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 796 transitions. [2023-01-27 18:17:25,673 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:17:25,673 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 796 transitions. [2023-01-27 18:17:25,674 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 88.44444444444444) internal successors, (796), 9 states have internal predecessors, (796), 0 states have call successors, (0), 0 states 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:17:25,677 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 198.0) internal successors, (1980), 10 states have internal predecessors, (1980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:17:25,678 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 198.0) internal successors, (1980), 10 states have internal predecessors, (1980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:17:25,678 INFO L175 Difference]: Start difference. First operand has 104 places, 106 transitions, 1650 flow. Second operand 9 states and 796 transitions. [2023-01-27 18:17:25,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 152 transitions, 2406 flow [2023-01-27 18:17:25,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 152 transitions, 2311 flow, removed 41 selfloop flow, removed 7 redundant places. [2023-01-27 18:17:25,731 INFO L231 Difference]: Finished difference. Result has 104 places, 105 transitions, 1658 flow [2023-01-27 18:17:25,731 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=1575, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1658, PETRI_PLACES=104, PETRI_TRANSITIONS=105} [2023-01-27 18:17:25,732 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 69 predicate places. [2023-01-27 18:17:25,732 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 105 transitions, 1658 flow [2023-01-27 18:17:25,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 81.6) internal successors, (816), 10 states have internal predecessors, (816), 0 states have call successors, (0), 0 states 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:17:25,733 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:17:25,733 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:17:25,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-01-27 18:17:25,733 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:17:25,733 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:17:25,733 INFO L85 PathProgramCache]: Analyzing trace with hash -272155952, now seen corresponding path program 1 times [2023-01-27 18:17:25,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:17:25,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964761165] [2023-01-27 18:17:25,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:17:25,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:17:25,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:17:25,939 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:17:25,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:17:25,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964761165] [2023-01-27 18:17:25,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964761165] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:17:25,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:17:25,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-27 18:17:25,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399948812] [2023-01-27 18:17:25,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:17:25,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-27 18:17:25,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:17:25,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-27 18:17:25,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-27 18:17:25,944 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 198 [2023-01-27 18:17:25,944 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 105 transitions, 1658 flow. Second operand has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 0 states 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:17:25,944 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:17:25,944 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 198 [2023-01-27 18:17:25,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:17:26,147 INFO L130 PetriNetUnfolder]: 545/1023 cut-off events. [2023-01-27 18:17:26,147 INFO L131 PetriNetUnfolder]: For 14155/14181 co-relation queries the response was YES. [2023-01-27 18:17:26,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6499 conditions, 1023 events. 545/1023 cut-off events. For 14155/14181 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 5234 event pairs, 129 based on Foata normal form. 73/1091 useless extension candidates. Maximal degree in co-relation 6450. Up to 833 conditions per place. [2023-01-27 18:17:26,155 INFO L137 encePairwiseOnDemand]: 193/198 looper letters, 109 selfloop transitions, 4 changer transitions 1/121 dead transitions. [2023-01-27 18:17:26,155 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 121 transitions, 2046 flow [2023-01-27 18:17:26,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 18:17:26,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 18:17:26,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 296 transitions. [2023-01-27 18:17:26,156 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4983164983164983 [2023-01-27 18:17:26,156 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 296 transitions. [2023-01-27 18:17:26,156 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 296 transitions. [2023-01-27 18:17:26,156 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:17:26,156 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 296 transitions. [2023-01-27 18:17:26,157 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states 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:17:26,159 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:17:26,159 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:17:26,159 INFO L175 Difference]: Start difference. First operand has 104 places, 105 transitions, 1658 flow. Second operand 3 states and 296 transitions. [2023-01-27 18:17:26,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 121 transitions, 2046 flow [2023-01-27 18:17:26,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 121 transitions, 1901 flow, removed 32 selfloop flow, removed 9 redundant places. [2023-01-27 18:17:26,181 INFO L231 Difference]: Finished difference. Result has 96 places, 89 transitions, 1232 flow [2023-01-27 18:17:26,181 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=1206, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1232, PETRI_PLACES=96, PETRI_TRANSITIONS=89} [2023-01-27 18:17:26,182 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 61 predicate places. [2023-01-27 18:17:26,183 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 89 transitions, 1232 flow [2023-01-27 18:17:26,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 0 states 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:17:26,183 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:17:26,183 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:17:26,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-01-27 18:17:26,183 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:17:26,183 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:17:26,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1370010612, now seen corresponding path program 1 times [2023-01-27 18:17:26,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:17:26,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021105077] [2023-01-27 18:17:26,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:17:26,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:17:26,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:17:26,431 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:17:26,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:17:26,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021105077] [2023-01-27 18:17:26,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021105077] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:17:26,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:17:26,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 18:17:26,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863411622] [2023-01-27 18:17:26,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:17:26,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 18:17:26,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:17:26,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 18:17:26,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-27 18:17:26,433 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 198 [2023-01-27 18:17:26,433 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 89 transitions, 1232 flow. Second operand has 4 states, 4 states have (on average 91.0) internal successors, (364), 4 states have internal predecessors, (364), 0 states have call successors, (0), 0 states 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:17:26,433 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:17:26,433 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 198 [2023-01-27 18:17:26,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:17:26,577 INFO L130 PetriNetUnfolder]: 258/552 cut-off events. [2023-01-27 18:17:26,577 INFO L131 PetriNetUnfolder]: For 6605/6616 co-relation queries the response was YES. [2023-01-27 18:17:26,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3684 conditions, 552 events. 258/552 cut-off events. For 6605/6616 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2604 event pairs, 40 based on Foata normal form. 64/611 useless extension candidates. Maximal degree in co-relation 3638. Up to 219 conditions per place. [2023-01-27 18:17:26,581 INFO L137 encePairwiseOnDemand]: 193/198 looper letters, 111 selfloop transitions, 7 changer transitions 2/125 dead transitions. [2023-01-27 18:17:26,581 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 125 transitions, 1959 flow [2023-01-27 18:17:26,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-27 18:17:26,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-27 18:17:26,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 393 transitions. [2023-01-27 18:17:26,582 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4962121212121212 [2023-01-27 18:17:26,582 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 393 transitions. [2023-01-27 18:17:26,582 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 393 transitions. [2023-01-27 18:17:26,582 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:17:26,582 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 393 transitions. [2023-01-27 18:17:26,583 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 98.25) internal successors, (393), 4 states have internal predecessors, (393), 0 states have call successors, (0), 0 states 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:17:26,584 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 198.0) internal successors, (990), 5 states have internal predecessors, (990), 0 states have call successors, (0), 0 states 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:17:26,584 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 198.0) internal successors, (990), 5 states have internal predecessors, (990), 0 states have call successors, (0), 0 states 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:17:26,584 INFO L175 Difference]: Start difference. First operand has 96 places, 89 transitions, 1232 flow. Second operand 4 states and 393 transitions. [2023-01-27 18:17:26,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 125 transitions, 1959 flow [2023-01-27 18:17:26,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 125 transitions, 1888 flow, removed 25 selfloop flow, removed 3 redundant places. [2023-01-27 18:17:26,598 INFO L231 Difference]: Finished difference. Result has 97 places, 80 transitions, 1049 flow [2023-01-27 18:17:26,598 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=1009, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1049, PETRI_PLACES=97, PETRI_TRANSITIONS=80} [2023-01-27 18:17:26,599 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 62 predicate places. [2023-01-27 18:17:26,599 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 80 transitions, 1049 flow [2023-01-27 18:17:26,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 91.0) internal successors, (364), 4 states have internal predecessors, (364), 0 states have call successors, (0), 0 states 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:17:26,599 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:17:26,599 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:17:26,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-01-27 18:17:26,600 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:17:26,600 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:17:26,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1214453931, now seen corresponding path program 1 times [2023-01-27 18:17:26,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:17:26,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857764123] [2023-01-27 18:17:26,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:17:26,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:17:26,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:17:28,118 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:17:28,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:17:28,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857764123] [2023-01-27 18:17:28,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857764123] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:17:28,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:17:28,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-01-27 18:17:28,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076521762] [2023-01-27 18:17:28,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:17:28,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-01-27 18:17:28,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:17:28,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-01-27 18:17:28,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-01-27 18:17:28,121 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 198 [2023-01-27 18:17:28,122 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 80 transitions, 1049 flow. Second operand has 10 states, 10 states have (on average 81.9) internal successors, (819), 10 states have internal predecessors, (819), 0 states have call successors, (0), 0 states 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:17:28,122 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:17:28,122 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 198 [2023-01-27 18:17:28,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:17:28,811 INFO L130 PetriNetUnfolder]: 311/679 cut-off events. [2023-01-27 18:17:28,811 INFO L131 PetriNetUnfolder]: For 7932/7942 co-relation queries the response was YES. [2023-01-27 18:17:28,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4728 conditions, 679 events. 311/679 cut-off events. For 7932/7942 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3351 event pairs, 38 based on Foata normal form. 18/695 useless extension candidates. Maximal degree in co-relation 4682. Up to 377 conditions per place. [2023-01-27 18:17:28,816 INFO L137 encePairwiseOnDemand]: 188/198 looper letters, 85 selfloop transitions, 42 changer transitions 16/145 dead transitions. [2023-01-27 18:17:28,816 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 145 transitions, 2188 flow [2023-01-27 18:17:28,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-01-27 18:17:28,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-01-27 18:17:28,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1284 transitions. [2023-01-27 18:17:28,818 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43232323232323233 [2023-01-27 18:17:28,818 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1284 transitions. [2023-01-27 18:17:28,819 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1284 transitions. [2023-01-27 18:17:28,819 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:17:28,819 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1284 transitions. [2023-01-27 18:17:28,821 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 85.6) internal successors, (1284), 15 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states 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:17:28,824 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 198.0) internal successors, (3168), 16 states have internal predecessors, (3168), 0 states have call successors, (0), 0 states 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:17:28,825 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 198.0) internal successors, (3168), 16 states have internal predecessors, (3168), 0 states have call successors, (0), 0 states 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:17:28,825 INFO L175 Difference]: Start difference. First operand has 97 places, 80 transitions, 1049 flow. Second operand 15 states and 1284 transitions. [2023-01-27 18:17:28,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 145 transitions, 2188 flow [2023-01-27 18:17:28,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 145 transitions, 2111 flow, removed 18 selfloop flow, removed 3 redundant places. [2023-01-27 18:17:28,844 INFO L231 Difference]: Finished difference. Result has 116 places, 90 transitions, 1367 flow [2023-01-27 18:17:28,844 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=1014, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1367, PETRI_PLACES=116, PETRI_TRANSITIONS=90} [2023-01-27 18:17:28,844 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 81 predicate places. [2023-01-27 18:17:28,844 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 90 transitions, 1367 flow [2023-01-27 18:17:28,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 81.9) internal successors, (819), 10 states have internal predecessors, (819), 0 states have call successors, (0), 0 states 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:17:28,845 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:17:28,845 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:17:28,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-01-27 18:17:28,846 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:17:28,846 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:17:28,846 INFO L85 PathProgramCache]: Analyzing trace with hash -218599849, now seen corresponding path program 2 times [2023-01-27 18:17:28,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:17:28,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420968051] [2023-01-27 18:17:28,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:17:28,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:17:28,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:17:30,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:17:30,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:17:30,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420968051] [2023-01-27 18:17:30,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420968051] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:17:30,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:17:30,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-01-27 18:17:30,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343478692] [2023-01-27 18:17:30,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:17:30,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-01-27 18:17:30,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:17:30,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-01-27 18:17:30,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-01-27 18:17:30,768 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 198 [2023-01-27 18:17:30,769 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 90 transitions, 1367 flow. Second operand has 10 states, 10 states have (on average 77.9) internal successors, (779), 10 states have internal predecessors, (779), 0 states have call successors, (0), 0 states 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:17:30,769 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:17:30,769 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 198 [2023-01-27 18:17:30,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:17:31,160 INFO L130 PetriNetUnfolder]: 258/599 cut-off events. [2023-01-27 18:17:31,160 INFO L131 PetriNetUnfolder]: For 8449/8464 co-relation queries the response was YES. [2023-01-27 18:17:31,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4250 conditions, 599 events. 258/599 cut-off events. For 8449/8464 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2993 event pairs, 58 based on Foata normal form. 21/620 useless extension candidates. Maximal degree in co-relation 4197. Up to 349 conditions per place. [2023-01-27 18:17:31,163 INFO L137 encePairwiseOnDemand]: 190/198 looper letters, 84 selfloop transitions, 22 changer transitions 14/122 dead transitions. [2023-01-27 18:17:31,163 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 122 transitions, 1941 flow [2023-01-27 18:17:31,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 18:17:31,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 18:17:31,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 595 transitions. [2023-01-27 18:17:31,164 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4292929292929293 [2023-01-27 18:17:31,165 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 595 transitions. [2023-01-27 18:17:31,165 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 595 transitions. [2023-01-27 18:17:31,165 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:17:31,165 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 595 transitions. [2023-01-27 18:17:31,166 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 85.0) internal successors, (595), 7 states have internal predecessors, (595), 0 states have call successors, (0), 0 states 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:17:31,168 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 198.0) internal successors, (1584), 8 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:17:31,168 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 198.0) internal successors, (1584), 8 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:17:31,168 INFO L175 Difference]: Start difference. First operand has 116 places, 90 transitions, 1367 flow. Second operand 7 states and 595 transitions. [2023-01-27 18:17:31,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 122 transitions, 1941 flow [2023-01-27 18:17:31,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 122 transitions, 1767 flow, removed 84 selfloop flow, removed 5 redundant places. [2023-01-27 18:17:31,196 INFO L231 Difference]: Finished difference. Result has 117 places, 81 transitions, 1131 flow [2023-01-27 18:17:31,196 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=1211, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1131, PETRI_PLACES=117, PETRI_TRANSITIONS=81} [2023-01-27 18:17:31,196 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 82 predicate places. [2023-01-27 18:17:31,196 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 81 transitions, 1131 flow [2023-01-27 18:17:31,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 77.9) internal successors, (779), 10 states have internal predecessors, (779), 0 states have call successors, (0), 0 states 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:17:31,197 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:17:31,197 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:17:31,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-01-27 18:17:31,197 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:17:31,197 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:17:31,198 INFO L85 PathProgramCache]: Analyzing trace with hash 547497481, now seen corresponding path program 3 times [2023-01-27 18:17:31,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:17:31,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585620873] [2023-01-27 18:17:31,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:17:31,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:17:31,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:17:32,610 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:17:32,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:17:32,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585620873] [2023-01-27 18:17:32,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585620873] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:17:32,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:17:32,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-01-27 18:17:32,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120319409] [2023-01-27 18:17:32,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:17:32,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-01-27 18:17:32,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:17:32,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-01-27 18:17:32,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-01-27 18:17:32,612 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 198 [2023-01-27 18:17:32,613 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 81 transitions, 1131 flow. Second operand has 10 states, 10 states have (on average 80.9) internal successors, (809), 10 states have internal predecessors, (809), 0 states have call successors, (0), 0 states 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:17:32,613 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:17:32,613 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 198 [2023-01-27 18:17:32,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:17:32,957 INFO L130 PetriNetUnfolder]: 223/476 cut-off events. [2023-01-27 18:17:32,957 INFO L131 PetriNetUnfolder]: For 5451/5451 co-relation queries the response was YES. [2023-01-27 18:17:32,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3262 conditions, 476 events. 223/476 cut-off events. For 5451/5451 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2028 event pairs, 56 based on Foata normal form. 6/482 useless extension candidates. Maximal degree in co-relation 3209. Up to 385 conditions per place. [2023-01-27 18:17:32,961 INFO L137 encePairwiseOnDemand]: 189/198 looper letters, 68 selfloop transitions, 13 changer transitions 23/105 dead transitions. [2023-01-27 18:17:32,961 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 105 transitions, 1511 flow [2023-01-27 18:17:32,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-27 18:17:32,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-01-27 18:17:32,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 771 transitions. [2023-01-27 18:17:32,963 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43265993265993263 [2023-01-27 18:17:32,964 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 771 transitions. [2023-01-27 18:17:32,964 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 771 transitions. [2023-01-27 18:17:32,966 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:17:32,966 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 771 transitions. [2023-01-27 18:17:32,967 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 85.66666666666667) internal successors, (771), 9 states have internal predecessors, (771), 0 states have call successors, (0), 0 states 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:17:32,969 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 198.0) internal successors, (1980), 10 states have internal predecessors, (1980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:17:32,969 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 198.0) internal successors, (1980), 10 states have internal predecessors, (1980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:17:32,969 INFO L175 Difference]: Start difference. First operand has 117 places, 81 transitions, 1131 flow. Second operand 9 states and 771 transitions. [2023-01-27 18:17:32,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 105 transitions, 1511 flow [2023-01-27 18:17:32,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 105 transitions, 1339 flow, removed 51 selfloop flow, removed 14 redundant places. [2023-01-27 18:17:32,986 INFO L231 Difference]: Finished difference. Result has 112 places, 70 transitions, 902 flow [2023-01-27 18:17:32,986 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=979, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=902, PETRI_PLACES=112, PETRI_TRANSITIONS=70} [2023-01-27 18:17:32,986 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 77 predicate places. [2023-01-27 18:17:32,986 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 70 transitions, 902 flow [2023-01-27 18:17:32,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 80.9) internal successors, (809), 10 states have internal predecessors, (809), 0 states have call successors, (0), 0 states 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:17:32,987 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:17:32,987 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:17:32,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-01-27 18:17:32,987 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:17:32,988 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:17:32,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1423020015, now seen corresponding path program 1 times [2023-01-27 18:17:32,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:17:32,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481519006] [2023-01-27 18:17:32,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:17:32,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:17:33,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:17:33,995 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:17:33,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:17:33,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481519006] [2023-01-27 18:17:33,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481519006] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:17:33,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:17:33,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-01-27 18:17:33,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227221309] [2023-01-27 18:17:33,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:17:33,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-01-27 18:17:33,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:17:33,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-01-27 18:17:33,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2023-01-27 18:17:33,997 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 198 [2023-01-27 18:17:33,998 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 70 transitions, 902 flow. Second operand has 11 states, 11 states have (on average 81.72727272727273) internal successors, (899), 11 states have internal predecessors, (899), 0 states have call successors, (0), 0 states 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:17:33,998 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:17:33,998 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 198 [2023-01-27 18:17:33,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:17:34,370 INFO L130 PetriNetUnfolder]: 291/590 cut-off events. [2023-01-27 18:17:34,370 INFO L131 PetriNetUnfolder]: For 6046/6046 co-relation queries the response was YES. [2023-01-27 18:17:34,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3757 conditions, 590 events. 291/590 cut-off events. For 6046/6046 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2602 event pairs, 67 based on Foata normal form. 7/597 useless extension candidates. Maximal degree in co-relation 3706. Up to 236 conditions per place. [2023-01-27 18:17:34,374 INFO L137 encePairwiseOnDemand]: 190/198 looper letters, 85 selfloop transitions, 13 changer transitions 29/128 dead transitions. [2023-01-27 18:17:34,374 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 128 transitions, 1638 flow [2023-01-27 18:17:34,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-01-27 18:17:34,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-01-27 18:17:34,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 955 transitions. [2023-01-27 18:17:34,376 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43847566574839303 [2023-01-27 18:17:34,377 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 955 transitions. [2023-01-27 18:17:34,377 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 955 transitions. [2023-01-27 18:17:34,377 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:17:34,377 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 955 transitions. [2023-01-27 18:17:34,379 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 86.81818181818181) internal successors, (955), 11 states have internal predecessors, (955), 0 states have call successors, (0), 0 states 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:17:34,381 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 198.0) internal successors, (2376), 12 states have internal predecessors, (2376), 0 states have call successors, (0), 0 states 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:17:34,381 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 198.0) internal successors, (2376), 12 states have internal predecessors, (2376), 0 states have call successors, (0), 0 states 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:17:34,381 INFO L175 Difference]: Start difference. First operand has 112 places, 70 transitions, 902 flow. Second operand 11 states and 955 transitions. [2023-01-27 18:17:34,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 128 transitions, 1638 flow [2023-01-27 18:17:34,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 128 transitions, 1433 flow, removed 67 selfloop flow, removed 22 redundant places. [2023-01-27 18:17:34,397 INFO L231 Difference]: Finished difference. Result has 97 places, 64 transitions, 725 flow [2023-01-27 18:17:34,397 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=761, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=725, PETRI_PLACES=97, PETRI_TRANSITIONS=64} [2023-01-27 18:17:34,398 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 62 predicate places. [2023-01-27 18:17:34,398 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 64 transitions, 725 flow [2023-01-27 18:17:34,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 81.72727272727273) internal successors, (899), 11 states have internal predecessors, (899), 0 states have call successors, (0), 0 states 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:17:34,398 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:17:34,398 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:17:34,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-01-27 18:17:34,399 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:17:34,399 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:17:34,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1177964945, now seen corresponding path program 1 times [2023-01-27 18:17:34,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:17:34,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741045370] [2023-01-27 18:17:34,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:17:34,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:17:34,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:17:34,565 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:17:34,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:17:34,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741045370] [2023-01-27 18:17:34,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741045370] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:17:34,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:17:34,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 18:17:34,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2825601] [2023-01-27 18:17:34,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:17:34,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 18:17:34,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:17:34,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 18:17:34,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-01-27 18:17:34,567 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 198 [2023-01-27 18:17:34,567 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 64 transitions, 725 flow. Second operand has 5 states, 5 states have (on average 90.6) internal successors, (453), 5 states have internal predecessors, (453), 0 states have call successors, (0), 0 states 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:17:34,567 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:17:34,567 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 198 [2023-01-27 18:17:34,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:17:34,653 INFO L130 PetriNetUnfolder]: 135/281 cut-off events. [2023-01-27 18:17:34,653 INFO L131 PetriNetUnfolder]: For 2547/2551 co-relation queries the response was YES. [2023-01-27 18:17:34,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1669 conditions, 281 events. 135/281 cut-off events. For 2547/2551 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1075 event pairs, 16 based on Foata normal form. 22/301 useless extension candidates. Maximal degree in co-relation 1630. Up to 119 conditions per place. [2023-01-27 18:17:34,655 INFO L137 encePairwiseOnDemand]: 193/198 looper letters, 84 selfloop transitions, 10 changer transitions 0/97 dead transitions. [2023-01-27 18:17:34,655 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 97 transitions, 1322 flow [2023-01-27 18:17:34,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 18:17:34,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 18:17:34,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 479 transitions. [2023-01-27 18:17:34,656 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48383838383838385 [2023-01-27 18:17:34,656 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 479 transitions. [2023-01-27 18:17:34,656 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 479 transitions. [2023-01-27 18:17:34,656 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:17:34,656 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 479 transitions. [2023-01-27 18:17:34,657 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 95.8) internal successors, (479), 5 states have internal predecessors, (479), 0 states have call successors, (0), 0 states 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:17:34,658 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 198.0) internal successors, (1188), 6 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:17:34,659 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 198.0) internal successors, (1188), 6 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:17:34,659 INFO L175 Difference]: Start difference. First operand has 97 places, 64 transitions, 725 flow. Second operand 5 states and 479 transitions. [2023-01-27 18:17:34,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 97 transitions, 1322 flow [2023-01-27 18:17:34,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 97 transitions, 988 flow, removed 82 selfloop flow, removed 22 redundant places. [2023-01-27 18:17:34,665 INFO L231 Difference]: Finished difference. Result has 74 places, 56 transitions, 473 flow [2023-01-27 18:17:34,665 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=445, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=473, PETRI_PLACES=74, PETRI_TRANSITIONS=56} [2023-01-27 18:17:34,665 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 39 predicate places. [2023-01-27 18:17:34,665 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 56 transitions, 473 flow [2023-01-27 18:17:34,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.6) internal successors, (453), 5 states have internal predecessors, (453), 0 states have call successors, (0), 0 states 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:17:34,666 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:17:34,666 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:17:34,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-01-27 18:17:34,666 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:17:34,666 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:17:34,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1782618140, now seen corresponding path program 1 times [2023-01-27 18:17:34,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:17:34,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090588097] [2023-01-27 18:17:34,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:17:34,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:17:34,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:17:35,898 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:17:35,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:17:35,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090588097] [2023-01-27 18:17:35,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090588097] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:17:35,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:17:35,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-01-27 18:17:35,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454331086] [2023-01-27 18:17:35,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:17:35,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-01-27 18:17:35,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:17:35,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-01-27 18:17:35,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2023-01-27 18:17:35,901 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 198 [2023-01-27 18:17:35,901 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 56 transitions, 473 flow. Second operand has 12 states, 12 states have (on average 78.75) internal successors, (945), 12 states have internal predecessors, (945), 0 states have call successors, (0), 0 states 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:17:35,901 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:17:35,901 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 198 [2023-01-27 18:17:35,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:17:36,161 INFO L130 PetriNetUnfolder]: 148/313 cut-off events. [2023-01-27 18:17:36,161 INFO L131 PetriNetUnfolder]: For 1305/1305 co-relation queries the response was YES. [2023-01-27 18:17:36,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1544 conditions, 313 events. 148/313 cut-off events. For 1305/1305 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1140 event pairs, 28 based on Foata normal form. 1/314 useless extension candidates. Maximal degree in co-relation 1518. Up to 182 conditions per place. [2023-01-27 18:17:36,163 INFO L137 encePairwiseOnDemand]: 192/198 looper letters, 48 selfloop transitions, 11 changer transitions 26/86 dead transitions. [2023-01-27 18:17:36,163 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 86 transitions, 828 flow [2023-01-27 18:17:36,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 18:17:36,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 18:17:36,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 589 transitions. [2023-01-27 18:17:36,165 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.424963924963925 [2023-01-27 18:17:36,165 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 589 transitions. [2023-01-27 18:17:36,165 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 589 transitions. [2023-01-27 18:17:36,165 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:17:36,165 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 589 transitions. [2023-01-27 18:17:36,166 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 84.14285714285714) internal successors, (589), 7 states have internal predecessors, (589), 0 states have call successors, (0), 0 states 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:17:36,168 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 198.0) internal successors, (1584), 8 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:17:36,168 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 198.0) internal successors, (1584), 8 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:17:36,168 INFO L175 Difference]: Start difference. First operand has 74 places, 56 transitions, 473 flow. Second operand 7 states and 589 transitions. [2023-01-27 18:17:36,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 86 transitions, 828 flow [2023-01-27 18:17:36,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 86 transitions, 723 flow, removed 30 selfloop flow, removed 5 redundant places. [2023-01-27 18:17:36,173 INFO L231 Difference]: Finished difference. Result has 77 places, 48 transitions, 358 flow [2023-01-27 18:17:36,173 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=407, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=358, PETRI_PLACES=77, PETRI_TRANSITIONS=48} [2023-01-27 18:17:36,174 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 42 predicate places. [2023-01-27 18:17:36,174 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 48 transitions, 358 flow [2023-01-27 18:17:36,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 78.75) internal successors, (945), 12 states have internal predecessors, (945), 0 states have call successors, (0), 0 states 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:17:36,174 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:17:36,174 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:17:36,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-01-27 18:17:36,175 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:17:36,175 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:17:36,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1247472168, now seen corresponding path program 2 times [2023-01-27 18:17:36,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:17:36,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609095347] [2023-01-27 18:17:36,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:17:36,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:17:36,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:17:37,020 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:17:37,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:17:37,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609095347] [2023-01-27 18:17:37,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609095347] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:17:37,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:17:37,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-01-27 18:17:37,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550896206] [2023-01-27 18:17:37,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:17:37,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-01-27 18:17:37,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:17:37,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-01-27 18:17:37,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-01-27 18:17:37,022 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 198 [2023-01-27 18:17:37,023 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 48 transitions, 358 flow. Second operand has 10 states, 10 states have (on average 75.2) internal successors, (752), 10 states have internal predecessors, (752), 0 states have call successors, (0), 0 states 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:17:37,023 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:17:37,023 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 198 [2023-01-27 18:17:37,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:17:37,313 INFO L130 PetriNetUnfolder]: 118/258 cut-off events. [2023-01-27 18:17:37,313 INFO L131 PetriNetUnfolder]: For 769/769 co-relation queries the response was YES. [2023-01-27 18:17:37,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1124 conditions, 258 events. 118/258 cut-off events. For 769/769 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 935 event pairs, 19 based on Foata normal form. 1/259 useless extension candidates. Maximal degree in co-relation 1100. Up to 65 conditions per place. [2023-01-27 18:17:37,315 INFO L137 encePairwiseOnDemand]: 188/198 looper letters, 63 selfloop transitions, 17 changer transitions 16/96 dead transitions. [2023-01-27 18:17:37,315 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 96 transitions, 799 flow [2023-01-27 18:17:37,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-01-27 18:17:37,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-01-27 18:17:37,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 861 transitions. [2023-01-27 18:17:37,317 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3953168044077135 [2023-01-27 18:17:37,317 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 861 transitions. [2023-01-27 18:17:37,317 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 861 transitions. [2023-01-27 18:17:37,318 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:17:37,318 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 861 transitions. [2023-01-27 18:17:37,319 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 78.27272727272727) internal successors, (861), 11 states have internal predecessors, (861), 0 states have call successors, (0), 0 states 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:17:37,321 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 198.0) internal successors, (2376), 12 states have internal predecessors, (2376), 0 states have call successors, (0), 0 states 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:17:37,322 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 198.0) internal successors, (2376), 12 states have internal predecessors, (2376), 0 states have call successors, (0), 0 states 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:17:37,322 INFO L175 Difference]: Start difference. First operand has 77 places, 48 transitions, 358 flow. Second operand 11 states and 861 transitions. [2023-01-27 18:17:37,322 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 96 transitions, 799 flow [2023-01-27 18:17:37,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 96 transitions, 722 flow, removed 10 selfloop flow, removed 16 redundant places. [2023-01-27 18:17:37,326 INFO L231 Difference]: Finished difference. Result has 69 places, 47 transitions, 309 flow [2023-01-27 18:17:37,326 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=309, PETRI_PLACES=69, PETRI_TRANSITIONS=47} [2023-01-27 18:17:37,327 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 34 predicate places. [2023-01-27 18:17:37,327 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 47 transitions, 309 flow [2023-01-27 18:17:37,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 75.2) internal successors, (752), 10 states have internal predecessors, (752), 0 states have call successors, (0), 0 states 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:17:37,327 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:17:37,327 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:17:37,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-01-27 18:17:37,327 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:17:37,328 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:17:37,328 INFO L85 PathProgramCache]: Analyzing trace with hash -151216652, now seen corresponding path program 3 times [2023-01-27 18:17:37,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:17:37,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582087893] [2023-01-27 18:17:37,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:17:37,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:17:37,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-27 18:17:37,366 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-27 18:17:37,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-27 18:17:37,429 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-27 18:17:37,429 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-27 18:17:37,430 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-01-27 18:17:37,431 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-01-27 18:17:37,431 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-01-27 18:17:37,431 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-01-27 18:17:37,431 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-01-27 18:17:37,432 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-01-27 18:17:37,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-01-27 18:17:37,432 INFO L445 BasicCegarLoop]: Path program histogram: [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:17:37,436 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-27 18:17:37,436 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-27 18:17:37,502 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.01 06:17:37 BasicIcfg [2023-01-27 18:17:37,502 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-27 18:17:37,503 INFO L158 Benchmark]: Toolchain (without parser) took 39196.02ms. Allocated memory was 352.3MB in the beginning and 912.3MB in the end (delta: 559.9MB). Free memory was 309.3MB in the beginning and 559.2MB in the end (delta: -250.0MB). Peak memory consumption was 312.9MB. Max. memory is 16.0GB. [2023-01-27 18:17:37,503 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 255.9MB. Free memory is still 213.4MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-27 18:17:37,503 INFO L158 Benchmark]: CACSL2BoogieTranslator took 545.34ms. Allocated memory is still 352.3MB. Free memory was 309.3MB in the beginning and 283.6MB in the end (delta: 25.7MB). Peak memory consumption was 27.3MB. Max. memory is 16.0GB. [2023-01-27 18:17:37,503 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.12ms. Allocated memory is still 352.3MB. Free memory was 283.6MB in the beginning and 280.8MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-27 18:17:37,503 INFO L158 Benchmark]: Boogie Preprocessor took 46.98ms. Allocated memory is still 352.3MB. Free memory was 280.8MB in the beginning and 278.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-27 18:17:37,504 INFO L158 Benchmark]: RCFGBuilder took 845.82ms. Allocated memory is still 352.3MB. Free memory was 278.7MB in the beginning and 290.7MB in the end (delta: -12.1MB). Peak memory consumption was 23.8MB. Max. memory is 16.0GB. [2023-01-27 18:17:37,504 INFO L158 Benchmark]: TraceAbstraction took 37704.64ms. Allocated memory was 352.3MB in the beginning and 912.3MB in the end (delta: 559.9MB). Free memory was 289.9MB in the beginning and 559.2MB in the end (delta: -269.3MB). Peak memory consumption was 291.2MB. Max. memory is 16.0GB. [2023-01-27 18:17:37,505 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.13ms. Allocated memory is still 255.9MB. Free memory is still 213.4MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 545.34ms. Allocated memory is still 352.3MB. Free memory was 309.3MB in the beginning and 283.6MB in the end (delta: 25.7MB). Peak memory consumption was 27.3MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 48.12ms. Allocated memory is still 352.3MB. Free memory was 283.6MB in the beginning and 280.8MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 46.98ms. Allocated memory is still 352.3MB. Free memory was 280.8MB in the beginning and 278.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 845.82ms. Allocated memory is still 352.3MB. Free memory was 278.7MB in the beginning and 290.7MB in the end (delta: -12.1MB). Peak memory consumption was 23.8MB. Max. memory is 16.0GB. * TraceAbstraction took 37704.64ms. Allocated memory was 352.3MB in the beginning and 912.3MB in the end (delta: 559.9MB). Free memory was 289.9MB in the beginning and 559.2MB in the end (delta: -269.3MB). Peak memory consumption was 291.2MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.4s, 112 PlacesBefore, 35 PlacesAfterwards, 104 TransitionsBefore, 26 TransitionsAfterwards, 1920 CoEnabledTransitionPairs, 6 FixpointIterations, 37 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 91 TotalNumberOfCompositions, 5019 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1714, independent: 1554, independent conditional: 0, independent unconditional: 1554, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 963, independent: 937, independent conditional: 0, independent unconditional: 937, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1714, independent: 617, independent conditional: 0, independent unconditional: 617, dependent: 134, dependent conditional: 0, dependent unconditional: 134, unknown: 963, unknown conditional: 0, unknown unconditional: 963] , Statistics on independence cache: Total cache size (in pairs): 67, Positive cache size: 52, Positive conditional cache size: 0, Positive unconditional cache size: 52, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L719] 0 int y = 0; [L720] 0 _Bool y$flush_delayed; [L721] 0 int y$mem_tmp; [L722] 0 _Bool y$r_buff0_thd0; [L723] 0 _Bool y$r_buff0_thd1; [L724] 0 _Bool y$r_buff0_thd2; [L725] 0 _Bool y$r_buff0_thd3; [L726] 0 _Bool y$r_buff1_thd0; [L727] 0 _Bool y$r_buff1_thd1; [L728] 0 _Bool y$r_buff1_thd2; [L729] 0 _Bool y$r_buff1_thd3; [L730] 0 _Bool y$read_delayed; [L731] 0 int *y$read_delayed_var; [L732] 0 int y$w_buff0; [L733] 0 _Bool y$w_buff0_used; [L734] 0 int y$w_buff1; [L735] 0 _Bool y$w_buff1_used; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L844] 0 pthread_t t1873; [L845] FCALL, FORK 0 pthread_create(&t1873, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1873, ((void *)0), P0, ((void *)0))=-2, t1873={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L846] 0 pthread_t t1874; [L847] FCALL, FORK 0 pthread_create(&t1874, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1874, ((void *)0), P1, ((void *)0))=-1, t1873={5:0}, t1874={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L848] 0 pthread_t t1875; [L849] FCALL, FORK 0 pthread_create(&t1875, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1875, ((void *)0), P2, ((void *)0))=0, t1873={5:0}, t1874={6:0}, t1875={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L741] 1 y$w_buff1 = y$w_buff0 [L742] 1 y$w_buff0 = 2 [L743] 1 y$w_buff1_used = y$w_buff0_used [L744] 1 y$w_buff0_used = (_Bool)1 [L745] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L745] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L746] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L747] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L748] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L749] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L750] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L770] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L776] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L777] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L778] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L779] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L780] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 2 return 0; [L790] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L791] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L792] 3 y$flush_delayed = weak$$choice2 [L793] 3 y$mem_tmp = y [L794] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L795] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L796] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L797] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L798] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L799] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L800] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] 3 __unbuffered_p2_EAX = y [L802] 3 y = y$flush_delayed ? y$mem_tmp : y [L803] 3 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L806] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 3 y$flush_delayed = weak$$choice2 [L809] 3 y$mem_tmp = y [L810] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L811] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L812] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L813] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L814] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L815] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L816] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L817] 3 __unbuffered_p2_EBX = y [L818] 3 y = y$flush_delayed ? y$mem_tmp : y [L819] 3 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, 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$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L756] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L757] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L758] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L759] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L760] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L822] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L823] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L824] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L825] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L826] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, 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$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L765] 1 return 0; [L829] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L831] 3 return 0; [L851] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L853] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L853] RET 0 assume_abort_if_not(main$tmp_guard0) [L855] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L856] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L857] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L858] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L859] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1873={5:0}, t1874={6:0}, t1875={3:0}, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L862] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L863] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L864] 0 y$flush_delayed = weak$$choice2 [L865] 0 y$mem_tmp = y [L866] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L867] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L868] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L869] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L870] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L871] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L872] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L873] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) [L874] 0 y = y$flush_delayed ? y$mem_tmp : y [L875] 0 y$flush_delayed = (_Bool)0 [L877] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 849]: 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: 847]: 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: 845]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 134 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 37.5s, OverallIterations: 25, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 12.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1134 SdHoareTripleChecker+Valid, 4.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1134 mSDsluCounter, 168 SdHoareTripleChecker+Invalid, 3.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 109 mSDsCounter, 499 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4117 IncrementalHoareTripleChecker+Invalid, 4616 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 499 mSolverCounterUnsat, 59 mSDtfsCounter, 4117 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 223 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1658occurred in iteration=15, InterpolantAutomatonStates: 191, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 20.0s InterpolantComputationTime, 395 NumberOfCodeBlocks, 395 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 349 ConstructedInterpolants, 0 QuantifiedInterpolants, 5480 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 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:17:37,519 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...