/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/mix025_power.oepc_power.opt_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-27 18:09:36,239 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-27 18:09:36,240 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-27 18:09:36,261 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-27 18:09:36,262 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-27 18:09:36,263 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-27 18:09:36,264 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-27 18:09:36,278 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-27 18:09:36,279 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-27 18:09:36,279 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-27 18:09:36,280 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-27 18:09:36,280 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-27 18:09:36,281 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-27 18:09:36,281 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-27 18:09:36,282 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-27 18:09:36,283 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-27 18:09:36,283 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-27 18:09:36,284 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-27 18:09:36,285 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-27 18:09:36,286 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-27 18:09:36,287 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-27 18:09:36,288 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-27 18:09:36,289 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-27 18:09:36,289 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-27 18:09:36,291 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-27 18:09:36,291 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-27 18:09:36,291 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-27 18:09:36,293 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-27 18:09:36,294 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-27 18:09:36,295 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-27 18:09:36,295 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-27 18:09:36,295 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-27 18:09:36,296 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-27 18:09:36,296 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-27 18:09:36,297 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-27 18:09:36,297 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-27 18:09:36,297 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-27 18:09:36,297 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-27 18:09:36,298 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-27 18:09:36,298 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-27 18:09:36,299 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-27 18:09:36,301 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:09:36,323 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-27 18:09:36,323 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-27 18:09:36,324 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-27 18:09:36,324 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-27 18:09:36,324 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-27 18:09:36,324 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-27 18:09:36,324 INFO L138 SettingsManager]: * Use SBE=true [2023-01-27 18:09:36,324 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-27 18:09:36,325 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-27 18:09:36,325 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-27 18:09:36,325 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-27 18:09:36,325 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-27 18:09:36,325 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-27 18:09:36,325 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-27 18:09:36,325 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-27 18:09:36,327 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-27 18:09:36,327 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-27 18:09:36,327 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-27 18:09:36,328 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-27 18:09:36,328 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-27 18:09:36,328 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-27 18:09:36,328 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-27 18:09:36,328 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-27 18:09:36,328 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 18:09:36,328 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-27 18:09:36,328 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-27 18:09:36,329 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-27 18:09:36,329 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-27 18:09:36,329 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-27 18:09:36,329 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-27 18:09:36,329 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-27 18:09:36,329 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:09:36,491 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-27 18:09:36,507 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-27 18:09:36,511 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-27 18:09:36,511 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-27 18:09:36,512 INFO L275 PluginConnector]: CDTParser initialized [2023-01-27 18:09:36,513 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix025_power.oepc_power.opt_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2023-01-27 18:09:37,451 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-27 18:09:37,720 INFO L351 CDTParser]: Found 1 translation units. [2023-01-27 18:09:37,720 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix025_power.oepc_power.opt_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2023-01-27 18:09:37,737 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27733db30/a361e4675a70485989afd83ee0500e78/FLAG5fa7f8973 [2023-01-27 18:09:37,748 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27733db30/a361e4675a70485989afd83ee0500e78 [2023-01-27 18:09:37,749 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-27 18:09:37,750 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-27 18:09:37,751 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-27 18:09:37,751 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-27 18:09:37,753 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-27 18:09:37,754 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 06:09:37" (1/1) ... [2023-01-27 18:09:37,754 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d64da47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:09:37, skipping insertion in model container [2023-01-27 18:09:37,755 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 06:09:37" (1/1) ... [2023-01-27 18:09:37,759 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-27 18:09:37,790 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-27 18:09:37,936 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/mix025_power.oepc_power.opt_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i[996,1009] [2023-01-27 18:09:38,103 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 18:09:38,112 INFO L203 MainTranslator]: Completed pre-run [2023-01-27 18:09:38,122 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/mix025_power.oepc_power.opt_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i[996,1009] [2023-01-27 18:09:38,163 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 18:09:38,188 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-27 18:09:38,189 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-27 18:09:38,194 INFO L208 MainTranslator]: Completed translation [2023-01-27 18:09:38,194 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:09:38 WrapperNode [2023-01-27 18:09:38,194 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-27 18:09:38,195 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-27 18:09:38,195 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-27 18:09:38,195 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-27 18:09:38,200 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:09:38" (1/1) ... [2023-01-27 18:09:38,212 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:09:38" (1/1) ... [2023-01-27 18:09:38,228 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 129 [2023-01-27 18:09:38,228 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-27 18:09:38,232 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-27 18:09:38,232 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-27 18:09:38,232 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-27 18:09:38,238 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:09:38" (1/1) ... [2023-01-27 18:09:38,238 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:09:38" (1/1) ... [2023-01-27 18:09:38,252 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:09:38" (1/1) ... [2023-01-27 18:09:38,252 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:09:38" (1/1) ... [2023-01-27 18:09:38,257 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:09:38" (1/1) ... [2023-01-27 18:09:38,259 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:09:38" (1/1) ... [2023-01-27 18:09:38,272 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:09:38" (1/1) ... [2023-01-27 18:09:38,273 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:09:38" (1/1) ... [2023-01-27 18:09:38,275 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-27 18:09:38,276 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-27 18:09:38,276 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-27 18:09:38,276 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-27 18:09:38,277 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:09:38" (1/1) ... [2023-01-27 18:09:38,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 18:09:38,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 18:09:38,312 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:09:38,335 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:09:38,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-27 18:09:38,355 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-27 18:09:38,355 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-27 18:09:38,355 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-27 18:09:38,355 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-27 18:09:38,356 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-01-27 18:09:38,356 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-01-27 18:09:38,356 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-01-27 18:09:38,356 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-01-27 18:09:38,356 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-01-27 18:09:38,356 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-01-27 18:09:38,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-27 18:09:38,356 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-27 18:09:38,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-27 18:09:38,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-27 18:09:38,357 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:09:38,493 INFO L236 CfgBuilder]: Building ICFG [2023-01-27 18:09:38,494 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-27 18:09:38,705 INFO L277 CfgBuilder]: Performing block encoding [2023-01-27 18:09:38,794 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-27 18:09:38,795 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-01-27 18:09:38,796 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 06:09:38 BoogieIcfgContainer [2023-01-27 18:09:38,796 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-27 18:09:38,798 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-27 18:09:38,798 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-27 18:09:38,800 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-27 18:09:38,800 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 06:09:37" (1/3) ... [2023-01-27 18:09:38,804 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cc78b5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 06:09:38, skipping insertion in model container [2023-01-27 18:09:38,805 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:09:38" (2/3) ... [2023-01-27 18:09:38,805 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cc78b5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 06:09:38, skipping insertion in model container [2023-01-27 18:09:38,805 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 06:09:38" (3/3) ... [2023-01-27 18:09:38,806 INFO L112 eAbstractionObserver]: Analyzing ICFG mix025_power.oepc_power.opt_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2023-01-27 18:09:38,818 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-27 18:09:38,818 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-01-27 18:09:38,818 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-27 18:09:38,894 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-27 18:09:38,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 110 transitions, 235 flow [2023-01-27 18:09:38,970 INFO L130 PetriNetUnfolder]: 2/107 cut-off events. [2023-01-27 18:09:38,971 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:09:38,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 107 events. 2/107 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 58 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 70. Up to 2 conditions per place. [2023-01-27 18:09:38,974 INFO L82 GeneralOperation]: Start removeDead. Operand has 118 places, 110 transitions, 235 flow [2023-01-27 18:09:38,982 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 115 places, 107 transitions, 223 flow [2023-01-27 18:09:38,985 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-27 18:09:38,992 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 115 places, 107 transitions, 223 flow [2023-01-27 18:09:38,993 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 115 places, 107 transitions, 223 flow [2023-01-27 18:09:38,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 107 transitions, 223 flow [2023-01-27 18:09:39,007 INFO L130 PetriNetUnfolder]: 2/107 cut-off events. [2023-01-27 18:09:39,007 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:09:39,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 107 events. 2/107 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 58 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 70. Up to 2 conditions per place. [2023-01-27 18:09:39,008 INFO L119 LiptonReduction]: Number of co-enabled transitions 2008 [2023-01-27 18:09:41,912 INFO L134 LiptonReduction]: Checked pairs total: 5560 [2023-01-27 18:09:41,912 INFO L136 LiptonReduction]: Total number of compositions: 97 [2023-01-27 18:09:41,922 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-27 18:09:41,927 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;@7486a7be, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-27 18:09:41,927 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-01-27 18:09:41,929 INFO L130 PetriNetUnfolder]: 0/3 cut-off events. [2023-01-27 18:09:41,929 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:09:41,929 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:09:41,930 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-01-27 18:09:41,930 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:09:41,933 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:09:41,933 INFO L85 PathProgramCache]: Analyzing trace with hash 479461, now seen corresponding path program 1 times [2023-01-27 18:09:41,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:09:41,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237100218] [2023-01-27 18:09:41,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:09:41,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:09:42,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:09:42,167 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:09:42,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:09:42,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237100218] [2023-01-27 18:09:42,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237100218] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:09:42,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:09:42,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-27 18:09:42,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072745725] [2023-01-27 18:09:42,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:09:42,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-27 18:09:42,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:09:42,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-27 18:09:42,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-27 18:09:42,193 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 207 [2023-01-27 18:09:42,195 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 59 flow. Second operand has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:09:42,196 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:09:42,196 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 207 [2023-01-27 18:09:42,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:09:42,408 INFO L130 PetriNetUnfolder]: 895/1450 cut-off events. [2023-01-27 18:09:42,408 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2023-01-27 18:09:42,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2833 conditions, 1450 events. 895/1450 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 7701 event pairs, 142 based on Foata normal form. 0/1365 useless extension candidates. Maximal degree in co-relation 2822. Up to 1084 conditions per place. [2023-01-27 18:09:42,417 INFO L137 encePairwiseOnDemand]: 203/207 looper letters, 31 selfloop transitions, 2 changer transitions 2/38 dead transitions. [2023-01-27 18:09:42,418 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 38 transitions, 161 flow [2023-01-27 18:09:42,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 18:09:42,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 18:09:42,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 326 transitions. [2023-01-27 18:09:42,427 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5249597423510467 [2023-01-27 18:09:42,428 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 326 transitions. [2023-01-27 18:09:42,428 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 326 transitions. [2023-01-27 18:09:42,429 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:09:42,430 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 326 transitions. [2023-01-27 18:09:42,434 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:09:42,438 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 207.0) internal successors, (828), 4 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:09:42,438 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 207.0) internal successors, (828), 4 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:09:42,440 INFO L175 Difference]: Start difference. First operand has 34 places, 25 transitions, 59 flow. Second operand 3 states and 326 transitions. [2023-01-27 18:09:42,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 38 transitions, 161 flow [2023-01-27 18:09:42,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 38 transitions, 156 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-01-27 18:09:42,443 INFO L231 Difference]: Finished difference. Result has 32 places, 22 transitions, 54 flow [2023-01-27 18:09:42,444 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=32, PETRI_TRANSITIONS=22} [2023-01-27 18:09:42,447 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2023-01-27 18:09:42,447 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 22 transitions, 54 flow [2023-01-27 18:09:42,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:09:42,447 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:09:42,447 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:09:42,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-27 18:09:42,448 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:09:42,448 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:09:42,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1698197872, now seen corresponding path program 1 times [2023-01-27 18:09:42,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:09:42,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100110488] [2023-01-27 18:09:42,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:09:42,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:09:42,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:09:42,723 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:09:42,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:09:42,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100110488] [2023-01-27 18:09:42,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100110488] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:09:42,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:09:42,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-27 18:09:42,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613154321] [2023-01-27 18:09:42,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:09:42,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-27 18:09:42,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:09:42,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-27 18:09:42,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-27 18:09:42,726 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 207 [2023-01-27 18:09:42,726 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 22 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:09:42,726 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:09:42,726 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 207 [2023-01-27 18:09:42,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:09:42,859 INFO L130 PetriNetUnfolder]: 775/1173 cut-off events. [2023-01-27 18:09:42,860 INFO L131 PetriNetUnfolder]: For 97/97 co-relation queries the response was YES. [2023-01-27 18:09:42,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2485 conditions, 1173 events. 775/1173 cut-off events. For 97/97 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 4957 event pairs, 263 based on Foata normal form. 32/1201 useless extension candidates. Maximal degree in co-relation 2475. Up to 817 conditions per place. [2023-01-27 18:09:42,867 INFO L137 encePairwiseOnDemand]: 204/207 looper letters, 26 selfloop transitions, 2 changer transitions 0/30 dead transitions. [2023-01-27 18:09:42,867 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 30 transitions, 128 flow [2023-01-27 18:09:42,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 18:09:42,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 18:09:42,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 311 transitions. [2023-01-27 18:09:42,871 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.500805152979066 [2023-01-27 18:09:42,872 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 311 transitions. [2023-01-27 18:09:42,872 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 311 transitions. [2023-01-27 18:09:42,872 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:09:42,872 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 311 transitions. [2023-01-27 18:09:42,873 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:09:42,876 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 207.0) internal successors, (828), 4 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:09:42,876 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 207.0) internal successors, (828), 4 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:09:42,876 INFO L175 Difference]: Start difference. First operand has 32 places, 22 transitions, 54 flow. Second operand 3 states and 311 transitions. [2023-01-27 18:09:42,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 30 transitions, 128 flow [2023-01-27 18:09:42,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 30 transitions, 122 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-27 18:09:42,878 INFO L231 Difference]: Finished difference. Result has 32 places, 22 transitions, 58 flow [2023-01-27 18:09:42,878 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=32, PETRI_TRANSITIONS=22} [2023-01-27 18:09:42,879 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2023-01-27 18:09:42,879 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 22 transitions, 58 flow [2023-01-27 18:09:42,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:09:42,880 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:09:42,880 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:09:42,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-27 18:09:42,880 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:09:42,882 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:09:42,882 INFO L85 PathProgramCache]: Analyzing trace with hash -141455440, now seen corresponding path program 1 times [2023-01-27 18:09:42,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:09:42,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76428643] [2023-01-27 18:09:42,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:09:42,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:09:42,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:09:43,159 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:09:43,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:09:43,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76428643] [2023-01-27 18:09:43,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76428643] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:09:43,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:09:43,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 18:09:43,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098201811] [2023-01-27 18:09:43,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:09:43,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 18:09:43,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:09:43,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 18:09:43,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-27 18:09:43,162 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 207 [2023-01-27 18:09:43,163 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 22 transitions, 58 flow. Second operand has 4 states, 4 states have (on average 92.5) internal successors, (370), 4 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:09:43,163 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:09:43,163 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 207 [2023-01-27 18:09:43,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:09:43,314 INFO L130 PetriNetUnfolder]: 514/853 cut-off events. [2023-01-27 18:09:43,314 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:09:43,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1795 conditions, 853 events. 514/853 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 4040 event pairs, 145 based on Foata normal form. 80/919 useless extension candidates. Maximal degree in co-relation 1784. Up to 341 conditions per place. [2023-01-27 18:09:43,317 INFO L137 encePairwiseOnDemand]: 201/207 looper letters, 38 selfloop transitions, 5 changer transitions 1/47 dead transitions. [2023-01-27 18:09:43,317 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 47 transitions, 200 flow [2023-01-27 18:09:43,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-27 18:09:43,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-27 18:09:43,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 406 transitions. [2023-01-27 18:09:43,320 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49033816425120774 [2023-01-27 18:09:43,320 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 406 transitions. [2023-01-27 18:09:43,320 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 406 transitions. [2023-01-27 18:09:43,320 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:09:43,321 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 406 transitions. [2023-01-27 18:09:43,321 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 101.5) internal successors, (406), 4 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:09:43,322 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 207.0) internal successors, (1035), 5 states have internal predecessors, (1035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:09:43,323 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 207.0) internal successors, (1035), 5 states have internal predecessors, (1035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:09:43,323 INFO L175 Difference]: Start difference. First operand has 32 places, 22 transitions, 58 flow. Second operand 4 states and 406 transitions. [2023-01-27 18:09:43,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 47 transitions, 200 flow [2023-01-27 18:09:43,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 47 transitions, 196 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-27 18:09:43,325 INFO L231 Difference]: Finished difference. Result has 35 places, 25 transitions, 88 flow [2023-01-27 18:09:43,325 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=88, PETRI_PLACES=35, PETRI_TRANSITIONS=25} [2023-01-27 18:09:43,326 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 1 predicate places. [2023-01-27 18:09:43,329 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 25 transitions, 88 flow [2023-01-27 18:09:43,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 92.5) internal successors, (370), 4 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:09:43,329 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:09:43,330 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:09:43,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-27 18:09:43,330 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:09:43,331 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:09:43,331 INFO L85 PathProgramCache]: Analyzing trace with hash -898181237, now seen corresponding path program 1 times [2023-01-27 18:09:43,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:09:43,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246905955] [2023-01-27 18:09:43,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:09:43,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:09:43,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:09:43,605 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:09:43,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:09:43,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246905955] [2023-01-27 18:09:43,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246905955] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:09:43,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:09:43,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 18:09:43,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115292302] [2023-01-27 18:09:43,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:09:43,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 18:09:43,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:09:43,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 18:09:43,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-27 18:09:43,609 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 207 [2023-01-27 18:09:43,609 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 25 transitions, 88 flow. Second operand has 5 states, 5 states have (on average 92.6) internal successors, (463), 5 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:09:43,609 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:09:43,609 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 207 [2023-01-27 18:09:43,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:09:43,757 INFO L130 PetriNetUnfolder]: 253/463 cut-off events. [2023-01-27 18:09:43,758 INFO L131 PetriNetUnfolder]: For 163/163 co-relation queries the response was YES. [2023-01-27 18:09:43,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1244 conditions, 463 events. 253/463 cut-off events. For 163/163 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1979 event pairs, 68 based on Foata normal form. 44/502 useless extension candidates. Maximal degree in co-relation 1231. Up to 194 conditions per place. [2023-01-27 18:09:43,760 INFO L137 encePairwiseOnDemand]: 201/207 looper letters, 47 selfloop transitions, 8 changer transitions 1/59 dead transitions. [2023-01-27 18:09:43,760 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 59 transitions, 289 flow [2023-01-27 18:09:43,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 18:09:43,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 18:09:43,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 508 transitions. [2023-01-27 18:09:43,762 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49082125603864735 [2023-01-27 18:09:43,762 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 508 transitions. [2023-01-27 18:09:43,762 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 508 transitions. [2023-01-27 18:09:43,762 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:09:43,765 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 508 transitions. [2023-01-27 18:09:43,770 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 101.6) internal successors, (508), 5 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:09:43,771 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 207.0) internal successors, (1242), 6 states have internal predecessors, (1242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:09:43,772 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 207.0) internal successors, (1242), 6 states have internal predecessors, (1242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:09:43,772 INFO L175 Difference]: Start difference. First operand has 35 places, 25 transitions, 88 flow. Second operand 5 states and 508 transitions. [2023-01-27 18:09:43,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 59 transitions, 289 flow [2023-01-27 18:09:43,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 59 transitions, 279 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-01-27 18:09:43,775 INFO L231 Difference]: Finished difference. Result has 39 places, 28 transitions, 128 flow [2023-01-27 18:09:43,775 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=128, PETRI_PLACES=39, PETRI_TRANSITIONS=28} [2023-01-27 18:09:43,776 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 5 predicate places. [2023-01-27 18:09:43,776 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 28 transitions, 128 flow [2023-01-27 18:09:43,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 92.6) internal successors, (463), 5 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:09:43,777 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:09:43,777 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:09:43,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-27 18:09:43,777 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:09:43,778 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:09:43,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1231934226, now seen corresponding path program 1 times [2023-01-27 18:09:43,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:09:43,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723870986] [2023-01-27 18:09:43,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:09:43,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:09:43,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:09:44,266 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:09:44,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:09:44,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723870986] [2023-01-27 18:09:44,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723870986] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:09:44,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:09:44,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 18:09:44,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334900907] [2023-01-27 18:09:44,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:09:44,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-27 18:09:44,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:09:44,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-27 18:09:44,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-01-27 18:09:44,269 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 207 [2023-01-27 18:09:44,269 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 28 transitions, 128 flow. Second operand has 6 states, 6 states have (on average 86.0) internal successors, (516), 6 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:09:44,269 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:09:44,269 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 207 [2023-01-27 18:09:44,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:09:44,606 INFO L130 PetriNetUnfolder]: 701/1248 cut-off events. [2023-01-27 18:09:44,606 INFO L131 PetriNetUnfolder]: For 1268/1268 co-relation queries the response was YES. [2023-01-27 18:09:44,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3780 conditions, 1248 events. 701/1248 cut-off events. For 1268/1268 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 6151 event pairs, 26 based on Foata normal form. 13/1261 useless extension candidates. Maximal degree in co-relation 3765. Up to 394 conditions per place. [2023-01-27 18:09:44,613 INFO L137 encePairwiseOnDemand]: 195/207 looper letters, 109 selfloop transitions, 33 changer transitions 16/158 dead transitions. [2023-01-27 18:09:44,613 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 158 transitions, 1033 flow [2023-01-27 18:09:44,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-27 18:09:44,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-01-27 18:09:44,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 879 transitions. [2023-01-27 18:09:44,616 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4718196457326892 [2023-01-27 18:09:44,616 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 879 transitions. [2023-01-27 18:09:44,616 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 879 transitions. [2023-01-27 18:09:44,616 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:09:44,616 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 879 transitions. [2023-01-27 18:09:44,618 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 97.66666666666667) internal successors, (879), 9 states have internal predecessors, (879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:09:44,621 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 207.0) internal successors, (2070), 10 states have internal predecessors, (2070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:09:44,622 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 207.0) internal successors, (2070), 10 states have internal predecessors, (2070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:09:44,622 INFO L175 Difference]: Start difference. First operand has 39 places, 28 transitions, 128 flow. Second operand 9 states and 879 transitions. [2023-01-27 18:09:44,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 158 transitions, 1033 flow [2023-01-27 18:09:44,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 158 transitions, 891 flow, removed 28 selfloop flow, removed 4 redundant places. [2023-01-27 18:09:44,633 INFO L231 Difference]: Finished difference. Result has 49 places, 63 transitions, 365 flow [2023-01-27 18:09:44,633 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=365, PETRI_PLACES=49, PETRI_TRANSITIONS=63} [2023-01-27 18:09:44,634 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 15 predicate places. [2023-01-27 18:09:44,635 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 63 transitions, 365 flow [2023-01-27 18:09:44,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 86.0) internal successors, (516), 6 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:09:44,635 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:09:44,635 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:09:44,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-27 18:09:44,635 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:09:44,636 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:09:44,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1918174584, now seen corresponding path program 2 times [2023-01-27 18:09:44,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:09:44,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464290173] [2023-01-27 18:09:44,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:09:44,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:09:44,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:09:44,970 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:09:44,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:09:44,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464290173] [2023-01-27 18:09:44,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464290173] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:09:44,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:09:44,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-27 18:09:44,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080532614] [2023-01-27 18:09:44,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:09:44,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-27 18:09:44,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:09:44,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-27 18:09:44,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-01-27 18:09:44,976 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 207 [2023-01-27 18:09:44,979 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 63 transitions, 365 flow. Second operand has 6 states, 6 states have (on average 92.66666666666667) internal successors, (556), 6 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:09:44,979 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:09:44,979 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 207 [2023-01-27 18:09:44,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:09:45,143 INFO L130 PetriNetUnfolder]: 478/910 cut-off events. [2023-01-27 18:09:45,143 INFO L131 PetriNetUnfolder]: For 2118/2221 co-relation queries the response was YES. [2023-01-27 18:09:45,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3487 conditions, 910 events. 478/910 cut-off events. For 2118/2221 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 4783 event pairs, 73 based on Foata normal form. 100/996 useless extension candidates. Maximal degree in co-relation 3467. Up to 331 conditions per place. [2023-01-27 18:09:45,148 INFO L137 encePairwiseOnDemand]: 201/207 looper letters, 82 selfloop transitions, 11 changer transitions 4/111 dead transitions. [2023-01-27 18:09:45,148 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 111 transitions, 795 flow [2023-01-27 18:09:45,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-27 18:09:45,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-27 18:09:45,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 588 transitions. [2023-01-27 18:09:45,150 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47342995169082125 [2023-01-27 18:09:45,150 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 588 transitions. [2023-01-27 18:09:45,150 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 588 transitions. [2023-01-27 18:09:45,150 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:09:45,151 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 588 transitions. [2023-01-27 18:09:45,151 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 98.0) internal successors, (588), 6 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:09:45,153 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 207.0) internal successors, (1449), 7 states have internal predecessors, (1449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:09:45,153 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 207.0) internal successors, (1449), 7 states have internal predecessors, (1449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:09:45,153 INFO L175 Difference]: Start difference. First operand has 49 places, 63 transitions, 365 flow. Second operand 6 states and 588 transitions. [2023-01-27 18:09:45,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 111 transitions, 795 flow [2023-01-27 18:09:45,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 111 transitions, 783 flow, removed 3 selfloop flow, removed 1 redundant places. [2023-01-27 18:09:45,160 INFO L231 Difference]: Finished difference. Result has 55 places, 62 transitions, 379 flow [2023-01-27 18:09:45,160 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=379, PETRI_PLACES=55, PETRI_TRANSITIONS=62} [2023-01-27 18:09:45,162 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 21 predicate places. [2023-01-27 18:09:45,162 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 62 transitions, 379 flow [2023-01-27 18:09:45,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 92.66666666666667) internal successors, (556), 6 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:09:45,162 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:09:45,162 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:09:45,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-27 18:09:45,163 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:09:45,163 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:09:45,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1084024195, now seen corresponding path program 1 times [2023-01-27 18:09:45,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:09:45,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741656409] [2023-01-27 18:09:45,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:09:45,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:09:45,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:09:45,374 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:09:45,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:09:45,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741656409] [2023-01-27 18:09:45,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741656409] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:09:45,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:09:45,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 18:09:45,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529006369] [2023-01-27 18:09:45,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:09:45,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 18:09:45,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:09:45,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 18:09:45,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-27 18:09:45,376 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 207 [2023-01-27 18:09:45,377 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 62 transitions, 379 flow. Second operand has 4 states, 4 states have (on average 97.0) internal successors, (388), 4 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:09:45,377 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:09:45,377 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 207 [2023-01-27 18:09:45,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:09:45,547 INFO L130 PetriNetUnfolder]: 707/1349 cut-off events. [2023-01-27 18:09:45,547 INFO L131 PetriNetUnfolder]: For 3347/3384 co-relation queries the response was YES. [2023-01-27 18:09:45,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5665 conditions, 1349 events. 707/1349 cut-off events. For 3347/3384 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 7597 event pairs, 121 based on Foata normal form. 11/1349 useless extension candidates. Maximal degree in co-relation 5642. Up to 608 conditions per place. [2023-01-27 18:09:45,552 INFO L137 encePairwiseOnDemand]: 204/207 looper letters, 49 selfloop transitions, 1 changer transitions 63/119 dead transitions. [2023-01-27 18:09:45,552 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 119 transitions, 954 flow [2023-01-27 18:09:45,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-27 18:09:45,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-27 18:09:45,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 412 transitions. [2023-01-27 18:09:45,554 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4975845410628019 [2023-01-27 18:09:45,554 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 412 transitions. [2023-01-27 18:09:45,554 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 412 transitions. [2023-01-27 18:09:45,554 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:09:45,554 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 412 transitions. [2023-01-27 18:09:45,555 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 103.0) internal successors, (412), 4 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:09:45,556 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 207.0) internal successors, (1035), 5 states have internal predecessors, (1035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:09:45,556 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 207.0) internal successors, (1035), 5 states have internal predecessors, (1035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:09:45,556 INFO L175 Difference]: Start difference. First operand has 55 places, 62 transitions, 379 flow. Second operand 4 states and 412 transitions. [2023-01-27 18:09:45,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 119 transitions, 954 flow [2023-01-27 18:09:45,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 119 transitions, 902 flow, removed 12 selfloop flow, removed 3 redundant places. [2023-01-27 18:09:45,567 INFO L231 Difference]: Finished difference. Result has 57 places, 49 transitions, 294 flow [2023-01-27 18:09:45,567 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=355, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=294, PETRI_PLACES=57, PETRI_TRANSITIONS=49} [2023-01-27 18:09:45,568 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 23 predicate places. [2023-01-27 18:09:45,568 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 49 transitions, 294 flow [2023-01-27 18:09:45,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 97.0) internal successors, (388), 4 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:09:45,568 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:09:45,568 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:09:45,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-27 18:09:45,568 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:09:45,569 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:09:45,569 INFO L85 PathProgramCache]: Analyzing trace with hash 130186395, now seen corresponding path program 2 times [2023-01-27 18:09:45,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:09:45,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864724700] [2023-01-27 18:09:45,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:09:45,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:09:45,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:09:45,756 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:09:45,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:09:45,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864724700] [2023-01-27 18:09:45,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864724700] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:09:45,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:09:45,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 18:09:45,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649061988] [2023-01-27 18:09:45,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:09:45,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 18:09:45,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:09:45,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 18:09:45,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-27 18:09:45,757 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 207 [2023-01-27 18:09:45,758 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 49 transitions, 294 flow. Second operand has 4 states, 4 states have (on average 93.5) internal successors, (374), 4 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:09:45,758 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:09:45,758 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 207 [2023-01-27 18:09:45,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:09:45,856 INFO L130 PetriNetUnfolder]: 269/526 cut-off events. [2023-01-27 18:09:45,856 INFO L131 PetriNetUnfolder]: For 1119/1119 co-relation queries the response was YES. [2023-01-27 18:09:45,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2201 conditions, 526 events. 269/526 cut-off events. For 1119/1119 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2204 event pairs, 81 based on Foata normal form. 1/527 useless extension candidates. Maximal degree in co-relation 2181. Up to 266 conditions per place. [2023-01-27 18:09:45,858 INFO L137 encePairwiseOnDemand]: 202/207 looper letters, 42 selfloop transitions, 7 changer transitions 28/77 dead transitions. [2023-01-27 18:09:45,858 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 77 transitions, 613 flow [2023-01-27 18:09:45,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-27 18:09:45,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-27 18:09:45,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 396 transitions. [2023-01-27 18:09:45,860 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4782608695652174 [2023-01-27 18:09:45,860 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 396 transitions. [2023-01-27 18:09:45,860 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 396 transitions. [2023-01-27 18:09:45,860 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:09:45,860 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 396 transitions. [2023-01-27 18:09:45,861 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 99.0) internal successors, (396), 4 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:09:45,862 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 207.0) internal successors, (1035), 5 states have internal predecessors, (1035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:09:45,862 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 207.0) internal successors, (1035), 5 states have internal predecessors, (1035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:09:45,862 INFO L175 Difference]: Start difference. First operand has 57 places, 49 transitions, 294 flow. Second operand 4 states and 396 transitions. [2023-01-27 18:09:45,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 77 transitions, 613 flow [2023-01-27 18:09:45,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 77 transitions, 575 flow, removed 7 selfloop flow, removed 5 redundant places. [2023-01-27 18:09:45,866 INFO L231 Difference]: Finished difference. Result has 55 places, 38 transitions, 234 flow [2023-01-27 18:09:45,867 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=234, PETRI_PLACES=55, PETRI_TRANSITIONS=38} [2023-01-27 18:09:45,867 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 21 predicate places. [2023-01-27 18:09:45,867 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 38 transitions, 234 flow [2023-01-27 18:09:45,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 93.5) internal successors, (374), 4 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:09:45,868 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:09:45,868 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:09:45,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-01-27 18:09:45,868 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:09:45,868 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:09:45,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1240770383, now seen corresponding path program 3 times [2023-01-27 18:09:45,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:09:45,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591216345] [2023-01-27 18:09:45,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:09:45,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:09:45,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:09:46,402 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:09:46,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:09:46,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591216345] [2023-01-27 18:09:46,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591216345] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:09:46,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:09:46,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-27 18:09:46,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215311433] [2023-01-27 18:09:46,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:09:46,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-27 18:09:46,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:09:46,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-27 18:09:46,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-01-27 18:09:46,404 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 207 [2023-01-27 18:09:46,405 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 38 transitions, 234 flow. Second operand has 7 states, 7 states have (on average 82.14285714285714) internal successors, (575), 7 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:09:46,405 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:09:46,405 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 207 [2023-01-27 18:09:46,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:09:46,643 INFO L130 PetriNetUnfolder]: 166/329 cut-off events. [2023-01-27 18:09:46,643 INFO L131 PetriNetUnfolder]: For 544/544 co-relation queries the response was YES. [2023-01-27 18:09:46,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1299 conditions, 329 events. 166/329 cut-off events. For 544/544 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1147 event pairs, 12 based on Foata normal form. 1/330 useless extension candidates. Maximal degree in co-relation 1277. Up to 99 conditions per place. [2023-01-27 18:09:46,645 INFO L137 encePairwiseOnDemand]: 197/207 looper letters, 53 selfloop transitions, 11 changer transitions 30/94 dead transitions. [2023-01-27 18:09:46,645 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 94 transitions, 720 flow [2023-01-27 18:09:46,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-27 18:09:46,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-01-27 18:09:46,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 703 transitions. [2023-01-27 18:09:46,647 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4245169082125604 [2023-01-27 18:09:46,647 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 703 transitions. [2023-01-27 18:09:46,647 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 703 transitions. [2023-01-27 18:09:46,647 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:09:46,647 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 703 transitions. [2023-01-27 18:09:46,649 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 87.875) internal successors, (703), 8 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:09:46,650 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 207.0) internal successors, (1863), 9 states have internal predecessors, (1863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:09:46,652 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 207.0) internal successors, (1863), 9 states have internal predecessors, (1863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:09:46,652 INFO L175 Difference]: Start difference. First operand has 55 places, 38 transitions, 234 flow. Second operand 8 states and 703 transitions. [2023-01-27 18:09:46,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 94 transitions, 720 flow [2023-01-27 18:09:46,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 94 transitions, 593 flow, removed 25 selfloop flow, removed 9 redundant places. [2023-01-27 18:09:46,655 INFO L231 Difference]: Finished difference. Result has 56 places, 35 transitions, 207 flow [2023-01-27 18:09:46,655 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=207, PETRI_PLACES=56, PETRI_TRANSITIONS=35} [2023-01-27 18:09:46,656 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 22 predicate places. [2023-01-27 18:09:46,656 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 35 transitions, 207 flow [2023-01-27 18:09:46,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 82.14285714285714) internal successors, (575), 7 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:09:46,657 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:09:46,657 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:09:46,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-27 18:09:46,657 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:09:46,657 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:09:46,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1166170575, now seen corresponding path program 4 times [2023-01-27 18:09:46,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:09:46,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945770146] [2023-01-27 18:09:46,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:09:46,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:09:46,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-27 18:09:46,698 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-27 18:09:46,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-27 18:09:46,777 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-27 18:09:46,778 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-27 18:09:46,779 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-01-27 18:09:46,804 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-01-27 18:09:46,804 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-01-27 18:09:46,804 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-01-27 18:09:46,804 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-01-27 18:09:46,804 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-01-27 18:09:46,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-01-27 18:09:46,805 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1] [2023-01-27 18:09:46,810 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-27 18:09:46,810 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-27 18:09:46,869 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.01 06:09:46 BasicIcfg [2023-01-27 18:09:46,870 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-27 18:09:46,870 INFO L158 Benchmark]: Toolchain (without parser) took 9119.64ms. Allocated memory was 568.3MB in the beginning and 713.0MB in the end (delta: 144.7MB). Free memory was 523.6MB in the beginning and 662.4MB in the end (delta: -138.8MB). Peak memory consumption was 417.2MB. Max. memory is 16.0GB. [2023-01-27 18:09:46,870 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 314.6MB. Free memory is still 260.6MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-27 18:09:46,870 INFO L158 Benchmark]: CACSL2BoogieTranslator took 443.15ms. Allocated memory is still 568.3MB. Free memory was 523.2MB in the beginning and 500.1MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-01-27 18:09:46,870 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.28ms. Allocated memory is still 568.3MB. Free memory was 500.1MB in the beginning and 497.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-27 18:09:46,871 INFO L158 Benchmark]: Boogie Preprocessor took 43.88ms. Allocated memory is still 568.3MB. Free memory was 497.6MB in the beginning and 495.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-27 18:09:46,871 INFO L158 Benchmark]: RCFGBuilder took 520.59ms. Allocated memory is still 568.3MB. Free memory was 495.9MB in the beginning and 459.6MB in the end (delta: 36.4MB). Peak memory consumption was 35.7MB. Max. memory is 16.0GB. [2023-01-27 18:09:46,871 INFO L158 Benchmark]: TraceAbstraction took 8071.93ms. Allocated memory was 568.3MB in the beginning and 713.0MB in the end (delta: 144.7MB). Free memory was 458.9MB in the beginning and 662.4MB in the end (delta: -203.5MB). Peak memory consumption was 354.3MB. Max. memory is 16.0GB. [2023-01-27 18:09:46,872 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.12ms. Allocated memory is still 314.6MB. Free memory is still 260.6MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 443.15ms. Allocated memory is still 568.3MB. Free memory was 523.2MB in the beginning and 500.1MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 33.28ms. Allocated memory is still 568.3MB. Free memory was 500.1MB in the beginning and 497.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 43.88ms. Allocated memory is still 568.3MB. Free memory was 497.6MB in the beginning and 495.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 520.59ms. Allocated memory is still 568.3MB. Free memory was 495.9MB in the beginning and 459.6MB in the end (delta: 36.4MB). Peak memory consumption was 35.7MB. Max. memory is 16.0GB. * TraceAbstraction took 8071.93ms. Allocated memory was 568.3MB in the beginning and 713.0MB in the end (delta: 144.7MB). Free memory was 458.9MB in the beginning and 662.4MB in the end (delta: -203.5MB). Peak memory consumption was 354.3MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.9s, 115 PlacesBefore, 34 PlacesAfterwards, 107 TransitionsBefore, 25 TransitionsAfterwards, 2008 CoEnabledTransitionPairs, 6 FixpointIterations, 39 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 97 TotalNumberOfCompositions, 5560 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2455, independent: 2277, independent conditional: 0, independent unconditional: 2277, dependent: 178, dependent conditional: 0, dependent unconditional: 178, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1117, independent: 1073, independent conditional: 0, independent unconditional: 1073, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2455, independent: 1204, independent conditional: 0, independent unconditional: 1204, dependent: 134, dependent conditional: 0, dependent unconditional: 134, unknown: 1117, unknown conditional: 0, unknown unconditional: 1117] , Statistics on independence cache: Total cache size (in pairs): 94, Positive cache size: 78, Positive conditional cache size: 0, Positive unconditional cache size: 78, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L721] 0 int y = 0; [L723] 0 int z = 0; [L724] 0 _Bool z$flush_delayed; [L725] 0 int z$mem_tmp; [L726] 0 _Bool z$r_buff0_thd0; [L727] 0 _Bool z$r_buff0_thd1; [L728] 0 _Bool z$r_buff0_thd2; [L729] 0 _Bool z$r_buff0_thd3; [L730] 0 _Bool z$r_buff1_thd0; [L731] 0 _Bool z$r_buff1_thd1; [L732] 0 _Bool z$r_buff1_thd2; [L733] 0 _Bool z$r_buff1_thd3; [L734] 0 _Bool z$read_delayed; [L735] 0 int *z$read_delayed_var; [L736] 0 int z$w_buff0; [L737] 0 _Bool z$w_buff0_used; [L738] 0 int z$w_buff1; [L739] 0 _Bool z$w_buff1_used; [L740] 0 _Bool weak$$choice0; [L741] 0 _Bool weak$$choice2; [L838] 0 pthread_t t657; [L839] FCALL, FORK 0 pthread_create(&t657, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t657, ((void *)0), P0, ((void *)0))=-3, t657={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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L840] 0 pthread_t t658; [L841] FCALL, FORK 0 pthread_create(&t658, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t658, ((void *)0), P1, ((void *)0))=-2, t657={5:0}, t658={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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L842] 0 pthread_t t659; [L843] FCALL, FORK 0 pthread_create(&t659, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t659, ((void *)0), P2, ((void *)0))=-1, t657={5:0}, t658={6:0}, t659={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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L745] 1 z$w_buff1 = z$w_buff0 [L746] 1 z$w_buff0 = 1 [L747] 1 z$w_buff1_used = z$w_buff0_used [L748] 1 z$w_buff0_used = (_Bool)1 [L749] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L749] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L750] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L751] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L752] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L753] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L754] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L757] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L774] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L777] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L794] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L797] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L800] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L801] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L802] 3 z$flush_delayed = weak$$choice2 [L803] 3 z$mem_tmp = z [L804] 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) [L805] 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)) [L806] 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)) [L807] 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)) [L808] 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)) [L809] 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)) [L810] 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)) [L811] 3 __unbuffered_p2_EBX = z [L812] 3 z = z$flush_delayed ? z$mem_tmp : z [L813] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L816] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L817] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L818] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L819] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L820] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L760] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L761] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L762] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L763] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L764] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 1 return 0; [L780] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L781] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L782] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L783] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L784] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L787] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L789] 2 return 0; [L823] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L825] 3 return 0; [L845] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t657={5:0}, t658={6:0}, t659={3:0}, weak$$choice2=1, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L847] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L847] RET 0 assume_abort_if_not(main$tmp_guard0) [L849] 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) [L850] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L851] 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 [L852] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L853] 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}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t657={5:0}, t658={6:0}, t659={3:0}, weak$$choice2=1, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L856] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) [L858] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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: 841]: 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: 839]: 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: 843]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 138 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 7.9s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 332 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 332 mSDsluCounter, 46 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 28 mSDsCounter, 34 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 852 IncrementalHoareTripleChecker+Invalid, 886 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 34 mSolverCounterUnsat, 18 mSDtfsCounter, 852 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=379occurred in iteration=6, InterpolantAutomatonStates: 46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 161 NumberOfCodeBlocks, 161 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 130 ConstructedInterpolants, 0 QuantifiedInterpolants, 1044 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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:09:46,896 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...