/usr/bin/java -Xmx8000000000 -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-NoLbe.epf --traceabstraction.use.on-demand.petri.net.difference true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/queue_ok_longest.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 16:10:38,619 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 16:10:38,620 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 16:10:38,643 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 16:10:38,643 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 16:10:38,644 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 16:10:38,645 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 16:10:38,646 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 16:10:38,647 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 16:10:38,648 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 16:10:38,648 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 16:10:38,649 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 16:10:38,649 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 16:10:38,650 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 16:10:38,651 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 16:10:38,655 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 16:10:38,656 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 16:10:38,659 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 16:10:38,662 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 16:10:38,668 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 16:10:38,669 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 16:10:38,670 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 16:10:38,671 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 16:10:38,671 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 16:10:38,673 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 16:10:38,673 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 16:10:38,673 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 16:10:38,674 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 16:10:38,674 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 16:10:38,675 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 16:10:38,675 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 16:10:38,675 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 16:10:38,675 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 16:10:38,676 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 16:10:38,676 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 16:10:38,677 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 16:10:38,677 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 16:10:38,677 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 16:10:38,677 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 16:10:38,678 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 16:10:38,678 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 16:10:38,683 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-NoLbe.epf [2022-12-06 16:10:38,709 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 16:10:38,709 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 16:10:38,710 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-06 16:10:38,710 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-06 16:10:38,711 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 16:10:38,711 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 16:10:38,712 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 16:10:38,712 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 16:10:38,712 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 16:10:38,712 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 16:10:38,713 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 16:10:38,713 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 16:10:38,713 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 16:10:38,713 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 16:10:38,713 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 16:10:38,713 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 16:10:38,713 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 16:10:38,713 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 16:10:38,713 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 16:10:38,713 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 16:10:38,713 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 16:10:38,714 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 16:10:38,714 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 16:10:38,714 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 16:10:38,714 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 16:10:38,714 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 16:10:38,714 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 16:10:38,714 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 16:10:38,714 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 16:10:38,714 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-06 16:10:38,714 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-06 16:10:38,714 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true [2022-12-06 16:10:39,060 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 16:10:39,088 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 16:10:39,090 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 16:10:39,091 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 16:10:39,091 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 16:10:39,092 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_ok_longest.i [2022-12-06 16:10:40,182 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 16:10:40,448 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 16:10:40,448 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longest.i [2022-12-06 16:10:40,469 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba66f9ad5/21539ebd419042e486a1ac22d10cae98/FLAG15f995a39 [2022-12-06 16:10:40,480 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba66f9ad5/21539ebd419042e486a1ac22d10cae98 [2022-12-06 16:10:40,481 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 16:10:40,482 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 16:10:40,483 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 16:10:40,483 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 16:10:40,485 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 16:10:40,485 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:10:40" (1/1) ... [2022-12-06 16:10:40,486 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@586cc466 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:10:40, skipping insertion in model container [2022-12-06 16:10:40,486 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:10:40" (1/1) ... [2022-12-06 16:10:40,490 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 16:10:40,541 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 16:10:40,888 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longest.i[43280,43293] [2022-12-06 16:10:40,893 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longest.i[43553,43566] [2022-12-06 16:10:40,895 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 16:10:40,905 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 16:10:40,952 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longest.i[43280,43293] [2022-12-06 16:10:40,958 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longest.i[43553,43566] [2022-12-06 16:10:40,967 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 16:10:41,004 INFO L208 MainTranslator]: Completed translation [2022-12-06 16:10:41,005 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:10:41 WrapperNode [2022-12-06 16:10:41,005 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 16:10:41,006 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 16:10:41,006 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 16:10:41,006 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 16:10:41,010 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:10:41" (1/1) ... [2022-12-06 16:10:41,037 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:10:41" (1/1) ... [2022-12-06 16:10:41,068 INFO L138 Inliner]: procedures = 274, calls = 57, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 202 [2022-12-06 16:10:41,069 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 16:10:41,069 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 16:10:41,069 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 16:10:41,069 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 16:10:41,075 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:10:41" (1/1) ... [2022-12-06 16:10:41,075 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:10:41" (1/1) ... [2022-12-06 16:10:41,078 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:10:41" (1/1) ... [2022-12-06 16:10:41,078 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:10:41" (1/1) ... [2022-12-06 16:10:41,100 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:10:41" (1/1) ... [2022-12-06 16:10:41,102 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:10:41" (1/1) ... [2022-12-06 16:10:41,103 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:10:41" (1/1) ... [2022-12-06 16:10:41,104 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:10:41" (1/1) ... [2022-12-06 16:10:41,106 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 16:10:41,107 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 16:10:41,107 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 16:10:41,107 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 16:10:41,108 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:10:41" (1/1) ... [2022-12-06 16:10:41,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 16:10:41,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 16:10:41,139 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) [2022-12-06 16:10:41,147 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 [2022-12-06 16:10:41,187 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-12-06 16:10:41,187 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-12-06 16:10:41,187 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-12-06 16:10:41,187 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-12-06 16:10:41,187 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 16:10:41,187 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 16:10:41,187 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 16:10:41,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 16:10:41,188 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-06 16:10:41,188 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 16:10:41,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 16:10:41,188 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 16:10:41,188 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 16:10:41,189 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 16:10:41,286 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 16:10:41,287 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 16:10:41,510 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 16:10:41,516 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 16:10:41,517 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-06 16:10:41,518 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:10:41 BoogieIcfgContainer [2022-12-06 16:10:41,518 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 16:10:41,520 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 16:10:41,520 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 16:10:41,522 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 16:10:41,524 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 04:10:40" (1/3) ... [2022-12-06 16:10:41,525 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fcecd7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:10:41, skipping insertion in model container [2022-12-06 16:10:41,525 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:10:41" (2/3) ... [2022-12-06 16:10:41,525 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fcecd7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:10:41, skipping insertion in model container [2022-12-06 16:10:41,525 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:10:41" (3/3) ... [2022-12-06 16:10:41,526 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok_longest.i [2022-12-06 16:10:41,538 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 16:10:41,538 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 16:10:41,538 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 16:10:41,653 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-06 16:10:41,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 209 places, 215 transitions, 446 flow [2022-12-06 16:10:41,767 INFO L130 PetriNetUnfolder]: 13/213 cut-off events. [2022-12-06 16:10:41,767 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 16:10:41,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 213 events. 13/213 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 357 event pairs, 0 based on Foata normal form. 0/198 useless extension candidates. Maximal degree in co-relation 140. Up to 3 conditions per place. [2022-12-06 16:10:41,776 INFO L82 GeneralOperation]: Start removeDead. Operand has 209 places, 215 transitions, 446 flow [2022-12-06 16:10:41,780 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 198 places, 204 transitions, 417 flow [2022-12-06 16:10:41,786 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 16:10:41,791 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;@43217a3e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 16:10:41,791 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-06 16:10:41,799 INFO L130 PetriNetUnfolder]: 1/55 cut-off events. [2022-12-06 16:10:41,799 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 16:10:41,799 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:10:41,800 INFO L213 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:10:41,800 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 2 more)] === [2022-12-06 16:10:41,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:10:41,804 INFO L85 PathProgramCache]: Analyzing trace with hash 813813323, now seen corresponding path program 1 times [2022-12-06 16:10:41,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:10:41,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848001299] [2022-12-06 16:10:41,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:10:41,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:10:41,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:10:42,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:10:42,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:10:42,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848001299] [2022-12-06 16:10:42,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848001299] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:10:42,014 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:10:42,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 16:10:42,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193085002] [2022-12-06 16:10:42,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:10:42,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-06 16:10:42,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:10:42,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-06 16:10:42,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-06 16:10:42,055 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 204 out of 215 [2022-12-06 16:10:42,059 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 204 transitions, 417 flow. Second operand has 2 states, 2 states have (on average 204.5) internal successors, (409), 2 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:10:42,059 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:10:42,059 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 204 of 215 [2022-12-06 16:10:42,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:10:42,150 INFO L130 PetriNetUnfolder]: 9/195 cut-off events. [2022-12-06 16:10:42,151 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-12-06 16:10:42,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 207 conditions, 195 events. 9/195 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 275 event pairs, 0 based on Foata normal form. 5/190 useless extension candidates. Maximal degree in co-relation 137. Up to 4 conditions per place. [2022-12-06 16:10:42,156 INFO L137 encePairwiseOnDemand]: 211/215 looper letters, 3 selfloop transitions, 0 changer transitions 0/195 dead transitions. [2022-12-06 16:10:42,156 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 195 transitions, 405 flow [2022-12-06 16:10:42,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-06 16:10:42,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-06 16:10:42,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 415 transitions. [2022-12-06 16:10:42,170 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.9651162790697675 [2022-12-06 16:10:42,172 INFO L294 CegarLoopForPetriNet]: 198 programPoint places, -4 predicate places. [2022-12-06 16:10:42,172 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 195 transitions, 405 flow [2022-12-06 16:10:42,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 204.5) internal successors, (409), 2 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:10:42,173 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:10:42,173 INFO L213 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:10:42,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 16:10:42,174 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 16:10:42,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:10:42,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1104887516, now seen corresponding path program 1 times [2022-12-06 16:10:42,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:10:42,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073608358] [2022-12-06 16:10:42,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:10:42,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:10:42,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:10:42,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:10:42,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:10:42,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073608358] [2022-12-06 16:10:42,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073608358] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:10:42,942 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:10:42,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-06 16:10:42,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822127785] [2022-12-06 16:10:42,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:10:42,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 16:10:42,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:10:42,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 16:10:42,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-12-06 16:10:42,947 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 215 [2022-12-06 16:10:42,949 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 195 transitions, 405 flow. Second operand has 12 states, 12 states have (on average 153.25) internal successors, (1839), 12 states have internal predecessors, (1839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:10:42,949 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:10:42,949 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 215 [2022-12-06 16:10:42,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:10:43,571 INFO L130 PetriNetUnfolder]: 611/2461 cut-off events. [2022-12-06 16:10:43,571 INFO L131 PetriNetUnfolder]: For 187/187 co-relation queries the response was YES. [2022-12-06 16:10:43,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3464 conditions, 2461 events. 611/2461 cut-off events. For 187/187 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 19462 event pairs, 459 based on Foata normal form. 0/2289 useless extension candidates. Maximal degree in co-relation 3073. Up to 882 conditions per place. [2022-12-06 16:10:43,587 INFO L137 encePairwiseOnDemand]: 202/215 looper letters, 42 selfloop transitions, 12 changer transitions 0/191 dead transitions. [2022-12-06 16:10:43,587 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 191 transitions, 505 flow [2022-12-06 16:10:43,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 16:10:43,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 16:10:43,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2005 transitions. [2022-12-06 16:10:43,593 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7173524150268337 [2022-12-06 16:10:43,594 INFO L294 CegarLoopForPetriNet]: 198 programPoint places, 5 predicate places. [2022-12-06 16:10:43,595 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 191 transitions, 505 flow [2022-12-06 16:10:43,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 153.25) internal successors, (1839), 12 states have internal predecessors, (1839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:10:43,598 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:10:43,601 INFO L213 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:10:43,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 16:10:43,602 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 16:10:43,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:10:43,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1353821565, now seen corresponding path program 1 times [2022-12-06 16:10:43,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:10:43,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5095105] [2022-12-06 16:10:43,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:10:43,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:10:43,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:10:43,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:10:43,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:10:43,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5095105] [2022-12-06 16:10:43,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5095105] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:10:43,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:10:43,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 16:10:43,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469395438] [2022-12-06 16:10:43,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:10:43,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 16:10:43,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:10:43,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 16:10:43,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 16:10:43,732 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 215 [2022-12-06 16:10:43,732 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 191 transitions, 505 flow. Second operand has 3 states, 3 states have (on average 199.66666666666666) internal successors, (599), 3 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:10:43,732 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:10:43,732 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 215 [2022-12-06 16:10:43,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:10:43,805 INFO L130 PetriNetUnfolder]: 109/631 cut-off events. [2022-12-06 16:10:43,805 INFO L131 PetriNetUnfolder]: For 304/310 co-relation queries the response was YES. [2022-12-06 16:10:43,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 998 conditions, 631 events. 109/631 cut-off events. For 304/310 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 3045 event pairs, 71 based on Foata normal form. 0/589 useless extension candidates. Maximal degree in co-relation 589. Up to 188 conditions per place. [2022-12-06 16:10:43,807 INFO L137 encePairwiseOnDemand]: 211/215 looper letters, 7 selfloop transitions, 2 changer transitions 5/194 dead transitions. [2022-12-06 16:10:43,807 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 194 transitions, 549 flow [2022-12-06 16:10:43,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 16:10:43,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 16:10:43,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 607 transitions. [2022-12-06 16:10:43,809 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.9410852713178295 [2022-12-06 16:10:43,810 INFO L294 CegarLoopForPetriNet]: 198 programPoint places, 7 predicate places. [2022-12-06 16:10:43,810 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 194 transitions, 549 flow [2022-12-06 16:10:43,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 199.66666666666666) internal successors, (599), 3 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:10:43,811 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:10:43,811 INFO L213 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, 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, 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, 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, 1, 1, 1] [2022-12-06 16:10:43,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 16:10:43,811 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 16:10:43,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:10:43,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1703980672, now seen corresponding path program 1 times [2022-12-06 16:10:43,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:10:43,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211743379] [2022-12-06 16:10:43,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:10:43,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:10:43,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:10:43,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:10:43,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:10:43,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211743379] [2022-12-06 16:10:43,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211743379] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:10:43,865 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:10:43,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 16:10:43,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689720114] [2022-12-06 16:10:43,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:10:43,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 16:10:43,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:10:43,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 16:10:43,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 16:10:43,869 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 215 [2022-12-06 16:10:43,869 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 194 transitions, 549 flow. Second operand has 3 states, 3 states have (on average 198.66666666666666) internal successors, (596), 3 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:10:43,870 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:10:43,870 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 215 [2022-12-06 16:10:43,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:10:43,953 INFO L130 PetriNetUnfolder]: 143/788 cut-off events. [2022-12-06 16:10:43,953 INFO L131 PetriNetUnfolder]: For 603/607 co-relation queries the response was YES. [2022-12-06 16:10:43,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1364 conditions, 788 events. 143/788 cut-off events. For 603/607 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 3546 event pairs, 96 based on Foata normal form. 0/742 useless extension candidates. Maximal degree in co-relation 953. Up to 256 conditions per place. [2022-12-06 16:10:43,959 INFO L137 encePairwiseOnDemand]: 212/215 looper letters, 14 selfloop transitions, 2 changer transitions 1/199 dead transitions. [2022-12-06 16:10:43,959 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 199 transitions, 604 flow [2022-12-06 16:10:43,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 16:10:43,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 16:10:43,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 607 transitions. [2022-12-06 16:10:43,960 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.9410852713178295 [2022-12-06 16:10:43,961 INFO L294 CegarLoopForPetriNet]: 198 programPoint places, 9 predicate places. [2022-12-06 16:10:43,962 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 199 transitions, 604 flow [2022-12-06 16:10:43,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 198.66666666666666) internal successors, (596), 3 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:10:43,962 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:10:43,962 INFO L213 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, 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, 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, 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, 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, 1, 1, 1] [2022-12-06 16:10:43,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 16:10:43,963 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 16:10:43,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:10:43,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1423051084, now seen corresponding path program 1 times [2022-12-06 16:10:43,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:10:43,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330719094] [2022-12-06 16:10:43,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:10:43,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:10:43,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:10:44,081 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:10:44,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:10:44,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330719094] [2022-12-06 16:10:44,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330719094] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 16:10:44,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [248081593] [2022-12-06 16:10:44,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:10:44,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 16:10:44,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 16:10:44,091 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) [2022-12-06 16:10:44,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-06 16:10:44,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:10:44,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-06 16:10:44,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 16:10:44,355 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:10:44,355 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 16:10:44,414 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:10:44,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [248081593] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 16:10:44,414 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 16:10:44,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-12-06 16:10:44,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018760913] [2022-12-06 16:10:44,414 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 16:10:44,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 16:10:44,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:10:44,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 16:10:44,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-12-06 16:10:44,417 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 215 [2022-12-06 16:10:44,419 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 199 transitions, 604 flow. Second operand has 10 states, 10 states have (on average 198.2) internal successors, (1982), 10 states have internal predecessors, (1982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:10:44,419 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:10:44,419 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 215 [2022-12-06 16:10:44,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:10:44,553 INFO L130 PetriNetUnfolder]: 184/977 cut-off events. [2022-12-06 16:10:44,553 INFO L131 PetriNetUnfolder]: For 1084/1090 co-relation queries the response was YES. [2022-12-06 16:10:44,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1873 conditions, 977 events. 184/977 cut-off events. For 1084/1090 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 3768 event pairs, 105 based on Foata normal form. 0/927 useless extension candidates. Maximal degree in co-relation 1441. Up to 333 conditions per place. [2022-12-06 16:10:44,558 INFO L137 encePairwiseOnDemand]: 209/215 looper letters, 21 selfloop transitions, 9 changer transitions 1/212 dead transitions. [2022-12-06 16:10:44,559 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 212 transitions, 770 flow [2022-12-06 16:10:44,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 16:10:44,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 16:10:44,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1795 transitions. [2022-12-06 16:10:44,565 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.9276485788113695 [2022-12-06 16:10:44,566 INFO L294 CegarLoopForPetriNet]: 198 programPoint places, 17 predicate places. [2022-12-06 16:10:44,566 INFO L495 AbstractCegarLoop]: Abstraction has has 215 places, 212 transitions, 770 flow [2022-12-06 16:10:44,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 198.2) internal successors, (1982), 10 states have internal predecessors, (1982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:10:44,568 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:10:44,568 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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, 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, 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, 1, 1] [2022-12-06 16:10:44,584 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-06 16:10:44,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 16:10:44,773 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 16:10:44,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:10:44,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1038674036, now seen corresponding path program 2 times [2022-12-06 16:10:44,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:10:44,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392229498] [2022-12-06 16:10:44,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:10:44,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:10:44,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:10:44,972 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-12-06 16:10:44,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:10:44,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392229498] [2022-12-06 16:10:44,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392229498] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:10:44,973 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:10:44,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 16:10:44,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592273187] [2022-12-06 16:10:44,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:10:44,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 16:10:44,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:10:44,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 16:10:44,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 16:10:44,974 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 215 [2022-12-06 16:10:44,975 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 212 transitions, 770 flow. Second operand has 3 states, 3 states have (on average 196.66666666666666) internal successors, (590), 3 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:10:44,975 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:10:44,975 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 215 [2022-12-06 16:10:44,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:10:45,094 INFO L130 PetriNetUnfolder]: 233/1250 cut-off events. [2022-12-06 16:10:45,094 INFO L131 PetriNetUnfolder]: For 1752/1763 co-relation queries the response was YES. [2022-12-06 16:10:45,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2460 conditions, 1250 events. 233/1250 cut-off events. For 1752/1763 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 5605 event pairs, 120 based on Foata normal form. 2/1194 useless extension candidates. Maximal degree in co-relation 1948. Up to 432 conditions per place. [2022-12-06 16:10:45,099 INFO L137 encePairwiseOnDemand]: 211/215 looper letters, 21 selfloop transitions, 4 changer transitions 5/216 dead transitions. [2022-12-06 16:10:45,099 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 216 transitions, 884 flow [2022-12-06 16:10:45,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 16:10:45,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 16:10:45,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 597 transitions. [2022-12-06 16:10:45,100 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.9255813953488372 [2022-12-06 16:10:45,101 INFO L294 CegarLoopForPetriNet]: 198 programPoint places, 19 predicate places. [2022-12-06 16:10:45,101 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 216 transitions, 884 flow [2022-12-06 16:10:45,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 196.66666666666666) internal successors, (590), 3 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:10:45,101 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:10:45,102 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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, 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, 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, 1, 1, 1] [2022-12-06 16:10:45,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 16:10:45,102 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 16:10:45,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:10:45,102 INFO L85 PathProgramCache]: Analyzing trace with hash 621191440, now seen corresponding path program 1 times [2022-12-06 16:10:45,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:10:45,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221170499] [2022-12-06 16:10:45,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:10:45,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:10:45,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:10:45,287 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:10:45,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:10:45,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221170499] [2022-12-06 16:10:45,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221170499] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 16:10:45,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2141947251] [2022-12-06 16:10:45,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:10:45,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 16:10:45,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 16:10:45,289 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) [2022-12-06 16:10:45,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-06 16:10:45,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:10:45,443 INFO L263 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 16:10:45,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 16:10:45,573 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:10:45,573 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 16:10:45,702 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:10:45,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2141947251] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 16:10:45,702 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 16:10:45,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-12-06 16:10:45,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827473327] [2022-12-06 16:10:45,702 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 16:10:45,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-06 16:10:45,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:10:45,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-06 16:10:45,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-12-06 16:10:45,706 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 215 [2022-12-06 16:10:45,709 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 216 transitions, 884 flow. Second operand has 18 states, 18 states have (on average 198.33333333333334) internal successors, (3570), 18 states have internal predecessors, (3570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:10:45,709 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:10:45,709 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 215 [2022-12-06 16:10:45,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:10:46,110 INFO L130 PetriNetUnfolder]: 433/2290 cut-off events. [2022-12-06 16:10:46,110 INFO L131 PetriNetUnfolder]: For 3708/3722 co-relation queries the response was YES. [2022-12-06 16:10:46,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4880 conditions, 2290 events. 433/2290 cut-off events. For 3708/3722 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 10832 event pairs, 240 based on Foata normal form. 0/2208 useless extension candidates. Maximal degree in co-relation 4342. Up to 848 conditions per place. [2022-12-06 16:10:46,117 INFO L137 encePairwiseOnDemand]: 209/215 looper letters, 48 selfloop transitions, 21 changer transitions 5/252 dead transitions. [2022-12-06 16:10:46,117 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 252 transitions, 1418 flow [2022-12-06 16:10:46,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-06 16:10:46,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-12-06 16:10:46,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 4181 transitions. [2022-12-06 16:10:46,123 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.9260243632336655 [2022-12-06 16:10:46,124 INFO L294 CegarLoopForPetriNet]: 198 programPoint places, 39 predicate places. [2022-12-06 16:10:46,124 INFO L495 AbstractCegarLoop]: Abstraction has has 237 places, 252 transitions, 1418 flow [2022-12-06 16:10:46,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 198.33333333333334) internal successors, (3570), 18 states have internal predecessors, (3570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:10:46,126 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:10:46,126 INFO L213 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 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, 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, 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, 1, 1, 1] [2022-12-06 16:10:46,151 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-06 16:10:46,331 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,SelfDestructingSolverStorable6 [2022-12-06 16:10:46,332 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 16:10:46,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:10:46,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1397685104, now seen corresponding path program 2 times [2022-12-06 16:10:46,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:10:46,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311776126] [2022-12-06 16:10:46,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:10:46,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:10:46,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:10:46,793 INFO L134 CoverageAnalysis]: Checked inductivity of 616 backedges. 0 proven. 616 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:10:46,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:10:46,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311776126] [2022-12-06 16:10:46,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311776126] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 16:10:46,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [49363403] [2022-12-06 16:10:46,793 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 16:10:46,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 16:10:46,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 16:10:46,794 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) [2022-12-06 16:10:46,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-06 16:10:47,002 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 16:10:47,002 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 16:10:47,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 736 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-06 16:10:47,008 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 16:10:47,188 INFO L134 CoverageAnalysis]: Checked inductivity of 616 backedges. 0 proven. 616 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:10:47,188 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 16:10:47,537 INFO L134 CoverageAnalysis]: Checked inductivity of 616 backedges. 0 proven. 616 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:10:47,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [49363403] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 16:10:47,537 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 16:10:47,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2022-12-06 16:10:47,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662669936] [2022-12-06 16:10:47,538 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 16:10:47,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-12-06 16:10:47,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:10:47,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-12-06 16:10:47,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2022-12-06 16:10:47,545 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 215 [2022-12-06 16:10:47,550 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 252 transitions, 1418 flow. Second operand has 34 states, 34 states have (on average 198.41176470588235) internal successors, (6746), 34 states have internal predecessors, (6746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:10:47,550 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:10:47,550 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 215 [2022-12-06 16:10:47,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:10:48,704 INFO L130 PetriNetUnfolder]: 833/4370 cut-off events. [2022-12-06 16:10:48,704 INFO L131 PetriNetUnfolder]: For 8355/8373 co-relation queries the response was YES. [2022-12-06 16:10:48,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10068 conditions, 4370 events. 833/4370 cut-off events. For 8355/8373 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 21213 event pairs, 480 based on Foata normal form. 0/4240 useless extension candidates. Maximal degree in co-relation 9504. Up to 1680 conditions per place. [2022-12-06 16:10:48,720 INFO L137 encePairwiseOnDemand]: 209/215 looper letters, 96 selfloop transitions, 45 changer transitions 5/324 dead transitions. [2022-12-06 16:10:48,720 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 324 transitions, 2632 flow [2022-12-06 16:10:48,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-12-06 16:10:48,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2022-12-06 16:10:48,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 8953 transitions. [2022-12-06 16:10:48,732 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.925374677002584 [2022-12-06 16:10:48,732 INFO L294 CegarLoopForPetriNet]: 198 programPoint places, 83 predicate places. [2022-12-06 16:10:48,732 INFO L495 AbstractCegarLoop]: Abstraction has has 281 places, 324 transitions, 2632 flow [2022-12-06 16:10:48,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 198.41176470588235) internal successors, (6746), 34 states have internal predecessors, (6746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:10:48,734 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:10:48,735 INFO L213 CegarLoopForPetriNet]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 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, 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, 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, 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, 1, 1, 1] [2022-12-06 16:10:48,749 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-06 16:10:48,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 16:10:48,942 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 16:10:48,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:10:48,942 INFO L85 PathProgramCache]: Analyzing trace with hash -532051056, now seen corresponding path program 3 times [2022-12-06 16:10:48,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:10:48,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253103816] [2022-12-06 16:10:48,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:10:48,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:10:49,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:10:50,246 INFO L134 CoverageAnalysis]: Checked inductivity of 3060 backedges. 0 proven. 3060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:10:50,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:10:50,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253103816] [2022-12-06 16:10:50,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253103816] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 16:10:50,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1499998922] [2022-12-06 16:10:50,247 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 16:10:50,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 16:10:50,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 16:10:50,264 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) [2022-12-06 16:10:50,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-06 16:10:50,516 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-06 16:10:50,517 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 16:10:50,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 50 conjunts are in the unsatisfiable core [2022-12-06 16:10:50,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 16:10:52,322 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-06 16:10:52,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 16:10:52,385 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-06 16:10:52,582 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 16:10:52,591 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-12-06 16:10:52,592 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-12-06 16:10:52,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 16:10:52,639 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-12-06 16:10:52,667 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-12-06 16:10:52,691 INFO L134 CoverageAnalysis]: Checked inductivity of 3060 backedges. 428 proven. 305 refuted. 0 times theorem prover too weak. 2327 trivial. 0 not checked. [2022-12-06 16:10:52,691 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 16:10:53,174 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 16:10:53,175 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 44 [2022-12-06 16:10:53,188 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 16:10:53,188 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 83 [2022-12-06 16:10:53,193 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 70 [2022-12-06 16:10:53,206 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-12-06 16:10:53,236 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 16:10:53,236 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 48 [2022-12-06 16:10:53,832 INFO L134 CoverageAnalysis]: Checked inductivity of 3060 backedges. 428 proven. 305 refuted. 0 times theorem prover too weak. 2327 trivial. 0 not checked. [2022-12-06 16:10:53,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1499998922] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 16:10:53,833 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 16:10:53,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 14, 13] total 56 [2022-12-06 16:10:53,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286795197] [2022-12-06 16:10:53,833 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 16:10:53,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-12-06 16:10:53,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:10:53,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-12-06 16:10:53,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=383, Invalid=2690, Unknown=7, NotChecked=0, Total=3080 [2022-12-06 16:10:53,842 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 215 [2022-12-06 16:10:53,849 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 324 transitions, 2632 flow. Second operand has 56 states, 56 states have (on average 150.60714285714286) internal successors, (8434), 56 states have internal predecessors, (8434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:10:53,849 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:10:53,849 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 215 [2022-12-06 16:10:53,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:11:04,322 INFO L130 PetriNetUnfolder]: 2819/10281 cut-off events. [2022-12-06 16:11:04,322 INFO L131 PetriNetUnfolder]: For 29484/29498 co-relation queries the response was YES. [2022-12-06 16:11:04,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32148 conditions, 10281 events. 2819/10281 cut-off events. For 29484/29498 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 65494 event pairs, 21 based on Foata normal form. 0/10119 useless extension candidates. Maximal degree in co-relation 31175. Up to 4667 conditions per place. [2022-12-06 16:11:04,373 INFO L137 encePairwiseOnDemand]: 191/215 looper letters, 923 selfloop transitions, 408 changer transitions 7/1466 dead transitions. [2022-12-06 16:11:04,373 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 481 places, 1466 transitions, 12942 flow [2022-12-06 16:11:04,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 201 states. [2022-12-06 16:11:04,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2022-12-06 16:11:04,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 30075 transitions. [2022-12-06 16:11:04,399 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6959389101006594 [2022-12-06 16:11:04,400 INFO L294 CegarLoopForPetriNet]: 198 programPoint places, 283 predicate places. [2022-12-06 16:11:04,400 INFO L495 AbstractCegarLoop]: Abstraction has has 481 places, 1466 transitions, 12942 flow [2022-12-06 16:11:04,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 150.60714285714286) internal successors, (8434), 56 states have internal predecessors, (8434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:11:04,403 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:11:04,403 INFO L213 CegarLoopForPetriNet]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 9, 9, 9, 7, 7, 7, 7, 7, 7, 7, 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, 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, 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, 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, 1, 1, 1] [2022-12-06 16:11:04,421 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-06 16:11:04,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 16:11:04,610 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 16:11:04,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:11:04,610 INFO L85 PathProgramCache]: Analyzing trace with hash -640743145, now seen corresponding path program 1 times [2022-12-06 16:11:04,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:11:04,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978194429] [2022-12-06 16:11:04,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:11:04,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:11:04,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:11:05,911 INFO L134 CoverageAnalysis]: Checked inductivity of 3454 backedges. 0 proven. 3454 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:11:05,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:11:05,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978194429] [2022-12-06 16:11:05,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978194429] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 16:11:05,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1308495954] [2022-12-06 16:11:05,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:11:05,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 16:11:05,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 16:11:05,913 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 16:11:05,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-06 16:11:06,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:11:06,170 INFO L263 TraceCheckSpWp]: Trace formula consists of 1329 conjuncts, 34 conjunts are in the unsatisfiable core [2022-12-06 16:11:06,176 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 16:11:06,680 INFO L134 CoverageAnalysis]: Checked inductivity of 3454 backedges. 0 proven. 3454 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:11:06,680 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 16:11:07,812 INFO L134 CoverageAnalysis]: Checked inductivity of 3454 backedges. 0 proven. 3454 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:11:07,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1308495954] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 16:11:07,813 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 16:11:07,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 70 [2022-12-06 16:11:07,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935087735] [2022-12-06 16:11:07,813 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 16:11:07,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2022-12-06 16:11:07,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:11:07,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2022-12-06 16:11:07,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1260, Invalid=3570, Unknown=0, NotChecked=0, Total=4830 [2022-12-06 16:11:07,824 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 215 [2022-12-06 16:11:07,840 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 481 places, 1466 transitions, 12942 flow. Second operand has 70 states, 70 states have (on average 198.4857142857143) internal successors, (13894), 70 states have internal predecessors, (13894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:11:07,840 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:11:07,840 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 215 [2022-12-06 16:11:07,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:11:17,119 INFO L130 PetriNetUnfolder]: 5427/19473 cut-off events. [2022-12-06 16:11:17,119 INFO L131 PetriNetUnfolder]: For 67626/67640 co-relation queries the response was YES. [2022-12-06 16:11:17,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64945 conditions, 19473 events. 5427/19473 cut-off events. For 67626/67640 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 121911 event pairs, 21 based on Foata normal form. 0/19215 useless extension candidates. Maximal degree in co-relation 63932. Up to 9003 conditions per place. [2022-12-06 16:11:17,210 INFO L137 encePairwiseOnDemand]: 209/215 looper letters, 600 selfloop transitions, 197 changer transitions 7/1860 dead transitions. [2022-12-06 16:11:17,210 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 579 places, 1860 transitions, 21802 flow [2022-12-06 16:11:17,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2022-12-06 16:11:17,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2022-12-06 16:11:17,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 19690 transitions. [2022-12-06 16:11:17,224 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.9250645994832042 [2022-12-06 16:11:17,225 INFO L294 CegarLoopForPetriNet]: 198 programPoint places, 381 predicate places. [2022-12-06 16:11:17,225 INFO L495 AbstractCegarLoop]: Abstraction has has 579 places, 1860 transitions, 21802 flow [2022-12-06 16:11:17,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 70 states have (on average 198.4857142857143) internal successors, (13894), 70 states have internal predecessors, (13894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:11:17,229 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:11:17,229 INFO L213 CegarLoopForPetriNet]: trace histogram [33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 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, 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, 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, 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, 1, 1, 1] [2022-12-06 16:11:17,241 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-06 16:11:17,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-12-06 16:11:17,436 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 16:11:17,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:11:17,436 INFO L85 PathProgramCache]: Analyzing trace with hash -606987942, now seen corresponding path program 2 times [2022-12-06 16:11:17,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:11:17,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574493997] [2022-12-06 16:11:17,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:11:17,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:11:17,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:11:21,954 INFO L134 CoverageAnalysis]: Checked inductivity of 15281 backedges. 0 proven. 15281 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:11:21,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:11:21,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574493997] [2022-12-06 16:11:21,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574493997] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 16:11:21,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1976622562] [2022-12-06 16:11:21,955 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 16:11:21,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 16:11:21,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 16:11:21,958 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 16:11:21,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-06 16:11:22,450 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 16:11:22,450 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 16:11:22,461 INFO L263 TraceCheckSpWp]: Trace formula consists of 2428 conjuncts, 68 conjunts are in the unsatisfiable core [2022-12-06 16:11:22,472 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 16:11:23,291 INFO L134 CoverageAnalysis]: Checked inductivity of 15281 backedges. 0 proven. 15281 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:11:23,291 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 16:11:26,170 INFO L134 CoverageAnalysis]: Checked inductivity of 15281 backedges. 0 proven. 15281 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:11:26,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1976622562] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 16:11:26,170 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 16:11:26,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 138 [2022-12-06 16:11:26,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007945956] [2022-12-06 16:11:26,171 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 16:11:26,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 138 states [2022-12-06 16:11:26,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:11:26,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2022-12-06 16:11:26,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4830, Invalid=14076, Unknown=0, NotChecked=0, Total=18906 [2022-12-06 16:11:26,200 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 215 [2022-12-06 16:11:26,224 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 579 places, 1860 transitions, 21802 flow. Second operand has 138 states, 138 states have (on average 198.47826086956522) internal successors, (27390), 138 states have internal predecessors, (27390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:11:26,224 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:11:26,224 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 215 [2022-12-06 16:11:26,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:12:00,870 INFO L130 PetriNetUnfolder]: 10935/38921 cut-off events. [2022-12-06 16:12:00,870 INFO L131 PetriNetUnfolder]: For 161745/161759 co-relation queries the response was YES. [2022-12-06 16:12:00,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137194 conditions, 38921 events. 10935/38921 cut-off events. For 161745/161759 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 245773 event pairs, 21 based on Foata normal form. 0/38459 useless extension candidates. Maximal degree in co-relation 136141. Up to 18183 conditions per place. [2022-12-06 16:12:01,056 INFO L137 encePairwiseOnDemand]: 209/215 looper letters, 1212 selfloop transitions, 401 changer transitions 7/2676 dead transitions. [2022-12-06 16:12:01,057 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 779 places, 2676 transitions, 41700 flow [2022-12-06 16:12:01,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 201 states. [2022-12-06 16:12:01,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2022-12-06 16:12:01,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 39971 transitions. [2022-12-06 16:12:01,073 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.9249334721740137 [2022-12-06 16:12:01,074 INFO L294 CegarLoopForPetriNet]: 198 programPoint places, 581 predicate places. [2022-12-06 16:12:01,074 INFO L495 AbstractCegarLoop]: Abstraction has has 779 places, 2676 transitions, 41700 flow [2022-12-06 16:12:01,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 138 states, 138 states have (on average 198.47826086956522) internal successors, (27390), 138 states have internal predecessors, (27390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:12:01,080 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:12:01,080 INFO L213 CegarLoopForPetriNet]: trace histogram [67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 34, 34, 34, 33, 33, 33, 33, 33, 33, 33, 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, 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, 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, 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, 1, 1, 1] [2022-12-06 16:12:01,106 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-06 16:12:01,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 16:12:01,289 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 16:12:01,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:12:01,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1799710951, now seen corresponding path program 3 times [2022-12-06 16:12:01,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:12:01,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693043811] [2022-12-06 16:12:01,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:12:01,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:12:01,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:12:20,617 INFO L134 CoverageAnalysis]: Checked inductivity of 64054 backedges. 0 proven. 64054 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:12:20,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:12:20,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693043811] [2022-12-06 16:12:20,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693043811] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 16:12:20,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1469151623] [2022-12-06 16:12:20,618 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 16:12:20,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 16:12:20,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 16:12:20,637 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 16:12:20,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-06 16:12:21,142 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-12-06 16:12:21,142 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 16:12:21,147 INFO L263 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 70 conjunts are in the unsatisfiable core [2022-12-06 16:12:21,164 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 16:12:25,848 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-06 16:12:25,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 16:12:25,947 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-06 16:12:26,258 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 16:12:26,265 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-12-06 16:12:26,265 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-12-06 16:12:26,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 16:12:26,325 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-12-06 16:12:26,633 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-12-06 16:12:26,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 16:12:26,713 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-06 16:12:26,952 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 16:12:26,957 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-12-06 16:12:26,958 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 27 [2022-12-06 16:12:26,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 16:12:26,993 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-12-06 16:12:27,011 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-12-06 16:12:27,082 INFO L134 CoverageAnalysis]: Checked inductivity of 64054 backedges. 3880 proven. 1454 refuted. 0 times theorem prover too weak. 58720 trivial. 0 not checked. [2022-12-06 16:12:27,082 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 16:12:27,608 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int)) (not (= (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse1)) 800))) is different from false [2022-12-06 16:12:27,625 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int)) (not (= 800 (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse1))))) is different from false [2022-12-06 16:12:27,630 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int)) (not (= (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse1)) 800))) is different from false [2022-12-06 16:12:27,635 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int)) (not (= 800 (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))) v_ArrVal_2815)) .cse1))))) is different from false [2022-12-06 16:12:27,644 WARN L837 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int)) (not (= 800 (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))) v_ArrVal_2815)) .cse1))))) (= |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1| 800)) is different from false [2022-12-06 16:12:27,662 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse4 (select .cse2 .cse3))) (or (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int)) (not (= 800 (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))) v_ArrVal_2815)) .cse1))))) (= 800 .cse4)))) is different from false [2022-12-06 16:12:27,842 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (v_ArrVal_2809 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2807)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse3 .cse4))) (or (= 800 .cse0) (not (= 800 (let ((.cse2 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2809) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) v_ArrVal_2815)) .cse2)))))))) is different from false [2022-12-06 16:12:27,855 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (v_ArrVal_2809 Int)) (let ((.cse2 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2807))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= 800 (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2809) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_2815)) .cse1)))) (= .cse4 800))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse3)))))) is different from false [2022-12-06 16:12:27,895 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse5 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2807)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 3204))) (let ((.cse2 (select .cse5 .cse1))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse0 .cse1))) (= 800 .cse2) (not (= 800 (let ((.cse4 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse3 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse5 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2809) .cse1 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse4))))))))) is different from false [2022-12-06 16:12:28,597 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 16:12:28,597 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 234 treesize of output 164 [2022-12-06 16:12:28,604 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 16:12:28,604 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 266 treesize of output 262 [2022-12-06 16:12:28,611 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 250 treesize of output 230 [2022-12-06 16:12:28,621 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 213 treesize of output 189 [2022-12-06 16:12:28,645 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-12-06 16:12:28,681 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 16:12:28,681 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 119 treesize of output 103 [2022-12-06 16:12:30,874 INFO L134 CoverageAnalysis]: Checked inductivity of 64054 backedges. 1941 proven. 2216 refuted. 0 times theorem prover too weak. 58720 trivial. 1177 not checked. [2022-12-06 16:12:30,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1469151623] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 16:12:30,875 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 16:12:30,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [137, 19, 24] total 176 [2022-12-06 16:12:30,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116248591] [2022-12-06 16:12:30,875 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 16:12:30,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 176 states [2022-12-06 16:12:30,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:12:30,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 176 interpolants. [2022-12-06 16:12:30,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4990, Invalid=22749, Unknown=19, NotChecked=3042, Total=30800 [2022-12-06 16:12:30,893 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 215 [2022-12-06 16:12:30,903 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 779 places, 2676 transitions, 41700 flow. Second operand has 176 states, 176 states have (on average 150.47727272727272) internal successors, (26484), 176 states have internal predecessors, (26484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:12:30,903 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:12:30,903 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 215 [2022-12-06 16:12:30,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand