/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/mix018.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-27 18:07:43,158 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-27 18:07:43,160 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-27 18:07:43,185 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-27 18:07:43,185 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-27 18:07:43,187 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-27 18:07:43,190 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-27 18:07:43,192 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-27 18:07:43,194 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-27 18:07:43,198 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-27 18:07:43,200 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-27 18:07:43,201 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-27 18:07:43,201 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-27 18:07:43,203 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-27 18:07:43,204 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-27 18:07:43,205 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-27 18:07:43,205 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-27 18:07:43,206 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-27 18:07:43,207 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-27 18:07:43,212 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-27 18:07:43,213 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-27 18:07:43,213 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-27 18:07:43,214 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-27 18:07:43,215 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-27 18:07:43,218 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-27 18:07:43,218 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-27 18:07:43,218 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-27 18:07:43,220 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-27 18:07:43,220 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-27 18:07:43,220 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-27 18:07:43,221 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-27 18:07:43,221 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-27 18:07:43,222 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-27 18:07:43,223 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-27 18:07:43,223 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-27 18:07:43,223 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-27 18:07:43,224 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-27 18:07:43,224 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-27 18:07:43,224 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-27 18:07:43,225 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-27 18:07:43,225 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-27 18:07:43,226 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:07:43,254 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-27 18:07:43,254 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-27 18:07:43,255 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-27 18:07:43,255 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-27 18:07:43,255 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-27 18:07:43,256 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-27 18:07:43,256 INFO L138 SettingsManager]: * Use SBE=true [2023-01-27 18:07:43,256 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-27 18:07:43,256 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-27 18:07:43,256 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-27 18:07:43,257 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-27 18:07:43,257 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-27 18:07:43,257 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-27 18:07:43,257 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-27 18:07:43,257 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-27 18:07:43,257 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-27 18:07:43,257 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-27 18:07:43,257 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-27 18:07:43,257 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-27 18:07:43,257 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-27 18:07:43,257 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-27 18:07:43,258 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-27 18:07:43,258 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-27 18:07:43,258 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 18:07:43,258 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-27 18:07:43,258 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-27 18:07:43,258 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-27 18:07:43,258 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-27 18:07:43,258 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-27 18:07:43,258 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-27 18:07:43,258 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-27 18:07:43,258 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:07:43,430 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-27 18:07:43,457 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-27 18:07:43,459 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-27 18:07:43,459 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-27 18:07:43,461 INFO L275 PluginConnector]: CDTParser initialized [2023-01-27 18:07:43,462 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix018.opt.i [2023-01-27 18:07:44,472 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-27 18:07:44,724 INFO L351 CDTParser]: Found 1 translation units. [2023-01-27 18:07:44,725 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix018.opt.i [2023-01-27 18:07:44,745 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98c6faaba/b26ada48eb5840b9958a67fd07e3eeec/FLAG719c49a92 [2023-01-27 18:07:44,756 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98c6faaba/b26ada48eb5840b9958a67fd07e3eeec [2023-01-27 18:07:44,758 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-27 18:07:44,759 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-27 18:07:44,760 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-27 18:07:44,760 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-27 18:07:44,762 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-27 18:07:44,762 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 06:07:44" (1/1) ... [2023-01-27 18:07:44,763 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7631ff11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:07:44, skipping insertion in model container [2023-01-27 18:07:44,763 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 06:07:44" (1/1) ... [2023-01-27 18:07:44,767 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-27 18:07:44,815 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-27 18:07:44,949 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/mix018.opt.i[944,957] [2023-01-27 18:07:45,051 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 18:07:45,058 INFO L203 MainTranslator]: Completed pre-run [2023-01-27 18:07:45,065 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/mix018.opt.i[944,957] [2023-01-27 18:07:45,097 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 18:07:45,119 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-27 18:07:45,119 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-27 18:07:45,124 INFO L208 MainTranslator]: Completed translation [2023-01-27 18:07:45,124 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:07:45 WrapperNode [2023-01-27 18:07:45,124 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-27 18:07:45,125 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-27 18:07:45,125 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-27 18:07:45,125 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-27 18:07:45,130 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:07:45" (1/1) ... [2023-01-27 18:07:45,140 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:07:45" (1/1) ... [2023-01-27 18:07:45,158 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 165 [2023-01-27 18:07:45,158 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-27 18:07:45,158 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-27 18:07:45,159 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-27 18:07:45,159 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-27 18:07:45,165 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:07:45" (1/1) ... [2023-01-27 18:07:45,165 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:07:45" (1/1) ... [2023-01-27 18:07:45,167 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:07:45" (1/1) ... [2023-01-27 18:07:45,167 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:07:45" (1/1) ... [2023-01-27 18:07:45,172 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:07:45" (1/1) ... [2023-01-27 18:07:45,174 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:07:45" (1/1) ... [2023-01-27 18:07:45,175 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:07:45" (1/1) ... [2023-01-27 18:07:45,176 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:07:45" (1/1) ... [2023-01-27 18:07:45,178 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-27 18:07:45,179 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-27 18:07:45,179 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-27 18:07:45,179 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-27 18:07:45,179 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:07:45" (1/1) ... [2023-01-27 18:07:45,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 18:07:45,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 18:07:45,222 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:07:45,226 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:07:45,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-27 18:07:45,250 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-27 18:07:45,251 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-27 18:07:45,251 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-27 18:07:45,251 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-27 18:07:45,251 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-01-27 18:07:45,251 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-01-27 18:07:45,251 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-01-27 18:07:45,251 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-01-27 18:07:45,251 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-01-27 18:07:45,251 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-01-27 18:07:45,251 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-01-27 18:07:45,251 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-01-27 18:07:45,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-27 18:07:45,252 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-27 18:07:45,252 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-27 18:07:45,252 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-27 18:07:45,253 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:07:45,343 INFO L236 CfgBuilder]: Building ICFG [2023-01-27 18:07:45,345 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-27 18:07:45,568 INFO L277 CfgBuilder]: Performing block encoding [2023-01-27 18:07:45,691 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-27 18:07:45,691 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-01-27 18:07:45,693 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 06:07:45 BoogieIcfgContainer [2023-01-27 18:07:45,693 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-27 18:07:45,694 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-27 18:07:45,694 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-27 18:07:45,696 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-27 18:07:45,696 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 06:07:44" (1/3) ... [2023-01-27 18:07:45,697 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cc770de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 06:07:45, skipping insertion in model container [2023-01-27 18:07:45,697 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:07:45" (2/3) ... [2023-01-27 18:07:45,697 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cc770de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 06:07:45, skipping insertion in model container [2023-01-27 18:07:45,697 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 06:07:45" (3/3) ... [2023-01-27 18:07:45,698 INFO L112 eAbstractionObserver]: Analyzing ICFG mix018.opt.i [2023-01-27 18:07:45,710 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-27 18:07:45,710 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-01-27 18:07:45,710 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-27 18:07:45,753 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-27 18:07:45,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 128 transitions, 276 flow [2023-01-27 18:07:45,809 INFO L130 PetriNetUnfolder]: 2/124 cut-off events. [2023-01-27 18:07:45,809 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:07:45,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 124 events. 2/124 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 64 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 85. Up to 2 conditions per place. [2023-01-27 18:07:45,814 INFO L82 GeneralOperation]: Start removeDead. Operand has 139 places, 128 transitions, 276 flow [2023-01-27 18:07:45,816 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 135 places, 124 transitions, 260 flow [2023-01-27 18:07:45,819 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-27 18:07:45,824 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 135 places, 124 transitions, 260 flow [2023-01-27 18:07:45,826 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 135 places, 124 transitions, 260 flow [2023-01-27 18:07:45,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 124 transitions, 260 flow [2023-01-27 18:07:45,845 INFO L130 PetriNetUnfolder]: 2/124 cut-off events. [2023-01-27 18:07:45,845 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:07:45,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 124 events. 2/124 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 64 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 85. Up to 2 conditions per place. [2023-01-27 18:07:45,847 INFO L119 LiptonReduction]: Number of co-enabled transitions 2718 [2023-01-27 18:07:48,957 INFO L134 LiptonReduction]: Checked pairs total: 6842 [2023-01-27 18:07:48,957 INFO L136 LiptonReduction]: Total number of compositions: 107 [2023-01-27 18:07:48,967 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-27 18:07:48,972 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;@5789d0cf, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-27 18:07:48,972 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-01-27 18:07:48,977 INFO L130 PetriNetUnfolder]: 0/17 cut-off events. [2023-01-27 18:07:48,977 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:07:48,977 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:07:48,978 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:07:48,978 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:07:48,982 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:07:48,982 INFO L85 PathProgramCache]: Analyzing trace with hash 225750539, now seen corresponding path program 1 times [2023-01-27 18:07:48,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:07:48,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582283439] [2023-01-27 18:07:48,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:07:48,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:07:49,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:07:49,295 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:07:49,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:07:49,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582283439] [2023-01-27 18:07:49,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582283439] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:07:49,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:07:49,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-27 18:07:49,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660855635] [2023-01-27 18:07:49,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:07:49,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-27 18:07:49,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:07:49,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-27 18:07:49,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-27 18:07:49,321 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 235 [2023-01-27 18:07:49,323 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 29 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:49,324 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:07:49,324 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 235 [2023-01-27 18:07:49,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:07:49,804 INFO L130 PetriNetUnfolder]: 3113/4511 cut-off events. [2023-01-27 18:07:49,804 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2023-01-27 18:07:49,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8905 conditions, 4511 events. 3113/4511 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 24008 event pairs, 593 based on Foata normal form. 0/4327 useless extension candidates. Maximal degree in co-relation 8893. Up to 3385 conditions per place. [2023-01-27 18:07:49,833 INFO L137 encePairwiseOnDemand]: 231/235 looper letters, 32 selfloop transitions, 2 changer transitions 2/39 dead transitions. [2023-01-27 18:07:49,833 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 39 transitions, 162 flow [2023-01-27 18:07:49,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 18:07:49,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 18:07:49,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 381 transitions. [2023-01-27 18:07:49,845 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5404255319148936 [2023-01-27 18:07:49,845 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 381 transitions. [2023-01-27 18:07:49,846 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 381 transitions. [2023-01-27 18:07:49,848 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:07:49,849 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 381 transitions. [2023-01-27 18:07:49,853 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:49,857 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:49,858 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:49,859 INFO L175 Difference]: Start difference. First operand has 41 places, 29 transitions, 70 flow. Second operand 3 states and 381 transitions. [2023-01-27 18:07:49,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 39 transitions, 162 flow [2023-01-27 18:07:49,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 39 transitions, 158 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-01-27 18:07:49,865 INFO L231 Difference]: Finished difference. Result has 38 places, 26 transitions, 64 flow [2023-01-27 18:07:49,866 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=38, PETRI_TRANSITIONS=26} [2023-01-27 18:07:49,870 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -3 predicate places. [2023-01-27 18:07:49,870 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 26 transitions, 64 flow [2023-01-27 18:07:49,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:49,871 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:07:49,872 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:07:49,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-27 18:07:49,872 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:07:49,878 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:07:49,879 INFO L85 PathProgramCache]: Analyzing trace with hash -582167020, now seen corresponding path program 1 times [2023-01-27 18:07:49,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:07:49,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074485227] [2023-01-27 18:07:49,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:07:49,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:07:49,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:07:50,101 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:07:50,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:07:50,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074485227] [2023-01-27 18:07:50,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074485227] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:07:50,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:07:50,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-27 18:07:50,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674625818] [2023-01-27 18:07:50,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:07:50,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 18:07:50,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:07:50,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 18:07:50,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-27 18:07:50,104 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 235 [2023-01-27 18:07:50,105 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 26 transitions, 64 flow. Second operand has 4 states, 4 states have (on average 106.0) internal successors, (424), 4 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:50,105 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:07:50,105 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 235 [2023-01-27 18:07:50,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:07:51,061 INFO L130 PetriNetUnfolder]: 9425/13038 cut-off events. [2023-01-27 18:07:51,062 INFO L131 PetriNetUnfolder]: For 500/500 co-relation queries the response was YES. [2023-01-27 18:07:51,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26854 conditions, 13038 events. 9425/13038 cut-off events. For 500/500 co-relation queries the response was YES. Maximal size of possible extension queue 480. Compared 66800 event pairs, 3245 based on Foata normal form. 568/13606 useless extension candidates. Maximal degree in co-relation 26844. Up to 8141 conditions per place. [2023-01-27 18:07:51,130 INFO L137 encePairwiseOnDemand]: 226/235 looper letters, 40 selfloop transitions, 7 changer transitions 29/76 dead transitions. [2023-01-27 18:07:51,131 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 76 transitions, 326 flow [2023-01-27 18:07:51,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 18:07:51,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 18:07:51,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 593 transitions. [2023-01-27 18:07:51,133 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5046808510638298 [2023-01-27 18:07:51,133 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 593 transitions. [2023-01-27 18:07:51,133 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 593 transitions. [2023-01-27 18:07:51,133 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:07:51,134 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 593 transitions. [2023-01-27 18:07:51,135 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 118.6) internal successors, (593), 5 states have internal predecessors, (593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:51,136 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:51,137 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:51,137 INFO L175 Difference]: Start difference. First operand has 38 places, 26 transitions, 64 flow. Second operand 5 states and 593 transitions. [2023-01-27 18:07:51,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 76 transitions, 326 flow [2023-01-27 18:07:51,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 76 transitions, 316 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-27 18:07:51,144 INFO L231 Difference]: Finished difference. Result has 43 places, 32 transitions, 130 flow [2023-01-27 18:07:51,144 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=130, PETRI_PLACES=43, PETRI_TRANSITIONS=32} [2023-01-27 18:07:51,144 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 2 predicate places. [2023-01-27 18:07:51,144 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 32 transitions, 130 flow [2023-01-27 18:07:51,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 106.0) internal successors, (424), 4 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:51,145 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:07:51,145 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:07:51,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-27 18:07:51,145 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:07:51,146 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:07:51,146 INFO L85 PathProgramCache]: Analyzing trace with hash -867327477, now seen corresponding path program 1 times [2023-01-27 18:07:51,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:07:51,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778377592] [2023-01-27 18:07:51,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:07:51,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:07:51,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:07:51,307 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:07:51,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:07:51,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778377592] [2023-01-27 18:07:51,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778377592] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:07:51,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:07:51,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-27 18:07:51,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708989792] [2023-01-27 18:07:51,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:07:51,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 18:07:51,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:07:51,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 18:07:51,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-27 18:07:51,310 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 235 [2023-01-27 18:07:51,311 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 32 transitions, 130 flow. Second operand has 4 states, 4 states have (on average 114.25) internal successors, (457), 4 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:51,311 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:07:51,311 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 235 [2023-01-27 18:07:51,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:07:51,982 INFO L130 PetriNetUnfolder]: 6051/8856 cut-off events. [2023-01-27 18:07:51,982 INFO L131 PetriNetUnfolder]: For 6283/6549 co-relation queries the response was YES. [2023-01-27 18:07:52,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23660 conditions, 8856 events. 6051/8856 cut-off events. For 6283/6549 co-relation queries the response was YES. Maximal size of possible extension queue 418. Compared 49947 event pairs, 2041 based on Foata normal form. 484/9142 useless extension candidates. Maximal degree in co-relation 23646. Up to 4995 conditions per place. [2023-01-27 18:07:52,042 INFO L137 encePairwiseOnDemand]: 231/235 looper letters, 34 selfloop transitions, 3 changer transitions 24/67 dead transitions. [2023-01-27 18:07:52,042 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 67 transitions, 380 flow [2023-01-27 18:07:52,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 18:07:52,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 18:07:52,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 608 transitions. [2023-01-27 18:07:52,045 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5174468085106383 [2023-01-27 18:07:52,046 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 608 transitions. [2023-01-27 18:07:52,046 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 608 transitions. [2023-01-27 18:07:52,046 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:07:52,046 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 608 transitions. [2023-01-27 18:07:52,047 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 121.6) internal successors, (608), 5 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:52,049 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:52,049 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:52,049 INFO L175 Difference]: Start difference. First operand has 43 places, 32 transitions, 130 flow. Second operand 5 states and 608 transitions. [2023-01-27 18:07:52,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 67 transitions, 380 flow [2023-01-27 18:07:52,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 67 transitions, 350 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-01-27 18:07:52,070 INFO L231 Difference]: Finished difference. Result has 46 places, 32 transitions, 129 flow [2023-01-27 18:07:52,070 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=129, PETRI_PLACES=46, PETRI_TRANSITIONS=32} [2023-01-27 18:07:52,071 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 5 predicate places. [2023-01-27 18:07:52,074 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 32 transitions, 129 flow [2023-01-27 18:07:52,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 114.25) internal successors, (457), 4 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:52,075 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:07:52,075 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:07:52,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-27 18:07:52,075 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:07:52,076 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:07:52,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1455448843, now seen corresponding path program 1 times [2023-01-27 18:07:52,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:07:52,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048475683] [2023-01-27 18:07:52,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:07:52,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:07:52,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:07:52,288 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:07:52,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:07:52,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048475683] [2023-01-27 18:07:52,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048475683] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:07:52,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:07:52,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 18:07:52,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785092145] [2023-01-27 18:07:52,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:07:52,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 18:07:52,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:07:52,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 18:07:52,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-27 18:07:52,290 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 235 [2023-01-27 18:07:52,291 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 32 transitions, 129 flow. Second operand has 5 states, 5 states have (on average 105.8) internal successors, (529), 5 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:52,291 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:07:52,291 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 235 [2023-01-27 18:07:52,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:07:53,189 INFO L130 PetriNetUnfolder]: 7483/10444 cut-off events. [2023-01-27 18:07:53,189 INFO L131 PetriNetUnfolder]: For 7554/7554 co-relation queries the response was YES. [2023-01-27 18:07:53,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28491 conditions, 10444 events. 7483/10444 cut-off events. For 7554/7554 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 52511 event pairs, 1905 based on Foata normal form. 380/10824 useless extension candidates. Maximal degree in co-relation 28474. Up to 6417 conditions per place. [2023-01-27 18:07:53,228 INFO L137 encePairwiseOnDemand]: 226/235 looper letters, 57 selfloop transitions, 11 changer transitions 32/100 dead transitions. [2023-01-27 18:07:53,229 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 100 transitions, 555 flow [2023-01-27 18:07:53,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 18:07:53,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 18:07:53,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 820 transitions. [2023-01-27 18:07:53,231 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49848024316109424 [2023-01-27 18:07:53,231 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 820 transitions. [2023-01-27 18:07:53,231 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 820 transitions. [2023-01-27 18:07:53,231 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:07:53,231 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 820 transitions. [2023-01-27 18:07:53,233 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 117.14285714285714) internal successors, (820), 7 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:53,235 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 235.0) internal successors, (1880), 8 states have internal predecessors, (1880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:53,235 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 235.0) internal successors, (1880), 8 states have internal predecessors, (1880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:53,236 INFO L175 Difference]: Start difference. First operand has 46 places, 32 transitions, 129 flow. Second operand 7 states and 820 transitions. [2023-01-27 18:07:53,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 100 transitions, 555 flow [2023-01-27 18:07:53,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 100 transitions, 535 flow, removed 5 selfloop flow, removed 5 redundant places. [2023-01-27 18:07:53,251 INFO L231 Difference]: Finished difference. Result has 50 places, 37 transitions, 193 flow [2023-01-27 18:07:53,251 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=193, PETRI_PLACES=50, PETRI_TRANSITIONS=37} [2023-01-27 18:07:53,251 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 9 predicate places. [2023-01-27 18:07:53,251 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 37 transitions, 193 flow [2023-01-27 18:07:53,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 105.8) internal successors, (529), 5 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:53,252 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:07:53,252 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:07:53,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-27 18:07:53,252 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:07:53,252 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:07:53,252 INFO L85 PathProgramCache]: Analyzing trace with hash -2125053244, now seen corresponding path program 1 times [2023-01-27 18:07:53,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:07:53,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192502723] [2023-01-27 18:07:53,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:07:53,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:07:53,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:07:53,394 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:07:53,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:07:53,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192502723] [2023-01-27 18:07:53,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192502723] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:07:53,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:07:53,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 18:07:53,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851878550] [2023-01-27 18:07:53,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:07:53,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 18:07:53,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:07:53,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 18:07:53,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-27 18:07:53,396 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 235 [2023-01-27 18:07:53,396 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 37 transitions, 193 flow. Second operand has 4 states, 4 states have (on average 110.75) internal successors, (443), 4 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:53,396 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:07:53,396 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 235 [2023-01-27 18:07:53,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:07:53,898 INFO L130 PetriNetUnfolder]: 4552/6701 cut-off events. [2023-01-27 18:07:53,899 INFO L131 PetriNetUnfolder]: For 8442/9001 co-relation queries the response was YES. [2023-01-27 18:07:53,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19849 conditions, 6701 events. 4552/6701 cut-off events. For 8442/9001 co-relation queries the response was YES. Maximal size of possible extension queue 407. Compared 37814 event pairs, 972 based on Foata normal form. 606/7028 useless extension candidates. Maximal degree in co-relation 19830. Up to 4572 conditions per place. [2023-01-27 18:07:53,939 INFO L137 encePairwiseOnDemand]: 228/235 looper letters, 75 selfloop transitions, 10 changer transitions 0/92 dead transitions. [2023-01-27 18:07:53,940 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 92 transitions, 615 flow [2023-01-27 18:07:53,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 18:07:53,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 18:07:53,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 600 transitions. [2023-01-27 18:07:53,941 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5106382978723404 [2023-01-27 18:07:53,941 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 600 transitions. [2023-01-27 18:07:53,941 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 600 transitions. [2023-01-27 18:07:53,942 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:07:53,942 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 600 transitions. [2023-01-27 18:07:53,943 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 120.0) internal successors, (600), 5 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:53,944 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:53,945 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:53,945 INFO L175 Difference]: Start difference. First operand has 50 places, 37 transitions, 193 flow. Second operand 5 states and 600 transitions. [2023-01-27 18:07:53,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 92 transitions, 615 flow [2023-01-27 18:07:53,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 92 transitions, 601 flow, removed 7 selfloop flow, removed 2 redundant places. [2023-01-27 18:07:53,969 INFO L231 Difference]: Finished difference. Result has 52 places, 46 transitions, 260 flow [2023-01-27 18:07:53,969 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=260, PETRI_PLACES=52, PETRI_TRANSITIONS=46} [2023-01-27 18:07:53,970 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 11 predicate places. [2023-01-27 18:07:53,970 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 46 transitions, 260 flow [2023-01-27 18:07:53,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 110.75) internal successors, (443), 4 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:53,970 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:07:53,970 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:07:53,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-27 18:07:53,970 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:07:53,971 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:07:53,971 INFO L85 PathProgramCache]: Analyzing trace with hash 12403944, now seen corresponding path program 1 times [2023-01-27 18:07:53,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:07:53,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180016551] [2023-01-27 18:07:53,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:07:53,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:07:53,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:07:54,208 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:07:54,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:07:54,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180016551] [2023-01-27 18:07:54,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180016551] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:07:54,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:07:54,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 18:07:54,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378020546] [2023-01-27 18:07:54,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:07:54,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 18:07:54,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:07:54,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 18:07:54,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-27 18:07:54,215 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 235 [2023-01-27 18:07:54,215 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 46 transitions, 260 flow. Second operand has 5 states, 5 states have (on average 106.4) internal successors, (532), 5 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:07:54,215 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:07:54,215 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 235 [2023-01-27 18:07:54,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:07:55,005 INFO L130 PetriNetUnfolder]: 7375/10738 cut-off events. [2023-01-27 18:07:55,006 INFO L131 PetriNetUnfolder]: For 15538/15538 co-relation queries the response was YES. [2023-01-27 18:07:55,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39804 conditions, 10738 events. 7375/10738 cut-off events. For 15538/15538 co-relation queries the response was YES. Maximal size of possible extension queue 395. Compared 58974 event pairs, 2079 based on Foata normal form. 170/10908 useless extension candidates. Maximal degree in co-relation 39782. Up to 5160 conditions per place. [2023-01-27 18:07:55,044 INFO L137 encePairwiseOnDemand]: 228/235 looper letters, 62 selfloop transitions, 9 changer transitions 32/103 dead transitions. [2023-01-27 18:07:55,044 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 103 transitions, 735 flow [2023-01-27 18:07:55,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-27 18:07:55,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-27 18:07:55,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 699 transitions. [2023-01-27 18:07:55,046 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4957446808510638 [2023-01-27 18:07:55,046 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 699 transitions. [2023-01-27 18:07:55,046 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 699 transitions. [2023-01-27 18:07:55,046 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:07:55,046 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 699 transitions. [2023-01-27 18:07:55,047 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 116.5) internal successors, (699), 6 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:55,049 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 235.0) internal successors, (1645), 7 states have internal predecessors, (1645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:55,049 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 235.0) internal successors, (1645), 7 states have internal predecessors, (1645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:55,049 INFO L175 Difference]: Start difference. First operand has 52 places, 46 transitions, 260 flow. Second operand 6 states and 699 transitions. [2023-01-27 18:07:55,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 103 transitions, 735 flow [2023-01-27 18:07:55,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 103 transitions, 724 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-01-27 18:07:55,072 INFO L231 Difference]: Finished difference. Result has 58 places, 41 transitions, 252 flow [2023-01-27 18:07:55,073 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=253, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=252, PETRI_PLACES=58, PETRI_TRANSITIONS=41} [2023-01-27 18:07:55,073 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 17 predicate places. [2023-01-27 18:07:55,073 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 41 transitions, 252 flow [2023-01-27 18:07:55,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 106.4) internal successors, (532), 5 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:07:55,074 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:07:55,074 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:07:55,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-27 18:07:55,074 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:07:55,074 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:07:55,074 INFO L85 PathProgramCache]: Analyzing trace with hash 993608901, now seen corresponding path program 1 times [2023-01-27 18:07:55,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:07:55,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871480058] [2023-01-27 18:07:55,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:07:55,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:07:55,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:07:55,222 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:07:55,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:07:55,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871480058] [2023-01-27 18:07:55,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871480058] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:07:55,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:07:55,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 18:07:55,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861680198] [2023-01-27 18:07:55,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:07:55,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 18:07:55,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:07:55,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 18:07:55,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-27 18:07:55,224 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 235 [2023-01-27 18:07:55,224 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 41 transitions, 252 flow. Second operand has 5 states, 5 states have (on average 110.2) internal successors, (551), 5 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:55,224 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:07:55,225 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 235 [2023-01-27 18:07:55,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:07:55,633 INFO L130 PetriNetUnfolder]: 3014/4757 cut-off events. [2023-01-27 18:07:55,633 INFO L131 PetriNetUnfolder]: For 7379/7677 co-relation queries the response was YES. [2023-01-27 18:07:55,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17500 conditions, 4757 events. 3014/4757 cut-off events. For 7379/7677 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 28045 event pairs, 391 based on Foata normal form. 484/5085 useless extension candidates. Maximal degree in co-relation 17475. Up to 2106 conditions per place. [2023-01-27 18:07:55,655 INFO L137 encePairwiseOnDemand]: 228/235 looper letters, 86 selfloop transitions, 13 changer transitions 2/108 dead transitions. [2023-01-27 18:07:55,656 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 108 transitions, 824 flow [2023-01-27 18:07:55,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-27 18:07:55,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-27 18:07:55,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 722 transitions. [2023-01-27 18:07:55,657 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5120567375886524 [2023-01-27 18:07:55,658 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 722 transitions. [2023-01-27 18:07:55,658 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 722 transitions. [2023-01-27 18:07:55,658 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:07:55,658 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 722 transitions. [2023-01-27 18:07:55,659 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 120.33333333333333) internal successors, (722), 6 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:55,661 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 235.0) internal successors, (1645), 7 states have internal predecessors, (1645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:55,661 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 235.0) internal successors, (1645), 7 states have internal predecessors, (1645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:55,661 INFO L175 Difference]: Start difference. First operand has 58 places, 41 transitions, 252 flow. Second operand 6 states and 722 transitions. [2023-01-27 18:07:55,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 108 transitions, 824 flow [2023-01-27 18:07:55,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 108 transitions, 759 flow, removed 11 selfloop flow, removed 5 redundant places. [2023-01-27 18:07:55,678 INFO L231 Difference]: Finished difference. Result has 57 places, 49 transitions, 329 flow [2023-01-27 18:07:55,678 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=219, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=329, PETRI_PLACES=57, PETRI_TRANSITIONS=49} [2023-01-27 18:07:55,678 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 16 predicate places. [2023-01-27 18:07:55,678 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 49 transitions, 329 flow [2023-01-27 18:07:55,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 110.2) internal successors, (551), 5 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:55,679 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:07:55,679 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:07:55,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-27 18:07:55,679 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:07:55,679 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:07:55,679 INFO L85 PathProgramCache]: Analyzing trace with hash 498050930, now seen corresponding path program 1 times [2023-01-27 18:07:55,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:07:55,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842128954] [2023-01-27 18:07:55,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:07:55,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:07:55,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:07:55,850 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:07:55,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:07:55,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842128954] [2023-01-27 18:07:55,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842128954] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:07:55,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:07:55,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-27 18:07:55,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249044570] [2023-01-27 18:07:55,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:07:55,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-27 18:07:55,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:07:55,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-27 18:07:55,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-01-27 18:07:55,852 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 235 [2023-01-27 18:07:55,852 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 49 transitions, 329 flow. Second operand has 6 states, 6 states have (on average 110.0) internal successors, (660), 6 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:55,853 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:07:55,853 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 235 [2023-01-27 18:07:55,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:07:56,238 INFO L130 PetriNetUnfolder]: 2451/3953 cut-off events. [2023-01-27 18:07:56,238 INFO L131 PetriNetUnfolder]: For 7652/7976 co-relation queries the response was YES. [2023-01-27 18:07:56,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16904 conditions, 3953 events. 2451/3953 cut-off events. For 7652/7976 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 23665 event pairs, 226 based on Foata normal form. 305/4117 useless extension candidates. Maximal degree in co-relation 16879. Up to 1751 conditions per place. [2023-01-27 18:07:56,256 INFO L137 encePairwiseOnDemand]: 228/235 looper letters, 95 selfloop transitions, 21 changer transitions 15/138 dead transitions. [2023-01-27 18:07:56,257 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 138 transitions, 1083 flow [2023-01-27 18:07:56,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-27 18:07:56,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-01-27 18:07:56,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 960 transitions. [2023-01-27 18:07:56,259 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5106382978723404 [2023-01-27 18:07:56,259 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 960 transitions. [2023-01-27 18:07:56,259 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 960 transitions. [2023-01-27 18:07:56,259 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:07:56,259 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 960 transitions. [2023-01-27 18:07:56,261 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 120.0) internal successors, (960), 8 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:56,263 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 235.0) internal successors, (2115), 9 states have internal predecessors, (2115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:56,263 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 235.0) internal successors, (2115), 9 states have internal predecessors, (2115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:56,263 INFO L175 Difference]: Start difference. First operand has 57 places, 49 transitions, 329 flow. Second operand 8 states and 960 transitions. [2023-01-27 18:07:56,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 138 transitions, 1083 flow [2023-01-27 18:07:56,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 138 transitions, 1032 flow, removed 16 selfloop flow, removed 3 redundant places. [2023-01-27 18:07:56,347 INFO L231 Difference]: Finished difference. Result has 64 places, 57 transitions, 435 flow [2023-01-27 18:07:56,347 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=435, PETRI_PLACES=64, PETRI_TRANSITIONS=57} [2023-01-27 18:07:56,347 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 23 predicate places. [2023-01-27 18:07:56,347 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 57 transitions, 435 flow [2023-01-27 18:07:56,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 110.0) internal successors, (660), 6 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:56,348 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:07:56,348 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:07:56,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-01-27 18:07:56,348 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:07:56,348 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:07:56,348 INFO L85 PathProgramCache]: Analyzing trace with hash 657305743, now seen corresponding path program 1 times [2023-01-27 18:07:56,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:07:56,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638833502] [2023-01-27 18:07:56,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:07:56,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:07:56,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:07:56,569 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:07:56,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:07:56,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638833502] [2023-01-27 18:07:56,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638833502] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:07:56,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:07:56,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 18:07:56,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152982000] [2023-01-27 18:07:56,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:07:56,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 18:07:56,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:07:56,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 18:07:56,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-01-27 18:07:56,571 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 235 [2023-01-27 18:07:56,571 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 57 transitions, 435 flow. Second operand has 5 states, 5 states have (on average 105.6) internal successors, (528), 5 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:56,572 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:07:56,572 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 235 [2023-01-27 18:07:56,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:07:57,154 INFO L130 PetriNetUnfolder]: 4125/6543 cut-off events. [2023-01-27 18:07:57,154 INFO L131 PetriNetUnfolder]: For 20839/20839 co-relation queries the response was YES. [2023-01-27 18:07:57,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28142 conditions, 6543 events. 4125/6543 cut-off events. For 20839/20839 co-relation queries the response was YES. Maximal size of possible extension queue 293. Compared 39104 event pairs, 232 based on Foata normal form. 16/6559 useless extension candidates. Maximal degree in co-relation 28115. Up to 3199 conditions per place. [2023-01-27 18:07:57,178 INFO L137 encePairwiseOnDemand]: 225/235 looper letters, 93 selfloop transitions, 22 changer transitions 54/169 dead transitions. [2023-01-27 18:07:57,178 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 169 transitions, 1669 flow [2023-01-27 18:07:57,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 18:07:57,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 18:07:57,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 801 transitions. [2023-01-27 18:07:57,182 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4869300911854103 [2023-01-27 18:07:57,183 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 801 transitions. [2023-01-27 18:07:57,183 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 801 transitions. [2023-01-27 18:07:57,183 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:07:57,183 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 801 transitions. [2023-01-27 18:07:57,184 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 114.42857142857143) internal successors, (801), 7 states have internal predecessors, (801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:57,187 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 235.0) internal successors, (1880), 8 states have internal predecessors, (1880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:57,187 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 235.0) internal successors, (1880), 8 states have internal predecessors, (1880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:57,187 INFO L175 Difference]: Start difference. First operand has 64 places, 57 transitions, 435 flow. Second operand 7 states and 801 transitions. [2023-01-27 18:07:57,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 169 transitions, 1669 flow [2023-01-27 18:07:57,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 169 transitions, 1364 flow, removed 122 selfloop flow, removed 4 redundant places. [2023-01-27 18:07:57,398 INFO L231 Difference]: Finished difference. Result has 70 places, 59 transitions, 445 flow [2023-01-27 18:07:57,398 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=347, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=445, PETRI_PLACES=70, PETRI_TRANSITIONS=59} [2023-01-27 18:07:57,399 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 29 predicate places. [2023-01-27 18:07:57,399 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 59 transitions, 445 flow [2023-01-27 18:07:57,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 105.6) internal successors, (528), 5 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:57,400 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:07:57,400 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:07:57,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-27 18:07:57,400 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:07:57,400 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:07:57,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1133163897, now seen corresponding path program 2 times [2023-01-27 18:07:57,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:07:57,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072820783] [2023-01-27 18:07:57,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:07:57,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:07:57,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:07:57,660 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:07:57,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:07:57,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072820783] [2023-01-27 18:07:57,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072820783] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:07:57,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:07:57,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-27 18:07:57,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687315678] [2023-01-27 18:07:57,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:07:57,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-27 18:07:57,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:07:57,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-27 18:07:57,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-01-27 18:07:57,662 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 235 [2023-01-27 18:07:57,662 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 59 transitions, 445 flow. Second operand has 7 states, 7 states have (on average 110.0) internal successors, (770), 7 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:57,662 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:07:57,662 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 235 [2023-01-27 18:07:57,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:07:57,975 INFO L130 PetriNetUnfolder]: 1596/2587 cut-off events. [2023-01-27 18:07:57,975 INFO L131 PetriNetUnfolder]: For 7458/7931 co-relation queries the response was YES. [2023-01-27 18:07:57,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10897 conditions, 2587 events. 1596/2587 cut-off events. For 7458/7931 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 14542 event pairs, 168 based on Foata normal form. 220/2738 useless extension candidates. Maximal degree in co-relation 10871. Up to 923 conditions per place. [2023-01-27 18:07:57,984 INFO L137 encePairwiseOnDemand]: 228/235 looper letters, 75 selfloop transitions, 18 changer transitions 29/131 dead transitions. [2023-01-27 18:07:57,985 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 131 transitions, 1191 flow [2023-01-27 18:07:57,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-27 18:07:57,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-01-27 18:07:57,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 938 transitions. [2023-01-27 18:07:57,989 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.498936170212766 [2023-01-27 18:07:57,989 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 938 transitions. [2023-01-27 18:07:57,989 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 938 transitions. [2023-01-27 18:07:57,989 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:07:57,990 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 938 transitions. [2023-01-27 18:07:57,991 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 117.25) internal successors, (938), 8 states have internal predecessors, (938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:57,993 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 235.0) internal successors, (2115), 9 states have internal predecessors, (2115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:57,993 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 235.0) internal successors, (2115), 9 states have internal predecessors, (2115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:57,993 INFO L175 Difference]: Start difference. First operand has 70 places, 59 transitions, 445 flow. Second operand 8 states and 938 transitions. [2023-01-27 18:07:57,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 131 transitions, 1191 flow [2023-01-27 18:07:58,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 131 transitions, 1103 flow, removed 34 selfloop flow, removed 6 redundant places. [2023-01-27 18:07:58,024 INFO L231 Difference]: Finished difference. Result has 68 places, 56 transitions, 424 flow [2023-01-27 18:07:58,025 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=404, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=424, PETRI_PLACES=68, PETRI_TRANSITIONS=56} [2023-01-27 18:07:58,025 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 27 predicate places. [2023-01-27 18:07:58,026 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 56 transitions, 424 flow [2023-01-27 18:07:58,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 110.0) internal successors, (770), 7 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:58,027 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:07:58,027 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:07:58,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-01-27 18:07:58,027 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:07:58,027 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:07:58,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1883579643, now seen corresponding path program 1 times [2023-01-27 18:07:58,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:07:58,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598571639] [2023-01-27 18:07:58,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:07:58,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:07:58,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:07:58,480 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:07:58,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:07:58,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598571639] [2023-01-27 18:07:58,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598571639] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:07:58,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:07:58,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-27 18:07:58,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457550675] [2023-01-27 18:07:58,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:07:58,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-01-27 18:07:58,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:07:58,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-01-27 18:07:58,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-01-27 18:07:58,482 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 235 [2023-01-27 18:07:58,483 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 56 transitions, 424 flow. Second operand has 8 states, 8 states have (on average 99.25) internal successors, (794), 8 states have internal predecessors, (794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:58,483 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:07:58,483 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 235 [2023-01-27 18:07:58,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:07:58,843 INFO L130 PetriNetUnfolder]: 1130/1813 cut-off events. [2023-01-27 18:07:58,843 INFO L131 PetriNetUnfolder]: For 6065/6065 co-relation queries the response was YES. [2023-01-27 18:07:58,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8502 conditions, 1813 events. 1130/1813 cut-off events. For 6065/6065 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 8219 event pairs, 43 based on Foata normal form. 1/1814 useless extension candidates. Maximal degree in co-relation 8472. Up to 782 conditions per place. [2023-01-27 18:07:58,850 INFO L137 encePairwiseOnDemand]: 224/235 looper letters, 89 selfloop transitions, 33 changer transitions 56/178 dead transitions. [2023-01-27 18:07:58,851 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 178 transitions, 1689 flow [2023-01-27 18:07:58,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-01-27 18:07:58,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-01-27 18:07:58,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1257 transitions. [2023-01-27 18:07:58,854 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44574468085106383 [2023-01-27 18:07:58,854 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1257 transitions. [2023-01-27 18:07:58,854 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1257 transitions. [2023-01-27 18:07:58,854 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:07:58,854 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1257 transitions. [2023-01-27 18:07:58,856 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 104.75) internal successors, (1257), 12 states have internal predecessors, (1257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:58,859 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 235.0) internal successors, (3055), 13 states have internal predecessors, (3055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:58,859 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 235.0) internal successors, (3055), 13 states have internal predecessors, (3055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:58,859 INFO L175 Difference]: Start difference. First operand has 68 places, 56 transitions, 424 flow. Second operand 12 states and 1257 transitions. [2023-01-27 18:07:58,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 178 transitions, 1689 flow [2023-01-27 18:07:58,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 178 transitions, 1391 flow, removed 66 selfloop flow, removed 11 redundant places. [2023-01-27 18:07:58,874 INFO L231 Difference]: Finished difference. Result has 72 places, 76 transitions, 596 flow [2023-01-27 18:07:58,874 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=596, PETRI_PLACES=72, PETRI_TRANSITIONS=76} [2023-01-27 18:07:58,875 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 31 predicate places. [2023-01-27 18:07:58,875 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 76 transitions, 596 flow [2023-01-27 18:07:58,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 99.25) internal successors, (794), 8 states have internal predecessors, (794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:58,875 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:07:58,875 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:07:58,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-01-27 18:07:58,875 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:07:58,876 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:07:58,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1118700259, now seen corresponding path program 2 times [2023-01-27 18:07:58,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:07:58,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426078726] [2023-01-27 18:07:58,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:07:58,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:07:58,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:07:59,088 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:07:59,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:07:59,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426078726] [2023-01-27 18:07:59,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426078726] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:07:59,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:07:59,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-27 18:07:59,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866526838] [2023-01-27 18:07:59,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:07:59,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-27 18:07:59,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:07:59,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-27 18:07:59,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-01-27 18:07:59,090 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 235 [2023-01-27 18:07:59,091 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 76 transitions, 596 flow. Second operand has 6 states, 6 states have (on average 105.33333333333333) internal successors, (632), 6 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:59,091 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:07:59,091 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 235 [2023-01-27 18:07:59,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:07:59,381 INFO L130 PetriNetUnfolder]: 1174/1908 cut-off events. [2023-01-27 18:07:59,381 INFO L131 PetriNetUnfolder]: For 5861/5861 co-relation queries the response was YES. [2023-01-27 18:07:59,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8356 conditions, 1908 events. 1174/1908 cut-off events. For 5861/5861 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 9096 event pairs, 206 based on Foata normal form. 1/1909 useless extension candidates. Maximal degree in co-relation 8335. Up to 990 conditions per place. [2023-01-27 18:07:59,389 INFO L137 encePairwiseOnDemand]: 227/235 looper letters, 45 selfloop transitions, 8 changer transitions 81/134 dead transitions. [2023-01-27 18:07:59,389 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 134 transitions, 1202 flow [2023-01-27 18:07:59,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 18:07:59,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 18:07:59,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 777 transitions. [2023-01-27 18:07:59,391 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4723404255319149 [2023-01-27 18:07:59,391 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 777 transitions. [2023-01-27 18:07:59,392 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 777 transitions. [2023-01-27 18:07:59,392 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:07:59,392 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 777 transitions. [2023-01-27 18:07:59,393 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 111.0) internal successors, (777), 7 states have internal predecessors, (777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:59,395 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 235.0) internal successors, (1880), 8 states have internal predecessors, (1880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:59,396 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 235.0) internal successors, (1880), 8 states have internal predecessors, (1880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:59,396 INFO L175 Difference]: Start difference. First operand has 72 places, 76 transitions, 596 flow. Second operand 7 states and 777 transitions. [2023-01-27 18:07:59,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 134 transitions, 1202 flow [2023-01-27 18:07:59,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 134 transitions, 1191 flow, removed 4 selfloop flow, removed 3 redundant places. [2023-01-27 18:07:59,414 INFO L231 Difference]: Finished difference. Result has 74 places, 44 transitions, 300 flow [2023-01-27 18:07:59,415 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=587, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=300, PETRI_PLACES=74, PETRI_TRANSITIONS=44} [2023-01-27 18:07:59,415 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 33 predicate places. [2023-01-27 18:07:59,415 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 44 transitions, 300 flow [2023-01-27 18:07:59,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 105.33333333333333) internal successors, (632), 6 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:59,415 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:07:59,416 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:07:59,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-01-27 18:07:59,416 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:07:59,416 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:07:59,416 INFO L85 PathProgramCache]: Analyzing trace with hash 370874973, now seen corresponding path program 3 times [2023-01-27 18:07:59,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:07:59,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352715206] [2023-01-27 18:07:59,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:07:59,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:07:59,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:07:59,637 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:07:59,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:07:59,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352715206] [2023-01-27 18:07:59,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352715206] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:07:59,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:07:59,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-27 18:07:59,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590118910] [2023-01-27 18:07:59,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:07:59,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-27 18:07:59,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:07:59,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-27 18:07:59,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-01-27 18:07:59,639 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 235 [2023-01-27 18:07:59,639 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 44 transitions, 300 flow. Second operand has 6 states, 6 states have (on average 105.33333333333333) internal successors, (632), 6 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:59,639 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:07:59,639 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 235 [2023-01-27 18:07:59,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:07:59,797 INFO L130 PetriNetUnfolder]: 321/583 cut-off events. [2023-01-27 18:07:59,798 INFO L131 PetriNetUnfolder]: For 1941/1941 co-relation queries the response was YES. [2023-01-27 18:07:59,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2559 conditions, 583 events. 321/583 cut-off events. For 1941/1941 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2503 event pairs, 39 based on Foata normal form. 1/584 useless extension candidates. Maximal degree in co-relation 2538. Up to 248 conditions per place. [2023-01-27 18:07:59,800 INFO L137 encePairwiseOnDemand]: 227/235 looper letters, 48 selfloop transitions, 5 changer transitions 41/94 dead transitions. [2023-01-27 18:07:59,800 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 94 transitions, 761 flow [2023-01-27 18:07:59,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 18:07:59,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 18:07:59,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 764 transitions. [2023-01-27 18:07:59,802 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4644376899696049 [2023-01-27 18:07:59,802 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 764 transitions. [2023-01-27 18:07:59,802 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 764 transitions. [2023-01-27 18:07:59,803 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:07:59,803 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 764 transitions. [2023-01-27 18:07:59,804 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 109.14285714285714) internal successors, (764), 7 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:59,806 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 235.0) internal successors, (1880), 8 states have internal predecessors, (1880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:59,806 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 235.0) internal successors, (1880), 8 states have internal predecessors, (1880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:59,806 INFO L175 Difference]: Start difference. First operand has 74 places, 44 transitions, 300 flow. Second operand 7 states and 764 transitions. [2023-01-27 18:07:59,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 94 transitions, 761 flow [2023-01-27 18:07:59,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 94 transitions, 695 flow, removed 7 selfloop flow, removed 15 redundant places. [2023-01-27 18:07:59,812 INFO L231 Difference]: Finished difference. Result has 61 places, 38 transitions, 207 flow [2023-01-27 18:07:59,812 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=243, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=207, PETRI_PLACES=61, PETRI_TRANSITIONS=38} [2023-01-27 18:07:59,812 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 20 predicate places. [2023-01-27 18:07:59,812 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 38 transitions, 207 flow [2023-01-27 18:07:59,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 105.33333333333333) internal successors, (632), 6 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:59,813 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:07:59,813 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:07:59,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-01-27 18:07:59,813 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:07:59,814 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:07:59,814 INFO L85 PathProgramCache]: Analyzing trace with hash 258530671, now seen corresponding path program 4 times [2023-01-27 18:07:59,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:07:59,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621085657] [2023-01-27 18:07:59,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:07:59,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:07:59,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:08:00,541 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:08:00,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:08:00,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621085657] [2023-01-27 18:08:00,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621085657] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:08:00,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:08:00,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-27 18:08:00,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693468488] [2023-01-27 18:08:00,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:08:00,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-01-27 18:08:00,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:08:00,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-01-27 18:08:00,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-01-27 18:08:00,543 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 235 [2023-01-27 18:08:00,543 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 38 transitions, 207 flow. Second operand has 8 states, 8 states have (on average 99.25) internal successors, (794), 8 states have internal predecessors, (794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:08:00,543 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:08:00,543 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 235 [2023-01-27 18:08:00,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:08:00,759 INFO L130 PetriNetUnfolder]: 177/361 cut-off events. [2023-01-27 18:08:00,759 INFO L131 PetriNetUnfolder]: For 818/818 co-relation queries the response was YES. [2023-01-27 18:08:00,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1405 conditions, 361 events. 177/361 cut-off events. For 818/818 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1497 event pairs, 17 based on Foata normal form. 1/362 useless extension candidates. Maximal degree in co-relation 1386. Up to 153 conditions per place. [2023-01-27 18:08:00,760 INFO L137 encePairwiseOnDemand]: 225/235 looper letters, 41 selfloop transitions, 7 changer transitions 27/75 dead transitions. [2023-01-27 18:08:00,760 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 75 transitions, 575 flow [2023-01-27 18:08:00,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-27 18:08:00,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-01-27 18:08:00,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1006 transitions. [2023-01-27 18:08:00,763 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4280851063829787 [2023-01-27 18:08:00,763 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1006 transitions. [2023-01-27 18:08:00,763 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1006 transitions. [2023-01-27 18:08:00,763 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:08:00,763 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1006 transitions. [2023-01-27 18:08:00,765 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 100.6) internal successors, (1006), 10 states have internal predecessors, (1006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:08:00,767 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 235.0) internal successors, (2585), 11 states have internal predecessors, (2585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:08:00,768 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 235.0) internal successors, (2585), 11 states have internal predecessors, (2585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:08:00,768 INFO L175 Difference]: Start difference. First operand has 61 places, 38 transitions, 207 flow. Second operand 10 states and 1006 transitions. [2023-01-27 18:08:00,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 75 transitions, 575 flow [2023-01-27 18:08:00,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 75 transitions, 533 flow, removed 9 selfloop flow, removed 6 redundant places. [2023-01-27 18:08:00,771 INFO L231 Difference]: Finished difference. Result has 63 places, 38 transitions, 204 flow [2023-01-27 18:08:00,771 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=204, PETRI_PLACES=63, PETRI_TRANSITIONS=38} [2023-01-27 18:08:00,771 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 22 predicate places. [2023-01-27 18:08:00,771 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 38 transitions, 204 flow [2023-01-27 18:08:00,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 99.25) internal successors, (794), 8 states have internal predecessors, (794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:08:00,772 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:08:00,772 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:08:00,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-01-27 18:08:00,772 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:08:00,772 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:08:00,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1295392597, now seen corresponding path program 5 times [2023-01-27 18:08:00,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:08:00,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173192943] [2023-01-27 18:08:00,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:08:00,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:08:00,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-27 18:08:00,801 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-27 18:08:00,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-27 18:08:00,870 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-27 18:08:00,870 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-27 18:08:00,871 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-01-27 18:08:00,872 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-01-27 18:08:00,872 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-01-27 18:08:00,872 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-01-27 18:08:00,873 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-01-27 18:08:00,873 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-01-27 18:08:00,873 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-01-27 18:08:00,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-01-27 18:08:00,873 INFO L445 BasicCegarLoop]: Path program histogram: [5, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:08:00,877 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-27 18:08:00,878 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-27 18:08:00,949 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.01 06:08:00 BasicIcfg [2023-01-27 18:08:00,950 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-27 18:08:00,950 INFO L158 Benchmark]: Toolchain (without parser) took 16190.98ms. Allocated memory was 576.7MB in the beginning and 1.6GB in the end (delta: 1.0GB). Free memory was 533.5MB in the beginning and 804.2MB in the end (delta: -270.7MB). Peak memory consumption was 755.4MB. Max. memory is 16.0GB. [2023-01-27 18:08:00,950 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 339.7MB. Free memory is still 287.4MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-27 18:08:00,950 INFO L158 Benchmark]: CACSL2BoogieTranslator took 364.51ms. Allocated memory is still 576.7MB. Free memory was 533.5MB in the beginning and 509.4MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-01-27 18:08:00,951 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.14ms. Allocated memory is still 576.7MB. Free memory was 509.4MB in the beginning and 506.5MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-01-27 18:08:00,951 INFO L158 Benchmark]: Boogie Preprocessor took 19.85ms. Allocated memory is still 576.7MB. Free memory was 506.5MB in the beginning and 504.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-27 18:08:00,951 INFO L158 Benchmark]: RCFGBuilder took 513.95ms. Allocated memory is still 576.7MB. Free memory was 504.4MB in the beginning and 524.8MB in the end (delta: -20.4MB). Peak memory consumption was 29.3MB. Max. memory is 16.0GB. [2023-01-27 18:08:00,951 INFO L158 Benchmark]: TraceAbstraction took 15255.61ms. Allocated memory was 576.7MB in the beginning and 1.6GB in the end (delta: 1.0GB). Free memory was 524.8MB in the beginning and 804.2MB in the end (delta: -279.4MB). Peak memory consumption was 745.0MB. Max. memory is 16.0GB. [2023-01-27 18:08:00,952 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 339.7MB. Free memory is still 287.4MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 364.51ms. Allocated memory is still 576.7MB. Free memory was 533.5MB in the beginning and 509.4MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 33.14ms. Allocated memory is still 576.7MB. Free memory was 509.4MB in the beginning and 506.5MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 19.85ms. Allocated memory is still 576.7MB. Free memory was 506.5MB in the beginning and 504.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 513.95ms. Allocated memory is still 576.7MB. Free memory was 504.4MB in the beginning and 524.8MB in the end (delta: -20.4MB). Peak memory consumption was 29.3MB. Max. memory is 16.0GB. * TraceAbstraction took 15255.61ms. Allocated memory was 576.7MB in the beginning and 1.6GB in the end (delta: 1.0GB). Free memory was 524.8MB in the beginning and 804.2MB in the end (delta: -279.4MB). Peak memory consumption was 745.0MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.1s, 135 PlacesBefore, 41 PlacesAfterwards, 124 TransitionsBefore, 29 TransitionsAfterwards, 2718 CoEnabledTransitionPairs, 7 FixpointIterations, 43 TrivialSequentialCompositions, 54 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 107 TotalNumberOfCompositions, 6842 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3154, independent: 2962, independent conditional: 0, independent unconditional: 2962, dependent: 192, dependent conditional: 0, dependent unconditional: 192, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1429, independent: 1399, independent conditional: 0, independent unconditional: 1399, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3154, independent: 1563, independent conditional: 0, independent unconditional: 1563, dependent: 162, dependent conditional: 0, dependent unconditional: 162, unknown: 1429, unknown conditional: 0, unknown unconditional: 1429] , Statistics on independence cache: Total cache size (in pairs): 132, Positive cache size: 114, Positive conditional cache size: 0, Positive unconditional cache size: 114, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L728] 0 int z = 0; [L729] 0 _Bool z$flush_delayed; [L730] 0 int z$mem_tmp; [L731] 0 _Bool z$r_buff0_thd0; [L732] 0 _Bool z$r_buff0_thd1; [L733] 0 _Bool z$r_buff0_thd2; [L734] 0 _Bool z$r_buff0_thd3; [L735] 0 _Bool z$r_buff0_thd4; [L736] 0 _Bool z$r_buff1_thd0; [L737] 0 _Bool z$r_buff1_thd1; [L738] 0 _Bool z$r_buff1_thd2; [L739] 0 _Bool z$r_buff1_thd3; [L740] 0 _Bool z$r_buff1_thd4; [L741] 0 _Bool z$read_delayed; [L742] 0 int *z$read_delayed_var; [L743] 0 int z$w_buff0; [L744] 0 _Bool z$w_buff0_used; [L745] 0 int z$w_buff1; [L746] 0 _Bool z$w_buff1_used; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L864] 0 pthread_t t469; [L865] FCALL, FORK 0 pthread_create(&t469, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t469, ((void *)0), P0, ((void *)0))=-4, t469={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L866] 0 pthread_t t470; [L867] FCALL, FORK 0 pthread_create(&t470, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t470, ((void *)0), P1, ((void *)0))=-3, t469={5:0}, t470={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L868] 0 pthread_t t471; [L869] FCALL, FORK 0 pthread_create(&t471, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t471, ((void *)0), P2, ((void *)0))=-2, t469={5:0}, t470={6:0}, t471={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L870] 0 pthread_t t472; [L871] FCALL, FORK 0 pthread_create(&t472, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t472, ((void *)0), P3, ((void *)0))=-1, t469={5:0}, t470={6:0}, t471={7:0}, t472={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L810] 4 z$w_buff1 = z$w_buff0 [L811] 4 z$w_buff0 = 1 [L812] 4 z$w_buff1_used = z$w_buff0_used [L813] 4 z$w_buff0_used = (_Bool)1 [L814] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L814] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L815] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L816] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L817] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L818] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L819] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L820] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L823] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L824] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L825] 4 z$flush_delayed = weak$$choice2 [L826] 4 z$mem_tmp = z [L827] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L828] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L829] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L830] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L831] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L832] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L833] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L834] 4 __unbuffered_p3_EAX = z [L835] 4 z = z$flush_delayed ? z$mem_tmp : z [L836] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L839] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L752] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L767] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L770] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L782] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L785] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L786] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L787] 3 z$flush_delayed = weak$$choice2 [L788] 3 z$mem_tmp = z [L789] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L790] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L791] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L792] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L793] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L794] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L795] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L796] 3 __unbuffered_p2_EAX = z [L797] 3 z = z$flush_delayed ? z$mem_tmp : z [L798] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L805] 3 return 0; [L842] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L843] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L844] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L845] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L846] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L849] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L851] 4 return 0; [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 2 return 0; [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 1 return 0; [L873] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L875] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L875] RET 0 assume_abort_if_not(main$tmp_guard0) [L877] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L878] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L879] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L880] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L881] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t469={5:0}, t470={6:0}, t471={7:0}, t472={3:0}, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L884] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L886] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 865]: 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: 869]: 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: 867]: 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: 871]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 162 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 15.1s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 8.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 592 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 592 mSDsluCounter, 138 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 81 mSDsCounter, 56 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1942 IncrementalHoareTripleChecker+Invalid, 1998 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 56 mSolverCounterUnsat, 57 mSDtfsCounter, 1942 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 88 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=596occurred in iteration=11, InterpolantAutomatonStates: 96, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 293 NumberOfCodeBlocks, 293 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 253 ConstructedInterpolants, 0 QuantifiedInterpolants, 1849 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-01-27 18:08:00,985 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...