/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/safe008_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-27 18:17:33,359 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-27 18:17:33,363 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-27 18:17:33,402 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-27 18:17:33,402 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-27 18:17:33,404 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-27 18:17:33,407 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-27 18:17:33,422 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-27 18:17:33,423 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-27 18:17:33,428 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-27 18:17:33,429 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-27 18:17:33,430 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-27 18:17:33,431 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-27 18:17:33,433 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-27 18:17:33,433 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-27 18:17:33,434 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-27 18:17:33,434 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-27 18:17:33,435 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-27 18:17:33,436 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-27 18:17:33,441 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-27 18:17:33,442 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-27 18:17:33,442 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-27 18:17:33,443 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-27 18:17:33,444 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-27 18:17:33,447 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-27 18:17:33,447 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-27 18:17:33,447 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-27 18:17:33,448 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-27 18:17:33,448 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-27 18:17:33,449 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-27 18:17:33,449 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-27 18:17:33,449 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-27 18:17:33,451 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-27 18:17:33,451 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-27 18:17:33,452 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-27 18:17:33,452 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-27 18:17:33,452 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-27 18:17:33,452 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-27 18:17:33,452 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-27 18:17:33,453 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-27 18:17:33,453 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-27 18:17:33,455 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:17:33,481 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-27 18:17:33,481 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-27 18:17:33,482 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-27 18:17:33,482 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-27 18:17:33,483 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-27 18:17:33,483 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-27 18:17:33,483 INFO L138 SettingsManager]: * Use SBE=true [2023-01-27 18:17:33,483 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-27 18:17:33,483 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-27 18:17:33,483 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-27 18:17:33,484 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-27 18:17:33,484 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-27 18:17:33,484 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-27 18:17:33,484 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-27 18:17:33,484 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-27 18:17:33,484 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-27 18:17:33,484 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-27 18:17:33,484 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-27 18:17:33,485 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-27 18:17:33,485 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-27 18:17:33,485 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-27 18:17:33,485 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-27 18:17:33,485 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-27 18:17:33,485 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 18:17:33,485 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-27 18:17:33,485 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-27 18:17:33,485 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-27 18:17:33,485 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-27 18:17:33,485 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-27 18:17:33,486 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-27 18:17:33,486 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-27 18:17:33,486 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:17:33,638 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-27 18:17:33,650 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-27 18:17:33,652 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-27 18:17:33,653 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-27 18:17:33,653 INFO L275 PluginConnector]: CDTParser initialized [2023-01-27 18:17:33,653 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe008_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-01-27 18:17:34,621 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-27 18:17:34,854 INFO L351 CDTParser]: Found 1 translation units. [2023-01-27 18:17:34,855 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe008_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-01-27 18:17:34,863 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3369063af/6a8fe834d6534073a4ebfa8cf0e29bca/FLAGf2823ed02 [2023-01-27 18:17:34,877 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3369063af/6a8fe834d6534073a4ebfa8cf0e29bca [2023-01-27 18:17:34,879 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-27 18:17:34,879 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-27 18:17:34,880 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-27 18:17:34,880 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-27 18:17:34,884 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-27 18:17:34,884 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 06:17:34" (1/1) ... [2023-01-27 18:17:34,885 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6efaf421 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:17:34, skipping insertion in model container [2023-01-27 18:17:34,885 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 06:17:34" (1/1) ... [2023-01-27 18:17:34,889 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-27 18:17:34,933 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-27 18:17:35,047 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/safe008_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[986,999] [2023-01-27 18:17:35,207 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 18:17:35,219 INFO L203 MainTranslator]: Completed pre-run [2023-01-27 18:17:35,229 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/safe008_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[986,999] [2023-01-27 18:17:35,269 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 18:17:35,290 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-27 18:17:35,290 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-27 18:17:35,295 INFO L208 MainTranslator]: Completed translation [2023-01-27 18:17:35,296 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:17:35 WrapperNode [2023-01-27 18:17:35,296 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-27 18:17:35,297 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-27 18:17:35,297 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-27 18:17:35,297 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-27 18:17:35,301 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:17:35" (1/1) ... [2023-01-27 18:17:35,326 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:17:35" (1/1) ... [2023-01-27 18:17:35,354 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 145 [2023-01-27 18:17:35,354 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-27 18:17:35,355 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-27 18:17:35,355 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-27 18:17:35,355 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-27 18:17:35,361 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:17:35" (1/1) ... [2023-01-27 18:17:35,361 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:17:35" (1/1) ... [2023-01-27 18:17:35,373 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:17:35" (1/1) ... [2023-01-27 18:17:35,374 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:17:35" (1/1) ... [2023-01-27 18:17:35,378 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:17:35" (1/1) ... [2023-01-27 18:17:35,380 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:17:35" (1/1) ... [2023-01-27 18:17:35,381 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:17:35" (1/1) ... [2023-01-27 18:17:35,382 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:17:35" (1/1) ... [2023-01-27 18:17:35,384 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-27 18:17:35,397 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-27 18:17:35,397 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-27 18:17:35,397 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-27 18:17:35,398 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:17:35" (1/1) ... [2023-01-27 18:17:35,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 18:17:35,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 18:17:35,424 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:17:35,440 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:17:35,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-27 18:17:35,458 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-27 18:17:35,458 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-27 18:17:35,458 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-27 18:17:35,459 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-27 18:17:35,459 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-01-27 18:17:35,459 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-01-27 18:17:35,460 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-01-27 18:17:35,460 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-01-27 18:17:35,460 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-01-27 18:17:35,460 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-01-27 18:17:35,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-27 18:17:35,460 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-27 18:17:35,460 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-27 18:17:35,461 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-27 18:17:35,461 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:17:35,578 INFO L236 CfgBuilder]: Building ICFG [2023-01-27 18:17:35,579 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-27 18:17:35,813 INFO L277 CfgBuilder]: Performing block encoding [2023-01-27 18:17:35,907 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-27 18:17:35,907 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-01-27 18:17:35,908 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 06:17:35 BoogieIcfgContainer [2023-01-27 18:17:35,909 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-27 18:17:35,910 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-27 18:17:35,910 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-27 18:17:35,912 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-27 18:17:35,912 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 06:17:34" (1/3) ... [2023-01-27 18:17:35,912 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29041bce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 06:17:35, skipping insertion in model container [2023-01-27 18:17:35,912 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:17:35" (2/3) ... [2023-01-27 18:17:35,913 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29041bce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 06:17:35, skipping insertion in model container [2023-01-27 18:17:35,913 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 06:17:35" (3/3) ... [2023-01-27 18:17:35,913 INFO L112 eAbstractionObserver]: Analyzing ICFG safe008_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-01-27 18:17:35,924 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-27 18:17:35,924 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-01-27 18:17:35,924 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-27 18:17:35,954 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-27 18:17:35,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 116 places, 108 transitions, 231 flow [2023-01-27 18:17:36,023 INFO L130 PetriNetUnfolder]: 2/105 cut-off events. [2023-01-27 18:17:36,023 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:17:36,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 105 events. 2/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2023-01-27 18:17:36,027 INFO L82 GeneralOperation]: Start removeDead. Operand has 116 places, 108 transitions, 231 flow [2023-01-27 18:17:36,031 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 113 places, 105 transitions, 219 flow [2023-01-27 18:17:36,034 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-27 18:17:36,049 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 113 places, 105 transitions, 219 flow [2023-01-27 18:17:36,054 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 113 places, 105 transitions, 219 flow [2023-01-27 18:17:36,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 105 transitions, 219 flow [2023-01-27 18:17:36,082 INFO L130 PetriNetUnfolder]: 2/105 cut-off events. [2023-01-27 18:17:36,082 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:17:36,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 105 events. 2/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2023-01-27 18:17:36,084 INFO L119 LiptonReduction]: Number of co-enabled transitions 1920 [2023-01-27 18:17:39,425 INFO L134 LiptonReduction]: Checked pairs total: 5105 [2023-01-27 18:17:39,426 INFO L136 LiptonReduction]: Total number of compositions: 95 [2023-01-27 18:17:39,435 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-27 18:17:39,440 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;@473a3973, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-27 18:17:39,440 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-01-27 18:17:39,442 INFO L130 PetriNetUnfolder]: 0/3 cut-off events. [2023-01-27 18:17:39,442 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:17:39,442 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:17:39,442 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-01-27 18:17:39,443 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:17:39,446 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:17:39,446 INFO L85 PathProgramCache]: Analyzing trace with hash 472636, now seen corresponding path program 1 times [2023-01-27 18:17:39,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:17:39,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593209441] [2023-01-27 18:17:39,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:17:39,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:17:39,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:17:39,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:17:39,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:17:39,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593209441] [2023-01-27 18:17:39,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593209441] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:17:39,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:17:39,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-27 18:17:39,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586177838] [2023-01-27 18:17:39,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:17:39,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-27 18:17:39,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:17:39,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-27 18:17:39,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-27 18:17:39,707 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 203 [2023-01-27 18:17:39,711 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 23 transitions, 55 flow. Second operand has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:17:39,711 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:17:39,711 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 203 [2023-01-27 18:17:39,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:17:39,880 INFO L130 PetriNetUnfolder]: 711/1166 cut-off events. [2023-01-27 18:17:39,881 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2023-01-27 18:17:39,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2285 conditions, 1166 events. 711/1166 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 6094 event pairs, 111 based on Foata normal form. 0/1097 useless extension candidates. Maximal degree in co-relation 2274. Up to 871 conditions per place. [2023-01-27 18:17:39,891 INFO L137 encePairwiseOnDemand]: 200/203 looper letters, 29 selfloop transitions, 2 changer transitions 2/36 dead transitions. [2023-01-27 18:17:39,891 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 36 transitions, 153 flow [2023-01-27 18:17:39,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 18:17:39,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 18:17:39,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 316 transitions. [2023-01-27 18:17:39,913 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5188834154351396 [2023-01-27 18:17:39,914 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 316 transitions. [2023-01-27 18:17:39,914 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 316 transitions. [2023-01-27 18:17:39,916 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:17:39,918 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 316 transitions. [2023-01-27 18:17:39,923 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:17:39,927 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 203.0) internal successors, (812), 4 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:17:39,927 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 203.0) internal successors, (812), 4 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:17:39,928 INFO L175 Difference]: Start difference. First operand has 33 places, 23 transitions, 55 flow. Second operand 3 states and 316 transitions. [2023-01-27 18:17:39,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 36 transitions, 153 flow [2023-01-27 18:17:39,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 36 transitions, 148 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-01-27 18:17:39,932 INFO L231 Difference]: Finished difference. Result has 31 places, 21 transitions, 52 flow [2023-01-27 18:17:39,933 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, 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=52, PETRI_PLACES=31, PETRI_TRANSITIONS=21} [2023-01-27 18:17:39,938 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, -2 predicate places. [2023-01-27 18:17:39,938 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 21 transitions, 52 flow [2023-01-27 18:17:39,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:17:39,939 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:17:39,939 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:17:39,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-27 18:17:39,939 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:17:39,947 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:17:39,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1330620814, now seen corresponding path program 1 times [2023-01-27 18:17:39,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:17:39,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600685265] [2023-01-27 18:17:39,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:17:39,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:17:40,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:17:40,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:17:40,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:17:40,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600685265] [2023-01-27 18:17:40,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600685265] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:17:40,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:17:40,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-27 18:17:40,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054682537] [2023-01-27 18:17:40,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:17:40,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 18:17:40,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:17:40,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 18:17:40,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-27 18:17:40,544 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 203 [2023-01-27 18:17:40,545 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 21 transitions, 52 flow. Second operand has 4 states, 4 states have (on average 85.25) internal successors, (341), 4 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:17:40,545 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:17:40,545 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 203 [2023-01-27 18:17:40,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:17:40,678 INFO L130 PetriNetUnfolder]: 671/1021 cut-off events. [2023-01-27 18:17:40,679 INFO L131 PetriNetUnfolder]: For 85/85 co-relation queries the response was YES. [2023-01-27 18:17:40,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2169 conditions, 1021 events. 671/1021 cut-off events. For 85/85 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4347 event pairs, 159 based on Foata normal form. 16/1033 useless extension candidates. Maximal degree in co-relation 2159. Up to 817 conditions per place. [2023-01-27 18:17:40,683 INFO L137 encePairwiseOnDemand]: 200/203 looper letters, 25 selfloop transitions, 2 changer transitions 0/29 dead transitions. [2023-01-27 18:17:40,683 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 29 transitions, 124 flow [2023-01-27 18:17:40,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 18:17:40,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 18:17:40,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 277 transitions. [2023-01-27 18:17:40,684 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4548440065681445 [2023-01-27 18:17:40,684 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 277 transitions. [2023-01-27 18:17:40,685 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 277 transitions. [2023-01-27 18:17:40,685 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:17:40,685 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 277 transitions. [2023-01-27 18:17:40,685 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 92.33333333333333) internal successors, (277), 3 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:17:40,687 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 203.0) internal successors, (812), 4 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:17:40,687 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 203.0) internal successors, (812), 4 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:17:40,687 INFO L175 Difference]: Start difference. First operand has 31 places, 21 transitions, 52 flow. Second operand 3 states and 277 transitions. [2023-01-27 18:17:40,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 29 transitions, 124 flow [2023-01-27 18:17:40,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 29 transitions, 118 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-27 18:17:40,688 INFO L231 Difference]: Finished difference. Result has 31 places, 21 transitions, 56 flow [2023-01-27 18:17:40,688 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=31, PETRI_TRANSITIONS=21} [2023-01-27 18:17:40,689 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, -2 predicate places. [2023-01-27 18:17:40,689 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 21 transitions, 56 flow [2023-01-27 18:17:40,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 85.25) internal successors, (341), 4 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:17:40,689 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:17:40,689 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:17:40,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-27 18:17:40,689 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:17:40,690 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:17:40,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1700426340, now seen corresponding path program 1 times [2023-01-27 18:17:40,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:17:40,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951972136] [2023-01-27 18:17:40,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:17:40,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:17:40,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:17:40,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:17:40,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:17:40,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951972136] [2023-01-27 18:17:40,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951972136] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:17:40,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:17:40,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-27 18:17:40,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864850662] [2023-01-27 18:17:40,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:17:40,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 18:17:40,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:17:40,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 18:17:40,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-27 18:17:40,965 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 203 [2023-01-27 18:17:40,965 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 21 transitions, 56 flow. Second operand has 4 states, 4 states have (on average 85.5) internal successors, (342), 4 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:17:40,966 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:17:40,966 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 203 [2023-01-27 18:17:40,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:17:41,110 INFO L130 PetriNetUnfolder]: 631/1030 cut-off events. [2023-01-27 18:17:41,111 INFO L131 PetriNetUnfolder]: For 101/101 co-relation queries the response was YES. [2023-01-27 18:17:41,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2181 conditions, 1030 events. 631/1030 cut-off events. For 101/101 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4874 event pairs, 118 based on Foata normal form. 16/1045 useless extension candidates. Maximal degree in co-relation 2170. Up to 798 conditions per place. [2023-01-27 18:17:41,116 INFO L137 encePairwiseOnDemand]: 200/203 looper letters, 28 selfloop transitions, 2 changer transitions 0/32 dead transitions. [2023-01-27 18:17:41,116 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 32 transitions, 143 flow [2023-01-27 18:17:41,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 18:17:41,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 18:17:41,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 280 transitions. [2023-01-27 18:17:41,117 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45977011494252873 [2023-01-27 18:17:41,117 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 280 transitions. [2023-01-27 18:17:41,117 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 280 transitions. [2023-01-27 18:17:41,117 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:17:41,117 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 280 transitions. [2023-01-27 18:17:41,118 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:17:41,119 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 203.0) internal successors, (812), 4 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:17:41,120 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 203.0) internal successors, (812), 4 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:17:41,120 INFO L175 Difference]: Start difference. First operand has 31 places, 21 transitions, 56 flow. Second operand 3 states and 280 transitions. [2023-01-27 18:17:41,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 32 transitions, 143 flow [2023-01-27 18:17:41,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 32 transitions, 137 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-27 18:17:41,122 INFO L231 Difference]: Finished difference. Result has 32 places, 21 transitions, 60 flow [2023-01-27 18:17:41,122 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=32, PETRI_TRANSITIONS=21} [2023-01-27 18:17:41,123 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, -1 predicate places. [2023-01-27 18:17:41,125 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 21 transitions, 60 flow [2023-01-27 18:17:41,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 85.5) internal successors, (342), 4 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:17:41,125 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:17:41,125 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:17:41,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-27 18:17:41,126 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:17:41,127 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:17:41,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1151437425, now seen corresponding path program 1 times [2023-01-27 18:17:41,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:17:41,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634113196] [2023-01-27 18:17:41,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:17:41,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:17:41,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:17:41,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:17:41,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:17:41,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634113196] [2023-01-27 18:17:41,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634113196] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:17:41,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:17:41,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-27 18:17:41,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890852462] [2023-01-27 18:17:41,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:17:41,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 18:17:41,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:17:41,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 18:17:41,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-27 18:17:41,520 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 203 [2023-01-27 18:17:41,520 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 21 transitions, 60 flow. Second operand has 4 states, 4 states have (on average 92.75) internal successors, (371), 4 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:17:41,520 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:17:41,520 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 203 [2023-01-27 18:17:41,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:17:41,635 INFO L130 PetriNetUnfolder]: 623/984 cut-off events. [2023-01-27 18:17:41,635 INFO L131 PetriNetUnfolder]: For 205/205 co-relation queries the response was YES. [2023-01-27 18:17:41,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2255 conditions, 984 events. 623/984 cut-off events. For 205/205 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 4461 event pairs, 158 based on Foata normal form. 3/986 useless extension candidates. Maximal degree in co-relation 2243. Up to 886 conditions per place. [2023-01-27 18:17:41,639 INFO L137 encePairwiseOnDemand]: 199/203 looper letters, 28 selfloop transitions, 3 changer transitions 0/33 dead transitions. [2023-01-27 18:17:41,639 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 33 transitions, 154 flow [2023-01-27 18:17:41,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 18:17:41,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 18:17:41,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 302 transitions. [2023-01-27 18:17:41,641 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49589490968801314 [2023-01-27 18:17:41,641 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 302 transitions. [2023-01-27 18:17:41,641 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 302 transitions. [2023-01-27 18:17:41,644 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:17:41,644 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 302 transitions. [2023-01-27 18:17:41,645 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:17:41,646 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 203.0) internal successors, (812), 4 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:17:41,646 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 203.0) internal successors, (812), 4 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:17:41,646 INFO L175 Difference]: Start difference. First operand has 32 places, 21 transitions, 60 flow. Second operand 3 states and 302 transitions. [2023-01-27 18:17:41,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 33 transitions, 154 flow [2023-01-27 18:17:41,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 33 transitions, 148 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-27 18:17:41,648 INFO L231 Difference]: Finished difference. Result has 33 places, 23 transitions, 75 flow [2023-01-27 18:17:41,648 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=75, PETRI_PLACES=33, PETRI_TRANSITIONS=23} [2023-01-27 18:17:41,650 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 0 predicate places. [2023-01-27 18:17:41,650 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 23 transitions, 75 flow [2023-01-27 18:17:41,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 92.75) internal successors, (371), 4 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:17:41,650 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:17:41,650 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:17:41,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-27 18:17:41,651 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:17:41,651 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:17:41,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1560278402, now seen corresponding path program 1 times [2023-01-27 18:17:41,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:17:41,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879548170] [2023-01-27 18:17:41,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:17:41,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:17:41,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:17:41,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:17:41,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:17:41,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879548170] [2023-01-27 18:17:41,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879548170] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:17:41,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:17:41,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 18:17:41,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493490532] [2023-01-27 18:17:41,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:17:41,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 18:17:41,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:17:41,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 18:17:41,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-27 18:17:41,938 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 203 [2023-01-27 18:17:41,938 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 23 transitions, 75 flow. Second operand has 5 states, 5 states have (on average 83.4) internal successors, (417), 5 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:17:41,938 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:17:41,938 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 203 [2023-01-27 18:17:41,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:17:42,104 INFO L130 PetriNetUnfolder]: 1018/1611 cut-off events. [2023-01-27 18:17:42,104 INFO L131 PetriNetUnfolder]: For 637/637 co-relation queries the response was YES. [2023-01-27 18:17:42,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3738 conditions, 1611 events. 1018/1611 cut-off events. For 637/637 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 8155 event pairs, 217 based on Foata normal form. 57/1666 useless extension candidates. Maximal degree in co-relation 3725. Up to 606 conditions per place. [2023-01-27 18:17:42,109 INFO L137 encePairwiseOnDemand]: 199/203 looper letters, 39 selfloop transitions, 3 changer transitions 5/48 dead transitions. [2023-01-27 18:17:42,109 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 48 transitions, 232 flow [2023-01-27 18:17:42,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-27 18:17:42,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-27 18:17:42,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 371 transitions. [2023-01-27 18:17:42,110 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45689655172413796 [2023-01-27 18:17:42,110 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 371 transitions. [2023-01-27 18:17:42,110 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 371 transitions. [2023-01-27 18:17:42,110 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:17:42,111 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 371 transitions. [2023-01-27 18:17:42,111 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 92.75) internal successors, (371), 4 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:17:42,112 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 203.0) internal successors, (1015), 5 states have internal predecessors, (1015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:17:42,113 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 203.0) internal successors, (1015), 5 states have internal predecessors, (1015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:17:42,113 INFO L175 Difference]: Start difference. First operand has 33 places, 23 transitions, 75 flow. Second operand 4 states and 371 transitions. [2023-01-27 18:17:42,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 48 transitions, 232 flow [2023-01-27 18:17:42,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 48 transitions, 229 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-27 18:17:42,114 INFO L231 Difference]: Finished difference. Result has 37 places, 23 transitions, 86 flow [2023-01-27 18:17:42,114 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=86, PETRI_PLACES=37, PETRI_TRANSITIONS=23} [2023-01-27 18:17:42,115 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 4 predicate places. [2023-01-27 18:17:42,115 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 23 transitions, 86 flow [2023-01-27 18:17:42,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 83.4) internal successors, (417), 5 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:17:42,115 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:17:42,115 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:17:42,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-27 18:17:42,115 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:17:42,116 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:17:42,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1385265302, now seen corresponding path program 1 times [2023-01-27 18:17:42,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:17:42,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385324881] [2023-01-27 18:17:42,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:17:42,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:17:42,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:17:42,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:17:42,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:17:42,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385324881] [2023-01-27 18:17:42,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385324881] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:17:42,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:17:42,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 18:17:42,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600240642] [2023-01-27 18:17:42,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:17:42,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 18:17:42,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:17:42,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 18:17:42,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-27 18:17:42,380 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 203 [2023-01-27 18:17:42,381 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 23 transitions, 86 flow. Second operand has 5 states, 5 states have (on average 83.4) internal successors, (417), 5 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:17:42,381 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:17:42,381 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 203 [2023-01-27 18:17:42,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:17:42,523 INFO L130 PetriNetUnfolder]: 774/1201 cut-off events. [2023-01-27 18:17:42,524 INFO L131 PetriNetUnfolder]: For 1249/1250 co-relation queries the response was YES. [2023-01-27 18:17:42,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2940 conditions, 1201 events. 774/1201 cut-off events. For 1249/1250 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 5008 event pairs, 210 based on Foata normal form. 48/1248 useless extension candidates. Maximal degree in co-relation 2924. Up to 444 conditions per place. [2023-01-27 18:17:42,527 INFO L137 encePairwiseOnDemand]: 199/203 looper letters, 29 selfloop transitions, 3 changer transitions 9/42 dead transitions. [2023-01-27 18:17:42,527 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 42 transitions, 213 flow [2023-01-27 18:17:42,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-27 18:17:42,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-27 18:17:42,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 365 transitions. [2023-01-27 18:17:42,529 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44950738916256155 [2023-01-27 18:17:42,529 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 365 transitions. [2023-01-27 18:17:42,529 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 365 transitions. [2023-01-27 18:17:42,529 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:17:42,529 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 365 transitions. [2023-01-27 18:17:42,530 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 91.25) internal successors, (365), 4 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:17:42,530 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 203.0) internal successors, (1015), 5 states have internal predecessors, (1015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:17:42,531 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 203.0) internal successors, (1015), 5 states have internal predecessors, (1015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:17:42,531 INFO L175 Difference]: Start difference. First operand has 37 places, 23 transitions, 86 flow. Second operand 4 states and 365 transitions. [2023-01-27 18:17:42,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 42 transitions, 213 flow [2023-01-27 18:17:42,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 42 transitions, 201 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-01-27 18:17:42,533 INFO L231 Difference]: Finished difference. Result has 38 places, 21 transitions, 80 flow [2023-01-27 18:17:42,533 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=80, PETRI_PLACES=38, PETRI_TRANSITIONS=21} [2023-01-27 18:17:42,533 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 5 predicate places. [2023-01-27 18:17:42,534 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 21 transitions, 80 flow [2023-01-27 18:17:42,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 83.4) internal successors, (417), 5 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:17:42,534 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:17:42,534 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:17:42,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-27 18:17:42,534 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:17:42,534 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:17:42,534 INFO L85 PathProgramCache]: Analyzing trace with hash 562797259, now seen corresponding path program 1 times [2023-01-27 18:17:42,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:17:42,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171450563] [2023-01-27 18:17:42,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:17:42,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:17:42,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:17:43,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:17:43,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:17:43,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171450563] [2023-01-27 18:17:43,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171450563] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:17:43,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:17:43,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 18:17:43,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297692828] [2023-01-27 18:17:43,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:17:43,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-27 18:17:43,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:17:43,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-27 18:17:43,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-01-27 18:17:43,354 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 203 [2023-01-27 18:17:43,354 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 21 transitions, 80 flow. Second operand has 6 states, 6 states have (on average 85.0) internal successors, (510), 6 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:17:43,354 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:17:43,354 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 203 [2023-01-27 18:17:43,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:17:43,498 INFO L130 PetriNetUnfolder]: 369/597 cut-off events. [2023-01-27 18:17:43,499 INFO L131 PetriNetUnfolder]: For 467/467 co-relation queries the response was YES. [2023-01-27 18:17:43,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1553 conditions, 597 events. 369/597 cut-off events. For 467/467 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2084 event pairs, 163 based on Foata normal form. 2/599 useless extension candidates. Maximal degree in co-relation 1537. Up to 546 conditions per place. [2023-01-27 18:17:43,501 INFO L137 encePairwiseOnDemand]: 197/203 looper letters, 32 selfloop transitions, 5 changer transitions 0/39 dead transitions. [2023-01-27 18:17:43,501 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 39 transitions, 206 flow [2023-01-27 18:17:43,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-27 18:17:43,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-27 18:17:43,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 370 transitions. [2023-01-27 18:17:43,528 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45566502463054187 [2023-01-27 18:17:43,528 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 370 transitions. [2023-01-27 18:17:43,528 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 370 transitions. [2023-01-27 18:17:43,528 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:17:43,528 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 370 transitions. [2023-01-27 18:17:43,529 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 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:17:43,530 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 203.0) internal successors, (1015), 5 states have internal predecessors, (1015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:17:43,530 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 203.0) internal successors, (1015), 5 states have internal predecessors, (1015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:17:43,530 INFO L175 Difference]: Start difference. First operand has 38 places, 21 transitions, 80 flow. Second operand 4 states and 370 transitions. [2023-01-27 18:17:43,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 39 transitions, 206 flow [2023-01-27 18:17:43,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 39 transitions, 185 flow, removed 3 selfloop flow, removed 6 redundant places. [2023-01-27 18:17:43,533 INFO L231 Difference]: Finished difference. Result has 36 places, 24 transitions, 90 flow [2023-01-27 18:17:43,533 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=90, PETRI_PLACES=36, PETRI_TRANSITIONS=24} [2023-01-27 18:17:43,534 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 3 predicate places. [2023-01-27 18:17:43,534 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 24 transitions, 90 flow [2023-01-27 18:17:43,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 85.0) internal successors, (510), 6 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:17:43,534 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:17:43,534 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:17:43,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-27 18:17:43,535 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:17:43,535 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:17:43,535 INFO L85 PathProgramCache]: Analyzing trace with hash 909334148, now seen corresponding path program 1 times [2023-01-27 18:17:43,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:17:43,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116459951] [2023-01-27 18:17:43,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:17:43,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:17:43,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:17:43,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:17:43,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:17:43,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116459951] [2023-01-27 18:17:43,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116459951] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:17:43,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:17:43,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 18:17:43,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452825067] [2023-01-27 18:17:43,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:17:43,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 18:17:43,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:17:43,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 18:17:43,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-27 18:17:43,776 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 203 [2023-01-27 18:17:43,777 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 24 transitions, 90 flow. Second operand has 4 states, 4 states have (on average 91.25) internal successors, (365), 4 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:17:43,777 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:17:43,777 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 203 [2023-01-27 18:17:43,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:17:43,880 INFO L130 PetriNetUnfolder]: 255/458 cut-off events. [2023-01-27 18:17:43,880 INFO L131 PetriNetUnfolder]: For 240/244 co-relation queries the response was YES. [2023-01-27 18:17:43,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1224 conditions, 458 events. 255/458 cut-off events. For 240/244 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1890 event pairs, 49 based on Foata normal form. 41/489 useless extension candidates. Maximal degree in co-relation 1211. Up to 185 conditions per place. [2023-01-27 18:17:43,885 INFO L137 encePairwiseOnDemand]: 197/203 looper letters, 36 selfloop transitions, 5 changer transitions 1/45 dead transitions. [2023-01-27 18:17:43,885 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 45 transitions, 238 flow [2023-01-27 18:17:43,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-27 18:17:43,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-27 18:17:43,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 393 transitions. [2023-01-27 18:17:43,886 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4839901477832512 [2023-01-27 18:17:43,886 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 393 transitions. [2023-01-27 18:17:43,886 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 393 transitions. [2023-01-27 18:17:43,886 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:17:43,886 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 393 transitions. [2023-01-27 18:17:43,887 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 98.25) internal successors, (393), 4 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:17:43,888 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 203.0) internal successors, (1015), 5 states have internal predecessors, (1015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:17:43,888 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 203.0) internal successors, (1015), 5 states have internal predecessors, (1015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:17:43,888 INFO L175 Difference]: Start difference. First operand has 36 places, 24 transitions, 90 flow. Second operand 4 states and 393 transitions. [2023-01-27 18:17:43,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 45 transitions, 238 flow [2023-01-27 18:17:43,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 45 transitions, 232 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-27 18:17:43,890 INFO L231 Difference]: Finished difference. Result has 39 places, 27 transitions, 118 flow [2023-01-27 18:17:43,891 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=118, PETRI_PLACES=39, PETRI_TRANSITIONS=27} [2023-01-27 18:17:43,892 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 6 predicate places. [2023-01-27 18:17:43,892 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 27 transitions, 118 flow [2023-01-27 18:17:43,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 91.25) internal successors, (365), 4 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:17:43,892 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:17:43,892 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:17:43,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-01-27 18:17:43,893 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:17:43,893 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:17:43,893 INFO L85 PathProgramCache]: Analyzing trace with hash -639165580, now seen corresponding path program 1 times [2023-01-27 18:17:43,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:17:43,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99389942] [2023-01-27 18:17:43,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:17:43,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:17:43,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:17:44,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:17:44,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:17:44,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99389942] [2023-01-27 18:17:44,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99389942] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:17:44,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:17:44,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 18:17:44,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931653888] [2023-01-27 18:17:44,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:17:44,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 18:17:44,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:17:44,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 18:17:44,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-27 18:17:44,065 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 203 [2023-01-27 18:17:44,066 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 27 transitions, 118 flow. Second operand has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:17:44,066 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:17:44,066 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 203 [2023-01-27 18:17:44,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:17:44,178 INFO L130 PetriNetUnfolder]: 137/271 cut-off events. [2023-01-27 18:17:44,179 INFO L131 PetriNetUnfolder]: For 222/226 co-relation queries the response was YES. [2023-01-27 18:17:44,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 884 conditions, 271 events. 137/271 cut-off events. For 222/226 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 959 event pairs, 24 based on Foata normal form. 26/292 useless extension candidates. Maximal degree in co-relation 869. Up to 102 conditions per place. [2023-01-27 18:17:44,180 INFO L137 encePairwiseOnDemand]: 197/203 looper letters, 41 selfloop transitions, 8 changer transitions 1/53 dead transitions. [2023-01-27 18:17:44,180 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 53 transitions, 316 flow [2023-01-27 18:17:44,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 18:17:44,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 18:17:44,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 489 transitions. [2023-01-27 18:17:44,181 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48177339901477834 [2023-01-27 18:17:44,181 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 489 transitions. [2023-01-27 18:17:44,181 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 489 transitions. [2023-01-27 18:17:44,182 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:17:44,182 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 489 transitions. [2023-01-27 18:17:44,183 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 97.8) internal successors, (489), 5 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:17:44,184 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 203.0) internal successors, (1218), 6 states have internal predecessors, (1218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:17:44,184 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 203.0) internal successors, (1218), 6 states have internal predecessors, (1218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:17:44,184 INFO L175 Difference]: Start difference. First operand has 39 places, 27 transitions, 118 flow. Second operand 5 states and 489 transitions. [2023-01-27 18:17:44,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 53 transitions, 316 flow [2023-01-27 18:17:44,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 53 transitions, 306 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-01-27 18:17:44,185 INFO L231 Difference]: Finished difference. Result has 43 places, 30 transitions, 158 flow [2023-01-27 18:17:44,185 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=158, PETRI_PLACES=43, PETRI_TRANSITIONS=30} [2023-01-27 18:17:44,186 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 10 predicate places. [2023-01-27 18:17:44,186 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 30 transitions, 158 flow [2023-01-27 18:17:44,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:17:44,186 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:17:44,186 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:17:44,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-27 18:17:44,187 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:17:44,187 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:17:44,187 INFO L85 PathProgramCache]: Analyzing trace with hash 2068607719, now seen corresponding path program 1 times [2023-01-27 18:17:44,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:17:44,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686291127] [2023-01-27 18:17:44,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:17:44,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:17:44,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:17:44,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:17:44,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:17:44,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686291127] [2023-01-27 18:17:44,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686291127] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:17:44,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:17:44,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-27 18:17:44,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331547640] [2023-01-27 18:17:44,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:17:44,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-27 18:17:44,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:17:44,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-27 18:17:44,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-01-27 18:17:44,373 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 203 [2023-01-27 18:17:44,374 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 30 transitions, 158 flow. Second operand has 6 states, 6 states have (on average 90.66666666666667) internal successors, (544), 6 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:17:44,374 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:17:44,374 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 203 [2023-01-27 18:17:44,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:17:44,474 INFO L130 PetriNetUnfolder]: 90/186 cut-off events. [2023-01-27 18:17:44,474 INFO L131 PetriNetUnfolder]: For 290/294 co-relation queries the response was YES. [2023-01-27 18:17:44,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 667 conditions, 186 events. 90/186 cut-off events. For 290/294 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 566 event pairs, 24 based on Foata normal form. 9/192 useless extension candidates. Maximal degree in co-relation 650. Up to 66 conditions per place. [2023-01-27 18:17:44,475 INFO L137 encePairwiseOnDemand]: 197/203 looper letters, 31 selfloop transitions, 11 changer transitions 1/46 dead transitions. [2023-01-27 18:17:44,475 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 46 transitions, 303 flow [2023-01-27 18:17:44,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-27 18:17:44,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-27 18:17:44,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 570 transitions. [2023-01-27 18:17:44,477 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46798029556650245 [2023-01-27 18:17:44,477 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 570 transitions. [2023-01-27 18:17:44,477 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 570 transitions. [2023-01-27 18:17:44,477 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:17:44,477 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 570 transitions. [2023-01-27 18:17:44,478 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 95.0) internal successors, (570), 6 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:17:44,479 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 203.0) internal successors, (1421), 7 states have internal predecessors, (1421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:17:44,480 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 203.0) internal successors, (1421), 7 states have internal predecessors, (1421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:17:44,480 INFO L175 Difference]: Start difference. First operand has 43 places, 30 transitions, 158 flow. Second operand 6 states and 570 transitions. [2023-01-27 18:17:44,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 46 transitions, 303 flow [2023-01-27 18:17:44,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 46 transitions, 264 flow, removed 8 selfloop flow, removed 6 redundant places. [2023-01-27 18:17:44,481 INFO L231 Difference]: Finished difference. Result has 44 places, 30 transitions, 160 flow [2023-01-27 18:17:44,482 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=160, PETRI_PLACES=44, PETRI_TRANSITIONS=30} [2023-01-27 18:17:44,482 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 11 predicate places. [2023-01-27 18:17:44,482 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 30 transitions, 160 flow [2023-01-27 18:17:44,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 90.66666666666667) internal successors, (544), 6 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:17:44,482 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:17:44,482 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:17:44,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-01-27 18:17:44,483 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:17:44,483 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:17:44,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1318740538, now seen corresponding path program 1 times [2023-01-27 18:17:44,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:17:44,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945525611] [2023-01-27 18:17:44,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:17:44,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:17:44,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:17:45,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:17:45,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:17:45,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945525611] [2023-01-27 18:17:45,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945525611] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:17:45,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:17:45,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-27 18:17:45,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068157571] [2023-01-27 18:17:45,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:17:45,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-27 18:17:45,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:17:45,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-27 18:17:45,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-01-27 18:17:45,011 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 203 [2023-01-27 18:17:45,012 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 30 transitions, 160 flow. Second operand has 7 states, 7 states have (on average 90.71428571428571) internal successors, (635), 7 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:17:45,012 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:17:45,012 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 203 [2023-01-27 18:17:45,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:17:45,130 INFO L130 PetriNetUnfolder]: 118/239 cut-off events. [2023-01-27 18:17:45,130 INFO L131 PetriNetUnfolder]: For 390/396 co-relation queries the response was YES. [2023-01-27 18:17:45,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 869 conditions, 239 events. 118/239 cut-off events. For 390/396 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 769 event pairs, 14 based on Foata normal form. 7/246 useless extension candidates. Maximal degree in co-relation 853. Up to 163 conditions per place. [2023-01-27 18:17:45,131 INFO L137 encePairwiseOnDemand]: 196/203 looper letters, 40 selfloop transitions, 14 changer transitions 7/63 dead transitions. [2023-01-27 18:17:45,131 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 63 transitions, 468 flow [2023-01-27 18:17:45,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-27 18:17:45,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-27 18:17:45,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 571 transitions. [2023-01-27 18:17:45,133 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4688013136288998 [2023-01-27 18:17:45,133 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 571 transitions. [2023-01-27 18:17:45,133 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 571 transitions. [2023-01-27 18:17:45,133 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:17:45,133 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 571 transitions. [2023-01-27 18:17:45,134 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 95.16666666666667) internal successors, (571), 6 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:17:45,136 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 203.0) internal successors, (1421), 7 states have internal predecessors, (1421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:17:45,136 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 203.0) internal successors, (1421), 7 states have internal predecessors, (1421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:17:45,136 INFO L175 Difference]: Start difference. First operand has 44 places, 30 transitions, 160 flow. Second operand 6 states and 571 transitions. [2023-01-27 18:17:45,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 63 transitions, 468 flow [2023-01-27 18:17:45,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 63 transitions, 338 flow, removed 20 selfloop flow, removed 9 redundant places. [2023-01-27 18:17:45,138 INFO L231 Difference]: Finished difference. Result has 42 places, 38 transitions, 184 flow [2023-01-27 18:17:45,138 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=184, PETRI_PLACES=42, PETRI_TRANSITIONS=38} [2023-01-27 18:17:45,139 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 9 predicate places. [2023-01-27 18:17:45,139 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 38 transitions, 184 flow [2023-01-27 18:17:45,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 90.71428571428571) internal successors, (635), 7 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:17:45,139 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:17:45,139 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:17:45,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-01-27 18:17:45,139 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:17:45,139 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:17:45,140 INFO L85 PathProgramCache]: Analyzing trace with hash -681835562, now seen corresponding path program 2 times [2023-01-27 18:17:45,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:17:45,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571078407] [2023-01-27 18:17:45,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:17:45,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:17:45,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:17:45,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:17:45,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:17:45,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571078407] [2023-01-27 18:17:45,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571078407] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:17:45,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:17:45,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-27 18:17:45,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270553248] [2023-01-27 18:17:45,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:17:45,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-01-27 18:17:45,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:17:45,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-01-27 18:17:45,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-01-27 18:17:45,993 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 203 [2023-01-27 18:17:45,993 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 38 transitions, 184 flow. Second operand has 8 states, 8 states have (on average 83.375) internal successors, (667), 8 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:17:45,993 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:17:45,993 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 203 [2023-01-27 18:17:45,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:17:46,140 INFO L130 PetriNetUnfolder]: 126/261 cut-off events. [2023-01-27 18:17:46,140 INFO L131 PetriNetUnfolder]: For 244/256 co-relation queries the response was YES. [2023-01-27 18:17:46,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 872 conditions, 261 events. 126/261 cut-off events. For 244/256 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 889 event pairs, 24 based on Foata normal form. 13/274 useless extension candidates. Maximal degree in co-relation 858. Up to 133 conditions per place. [2023-01-27 18:17:46,141 INFO L137 encePairwiseOnDemand]: 196/203 looper letters, 33 selfloop transitions, 11 changer transitions 19/65 dead transitions. [2023-01-27 18:17:46,141 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 65 transitions, 405 flow [2023-01-27 18:17:46,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-27 18:17:46,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-27 18:17:46,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 529 transitions. [2023-01-27 18:17:46,144 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4343185550082102 [2023-01-27 18:17:46,145 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 529 transitions. [2023-01-27 18:17:46,145 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 529 transitions. [2023-01-27 18:17:46,145 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:17:46,145 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 529 transitions. [2023-01-27 18:17:46,146 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 88.16666666666667) internal successors, (529), 6 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:17:46,147 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 203.0) internal successors, (1421), 7 states have internal predecessors, (1421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:17:46,147 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 203.0) internal successors, (1421), 7 states have internal predecessors, (1421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:17:46,147 INFO L175 Difference]: Start difference. First operand has 42 places, 38 transitions, 184 flow. Second operand 6 states and 529 transitions. [2023-01-27 18:17:46,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 65 transitions, 405 flow [2023-01-27 18:17:46,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 65 transitions, 402 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-27 18:17:46,149 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 199 flow [2023-01-27 18:17:46,149 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=199, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2023-01-27 18:17:46,149 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 13 predicate places. [2023-01-27 18:17:46,149 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 199 flow [2023-01-27 18:17:46,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 83.375) internal successors, (667), 8 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:17:46,150 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:17:46,150 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:17:46,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-01-27 18:17:46,150 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:17:46,150 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:17:46,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1564516710, now seen corresponding path program 3 times [2023-01-27 18:17:46,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:17:46,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685516935] [2023-01-27 18:17:46,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:17:46,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:17:46,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-27 18:17:46,200 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-27 18:17:46,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-27 18:17:46,259 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-27 18:17:46,259 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-27 18:17:46,260 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-01-27 18:17:46,261 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-01-27 18:17:46,261 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-01-27 18:17:46,261 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-01-27 18:17:46,261 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-01-27 18:17:46,261 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-01-27 18:17:46,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-01-27 18:17:46,262 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:17:46,265 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-27 18:17:46,265 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-27 18:17:46,323 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.01 06:17:46 BasicIcfg [2023-01-27 18:17:46,323 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-27 18:17:46,323 INFO L158 Benchmark]: Toolchain (without parser) took 11443.81ms. Allocated memory was 509.6MB in the beginning and 765.5MB in the end (delta: 255.9MB). Free memory was 467.8MB in the beginning and 403.8MB in the end (delta: 64.0MB). Peak memory consumption was 321.9MB. Max. memory is 16.0GB. [2023-01-27 18:17:46,323 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 339.7MB. Free memory is still 288.0MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-27 18:17:46,323 INFO L158 Benchmark]: CACSL2BoogieTranslator took 415.99ms. Allocated memory is still 509.6MB. Free memory was 467.8MB in the beginning and 444.6MB in the end (delta: 23.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-01-27 18:17:46,324 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.52ms. Allocated memory is still 509.6MB. Free memory was 444.6MB in the beginning and 441.8MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-01-27 18:17:46,324 INFO L158 Benchmark]: Boogie Preprocessor took 29.33ms. Allocated memory is still 509.6MB. Free memory was 441.8MB in the beginning and 440.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-27 18:17:46,324 INFO L158 Benchmark]: RCFGBuilder took 511.66ms. Allocated memory is still 509.6MB. Free memory was 440.1MB in the beginning and 465.1MB in the end (delta: -25.1MB). Peak memory consumption was 36.1MB. Max. memory is 16.0GB. [2023-01-27 18:17:46,324 INFO L158 Benchmark]: TraceAbstraction took 10413.08ms. Allocated memory was 509.6MB in the beginning and 765.5MB in the end (delta: 255.9MB). Free memory was 464.1MB in the beginning and 403.8MB in the end (delta: 60.3MB). Peak memory consumption was 315.1MB. Max. memory is 16.0GB. [2023-01-27 18:17:46,325 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 339.7MB. Free memory is still 288.0MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 415.99ms. Allocated memory is still 509.6MB. Free memory was 467.8MB in the beginning and 444.6MB in the end (delta: 23.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 57.52ms. Allocated memory is still 509.6MB. Free memory was 444.6MB in the beginning and 441.8MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 29.33ms. Allocated memory is still 509.6MB. Free memory was 441.8MB in the beginning and 440.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 511.66ms. Allocated memory is still 509.6MB. Free memory was 440.1MB in the beginning and 465.1MB in the end (delta: -25.1MB). Peak memory consumption was 36.1MB. Max. memory is 16.0GB. * TraceAbstraction took 10413.08ms. Allocated memory was 509.6MB in the beginning and 765.5MB in the end (delta: 255.9MB). Free memory was 464.1MB in the beginning and 403.8MB in the end (delta: 60.3MB). Peak memory consumption was 315.1MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.4s, 113 PlacesBefore, 33 PlacesAfterwards, 105 TransitionsBefore, 23 TransitionsAfterwards, 1920 CoEnabledTransitionPairs, 7 FixpointIterations, 38 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 2 ChoiceCompositions, 95 TotalNumberOfCompositions, 5105 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2510, independent: 2331, independent conditional: 0, independent unconditional: 2331, dependent: 179, dependent conditional: 0, dependent unconditional: 179, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1050, independent: 1007, independent conditional: 0, independent unconditional: 1007, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2510, independent: 1324, independent conditional: 0, independent unconditional: 1324, dependent: 136, dependent conditional: 0, dependent unconditional: 136, unknown: 1050, unknown conditional: 0, unknown unconditional: 1050] , Statistics on independence cache: Total cache size (in pairs): 76, Positive cache size: 62, Positive conditional cache size: 0, Positive unconditional cache size: 62, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14, 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_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L719] 0 int y = 0; [L721] 0 int z = 0; [L722] 0 _Bool z$flush_delayed; [L723] 0 int z$mem_tmp; [L724] 0 _Bool z$r_buff0_thd0; [L725] 0 _Bool z$r_buff0_thd1; [L726] 0 _Bool z$r_buff0_thd2; [L727] 0 _Bool z$r_buff0_thd3; [L728] 0 _Bool z$r_buff1_thd0; [L729] 0 _Bool z$r_buff1_thd1; [L730] 0 _Bool z$r_buff1_thd2; [L731] 0 _Bool z$r_buff1_thd3; [L732] 0 _Bool z$read_delayed; [L733] 0 int *z$read_delayed_var; [L734] 0 int z$w_buff0; [L735] 0 _Bool z$w_buff0_used; [L736] 0 int z$w_buff1; [L737] 0 _Bool z$w_buff1_used; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L820] 0 pthread_t t1961; [L821] FCALL, FORK 0 pthread_create(&t1961, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1961, ((void *)0), P0, ((void *)0))=-2, t1961={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] [L822] 0 pthread_t t1962; [L823] FCALL, FORK 0 pthread_create(&t1962, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1962, ((void *)0), P1, ((void *)0))=-1, t1961={5:0}, t1962={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] [L824] 0 pthread_t t1963; [L825] FCALL, FORK 0 pthread_create(&t1963, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1963, ((void *)0), P2, ((void *)0))=0, t1961={5:0}, t1962={6:0}, t1963={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] [L743] 1 z$w_buff1 = z$w_buff0 [L744] 1 z$w_buff0 = 2 [L745] 1 z$w_buff1_used = z$w_buff0_used [L746] 1 z$w_buff0_used = (_Bool)1 [L747] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L747] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L748] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L749] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L750] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L751] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L752] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, 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=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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L772] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L775] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L792] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, 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=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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L795] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, 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=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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L758] 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) [L759] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L760] 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 [L761] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L762] 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_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L778] 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) [L779] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L780] 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 [L781] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L782] 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_p1_EAX=1, __unbuffered_p2_EAX=1, 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=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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 2 return 0; [L798] 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) [L799] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L800] 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 [L801] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L802] 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 [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, 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=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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L805] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L807] 3 return 0; [L827] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1961={5:0}, t1962={6:0}, t1963={3: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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L829] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L829] RET 0 assume_abort_if_not(main$tmp_guard0) [L831] 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) [L832] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L833] 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 [L834] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L835] 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_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1961={5:0}, t1962={6:0}, t1963={3: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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L838] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L839] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L840] 0 z$flush_delayed = weak$$choice2 [L841] 0 z$mem_tmp = z [L842] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L843] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L844] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L845] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L846] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L848] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L849] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1) [L850] 0 z = z$flush_delayed ? z$mem_tmp : z [L851] 0 z$flush_delayed = (_Bool)0 [L853] 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_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 825]: 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: 823]: 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: 821]: 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, 135 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: 10.3s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 347 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 347 mSDsluCounter, 15 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5 mSDsCounter, 51 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 688 IncrementalHoareTripleChecker+Invalid, 739 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 51 mSolverCounterUnsat, 10 mSDtfsCounter, 688 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 53 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=199occurred in iteration=12, InterpolantAutomatonStates: 51, 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, 4.4s InterpolantComputationTime, 184 NumberOfCodeBlocks, 184 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 151 ConstructedInterpolants, 0 QuantifiedInterpolants, 2564 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-01-27 18:17:46,345 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...