/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/weaver/popl20-commit-1.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-27 21:28:11,438 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-27 21:28:11,440 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-27 21:28:11,478 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-27 21:28:11,478 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-27 21:28:11,481 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-27 21:28:11,484 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-27 21:28:11,486 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-27 21:28:11,487 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-27 21:28:11,493 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-27 21:28:11,494 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-27 21:28:11,494 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-27 21:28:11,495 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-27 21:28:11,495 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-27 21:28:11,496 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-27 21:28:11,497 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-27 21:28:11,497 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-27 21:28:11,498 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-27 21:28:11,499 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-27 21:28:11,500 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-27 21:28:11,501 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-27 21:28:11,505 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-27 21:28:11,506 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-27 21:28:11,507 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-27 21:28:11,515 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-27 21:28:11,516 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-27 21:28:11,516 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-27 21:28:11,517 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-27 21:28:11,517 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-27 21:28:11,518 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-27 21:28:11,518 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-27 21:28:11,519 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-27 21:28:11,520 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-27 21:28:11,521 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-27 21:28:11,521 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-27 21:28:11,521 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-27 21:28:11,522 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-27 21:28:11,522 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-27 21:28:11,522 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-27 21:28:11,523 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-27 21:28:11,523 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-27 21:28:11,524 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 21:28:11,550 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-27 21:28:11,551 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-27 21:28:11,552 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-27 21:28:11,552 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-27 21:28:11,553 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-27 21:28:11,553 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-27 21:28:11,553 INFO L138 SettingsManager]: * Use SBE=true [2023-01-27 21:28:11,553 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-27 21:28:11,553 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-27 21:28:11,554 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-27 21:28:11,554 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-27 21:28:11,554 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-27 21:28:11,555 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-27 21:28:11,555 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-27 21:28:11,555 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-27 21:28:11,555 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-27 21:28:11,555 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-27 21:28:11,555 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-27 21:28:11,555 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-27 21:28:11,555 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-27 21:28:11,555 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-27 21:28:11,556 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-27 21:28:11,556 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-27 21:28:11,556 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 21:28:11,556 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-27 21:28:11,556 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-27 21:28:11,556 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-27 21:28:11,556 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-27 21:28:11,557 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-27 21:28:11,557 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-27 21:28:11,557 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-27 21:28:11,557 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 21:28:11,772 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-27 21:28:11,793 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-27 21:28:11,795 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-27 21:28:11,796 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-27 21:28:11,796 INFO L275 PluginConnector]: CDTParser initialized [2023-01-27 21:28:11,797 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-commit-1.wvr.c [2023-01-27 21:28:12,930 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-27 21:28:13,141 INFO L351 CDTParser]: Found 1 translation units. [2023-01-27 21:28:13,142 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-commit-1.wvr.c [2023-01-27 21:28:13,150 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52262690f/a36430c800a14f208b3b4dc6ff7dcb43/FLAG87a3dfebd [2023-01-27 21:28:13,164 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52262690f/a36430c800a14f208b3b4dc6ff7dcb43 [2023-01-27 21:28:13,166 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-27 21:28:13,167 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-27 21:28:13,168 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-27 21:28:13,169 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-27 21:28:13,171 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-27 21:28:13,172 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 09:28:13" (1/1) ... [2023-01-27 21:28:13,173 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@374774b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 09:28:13, skipping insertion in model container [2023-01-27 21:28:13,173 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 09:28:13" (1/1) ... [2023-01-27 21:28:13,179 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-27 21:28:13,204 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-27 21:28:13,338 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-commit-1.wvr.c[4604,4617] [2023-01-27 21:28:13,345 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 21:28:13,353 INFO L203 MainTranslator]: Completed pre-run [2023-01-27 21:28:13,377 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-commit-1.wvr.c[4604,4617] [2023-01-27 21:28:13,381 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 21:28:13,388 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-27 21:28:13,388 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-27 21:28:13,393 INFO L208 MainTranslator]: Completed translation [2023-01-27 21:28:13,394 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 09:28:13 WrapperNode [2023-01-27 21:28:13,394 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-27 21:28:13,394 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-27 21:28:13,395 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-27 21:28:13,395 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-27 21:28:13,399 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 09:28:13" (1/1) ... [2023-01-27 21:28:13,407 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 09:28:13" (1/1) ... [2023-01-27 21:28:13,437 INFO L138 Inliner]: procedures = 25, calls = 68, calls flagged for inlining = 20, calls inlined = 24, statements flattened = 347 [2023-01-27 21:28:13,437 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-27 21:28:13,438 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-27 21:28:13,438 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-27 21:28:13,438 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-27 21:28:13,447 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 09:28:13" (1/1) ... [2023-01-27 21:28:13,448 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 09:28:13" (1/1) ... [2023-01-27 21:28:13,451 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 09:28:13" (1/1) ... [2023-01-27 21:28:13,452 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 09:28:13" (1/1) ... [2023-01-27 21:28:13,461 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 09:28:13" (1/1) ... [2023-01-27 21:28:13,466 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 09:28:13" (1/1) ... [2023-01-27 21:28:13,468 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 09:28:13" (1/1) ... [2023-01-27 21:28:13,469 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 09:28:13" (1/1) ... [2023-01-27 21:28:13,473 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-27 21:28:13,482 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-27 21:28:13,483 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-27 21:28:13,483 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-27 21:28:13,483 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 09:28:13" (1/1) ... [2023-01-27 21:28:13,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 21:28:13,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 21:28:13,513 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 21:28:13,517 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 21:28:13,547 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-27 21:28:13,547 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-27 21:28:13,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-27 21:28:13,547 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-01-27 21:28:13,547 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-01-27 21:28:13,547 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-01-27 21:28:13,548 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-01-27 21:28:13,548 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-01-27 21:28:13,548 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-01-27 21:28:13,549 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-01-27 21:28:13,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-27 21:28:13,549 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-27 21:28:13,550 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-27 21:28:13,550 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-01-27 21:28:13,550 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-27 21:28:13,550 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-27 21:28:13,550 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-27 21:28:13,552 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 21:28:13,661 INFO L236 CfgBuilder]: Building ICFG [2023-01-27 21:28:13,663 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-27 21:28:14,176 INFO L277 CfgBuilder]: Performing block encoding [2023-01-27 21:28:14,396 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-27 21:28:14,397 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2023-01-27 21:28:14,403 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 09:28:14 BoogieIcfgContainer [2023-01-27 21:28:14,403 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-27 21:28:14,405 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-27 21:28:14,405 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-27 21:28:14,407 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-27 21:28:14,407 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 09:28:13" (1/3) ... [2023-01-27 21:28:14,408 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d133f3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 09:28:14, skipping insertion in model container [2023-01-27 21:28:14,408 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 09:28:13" (2/3) ... [2023-01-27 21:28:14,408 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d133f3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 09:28:14, skipping insertion in model container [2023-01-27 21:28:14,408 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 09:28:14" (3/3) ... [2023-01-27 21:28:14,409 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-commit-1.wvr.c [2023-01-27 21:28:14,424 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-27 21:28:14,424 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-01-27 21:28:14,424 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-27 21:28:14,505 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-01-27 21:28:14,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 239 places, 248 transitions, 520 flow [2023-01-27 21:28:14,658 INFO L130 PetriNetUnfolder]: 19/245 cut-off events. [2023-01-27 21:28:14,658 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-01-27 21:28:14,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 258 conditions, 245 events. 19/245 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 142 event pairs, 0 based on Foata normal form. 0/225 useless extension candidates. Maximal degree in co-relation 209. Up to 2 conditions per place. [2023-01-27 21:28:14,664 INFO L82 GeneralOperation]: Start removeDead. Operand has 239 places, 248 transitions, 520 flow [2023-01-27 21:28:14,669 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 226 places, 235 transitions, 488 flow [2023-01-27 21:28:14,672 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-27 21:28:14,683 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 226 places, 235 transitions, 488 flow [2023-01-27 21:28:14,685 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 226 places, 235 transitions, 488 flow [2023-01-27 21:28:14,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 226 places, 235 transitions, 488 flow [2023-01-27 21:28:14,728 INFO L130 PetriNetUnfolder]: 19/235 cut-off events. [2023-01-27 21:28:14,728 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-01-27 21:28:14,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 248 conditions, 235 events. 19/235 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 140 event pairs, 0 based on Foata normal form. 0/216 useless extension candidates. Maximal degree in co-relation 209. Up to 2 conditions per place. [2023-01-27 21:28:14,732 INFO L119 LiptonReduction]: Number of co-enabled transitions 1460 [2023-01-27 21:28:22,647 INFO L134 LiptonReduction]: Checked pairs total: 3005 [2023-01-27 21:28:22,647 INFO L136 LiptonReduction]: Total number of compositions: 247 [2023-01-27 21:28:22,659 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-27 21:28:22,664 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;@63cb0492, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-27 21:28:22,665 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-01-27 21:28:22,671 INFO L130 PetriNetUnfolder]: 6/29 cut-off events. [2023-01-27 21:28:22,671 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-01-27 21:28:22,671 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:28:22,672 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 21:28:22,672 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 21:28:22,676 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:28:22,677 INFO L85 PathProgramCache]: Analyzing trace with hash 169519787, now seen corresponding path program 1 times [2023-01-27 21:28:22,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:28:22,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245750940] [2023-01-27 21:28:22,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:28:22,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:28:22,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:28:23,400 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 21:28:23,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:28:23,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245750940] [2023-01-27 21:28:23,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245750940] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 21:28:23,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 21:28:23,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 21:28:23,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547914263] [2023-01-27 21:28:23,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 21:28:23,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 21:28:23,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:28:23,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 21:28:23,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-01-27 21:28:23,435 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 495 [2023-01-27 21:28:23,439 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 30 transitions, 78 flow. Second operand has 5 states, 5 states have (on average 187.8) internal successors, (939), 5 states have internal predecessors, (939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:28:23,439 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:28:23,439 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 495 [2023-01-27 21:28:23,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:28:23,684 INFO L130 PetriNetUnfolder]: 564/838 cut-off events. [2023-01-27 21:28:23,684 INFO L131 PetriNetUnfolder]: For 93/93 co-relation queries the response was YES. [2023-01-27 21:28:23,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1782 conditions, 838 events. 564/838 cut-off events. For 93/93 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 3025 event pairs, 130 based on Foata normal form. 2/616 useless extension candidates. Maximal degree in co-relation 1134. Up to 602 conditions per place. [2023-01-27 21:28:23,690 INFO L137 encePairwiseOnDemand]: 485/495 looper letters, 57 selfloop transitions, 12 changer transitions 2/71 dead transitions. [2023-01-27 21:28:23,691 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 71 transitions, 335 flow [2023-01-27 21:28:23,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-27 21:28:23,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-27 21:28:23,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 809 transitions. [2023-01-27 21:28:23,707 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4085858585858586 [2023-01-27 21:28:23,707 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 809 transitions. [2023-01-27 21:28:23,708 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 809 transitions. [2023-01-27 21:28:23,710 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:28:23,712 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 809 transitions. [2023-01-27 21:28:23,717 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 202.25) internal successors, (809), 4 states have internal predecessors, (809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:28:23,723 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 495.0) internal successors, (2475), 5 states have internal predecessors, (2475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:28:23,724 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 495.0) internal successors, (2475), 5 states have internal predecessors, (2475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:28:23,725 INFO L175 Difference]: Start difference. First operand has 34 places, 30 transitions, 78 flow. Second operand 4 states and 809 transitions. [2023-01-27 21:28:23,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 71 transitions, 335 flow [2023-01-27 21:28:23,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 71 transitions, 301 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-01-27 21:28:23,731 INFO L231 Difference]: Finished difference. Result has 33 places, 41 transitions, 149 flow [2023-01-27 21:28:23,732 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=495, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=149, PETRI_PLACES=33, PETRI_TRANSITIONS=41} [2023-01-27 21:28:23,735 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, -1 predicate places. [2023-01-27 21:28:23,735 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 41 transitions, 149 flow [2023-01-27 21:28:23,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 187.8) internal successors, (939), 5 states have internal predecessors, (939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:28:23,736 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:28:23,736 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 21:28:23,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-27 21:28:23,737 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 21:28:23,737 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:28:23,737 INFO L85 PathProgramCache]: Analyzing trace with hash 790486479, now seen corresponding path program 1 times [2023-01-27 21:28:23,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:28:23,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455778087] [2023-01-27 21:28:23,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:28:23,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:28:23,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:28:23,858 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:28:23,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:28:23,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455778087] [2023-01-27 21:28:23,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455778087] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 21:28:23,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 21:28:23,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 21:28:23,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101346832] [2023-01-27 21:28:23,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 21:28:23,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 21:28:23,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:28:23,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 21:28:23,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-27 21:28:23,863 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 495 [2023-01-27 21:28:23,864 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 41 transitions, 149 flow. Second operand has 4 states, 4 states have (on average 189.25) internal successors, (757), 4 states have internal predecessors, (757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:28:23,864 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:28:23,864 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 495 [2023-01-27 21:28:23,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:28:24,050 INFO L130 PetriNetUnfolder]: 680/1058 cut-off events. [2023-01-27 21:28:24,050 INFO L131 PetriNetUnfolder]: For 236/236 co-relation queries the response was YES. [2023-01-27 21:28:24,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2588 conditions, 1058 events. 680/1058 cut-off events. For 236/236 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 3978 event pairs, 453 based on Foata normal form. 50/1042 useless extension candidates. Maximal degree in co-relation 1563. Up to 837 conditions per place. [2023-01-27 21:28:24,056 INFO L137 encePairwiseOnDemand]: 489/495 looper letters, 38 selfloop transitions, 2 changer transitions 24/64 dead transitions. [2023-01-27 21:28:24,056 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 64 transitions, 353 flow [2023-01-27 21:28:24,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-27 21:28:24,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-27 21:28:24,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 790 transitions. [2023-01-27 21:28:24,059 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.398989898989899 [2023-01-27 21:28:24,059 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 790 transitions. [2023-01-27 21:28:24,059 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 790 transitions. [2023-01-27 21:28:24,059 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:28:24,059 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 790 transitions. [2023-01-27 21:28:24,061 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 197.5) internal successors, (790), 4 states have internal predecessors, (790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:28:24,064 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 495.0) internal successors, (2475), 5 states have internal predecessors, (2475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:28:24,066 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 495.0) internal successors, (2475), 5 states have internal predecessors, (2475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:28:24,066 INFO L175 Difference]: Start difference. First operand has 33 places, 41 transitions, 149 flow. Second operand 4 states and 790 transitions. [2023-01-27 21:28:24,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 64 transitions, 353 flow [2023-01-27 21:28:24,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 64 transitions, 353 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-01-27 21:28:24,068 INFO L231 Difference]: Finished difference. Result has 37 places, 40 transitions, 159 flow [2023-01-27 21:28:24,068 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=495, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=159, PETRI_PLACES=37, PETRI_TRANSITIONS=40} [2023-01-27 21:28:24,069 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 3 predicate places. [2023-01-27 21:28:24,069 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 40 transitions, 159 flow [2023-01-27 21:28:24,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 189.25) internal successors, (757), 4 states have internal predecessors, (757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:28:24,070 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:28:24,070 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 21:28:24,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-27 21:28:24,070 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 21:28:24,071 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:28:24,071 INFO L85 PathProgramCache]: Analyzing trace with hash 611376253, now seen corresponding path program 1 times [2023-01-27 21:28:24,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:28:24,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201201980] [2023-01-27 21:28:24,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:28:24,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:28:24,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:28:24,206 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 21:28:24,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:28:24,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201201980] [2023-01-27 21:28:24,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201201980] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 21:28:24,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 21:28:24,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 21:28:24,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670907130] [2023-01-27 21:28:24,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 21:28:24,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-27 21:28:24,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:28:24,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-27 21:28:24,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-27 21:28:24,209 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 495 [2023-01-27 21:28:24,210 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 40 transitions, 159 flow. Second operand has 3 states, 3 states have (on average 220.33333333333334) internal successors, (661), 3 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:28:24,211 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:28:24,211 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 495 [2023-01-27 21:28:24,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:28:24,384 INFO L130 PetriNetUnfolder]: 623/959 cut-off events. [2023-01-27 21:28:24,384 INFO L131 PetriNetUnfolder]: For 367/367 co-relation queries the response was YES. [2023-01-27 21:28:24,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2455 conditions, 959 events. 623/959 cut-off events. For 367/367 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3602 event pairs, 240 based on Foata normal form. 70/1029 useless extension candidates. Maximal degree in co-relation 2439. Up to 512 conditions per place. [2023-01-27 21:28:24,389 INFO L137 encePairwiseOnDemand]: 492/495 looper letters, 54 selfloop transitions, 2 changer transitions 0/56 dead transitions. [2023-01-27 21:28:24,389 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 56 transitions, 314 flow [2023-01-27 21:28:24,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 21:28:24,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 21:28:24,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 688 transitions. [2023-01-27 21:28:24,391 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4632996632996633 [2023-01-27 21:28:24,391 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 688 transitions. [2023-01-27 21:28:24,391 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 688 transitions. [2023-01-27 21:28:24,392 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:28:24,392 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 688 transitions. [2023-01-27 21:28:24,394 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 229.33333333333334) internal successors, (688), 3 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:28:24,396 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 495.0) internal successors, (1980), 4 states have internal predecessors, (1980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:28:24,397 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 495.0) internal successors, (1980), 4 states have internal predecessors, (1980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:28:24,397 INFO L175 Difference]: Start difference. First operand has 37 places, 40 transitions, 159 flow. Second operand 3 states and 688 transitions. [2023-01-27 21:28:24,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 56 transitions, 314 flow [2023-01-27 21:28:24,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 56 transitions, 310 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-01-27 21:28:24,400 INFO L231 Difference]: Finished difference. Result has 38 places, 39 transitions, 157 flow [2023-01-27 21:28:24,400 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=495, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=157, PETRI_PLACES=38, PETRI_TRANSITIONS=39} [2023-01-27 21:28:24,401 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 4 predicate places. [2023-01-27 21:28:24,401 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 39 transitions, 157 flow [2023-01-27 21:28:24,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 220.33333333333334) internal successors, (661), 3 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:28:24,401 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:28:24,401 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 21:28:24,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-27 21:28:24,402 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 21:28:24,402 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:28:24,402 INFO L85 PathProgramCache]: Analyzing trace with hash 654922567, now seen corresponding path program 1 times [2023-01-27 21:28:24,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:28:24,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583972377] [2023-01-27 21:28:24,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:28:24,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:28:24,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:28:24,511 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 21:28:24,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:28:24,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583972377] [2023-01-27 21:28:24,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583972377] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 21:28:24,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 21:28:24,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 21:28:24,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662799437] [2023-01-27 21:28:24,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 21:28:24,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-27 21:28:24,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:28:24,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-27 21:28:24,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-27 21:28:24,514 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 495 [2023-01-27 21:28:24,515 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 39 transitions, 157 flow. Second operand has 3 states, 3 states have (on average 223.33333333333334) internal successors, (670), 3 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:28:24,515 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:28:24,515 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 495 [2023-01-27 21:28:24,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:28:24,668 INFO L130 PetriNetUnfolder]: 625/969 cut-off events. [2023-01-27 21:28:24,668 INFO L131 PetriNetUnfolder]: For 442/442 co-relation queries the response was YES. [2023-01-27 21:28:24,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2537 conditions, 969 events. 625/969 cut-off events. For 442/442 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3620 event pairs, 224 based on Foata normal form. 44/1013 useless extension candidates. Maximal degree in co-relation 2152. Up to 520 conditions per place. [2023-01-27 21:28:24,674 INFO L137 encePairwiseOnDemand]: 492/495 looper letters, 47 selfloop transitions, 2 changer transitions 6/55 dead transitions. [2023-01-27 21:28:24,674 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 55 transitions, 306 flow [2023-01-27 21:28:24,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 21:28:24,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 21:28:24,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 699 transitions. [2023-01-27 21:28:24,677 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4707070707070707 [2023-01-27 21:28:24,677 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 699 transitions. [2023-01-27 21:28:24,677 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 699 transitions. [2023-01-27 21:28:24,678 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:28:24,678 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 699 transitions. [2023-01-27 21:28:24,679 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 233.0) internal successors, (699), 3 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:28:24,682 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 495.0) internal successors, (1980), 4 states have internal predecessors, (1980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:28:24,683 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 495.0) internal successors, (1980), 4 states have internal predecessors, (1980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:28:24,683 INFO L175 Difference]: Start difference. First operand has 38 places, 39 transitions, 157 flow. Second operand 3 states and 699 transitions. [2023-01-27 21:28:24,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 55 transitions, 306 flow [2023-01-27 21:28:24,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 55 transitions, 304 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-27 21:28:24,686 INFO L231 Difference]: Finished difference. Result has 40 places, 38 transitions, 157 flow [2023-01-27 21:28:24,686 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=495, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=157, PETRI_PLACES=40, PETRI_TRANSITIONS=38} [2023-01-27 21:28:24,687 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 6 predicate places. [2023-01-27 21:28:24,687 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 38 transitions, 157 flow [2023-01-27 21:28:24,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 223.33333333333334) internal successors, (670), 3 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:28:24,688 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:28:24,688 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 21:28:24,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-27 21:28:24,688 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 21:28:24,688 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:28:24,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1525535317, now seen corresponding path program 1 times [2023-01-27 21:28:24,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:28:24,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911892327] [2023-01-27 21:28:24,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:28:24,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:28:24,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:28:24,816 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 21:28:24,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:28:24,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911892327] [2023-01-27 21:28:24,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911892327] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 21:28:24,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 21:28:24,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 21:28:24,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557784013] [2023-01-27 21:28:24,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 21:28:24,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 21:28:24,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:28:24,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 21:28:24,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-27 21:28:24,819 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 495 [2023-01-27 21:28:24,820 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 38 transitions, 157 flow. Second operand has 4 states, 4 states have (on average 190.0) internal successors, (760), 4 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:28:24,820 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:28:24,820 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 495 [2023-01-27 21:28:24,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:28:25,098 INFO L130 PetriNetUnfolder]: 883/1411 cut-off events. [2023-01-27 21:28:25,099 INFO L131 PetriNetUnfolder]: For 762/762 co-relation queries the response was YES. [2023-01-27 21:28:25,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3767 conditions, 1411 events. 883/1411 cut-off events. For 762/762 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 5924 event pairs, 701 based on Foata normal form. 26/1437 useless extension candidates. Maximal degree in co-relation 2284. Up to 965 conditions per place. [2023-01-27 21:28:25,106 INFO L137 encePairwiseOnDemand]: 490/495 looper letters, 34 selfloop transitions, 3 changer transitions 25/62 dead transitions. [2023-01-27 21:28:25,106 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 62 transitions, 361 flow [2023-01-27 21:28:25,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-27 21:28:25,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-27 21:28:25,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 791 transitions. [2023-01-27 21:28:25,109 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3994949494949495 [2023-01-27 21:28:25,109 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 791 transitions. [2023-01-27 21:28:25,109 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 791 transitions. [2023-01-27 21:28:25,109 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:28:25,109 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 791 transitions. [2023-01-27 21:28:25,111 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 197.75) internal successors, (791), 4 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:28:25,114 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 495.0) internal successors, (2475), 5 states have internal predecessors, (2475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:28:25,116 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 495.0) internal successors, (2475), 5 states have internal predecessors, (2475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:28:25,116 INFO L175 Difference]: Start difference. First operand has 40 places, 38 transitions, 157 flow. Second operand 4 states and 791 transitions. [2023-01-27 21:28:25,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 62 transitions, 361 flow [2023-01-27 21:28:25,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 62 transitions, 359 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-27 21:28:25,118 INFO L231 Difference]: Finished difference. Result has 43 places, 37 transitions, 161 flow [2023-01-27 21:28:25,119 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=495, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=161, PETRI_PLACES=43, PETRI_TRANSITIONS=37} [2023-01-27 21:28:25,119 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 9 predicate places. [2023-01-27 21:28:25,119 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 37 transitions, 161 flow [2023-01-27 21:28:25,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 190.0) internal successors, (760), 4 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:28:25,120 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:28:25,120 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 21:28:25,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-27 21:28:25,120 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 21:28:25,121 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:28:25,121 INFO L85 PathProgramCache]: Analyzing trace with hash -424741139, now seen corresponding path program 1 times [2023-01-27 21:28:25,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:28:25,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693312677] [2023-01-27 21:28:25,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:28:25,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:28:25,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:28:25,227 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-27 21:28:25,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:28:25,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693312677] [2023-01-27 21:28:25,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693312677] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 21:28:25,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 21:28:25,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 21:28:25,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220429290] [2023-01-27 21:28:25,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 21:28:25,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 21:28:25,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:28:25,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 21:28:25,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-27 21:28:25,230 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 495 [2023-01-27 21:28:25,231 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 37 transitions, 161 flow. Second operand has 4 states, 4 states have (on average 190.25) internal successors, (761), 4 states have internal predecessors, (761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:28:25,231 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:28:25,231 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 495 [2023-01-27 21:28:25,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:28:25,396 INFO L130 PetriNetUnfolder]: 634/996 cut-off events. [2023-01-27 21:28:25,397 INFO L131 PetriNetUnfolder]: For 575/575 co-relation queries the response was YES. [2023-01-27 21:28:25,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2702 conditions, 996 events. 634/996 cut-off events. For 575/575 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3749 event pairs, 505 based on Foata normal form. 18/1014 useless extension candidates. Maximal degree in co-relation 2668. Up to 831 conditions per place. [2023-01-27 21:28:25,402 INFO L137 encePairwiseOnDemand]: 487/495 looper letters, 30 selfloop transitions, 6 changer transitions 17/53 dead transitions. [2023-01-27 21:28:25,402 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 53 transitions, 307 flow [2023-01-27 21:28:25,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 21:28:25,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 21:28:25,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 971 transitions. [2023-01-27 21:28:25,405 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3923232323232323 [2023-01-27 21:28:25,406 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 971 transitions. [2023-01-27 21:28:25,406 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 971 transitions. [2023-01-27 21:28:25,406 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:28:25,406 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 971 transitions. [2023-01-27 21:28:25,408 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 194.2) internal successors, (971), 5 states have internal predecessors, (971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:28:25,411 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 495.0) internal successors, (2970), 6 states have internal predecessors, (2970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:28:25,412 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 495.0) internal successors, (2970), 6 states have internal predecessors, (2970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:28:25,412 INFO L175 Difference]: Start difference. First operand has 43 places, 37 transitions, 161 flow. Second operand 5 states and 971 transitions. [2023-01-27 21:28:25,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 53 transitions, 307 flow [2023-01-27 21:28:25,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 53 transitions, 297 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-01-27 21:28:25,415 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 166 flow [2023-01-27 21:28:25,415 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=495, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=166, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2023-01-27 21:28:25,416 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 12 predicate places. [2023-01-27 21:28:25,416 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 166 flow [2023-01-27 21:28:25,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 190.25) internal successors, (761), 4 states have internal predecessors, (761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:28:25,416 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:28:25,417 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 21:28:25,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-27 21:28:25,417 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 21:28:25,417 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:28:25,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1608617032, now seen corresponding path program 1 times [2023-01-27 21:28:25,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:28:25,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551168214] [2023-01-27 21:28:25,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:28:25,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:28:25,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:28:25,556 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-01-27 21:28:25,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:28:25,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551168214] [2023-01-27 21:28:25,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551168214] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 21:28:25,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 21:28:25,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-27 21:28:25,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927359726] [2023-01-27 21:28:25,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 21:28:25,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-27 21:28:25,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:28:25,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-27 21:28:25,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-27 21:28:25,559 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 495 [2023-01-27 21:28:25,560 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 166 flow. Second operand has 3 states, 3 states have (on average 224.66666666666666) internal successors, (674), 3 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:28:25,560 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:28:25,560 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 495 [2023-01-27 21:28:25,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:28:25,692 INFO L130 PetriNetUnfolder]: 353/547 cut-off events. [2023-01-27 21:28:25,693 INFO L131 PetriNetUnfolder]: For 349/349 co-relation queries the response was YES. [2023-01-27 21:28:25,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1486 conditions, 547 events. 353/547 cut-off events. For 349/349 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1604 event pairs, 139 based on Foata normal form. 14/561 useless extension candidates. Maximal degree in co-relation 1435. Up to 460 conditions per place. [2023-01-27 21:28:25,695 INFO L137 encePairwiseOnDemand]: 492/495 looper letters, 37 selfloop transitions, 2 changer transitions 7/46 dead transitions. [2023-01-27 21:28:25,696 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 46 transitions, 283 flow [2023-01-27 21:28:25,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 21:28:25,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 21:28:25,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 689 transitions. [2023-01-27 21:28:25,698 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.463973063973064 [2023-01-27 21:28:25,698 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 689 transitions. [2023-01-27 21:28:25,698 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 689 transitions. [2023-01-27 21:28:25,698 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:28:25,698 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 689 transitions. [2023-01-27 21:28:25,700 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 229.66666666666666) internal successors, (689), 3 states have internal predecessors, (689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:28:25,702 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 495.0) internal successors, (1980), 4 states have internal predecessors, (1980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:28:25,702 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 495.0) internal successors, (1980), 4 states have internal predecessors, (1980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:28:25,703 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 166 flow. Second operand 3 states and 689 transitions. [2023-01-27 21:28:25,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 46 transitions, 283 flow [2023-01-27 21:28:25,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 46 transitions, 261 flow, removed 3 selfloop flow, removed 4 redundant places. [2023-01-27 21:28:25,704 INFO L231 Difference]: Finished difference. Result has 45 places, 37 transitions, 158 flow [2023-01-27 21:28:25,705 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=495, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=158, PETRI_PLACES=45, PETRI_TRANSITIONS=37} [2023-01-27 21:28:25,705 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 11 predicate places. [2023-01-27 21:28:25,705 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 37 transitions, 158 flow [2023-01-27 21:28:25,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 224.66666666666666) internal successors, (674), 3 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:28:25,706 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:28:25,706 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 21:28:25,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-27 21:28:25,706 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 21:28:25,706 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:28:25,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1743219548, now seen corresponding path program 1 times [2023-01-27 21:28:25,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:28:25,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492954465] [2023-01-27 21:28:25,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:28:25,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:28:25,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:28:26,013 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-27 21:28:26,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:28:26,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492954465] [2023-01-27 21:28:26,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492954465] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 21:28:26,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1345044255] [2023-01-27 21:28:26,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:28:26,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 21:28:26,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 21:28:26,021 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 21:28:26,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-01-27 21:28:26,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:28:26,194 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 12 conjunts are in the unsatisfiable core [2023-01-27 21:28:26,198 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 21:28:26,402 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-27 21:28:26,402 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 21:28:26,528 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-27 21:28:26,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1345044255] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 21:28:26,529 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 21:28:26,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2023-01-27 21:28:26,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137721344] [2023-01-27 21:28:26,529 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 21:28:26,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-01-27 21:28:26,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:28:26,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-01-27 21:28:26,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2023-01-27 21:28:26,533 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 495 [2023-01-27 21:28:26,537 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 37 transitions, 158 flow. Second operand has 14 states, 14 states have (on average 179.21428571428572) internal successors, (2509), 14 states have internal predecessors, (2509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:28:26,537 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:28:26,537 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 495 [2023-01-27 21:28:26,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:28:27,390 INFO L130 PetriNetUnfolder]: 1251/2042 cut-off events. [2023-01-27 21:28:27,390 INFO L131 PetriNetUnfolder]: For 1609/1609 co-relation queries the response was YES. [2023-01-27 21:28:27,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5636 conditions, 2042 events. 1251/2042 cut-off events. For 1609/1609 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 9046 event pairs, 364 based on Foata normal form. 192/2234 useless extension candidates. Maximal degree in co-relation 2554. Up to 483 conditions per place. [2023-01-27 21:28:27,401 INFO L137 encePairwiseOnDemand]: 484/495 looper letters, 78 selfloop transitions, 16 changer transitions 118/212 dead transitions. [2023-01-27 21:28:27,401 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 212 transitions, 1170 flow [2023-01-27 21:28:27,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-01-27 21:28:27,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-01-27 21:28:27,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 3712 transitions. [2023-01-27 21:28:27,412 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.374949494949495 [2023-01-27 21:28:27,412 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 3712 transitions. [2023-01-27 21:28:27,412 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 3712 transitions. [2023-01-27 21:28:27,414 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:28:27,414 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 3712 transitions. [2023-01-27 21:28:27,422 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 185.6) internal successors, (3712), 20 states have internal predecessors, (3712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:28:27,435 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 495.0) internal successors, (10395), 21 states have internal predecessors, (10395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:28:27,438 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 495.0) internal successors, (10395), 21 states have internal predecessors, (10395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:28:27,438 INFO L175 Difference]: Start difference. First operand has 45 places, 37 transitions, 158 flow. Second operand 20 states and 3712 transitions. [2023-01-27 21:28:27,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 212 transitions, 1170 flow [2023-01-27 21:28:27,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 212 transitions, 1157 flow, removed 4 selfloop flow, removed 1 redundant places. [2023-01-27 21:28:27,444 INFO L231 Difference]: Finished difference. Result has 74 places, 48 transitions, 319 flow [2023-01-27 21:28:27,444 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=495, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=319, PETRI_PLACES=74, PETRI_TRANSITIONS=48} [2023-01-27 21:28:27,446 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 40 predicate places. [2023-01-27 21:28:27,446 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 48 transitions, 319 flow [2023-01-27 21:28:27,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 179.21428571428572) internal successors, (2509), 14 states have internal predecessors, (2509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:28:27,448 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:28:27,448 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 21:28:27,459 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-01-27 21:28:27,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 21:28:27,655 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 21:28:27,656 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:28:27,656 INFO L85 PathProgramCache]: Analyzing trace with hash -2011379154, now seen corresponding path program 2 times [2023-01-27 21:28:27,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:28:27,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041953042] [2023-01-27 21:28:27,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:28:27,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:28:27,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:28:27,922 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-01-27 21:28:27,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:28:27,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041953042] [2023-01-27 21:28:27,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041953042] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 21:28:27,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 21:28:27,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 21:28:27,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931725089] [2023-01-27 21:28:27,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 21:28:27,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 21:28:27,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:28:27,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 21:28:27,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-01-27 21:28:27,930 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 495 [2023-01-27 21:28:27,932 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 48 transitions, 319 flow. Second operand has 5 states, 5 states have (on average 218.6) internal successors, (1093), 5 states have internal predecessors, (1093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:28:27,932 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:28:27,932 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 495 [2023-01-27 21:28:27,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:28:28,426 INFO L130 PetriNetUnfolder]: 2001/3024 cut-off events. [2023-01-27 21:28:28,427 INFO L131 PetriNetUnfolder]: For 9982/9982 co-relation queries the response was YES. [2023-01-27 21:28:28,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11593 conditions, 3024 events. 2001/3024 cut-off events. For 9982/9982 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 13309 event pairs, 650 based on Foata normal form. 42/3066 useless extension candidates. Maximal degree in co-relation 6322. Up to 1345 conditions per place. [2023-01-27 21:28:28,448 INFO L137 encePairwiseOnDemand]: 490/495 looper letters, 73 selfloop transitions, 15 changer transitions 0/88 dead transitions. [2023-01-27 21:28:28,449 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 88 transitions, 727 flow [2023-01-27 21:28:28,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-27 21:28:28,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-27 21:28:28,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 918 transitions. [2023-01-27 21:28:28,452 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4636363636363636 [2023-01-27 21:28:28,452 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 918 transitions. [2023-01-27 21:28:28,452 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 918 transitions. [2023-01-27 21:28:28,453 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:28:28,453 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 918 transitions. [2023-01-27 21:28:28,455 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 229.5) internal successors, (918), 4 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:28:28,458 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 495.0) internal successors, (2475), 5 states have internal predecessors, (2475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:28:28,459 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 495.0) internal successors, (2475), 5 states have internal predecessors, (2475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:28:28,459 INFO L175 Difference]: Start difference. First operand has 74 places, 48 transitions, 319 flow. Second operand 4 states and 918 transitions. [2023-01-27 21:28:28,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 88 transitions, 727 flow [2023-01-27 21:28:28,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 88 transitions, 638 flow, removed 39 selfloop flow, removed 8 redundant places. [2023-01-27 21:28:28,471 INFO L231 Difference]: Finished difference. Result has 64 places, 58 transitions, 429 flow [2023-01-27 21:28:28,472 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=495, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=429, PETRI_PLACES=64, PETRI_TRANSITIONS=58} [2023-01-27 21:28:28,472 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 30 predicate places. [2023-01-27 21:28:28,473 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 58 transitions, 429 flow [2023-01-27 21:28:28,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 218.6) internal successors, (1093), 5 states have internal predecessors, (1093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:28:28,473 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:28:28,474 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 21:28:28,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-27 21:28:28,474 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 21:28:28,474 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:28:28,474 INFO L85 PathProgramCache]: Analyzing trace with hash -23841826, now seen corresponding path program 1 times [2023-01-27 21:28:28,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:28:28,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025550813] [2023-01-27 21:28:28,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:28:28,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:28:28,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:28:28,718 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-01-27 21:28:28,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:28:28,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025550813] [2023-01-27 21:28:28,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025550813] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 21:28:28,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1879635764] [2023-01-27 21:28:28,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:28:28,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 21:28:28,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 21:28:28,721 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 21:28:28,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-01-27 21:28:28,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:28:28,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 8 conjunts are in the unsatisfiable core [2023-01-27 21:28:28,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 21:28:28,947 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-01-27 21:28:28,948 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 21:28:29,022 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-01-27 21:28:29,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1879635764] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 21:28:29,022 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 21:28:29,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2023-01-27 21:28:29,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478272492] [2023-01-27 21:28:29,023 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 21:28:29,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-01-27 21:28:29,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:28:29,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-01-27 21:28:29,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2023-01-27 21:28:29,027 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 495 [2023-01-27 21:28:29,029 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 58 transitions, 429 flow. Second operand has 12 states, 12 states have (on average 185.83333333333334) internal successors, (2230), 12 states have internal predecessors, (2230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:28:29,029 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:28:29,029 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 495 [2023-01-27 21:28:29,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:28:29,353 INFO L130 PetriNetUnfolder]: 949/1472 cut-off events. [2023-01-27 21:28:29,354 INFO L131 PetriNetUnfolder]: For 4771/4771 co-relation queries the response was YES. [2023-01-27 21:28:29,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5720 conditions, 1472 events. 949/1472 cut-off events. For 4771/4771 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 5597 event pairs, 669 based on Foata normal form. 2/1474 useless extension candidates. Maximal degree in co-relation 5287. Up to 1332 conditions per place. [2023-01-27 21:28:29,364 INFO L137 encePairwiseOnDemand]: 490/495 looper letters, 42 selfloop transitions, 3 changer transitions 33/78 dead transitions. [2023-01-27 21:28:29,364 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 78 transitions, 598 flow [2023-01-27 21:28:29,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-27 21:28:29,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-27 21:28:29,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1155 transitions. [2023-01-27 21:28:29,368 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3888888888888889 [2023-01-27 21:28:29,368 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1155 transitions. [2023-01-27 21:28:29,369 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1155 transitions. [2023-01-27 21:28:29,369 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:28:29,369 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1155 transitions. [2023-01-27 21:28:29,372 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 192.5) internal successors, (1155), 6 states have internal predecessors, (1155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:28:29,388 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 495.0) internal successors, (3465), 7 states have internal predecessors, (3465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:28:29,390 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 495.0) internal successors, (3465), 7 states have internal predecessors, (3465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:28:29,390 INFO L175 Difference]: Start difference. First operand has 64 places, 58 transitions, 429 flow. Second operand 6 states and 1155 transitions. [2023-01-27 21:28:29,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 78 transitions, 598 flow [2023-01-27 21:28:29,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 78 transitions, 560 flow, removed 19 selfloop flow, removed 1 redundant places. [2023-01-27 21:28:29,397 INFO L231 Difference]: Finished difference. Result has 68 places, 45 transitions, 275 flow [2023-01-27 21:28:29,397 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=495, PETRI_DIFFERENCE_MINUEND_FLOW=311, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=275, PETRI_PLACES=68, PETRI_TRANSITIONS=45} [2023-01-27 21:28:29,397 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 34 predicate places. [2023-01-27 21:28:29,397 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 45 transitions, 275 flow [2023-01-27 21:28:29,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 185.83333333333334) internal successors, (2230), 12 states have internal predecessors, (2230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:28:29,398 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:28:29,398 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 21:28:29,405 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-01-27 21:28:29,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-01-27 21:28:29,605 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 21:28:29,606 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:28:29,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1711614402, now seen corresponding path program 2 times [2023-01-27 21:28:29,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:28:29,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900585728] [2023-01-27 21:28:29,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:28:29,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:28:29,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:28:33,546 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:28:33,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:28:33,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900585728] [2023-01-27 21:28:33,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900585728] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 21:28:33,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1740990884] [2023-01-27 21:28:33,548 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-27 21:28:33,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 21:28:33,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 21:28:33,550 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 21:28:33,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-01-27 21:28:33,729 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-27 21:28:33,729 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 21:28:33,732 INFO L263 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 74 conjunts are in the unsatisfiable core [2023-01-27 21:28:33,737 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 21:28:34,900 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-01-27 21:28:34,900 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 21:28:47,458 WARN L222 SmtUtils]: Spent 10.07s on a formula simplification that was a NOOP. DAG size: 40 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 21:28:49,635 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| c_~manager~0.base))) (let ((.cse7 (* c_~client_back~0 4)) (.cse1 (select .cse2 (+ c_~manager~0.offset (* c_~manager_back~0 4))))) (let ((.cse3 (forall ((~client~0.base Int) (~client~0.offset Int)) (let ((.cse8 (select |c_#memory_int| ~client~0.base))) (or (not (= .cse1 (select .cse8 (+ .cse7 ~client~0.offset)))) (= (select .cse8 (+ (* c_~client_front~0 4) ~client~0.offset)) .cse1))))) (.cse0 (forall ((~client~0.base Int) (~client~0.offset Int)) (not (= .cse1 (select (select |c_#memory_int| ~client~0.base) (+ .cse7 ~client~0.offset))))))) (let ((.cse5 (and .cse3 .cse0)) (.cse6 (= (mod c_~safe~0 256) 0))) (and (or (let ((.cse4 (= c_~update~0 (select (select |c_#memory_int| c_~node~0.base) (+ (* c_~node_front~0 4) c_~node~0.offset))))) (and (or (and (or .cse0 (= .cse1 (select .cse2 (+ (* 4 c_~manager_front~0) c_~manager~0.offset)))) .cse3) (not .cse4)) (or .cse5 .cse4))) .cse6) (or .cse5 (not .cse6))))))) is different from false [2023-01-27 21:29:40,067 WARN L222 SmtUtils]: Spent 50.23s on a formula simplification. DAG size of input: 71 DAG size of output: 69 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 21:30:36,780 WARN L222 SmtUtils]: Spent 54.28s on a formula simplification. DAG size of input: 79 DAG size of output: 75 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 21:30:36,896 INFO L321 Elim1Store]: treesize reduction 39, result has 60.2 percent of original size [2023-01-27 21:30:36,897 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 67 [2023-01-27 21:30:36,979 INFO L321 Elim1Store]: treesize reduction 48, result has 70.7 percent of original size [2023-01-27 21:30:36,979 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 61 treesize of output 127 [2023-01-27 21:30:37,081 INFO L321 Elim1Store]: treesize reduction 48, result has 68.8 percent of original size [2023-01-27 21:30:37,083 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 61 treesize of output 117 [2023-01-27 21:30:37,318 INFO L321 Elim1Store]: treesize reduction 266, result has 43.9 percent of original size [2023-01-27 21:30:37,319 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 127 treesize of output 233 [2023-01-27 21:30:37,781 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 1 not checked. [2023-01-27 21:30:37,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1740990884] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 21:30:37,781 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 21:30:37,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 13] total 43 [2023-01-27 21:30:37,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915681252] [2023-01-27 21:30:37,782 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 21:30:37,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2023-01-27 21:30:37,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:30:37,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-01-27 21:30:37,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=266, Invalid=1627, Unknown=3, NotChecked=84, Total=1980 [2023-01-27 21:30:37,790 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 495 [2023-01-27 21:30:37,794 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 45 transitions, 275 flow. Second operand has 45 states, 45 states have (on average 141.04444444444445) internal successors, (6347), 45 states have internal predecessors, (6347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:30:37,794 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:30:37,794 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 495 [2023-01-27 21:30:37,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:30:50,060 WARN L222 SmtUtils]: Spent 12.17s on a formula simplification. DAG size of input: 116 DAG size of output: 91 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 21:31:07,664 WARN L222 SmtUtils]: Spent 16.13s on a formula simplification. DAG size of input: 85 DAG size of output: 70 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 21:31:32,222 WARN L222 SmtUtils]: Spent 16.21s on a formula simplification. DAG size of input: 117 DAG size of output: 68 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 21:32:30,530 WARN L222 SmtUtils]: Spent 56.19s on a formula simplification. DAG size of input: 83 DAG size of output: 76 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 21:32:32,563 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:32:34,566 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:32:36,574 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:32:38,579 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:32:40,582 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:33:25,364 WARN L222 SmtUtils]: Spent 42.71s on a formula simplification. DAG size of input: 58 DAG size of output: 51 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 21:33:37,791 WARN L222 SmtUtils]: Spent 12.17s on a formula simplification. DAG size of input: 105 DAG size of output: 82 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 21:34:10,091 WARN L222 SmtUtils]: Spent 16.15s on a formula simplification. DAG size of input: 98 DAG size of output: 60 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 21:34:12,120 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:34:14,139 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:34:16,143 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:34:18,161 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:34:20,164 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:34:22,167 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:34:24,199 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-01-27 21:34:26,210 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-01-27 21:34:28,223 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-01-27 21:34:40,715 WARN L222 SmtUtils]: Spent 12.14s on a formula simplification. DAG size of input: 91 DAG size of output: 75 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 21:34:42,725 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:34:44,741 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:34:46,747 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:34:48,755 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-01-27 21:34:50,757 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-01-27 21:34:52,759 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:34:54,762 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:34:56,765 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:34:58,768 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:35:00,770 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:35:02,779 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:35:04,897 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-01-27 21:35:06,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-01-27 21:35:07,515 INFO L130 PetriNetUnfolder]: 1320/2122 cut-off events. [2023-01-27 21:35:07,515 INFO L131 PetriNetUnfolder]: For 3947/3947 co-relation queries the response was YES. [2023-01-27 21:35:07,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7099 conditions, 2122 events. 1320/2122 cut-off events. For 3947/3947 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 9083 event pairs, 520 based on Foata normal form. 1/2123 useless extension candidates. Maximal degree in co-relation 7062. Up to 1245 conditions per place. [2023-01-27 21:35:07,534 INFO L137 encePairwiseOnDemand]: 477/495 looper letters, 118 selfloop transitions, 62 changer transitions 72/252 dead transitions. [2023-01-27 21:35:07,534 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 252 transitions, 1526 flow [2023-01-27 21:35:07,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-01-27 21:35:07,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2023-01-27 21:35:07,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 6360 transitions. [2023-01-27 21:35:07,553 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.29201101928374656 [2023-01-27 21:35:07,553 INFO L72 ComplementDD]: Start complementDD. Operand 44 states and 6360 transitions. [2023-01-27 21:35:07,553 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 6360 transitions. [2023-01-27 21:35:07,557 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:35:07,557 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 44 states and 6360 transitions. [2023-01-27 21:35:07,569 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 45 states, 44 states have (on average 144.54545454545453) internal successors, (6360), 44 states have internal predecessors, (6360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:35:07,592 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 45 states, 45 states have (on average 495.0) internal successors, (22275), 45 states have internal predecessors, (22275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:35:07,595 INFO L81 ComplementDD]: Finished complementDD. Result has 45 states, 45 states have (on average 495.0) internal successors, (22275), 45 states have internal predecessors, (22275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:35:07,596 INFO L175 Difference]: Start difference. First operand has 68 places, 45 transitions, 275 flow. Second operand 44 states and 6360 transitions. [2023-01-27 21:35:07,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 252 transitions, 1526 flow [2023-01-27 21:35:07,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 252 transitions, 1484 flow, removed 18 selfloop flow, removed 5 redundant places. [2023-01-27 21:35:07,604 INFO L231 Difference]: Finished difference. Result has 106 places, 99 transitions, 801 flow [2023-01-27 21:35:07,604 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=495, PETRI_DIFFERENCE_MINUEND_FLOW=257, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=44, PETRI_FLOW=801, PETRI_PLACES=106, PETRI_TRANSITIONS=99} [2023-01-27 21:35:07,605 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 72 predicate places. [2023-01-27 21:35:07,605 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 99 transitions, 801 flow [2023-01-27 21:35:07,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 141.04444444444445) internal successors, (6347), 45 states have internal predecessors, (6347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:35:07,607 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:35:07,607 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 21:35:07,616 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-01-27 21:35:07,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 21:35:07,816 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 21:35:07,816 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:35:07,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1225962343, now seen corresponding path program 3 times [2023-01-27 21:35:07,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:35:07,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192256000] [2023-01-27 21:35:07,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:35:07,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:35:08,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:35:11,804 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:35:11,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:35:11,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192256000] [2023-01-27 21:35:11,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192256000] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 21:35:11,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [815253839] [2023-01-27 21:35:11,805 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-01-27 21:35:11,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 21:35:11,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 21:35:11,806 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 21:35:11,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-01-27 21:35:12,054 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-01-27 21:35:12,054 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 21:35:12,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 91 conjunts are in the unsatisfiable core [2023-01-27 21:35:12,067 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 21:35:13,332 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 21:35:13,332 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 21:35:34,610 WARN L222 SmtUtils]: Spent 20.08s on a formula simplification that was a NOOP. DAG size: 73 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 21:36:21,274 WARN L222 SmtUtils]: Spent 44.28s on a formula simplification. DAG size of input: 84 DAG size of output: 79 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 21:36:21,429 INFO L321 Elim1Store]: treesize reduction 48, result has 70.7 percent of original size [2023-01-27 21:36:21,429 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 61 treesize of output 127 [2023-01-27 21:36:21,536 INFO L321 Elim1Store]: treesize reduction 48, result has 70.7 percent of original size [2023-01-27 21:36:21,536 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 62 treesize of output 127 [2023-01-27 21:36:21,629 INFO L321 Elim1Store]: treesize reduction 48, result has 69.2 percent of original size [2023-01-27 21:36:21,629 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 63 treesize of output 119 [2023-01-27 21:36:21,667 INFO L321 Elim1Store]: treesize reduction 153, result has 0.6 percent of original size [2023-01-27 21:36:21,668 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 61 treesize of output 1 [2023-01-27 21:36:21,704 INFO L321 Elim1Store]: treesize reduction 39, result has 60.2 percent of original size [2023-01-27 21:36:21,704 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 67 [2023-01-27 21:36:22,367 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-01-27 21:36:22,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [815253839] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 21:36:22,368 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 21:36:22,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 15] total 49 [2023-01-27 21:36:22,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992631163] [2023-01-27 21:36:22,368 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 21:36:22,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2023-01-27 21:36:22,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:36:22,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2023-01-27 21:36:22,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=471, Invalid=2078, Unknown=1, NotChecked=0, Total=2550 [2023-01-27 21:36:22,374 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 495 [2023-01-27 21:36:22,378 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 99 transitions, 801 flow. Second operand has 51 states, 51 states have (on average 140.92156862745097) internal successors, (7187), 51 states have internal predecessors, (7187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:36:22,378 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:36:22,379 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 495 [2023-01-27 21:36:22,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:37:51,454 WARN L222 SmtUtils]: Spent 1.48m on a formula simplification. DAG size of input: 135 DAG size of output: 85 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 21:37:53,463 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:37:55,477 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:38:56,275 WARN L222 SmtUtils]: Spent 56.21s on a formula simplification. DAG size of input: 79 DAG size of output: 74 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 21:39:29,114 WARN L222 SmtUtils]: Spent 32.43s on a formula simplification. DAG size of input: 116 DAG size of output: 82 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 21:39:31,188 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:39:33,194 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:39:35,203 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:40:03,719 WARN L222 SmtUtils]: Spent 28.30s on a formula simplification. DAG size of input: 121 DAG size of output: 88 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 21:40:06,007 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-01-27 21:40:08,012 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-01-27 21:40:09,365 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-01-27 21:41:57,405 WARN L222 SmtUtils]: Spent 1.80m on a formula simplification. DAG size of input: 109 DAG size of output: 101 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Received shutdown request... [2023-01-27 21:42:28,292 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-01-27 21:42:28,292 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-01-27 21:42:29,302 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-01-27 21:42:29,493 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2023-01-27 21:42:29,557 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 137 [2023-01-27 21:42:29,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2023-01-27 21:42:29,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-01-27 21:42:29,558 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Not enough levels on assertion stack at de.uni_freiburg.informatik.ultimate.logic.NoopScript.pop(NoopScript.java:272) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:138) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:99) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.pop(HistoryRecordingScript.java:117) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.pop(UndoableWrapperScript.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.restore(UndoableWrapperScript.java:87) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:236) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:160) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:376) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:282) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.NestedWordAutomataUtils.getSuccessorState(NestedWordAutomataUtils.java:483) at de.uni_freiburg.informatik.ultimate.automata.petrinet.operations.DifferencePetriNet$DifferenceSuccessorTransitionProvider.getOrConstructTransition(DifferencePetriNet.java:279) at de.uni_freiburg.informatik.ultimate.automata.petrinet.operations.DifferencePetriNet$DifferenceSuccessorTransitionProvider.getTransitions(DifferencePetriNet.java:261) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.addFullyInstantiatedCandidate(PossibleExtensions.java:168) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:195) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.update(PossibleExtensions.java:135) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolder.computeUnfoldingHelper(PetriNetUnfolder.java:209) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolder.computeUnfolding(PetriNetUnfolder.java:168) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolder.(PetriNetUnfolder.java:129) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.FinitePrefix.(FinitePrefix.java:76) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.FinitePrefix.(FinitePrefix.java:64) at de.uni_freiburg.informatik.ultimate.automata.petrinet.operations.DifferencePairwiseOnDemand.(DifferencePairwiseOnDemand.java:125) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNet.enhanceAnddeterminizeInterpolantAutomaton(CegarLoopForPetriNet.java:481) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNet.refineAbstraction(CegarLoopForPetriNet.java:227) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-01-27 21:42:29,561 INFO L158 Benchmark]: Toolchain (without parser) took 856393.55ms. Allocated memory was 367.0MB in the beginning and 763.4MB in the end (delta: 396.4MB). Free memory was 328.1MB in the beginning and 504.0MB in the end (delta: -175.8MB). Peak memory consumption was 222.4MB. Max. memory is 16.0GB. [2023-01-27 21:42:29,561 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 255.9MB. Free memory is still 213.2MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-27 21:42:29,561 INFO L158 Benchmark]: CACSL2BoogieTranslator took 225.50ms. Allocated memory is still 367.0MB. Free memory was 328.1MB in the beginning and 315.4MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. [2023-01-27 21:42:29,561 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.07ms. Allocated memory is still 367.0MB. Free memory was 315.4MB in the beginning and 312.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-27 21:42:29,562 INFO L158 Benchmark]: Boogie Preprocessor took 34.97ms. Allocated memory is still 367.0MB. Free memory was 312.7MB in the beginning and 310.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-27 21:42:29,562 INFO L158 Benchmark]: RCFGBuilder took 920.52ms. Allocated memory is still 367.0MB. Free memory was 310.3MB in the beginning and 323.1MB in the end (delta: -12.8MB). Peak memory consumption was 40.5MB. Max. memory is 16.0GB. [2023-01-27 21:42:29,562 INFO L158 Benchmark]: TraceAbstraction took 855155.95ms. Allocated memory was 367.0MB in the beginning and 763.4MB in the end (delta: 396.4MB). Free memory was 323.1MB in the beginning and 504.0MB in the end (delta: -180.9MB). Peak memory consumption was 215.5MB. Max. memory is 16.0GB. [2023-01-27 21:42:29,563 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 255.9MB. Free memory is still 213.2MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 225.50ms. Allocated memory is still 367.0MB. Free memory was 328.1MB in the beginning and 315.4MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 43.07ms. Allocated memory is still 367.0MB. Free memory was 315.4MB in the beginning and 312.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 34.97ms. Allocated memory is still 367.0MB. Free memory was 312.7MB in the beginning and 310.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 920.52ms. Allocated memory is still 367.0MB. Free memory was 310.3MB in the beginning and 323.1MB in the end (delta: -12.8MB). Peak memory consumption was 40.5MB. Max. memory is 16.0GB. * TraceAbstraction took 855155.95ms. Allocated memory was 367.0MB in the beginning and 763.4MB in the end (delta: 396.4MB). Free memory was 323.1MB in the beginning and 504.0MB in the end (delta: -180.9MB). Peak memory consumption was 215.5MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.0s, 226 PlacesBefore, 34 PlacesAfterwards, 235 TransitionsBefore, 30 TransitionsAfterwards, 1460 CoEnabledTransitionPairs, 8 FixpointIterations, 163 TrivialSequentialCompositions, 28 ConcurrentSequentialCompositions, 32 TrivialYvCompositions, 11 ConcurrentYvCompositions, 13 ChoiceCompositions, 247 TotalNumberOfCompositions, 3005 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1957, independent: 1858, independent conditional: 0, independent unconditional: 1858, dependent: 99, dependent conditional: 0, dependent unconditional: 99, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 849, independent: 829, independent conditional: 0, independent unconditional: 829, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1957, independent: 1029, independent conditional: 0, independent unconditional: 1029, dependent: 79, dependent conditional: 0, dependent unconditional: 79, unknown: 849, unknown conditional: 0, unknown unconditional: 849] , Statistics on independence cache: Total cache size (in pairs): 73, Positive cache size: 65, Positive conditional cache size: 0, Positive unconditional cache size: 65, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - ExceptionOrErrorResult: SMTLIBException: Not enough levels on assertion stack de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Not enough levels on assertion stack: de.uni_freiburg.informatik.ultimate.logic.NoopScript.pop(NoopScript.java:272) RESULT: Ultimate could not prove your program: Toolchain returned no result. Completed graceful shutdown