/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/queue_ok.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-28 06:12:40,467 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-28 06:12:40,468 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-28 06:12:40,493 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-28 06:12:40,494 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-28 06:12:40,495 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-28 06:12:40,496 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-28 06:12:40,497 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-28 06:12:40,498 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-28 06:12:40,499 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-28 06:12:40,500 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-28 06:12:40,501 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-28 06:12:40,501 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-28 06:12:40,502 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-28 06:12:40,502 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-28 06:12:40,503 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-28 06:12:40,504 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-28 06:12:40,504 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-28 06:12:40,506 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-28 06:12:40,507 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-28 06:12:40,508 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-28 06:12:40,509 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-28 06:12:40,510 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-28 06:12:40,511 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-28 06:12:40,514 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-28 06:12:40,514 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-28 06:12:40,515 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-28 06:12:40,515 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-28 06:12:40,516 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-28 06:12:40,516 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-28 06:12:40,517 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-28 06:12:40,517 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-28 06:12:40,518 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-28 06:12:40,519 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-28 06:12:40,519 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-28 06:12:40,520 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-28 06:12:40,520 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-28 06:12:40,520 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-28 06:12:40,521 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-28 06:12:40,521 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-28 06:12:40,522 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-28 06:12:40,522 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-01-28 06:12:40,547 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-28 06:12:40,547 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-28 06:12:40,548 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-28 06:12:40,549 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-28 06:12:40,549 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-28 06:12:40,550 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-28 06:12:40,550 INFO L138 SettingsManager]: * Use SBE=true [2023-01-28 06:12:40,550 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-28 06:12:40,550 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-28 06:12:40,550 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-28 06:12:40,551 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-28 06:12:40,551 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-28 06:12:40,551 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-28 06:12:40,551 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-28 06:12:40,551 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-28 06:12:40,552 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-28 06:12:40,552 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-28 06:12:40,552 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-28 06:12:40,552 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-28 06:12:40,552 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-28 06:12:40,552 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-28 06:12:40,553 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-28 06:12:40,553 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-28 06:12:40,553 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 06:12:40,553 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-28 06:12:40,553 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-28 06:12:40,553 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-28 06:12:40,553 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-28 06:12:40,553 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-28 06:12:40,554 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-28 06:12:40,554 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-28 06:12:40,554 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> AFTER [2023-01-28 06:12:40,792 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-28 06:12:40,819 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-28 06:12:40,824 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-28 06:12:40,825 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-28 06:12:40,825 INFO L275 PluginConnector]: CDTParser initialized [2023-01-28 06:12:40,827 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_ok.i [2023-01-28 06:12:41,913 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-28 06:12:42,185 INFO L351 CDTParser]: Found 1 translation units. [2023-01-28 06:12:42,186 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i [2023-01-28 06:12:42,201 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4668f85d9/152801d5de984363abccf3af89c35c57/FLAGfe3754162 [2023-01-28 06:12:42,213 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4668f85d9/152801d5de984363abccf3af89c35c57 [2023-01-28 06:12:42,215 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-28 06:12:42,216 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-28 06:12:42,217 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-28 06:12:42,217 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-28 06:12:42,220 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-28 06:12:42,220 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 06:12:42" (1/1) ... [2023-01-28 06:12:42,221 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7faf16ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:12:42, skipping insertion in model container [2023-01-28 06:12:42,222 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 06:12:42" (1/1) ... [2023-01-28 06:12:42,227 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-28 06:12:42,259 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-28 06:12:42,667 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i[43266,43279] [2023-01-28 06:12:42,675 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i[43543,43556] [2023-01-28 06:12:42,682 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 06:12:42,693 INFO L203 MainTranslator]: Completed pre-run [2023-01-28 06:12:42,749 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i[43266,43279] [2023-01-28 06:12:42,751 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i[43543,43556] [2023-01-28 06:12:42,753 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 06:12:42,797 INFO L208 MainTranslator]: Completed translation [2023-01-28 06:12:42,798 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:12:42 WrapperNode [2023-01-28 06:12:42,798 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-28 06:12:42,799 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-28 06:12:42,799 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-28 06:12:42,799 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-28 06:12:42,805 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:12:42" (1/1) ... [2023-01-28 06:12:42,820 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:12:42" (1/1) ... [2023-01-28 06:12:42,847 INFO L138 Inliner]: procedures = 274, calls = 57, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 203 [2023-01-28 06:12:42,847 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-28 06:12:42,848 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-28 06:12:42,848 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-28 06:12:42,848 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-28 06:12:42,856 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:12:42" (1/1) ... [2023-01-28 06:12:42,856 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:12:42" (1/1) ... [2023-01-28 06:12:42,860 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:12:42" (1/1) ... [2023-01-28 06:12:42,860 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:12:42" (1/1) ... [2023-01-28 06:12:42,867 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:12:42" (1/1) ... [2023-01-28 06:12:42,871 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:12:42" (1/1) ... [2023-01-28 06:12:42,878 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:12:42" (1/1) ... [2023-01-28 06:12:42,879 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:12:42" (1/1) ... [2023-01-28 06:12:42,882 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-28 06:12:42,883 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-28 06:12:42,883 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-28 06:12:42,883 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-28 06:12:42,884 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:12:42" (1/1) ... [2023-01-28 06:12:42,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 06:12:42,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 06:12:42,918 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-01-28 06:12:42,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-01-28 06:12:42,962 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-01-28 06:12:42,962 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-01-28 06:12:42,962 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-01-28 06:12:42,962 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-01-28 06:12:42,962 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-28 06:12:42,963 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-28 06:12:42,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-01-28 06:12:42,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-28 06:12:42,963 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-01-28 06:12:42,963 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-28 06:12:42,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-28 06:12:42,963 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-28 06:12:42,964 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-28 06:12:42,965 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-01-28 06:12:43,125 INFO L236 CfgBuilder]: Building ICFG [2023-01-28 06:12:43,127 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-28 06:12:43,413 INFO L277 CfgBuilder]: Performing block encoding [2023-01-28 06:12:43,421 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-28 06:12:43,421 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-01-28 06:12:43,423 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 06:12:43 BoogieIcfgContainer [2023-01-28 06:12:43,423 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-28 06:12:43,424 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-28 06:12:43,424 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-28 06:12:43,427 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-28 06:12:43,427 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 06:12:42" (1/3) ... [2023-01-28 06:12:43,427 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a3ec1d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 06:12:43, skipping insertion in model container [2023-01-28 06:12:43,427 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:12:42" (2/3) ... [2023-01-28 06:12:43,428 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a3ec1d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 06:12:43, skipping insertion in model container [2023-01-28 06:12:43,428 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 06:12:43" (3/3) ... [2023-01-28 06:12:43,429 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok.i [2023-01-28 06:12:43,442 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-28 06:12:43,442 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-01-28 06:12:43,443 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-28 06:12:43,563 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-01-28 06:12:43,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 210 places, 216 transitions, 448 flow [2023-01-28 06:12:43,682 INFO L130 PetriNetUnfolder]: 13/214 cut-off events. [2023-01-28 06:12:43,682 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-01-28 06:12:43,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 214 events. 13/214 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 359 event pairs, 0 based on Foata normal form. 0/199 useless extension candidates. Maximal degree in co-relation 141. Up to 3 conditions per place. [2023-01-28 06:12:43,688 INFO L82 GeneralOperation]: Start removeDead. Operand has 210 places, 216 transitions, 448 flow [2023-01-28 06:12:43,693 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 199 places, 205 transitions, 419 flow [2023-01-28 06:12:43,696 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 06:12:43,704 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 199 places, 205 transitions, 419 flow [2023-01-28 06:12:43,706 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 199 places, 205 transitions, 419 flow [2023-01-28 06:12:43,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 199 places, 205 transitions, 419 flow [2023-01-28 06:12:43,762 INFO L130 PetriNetUnfolder]: 13/205 cut-off events. [2023-01-28 06:12:43,762 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-01-28 06:12:43,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 213 conditions, 205 events. 13/205 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 293 event pairs, 0 based on Foata normal form. 0/190 useless extension candidates. Maximal degree in co-relation 141. Up to 3 conditions per place. [2023-01-28 06:12:43,774 INFO L119 LiptonReduction]: Number of co-enabled transitions 9984 [2023-01-28 06:12:49,865 INFO L134 LiptonReduction]: Checked pairs total: 19772 [2023-01-28 06:12:49,866 INFO L136 LiptonReduction]: Total number of compositions: 186 [2023-01-28 06:12:49,895 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-28 06:12:49,902 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;@bbee707, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 06:12:49,902 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-01-28 06:12:49,903 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-01-28 06:12:49,903 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 06:12:49,904 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:12:49,905 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-01-28 06:12:49,906 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)] === [2023-01-28 06:12:49,909 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:12:49,909 INFO L85 PathProgramCache]: Analyzing trace with hash 839, now seen corresponding path program 1 times [2023-01-28 06:12:49,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:12:49,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170341516] [2023-01-28 06:12:49,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:12:49,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:12:49,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:12:50,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:12:50,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:12:50,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170341516] [2023-01-28 06:12:50,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170341516] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:12:50,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:12:50,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-01-28 06:12:50,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832406151] [2023-01-28 06:12:50,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:12:50,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-01-28 06:12:50,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:12:50,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-01-28 06:12:50,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-01-28 06:12:50,066 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 402 [2023-01-28 06:12:50,069 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 47 transitions, 103 flow. Second operand has 2 states, 2 states have (on average 205.5) internal successors, (411), 2 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:12:50,070 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:12:50,070 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 402 [2023-01-28 06:12:50,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:12:50,237 INFO L130 PetriNetUnfolder]: 829/1341 cut-off events. [2023-01-28 06:12:50,238 INFO L131 PetriNetUnfolder]: For 52/52 co-relation queries the response was YES. [2023-01-28 06:12:50,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2685 conditions, 1341 events. 829/1341 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 5736 event pairs, 621 based on Foata normal form. 0/1143 useless extension candidates. Maximal degree in co-relation 2519. Up to 1297 conditions per place. [2023-01-28 06:12:50,246 INFO L137 encePairwiseOnDemand]: 401/402 looper letters, 38 selfloop transitions, 0 changer transitions 1/46 dead transitions. [2023-01-28 06:12:50,246 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 46 transitions, 179 flow [2023-01-28 06:12:50,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-28 06:12:50,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-01-28 06:12:50,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 450 transitions. [2023-01-28 06:12:50,259 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5597014925373134 [2023-01-28 06:12:50,260 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 450 transitions. [2023-01-28 06:12:50,260 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 450 transitions. [2023-01-28 06:12:50,263 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:12:50,265 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 450 transitions. [2023-01-28 06:12:50,270 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 225.0) internal successors, (450), 2 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:12:50,275 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 402.0) internal successors, (1206), 3 states have internal predecessors, (1206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:12:50,276 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 402.0) internal successors, (1206), 3 states have internal predecessors, (1206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:12:50,278 INFO L175 Difference]: Start difference. First operand has 47 places, 47 transitions, 103 flow. Second operand 2 states and 450 transitions. [2023-01-28 06:12:50,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 46 transitions, 179 flow [2023-01-28 06:12:50,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 46 transitions, 174 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-01-28 06:12:50,282 INFO L231 Difference]: Finished difference. Result has 44 places, 45 transitions, 94 flow [2023-01-28 06:12:50,284 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=402, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=94, PETRI_PLACES=44, PETRI_TRANSITIONS=45} [2023-01-28 06:12:50,288 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, -3 predicate places. [2023-01-28 06:12:50,288 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 45 transitions, 94 flow [2023-01-28 06:12:50,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 205.5) internal successors, (411), 2 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:12:50,289 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:12:50,289 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:12:50,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-28 06:12:50,289 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)] === [2023-01-28 06:12:50,290 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:12:50,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1319934340, now seen corresponding path program 1 times [2023-01-28 06:12:50,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:12:50,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179300436] [2023-01-28 06:12:50,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:12:50,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:12:50,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:12:50,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:12:50,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:12:50,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179300436] [2023-01-28 06:12:50,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179300436] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:12:50,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:12:50,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 06:12:50,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828003394] [2023-01-28 06:12:50,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:12:50,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 06:12:50,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:12:50,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 06:12:50,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 06:12:50,599 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 402 [2023-01-28 06:12:50,601 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 45 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 204.0) internal successors, (612), 3 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:12:50,602 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:12:50,602 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 402 [2023-01-28 06:12:50,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:12:50,714 INFO L130 PetriNetUnfolder]: 248/490 cut-off events. [2023-01-28 06:12:50,715 INFO L131 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2023-01-28 06:12:50,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 983 conditions, 490 events. 248/490 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2048 event pairs, 164 based on Foata normal form. 0/440 useless extension candidates. Maximal degree in co-relation 980. Up to 253 conditions per place. [2023-01-28 06:12:50,717 INFO L137 encePairwiseOnDemand]: 398/402 looper letters, 40 selfloop transitions, 2 changer transitions 8/53 dead transitions. [2023-01-28 06:12:50,717 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 53 transitions, 209 flow [2023-01-28 06:12:50,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 06:12:50,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 06:12:50,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 646 transitions. [2023-01-28 06:12:50,723 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5356550580431177 [2023-01-28 06:12:50,723 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 646 transitions. [2023-01-28 06:12:50,723 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 646 transitions. [2023-01-28 06:12:50,723 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:12:50,723 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 646 transitions. [2023-01-28 06:12:50,725 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 215.33333333333334) internal successors, (646), 3 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:12:50,730 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 402.0) internal successors, (1608), 4 states have internal predecessors, (1608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:12:50,731 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 402.0) internal successors, (1608), 4 states have internal predecessors, (1608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:12:50,731 INFO L175 Difference]: Start difference. First operand has 44 places, 45 transitions, 94 flow. Second operand 3 states and 646 transitions. [2023-01-28 06:12:50,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 53 transitions, 209 flow [2023-01-28 06:12:50,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 53 transitions, 209 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-01-28 06:12:50,733 INFO L231 Difference]: Finished difference. Result has 46 places, 41 transitions, 94 flow [2023-01-28 06:12:50,733 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=402, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=46, PETRI_TRANSITIONS=41} [2023-01-28 06:12:50,734 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, -1 predicate places. [2023-01-28 06:12:50,734 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 41 transitions, 94 flow [2023-01-28 06:12:50,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 204.0) internal successors, (612), 3 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:12:50,735 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:12:50,735 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:12:50,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-28 06:12:50,736 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)] === [2023-01-28 06:12:50,736 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:12:50,737 INFO L85 PathProgramCache]: Analyzing trace with hash -312369892, now seen corresponding path program 1 times [2023-01-28 06:12:50,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:12:50,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252500438] [2023-01-28 06:12:50,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:12:50,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:12:50,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:12:50,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:12:50,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:12:50,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252500438] [2023-01-28 06:12:50,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252500438] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:12:50,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:12:50,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 06:12:50,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821907512] [2023-01-28 06:12:50,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:12:50,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 06:12:50,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:12:50,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 06:12:50,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 06:12:50,871 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 402 [2023-01-28 06:12:50,872 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 41 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 204.0) internal successors, (612), 3 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:12:50,872 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:12:50,872 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 402 [2023-01-28 06:12:50,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:12:50,974 INFO L130 PetriNetUnfolder]: 245/490 cut-off events. [2023-01-28 06:12:50,975 INFO L131 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2023-01-28 06:12:50,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1025 conditions, 490 events. 245/490 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1755 event pairs, 155 based on Foata normal form. 0/452 useless extension candidates. Maximal degree in co-relation 1020. Up to 357 conditions per place. [2023-01-28 06:12:50,979 INFO L137 encePairwiseOnDemand]: 398/402 looper letters, 48 selfloop transitions, 3 changer transitions 0/55 dead transitions. [2023-01-28 06:12:50,980 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 55 transitions, 226 flow [2023-01-28 06:12:50,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 06:12:50,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 06:12:50,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 646 transitions. [2023-01-28 06:12:50,982 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5356550580431177 [2023-01-28 06:12:50,982 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 646 transitions. [2023-01-28 06:12:50,982 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 646 transitions. [2023-01-28 06:12:50,982 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:12:50,982 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 646 transitions. [2023-01-28 06:12:50,984 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 215.33333333333334) internal successors, (646), 3 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:12:50,986 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 402.0) internal successors, (1608), 4 states have internal predecessors, (1608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:12:50,987 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 402.0) internal successors, (1608), 4 states have internal predecessors, (1608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:12:50,987 INFO L175 Difference]: Start difference. First operand has 46 places, 41 transitions, 94 flow. Second operand 3 states and 646 transitions. [2023-01-28 06:12:50,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 55 transitions, 226 flow [2023-01-28 06:12:50,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 55 transitions, 222 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 06:12:50,990 INFO L231 Difference]: Finished difference. Result has 44 places, 43 transitions, 109 flow [2023-01-28 06:12:50,990 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=402, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=109, PETRI_PLACES=44, PETRI_TRANSITIONS=43} [2023-01-28 06:12:50,991 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, -3 predicate places. [2023-01-28 06:12:50,991 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 43 transitions, 109 flow [2023-01-28 06:12:50,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 204.0) internal successors, (612), 3 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:12:50,992 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:12:50,992 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:12:50,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-28 06:12:50,993 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)] === [2023-01-28 06:12:50,993 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:12:50,993 INFO L85 PathProgramCache]: Analyzing trace with hash -824947493, now seen corresponding path program 1 times [2023-01-28 06:12:50,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:12:50,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303987542] [2023-01-28 06:12:50,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:12:50,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:12:51,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:12:51,178 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:12:51,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:12:51,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303987542] [2023-01-28 06:12:51,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303987542] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:12:51,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:12:51,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 06:12:51,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646491709] [2023-01-28 06:12:51,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:12:51,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 06:12:51,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:12:51,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 06:12:51,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 06:12:51,181 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 402 [2023-01-28 06:12:51,181 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 43 transitions, 109 flow. Second operand has 3 states, 3 states have (on average 202.0) internal successors, (606), 3 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:12:51,182 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:12:51,182 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 402 [2023-01-28 06:12:51,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:12:51,266 INFO L130 PetriNetUnfolder]: 187/394 cut-off events. [2023-01-28 06:12:51,266 INFO L131 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2023-01-28 06:12:51,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 871 conditions, 394 events. 187/394 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1256 event pairs, 12 based on Foata normal form. 42/410 useless extension candidates. Maximal degree in co-relation 865. Up to 341 conditions per place. [2023-01-28 06:12:51,268 INFO L137 encePairwiseOnDemand]: 399/402 looper letters, 43 selfloop transitions, 3 changer transitions 0/49 dead transitions. [2023-01-28 06:12:51,268 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 49 transitions, 216 flow [2023-01-28 06:12:51,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 06:12:51,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 06:12:51,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 628 transitions. [2023-01-28 06:12:51,270 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5207296849087893 [2023-01-28 06:12:51,270 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 628 transitions. [2023-01-28 06:12:51,271 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 628 transitions. [2023-01-28 06:12:51,271 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:12:51,274 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 628 transitions. [2023-01-28 06:12:51,276 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 209.33333333333334) internal successors, (628), 3 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:12:51,279 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 402.0) internal successors, (1608), 4 states have internal predecessors, (1608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:12:51,280 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 402.0) internal successors, (1608), 4 states have internal predecessors, (1608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:12:51,281 INFO L175 Difference]: Start difference. First operand has 44 places, 43 transitions, 109 flow. Second operand 3 states and 628 transitions. [2023-01-28 06:12:51,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 49 transitions, 216 flow [2023-01-28 06:12:51,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 49 transitions, 213 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 06:12:51,283 INFO L231 Difference]: Finished difference. Result has 45 places, 43 transitions, 112 flow [2023-01-28 06:12:51,284 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=402, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=45, PETRI_TRANSITIONS=43} [2023-01-28 06:12:51,285 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, -2 predicate places. [2023-01-28 06:12:51,285 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 43 transitions, 112 flow [2023-01-28 06:12:51,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 202.0) internal successors, (606), 3 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:12:51,286 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:12:51,286 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:12:51,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-28 06:12:51,286 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)] === [2023-01-28 06:12:51,287 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:12:51,287 INFO L85 PathProgramCache]: Analyzing trace with hash 818194887, now seen corresponding path program 1 times [2023-01-28 06:12:51,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:12:51,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079362184] [2023-01-28 06:12:51,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:12:51,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:12:51,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:12:51,431 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:12:51,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:12:51,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079362184] [2023-01-28 06:12:51,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079362184] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 06:12:51,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1590717439] [2023-01-28 06:12:51,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:12:51,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 06:12:51,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 06:12:51,441 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 06:12:51,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-01-28 06:12:51,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:12:51,567 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 3 conjunts are in the unsatisfiable core [2023-01-28 06:12:51,571 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 06:12:51,636 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:12:51,636 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 06:12:51,676 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:12:51,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1590717439] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 06:12:51,676 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 06:12:51,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-01-28 06:12:51,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855644458] [2023-01-28 06:12:51,677 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 06:12:51,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 06:12:51,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:12:51,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 06:12:51,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-01-28 06:12:51,679 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 402 [2023-01-28 06:12:51,681 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 43 transitions, 112 flow. Second operand has 7 states, 7 states have (on average 203.57142857142858) internal successors, (1425), 7 states have internal predecessors, (1425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:12:51,681 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:12:51,681 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 402 [2023-01-28 06:12:51,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:12:51,846 INFO L130 PetriNetUnfolder]: 246/531 cut-off events. [2023-01-28 06:12:51,846 INFO L131 PetriNetUnfolder]: For 36/38 co-relation queries the response was YES. [2023-01-28 06:12:51,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1200 conditions, 531 events. 246/531 cut-off events. For 36/38 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1513 event pairs, 100 based on Foata normal form. 12/507 useless extension candidates. Maximal degree in co-relation 1194. Up to 238 conditions per place. [2023-01-28 06:12:51,849 INFO L137 encePairwiseOnDemand]: 397/402 looper letters, 70 selfloop transitions, 10 changer transitions 1/84 dead transitions. [2023-01-28 06:12:51,849 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 84 transitions, 370 flow [2023-01-28 06:12:51,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 06:12:51,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 06:12:51,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1271 transitions. [2023-01-28 06:12:51,852 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5269485903814262 [2023-01-28 06:12:51,852 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1271 transitions. [2023-01-28 06:12:51,852 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1271 transitions. [2023-01-28 06:12:51,853 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:12:51,853 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1271 transitions. [2023-01-28 06:12:51,856 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 211.83333333333334) internal successors, (1271), 6 states have internal predecessors, (1271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:12:51,859 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 402.0) internal successors, (2814), 7 states have internal predecessors, (2814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:12:51,860 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 402.0) internal successors, (2814), 7 states have internal predecessors, (2814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:12:51,860 INFO L175 Difference]: Start difference. First operand has 45 places, 43 transitions, 112 flow. Second operand 6 states and 1271 transitions. [2023-01-28 06:12:51,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 84 transitions, 370 flow [2023-01-28 06:12:51,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 84 transitions, 367 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 06:12:51,862 INFO L231 Difference]: Finished difference. Result has 53 places, 47 transitions, 170 flow [2023-01-28 06:12:51,863 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=402, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=170, PETRI_PLACES=53, PETRI_TRANSITIONS=47} [2023-01-28 06:12:51,863 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 6 predicate places. [2023-01-28 06:12:51,863 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 47 transitions, 170 flow [2023-01-28 06:12:51,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 203.57142857142858) internal successors, (1425), 7 states have internal predecessors, (1425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:12:51,865 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:12:51,865 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:12:51,875 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-01-28 06:12:52,075 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 [2023-01-28 06:12:52,075 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)] === [2023-01-28 06:12:52,076 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:12:52,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1030938622, now seen corresponding path program 2 times [2023-01-28 06:12:52,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:12:52,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449787448] [2023-01-28 06:12:52,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:12:52,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:12:52,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:12:52,249 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:12:52,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:12:52,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449787448] [2023-01-28 06:12:52,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449787448] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 06:12:52,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2066602778] [2023-01-28 06:12:52,250 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-28 06:12:52,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 06:12:52,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 06:12:52,252 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 06:12:52,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-01-28 06:12:52,451 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-28 06:12:52,451 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 06:12:52,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 6 conjunts are in the unsatisfiable core [2023-01-28 06:12:52,456 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 06:12:52,513 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:12:52,514 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 06:12:52,594 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:12:52,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2066602778] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 06:12:52,594 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 06:12:52,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2023-01-28 06:12:52,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358876718] [2023-01-28 06:12:52,595 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 06:12:52,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-01-28 06:12:52,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:12:52,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-01-28 06:12:52,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-01-28 06:12:52,598 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 402 [2023-01-28 06:12:52,601 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 47 transitions, 170 flow. Second operand has 13 states, 13 states have (on average 203.84615384615384) internal successors, (2650), 13 states have internal predecessors, (2650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:12:52,601 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:12:52,601 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 402 [2023-01-28 06:12:52,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:12:52,915 INFO L130 PetriNetUnfolder]: 423/934 cut-off events. [2023-01-28 06:12:52,916 INFO L131 PetriNetUnfolder]: For 328/328 co-relation queries the response was YES. [2023-01-28 06:12:52,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2367 conditions, 934 events. 423/934 cut-off events. For 328/328 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2534 event pairs, 91 based on Foata normal form. 24/900 useless extension candidates. Maximal degree in co-relation 2357. Up to 217 conditions per place. [2023-01-28 06:12:52,921 INFO L137 encePairwiseOnDemand]: 397/402 looper letters, 136 selfloop transitions, 22 changer transitions 0/161 dead transitions. [2023-01-28 06:12:52,921 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 161 transitions, 836 flow [2023-01-28 06:12:52,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-01-28 06:12:52,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-01-28 06:12:52,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2540 transitions. [2023-01-28 06:12:52,927 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5265339966832504 [2023-01-28 06:12:52,927 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2540 transitions. [2023-01-28 06:12:52,927 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2540 transitions. [2023-01-28 06:12:52,928 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:12:52,928 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2540 transitions. [2023-01-28 06:12:52,934 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 211.66666666666666) internal successors, (2540), 12 states have internal predecessors, (2540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:12:52,941 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 402.0) internal successors, (5226), 13 states have internal predecessors, (5226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:12:52,943 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 402.0) internal successors, (5226), 13 states have internal predecessors, (5226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:12:52,943 INFO L175 Difference]: Start difference. First operand has 53 places, 47 transitions, 170 flow. Second operand 12 states and 2540 transitions. [2023-01-28 06:12:52,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 161 transitions, 836 flow [2023-01-28 06:12:52,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 161 transitions, 797 flow, removed 18 selfloop flow, removed 1 redundant places. [2023-01-28 06:12:52,952 INFO L231 Difference]: Finished difference. Result has 70 places, 60 transitions, 320 flow [2023-01-28 06:12:52,952 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=402, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=320, PETRI_PLACES=70, PETRI_TRANSITIONS=60} [2023-01-28 06:12:52,954 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 23 predicate places. [2023-01-28 06:12:52,954 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 60 transitions, 320 flow [2023-01-28 06:12:52,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 203.84615384615384) internal successors, (2650), 13 states have internal predecessors, (2650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:12:52,956 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:12:52,956 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:12:52,967 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-01-28 06:12:53,163 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,SelfDestructingSolverStorable5 [2023-01-28 06:12:53,164 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)] === [2023-01-28 06:12:53,164 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:12:53,164 INFO L85 PathProgramCache]: Analyzing trace with hash -122187422, now seen corresponding path program 3 times [2023-01-28 06:12:53,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:12:53,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991241636] [2023-01-28 06:12:53,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:12:53,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:12:53,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:12:53,666 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:12:53,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:12:53,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991241636] [2023-01-28 06:12:53,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991241636] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 06:12:53,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [967272478] [2023-01-28 06:12:53,667 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-01-28 06:12:53,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 06:12:53,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 06:12:53,669 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 06:12:53,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-01-28 06:12:54,126 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-01-28 06:12:54,127 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 06:12:54,130 INFO L263 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 70 conjunts are in the unsatisfiable core [2023-01-28 06:12:54,136 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 06:12:54,534 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 11 treesize of output 7 [2023-01-28 06:12:54,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 06:12:54,561 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 14 treesize of output 16 [2023-01-28 06:12:54,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 06:12:54,649 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 21 treesize of output 20 [2023-01-28 06:12:54,725 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 19 treesize of output 18 [2023-01-28 06:12:54,732 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2023-01-28 06:12:54,733 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-01-28 06:12:54,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [967272478] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:12:54,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-01-28 06:12:54,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [13] total 18 [2023-01-28 06:12:54,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783984820] [2023-01-28 06:12:54,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:12:54,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 06:12:54,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:12:54,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 06:12:54,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2023-01-28 06:12:54,735 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 402 [2023-01-28 06:12:54,737 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 60 transitions, 320 flow. Second operand has 7 states, 7 states have (on average 162.57142857142858) internal successors, (1138), 7 states have internal predecessors, (1138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:12:54,737 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:12:54,737 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 402 [2023-01-28 06:12:54,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:12:55,064 INFO L130 PetriNetUnfolder]: 725/1582 cut-off events. [2023-01-28 06:12:55,065 INFO L131 PetriNetUnfolder]: For 980/980 co-relation queries the response was YES. [2023-01-28 06:12:55,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4252 conditions, 1582 events. 725/1582 cut-off events. For 980/980 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 5513 event pairs, 159 based on Foata normal form. 0/1518 useless extension candidates. Maximal degree in co-relation 4235. Up to 992 conditions per place. [2023-01-28 06:12:55,074 INFO L137 encePairwiseOnDemand]: 394/402 looper letters, 89 selfloop transitions, 11 changer transitions 1/103 dead transitions. [2023-01-28 06:12:55,074 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 103 transitions, 730 flow [2023-01-28 06:12:55,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 06:12:55,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 06:12:55,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1013 transitions. [2023-01-28 06:12:55,077 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41998341625207297 [2023-01-28 06:12:55,077 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1013 transitions. [2023-01-28 06:12:55,077 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1013 transitions. [2023-01-28 06:12:55,078 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:12:55,078 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1013 transitions. [2023-01-28 06:12:55,080 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 168.83333333333334) internal successors, (1013), 6 states have internal predecessors, (1013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:12:55,083 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 402.0) internal successors, (2814), 7 states have internal predecessors, (2814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:12:55,083 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 402.0) internal successors, (2814), 7 states have internal predecessors, (2814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:12:55,083 INFO L175 Difference]: Start difference. First operand has 70 places, 60 transitions, 320 flow. Second operand 6 states and 1013 transitions. [2023-01-28 06:12:55,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 103 transitions, 730 flow [2023-01-28 06:12:55,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 103 transitions, 714 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-01-28 06:12:55,090 INFO L231 Difference]: Finished difference. Result has 74 places, 69 transitions, 398 flow [2023-01-28 06:12:55,090 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=402, PETRI_DIFFERENCE_MINUEND_FLOW=309, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=398, PETRI_PLACES=74, PETRI_TRANSITIONS=69} [2023-01-28 06:12:55,091 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 27 predicate places. [2023-01-28 06:12:55,091 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 69 transitions, 398 flow [2023-01-28 06:12:55,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 162.57142857142858) internal successors, (1138), 7 states have internal predecessors, (1138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:12:55,092 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:12:55,092 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 6, 6, 6, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:12:55,101 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-01-28 06:12:55,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 06:12:55,303 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)] === [2023-01-28 06:12:55,304 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:12:55,304 INFO L85 PathProgramCache]: Analyzing trace with hash -345088948, now seen corresponding path program 1 times [2023-01-28 06:12:55,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:12:55,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219587637] [2023-01-28 06:12:55,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:12:55,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:12:55,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:12:55,656 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 0 proven. 283 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:12:55,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:12:55,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219587637] [2023-01-28 06:12:55,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219587637] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 06:12:55,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1201830949] [2023-01-28 06:12:55,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:12:55,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 06:12:55,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 06:12:55,658 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 06:12:55,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-01-28 06:12:55,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:12:55,866 INFO L263 TraceCheckSpWp]: Trace formula consists of 721 conjuncts, 12 conjunts are in the unsatisfiable core [2023-01-28 06:12:55,869 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 06:12:55,971 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 0 proven. 283 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:12:55,972 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 06:12:56,241 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 0 proven. 283 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:12:56,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1201830949] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 06:12:56,241 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 06:12:56,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 23 [2023-01-28 06:12:56,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59296441] [2023-01-28 06:12:56,242 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 06:12:56,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-01-28 06:12:56,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:12:56,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-01-28 06:12:56,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2023-01-28 06:12:56,247 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 402 [2023-01-28 06:12:56,252 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 69 transitions, 398 flow. Second operand has 23 states, 23 states have (on average 204.56521739130434) internal successors, (4705), 23 states have internal predecessors, (4705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:12:56,252 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:12:56,252 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 402 [2023-01-28 06:12:56,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:12:57,036 INFO L130 PetriNetUnfolder]: 1178/2745 cut-off events. [2023-01-28 06:12:57,036 INFO L131 PetriNetUnfolder]: For 4953/4953 co-relation queries the response was YES. [2023-01-28 06:12:57,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8932 conditions, 2745 events. 1178/2745 cut-off events. For 4953/4953 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 9881 event pairs, 137 based on Foata normal form. 80/2801 useless extension candidates. Maximal degree in co-relation 8912. Up to 680 conditions per place. [2023-01-28 06:12:57,056 INFO L137 encePairwiseOnDemand]: 397/402 looper letters, 344 selfloop transitions, 43 changer transitions 0/390 dead transitions. [2023-01-28 06:12:57,056 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 390 transitions, 2835 flow [2023-01-28 06:12:57,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-28 06:12:57,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2023-01-28 06:12:57,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 4654 transitions. [2023-01-28 06:12:57,067 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.526232473993668 [2023-01-28 06:12:57,068 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 4654 transitions. [2023-01-28 06:12:57,068 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 4654 transitions. [2023-01-28 06:12:57,070 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:12:57,070 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 4654 transitions. [2023-01-28 06:12:57,080 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 211.54545454545453) internal successors, (4654), 22 states have internal predecessors, (4654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:12:57,092 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 402.0) internal successors, (9246), 23 states have internal predecessors, (9246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:12:57,106 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 402.0) internal successors, (9246), 23 states have internal predecessors, (9246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:12:57,107 INFO L175 Difference]: Start difference. First operand has 74 places, 69 transitions, 398 flow. Second operand 22 states and 4654 transitions. [2023-01-28 06:12:57,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 390 transitions, 2835 flow [2023-01-28 06:12:57,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 390 transitions, 2834 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 06:12:57,122 INFO L231 Difference]: Finished difference. Result has 105 places, 91 transitions, 780 flow [2023-01-28 06:12:57,122 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=402, PETRI_DIFFERENCE_MINUEND_FLOW=397, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=780, PETRI_PLACES=105, PETRI_TRANSITIONS=91} [2023-01-28 06:12:57,124 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 58 predicate places. [2023-01-28 06:12:57,124 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 91 transitions, 780 flow [2023-01-28 06:12:57,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 204.56521739130434) internal successors, (4705), 23 states have internal predecessors, (4705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:12:57,126 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:12:57,126 INFO L208 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 11, 11, 11, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:12:57,135 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-01-28 06:12:57,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 06:12:57,336 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)] === [2023-01-28 06:12:57,336 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:12:57,336 INFO L85 PathProgramCache]: Analyzing trace with hash -541637280, now seen corresponding path program 2 times [2023-01-28 06:12:57,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:12:57,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102378441] [2023-01-28 06:12:57,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:12:57,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:12:57,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:12:59,496 INFO L134 CoverageAnalysis]: Checked inductivity of 1188 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 1092 trivial. 0 not checked. [2023-01-28 06:12:59,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:12:59,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102378441] [2023-01-28 06:12:59,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102378441] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:12:59,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:12:59,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 06:12:59,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763508667] [2023-01-28 06:12:59,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:12:59,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 06:12:59,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:12:59,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 06:12:59,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 06:12:59,499 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 402 [2023-01-28 06:12:59,500 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 91 transitions, 780 flow. Second operand has 5 states, 5 states have (on average 164.8) internal successors, (824), 5 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:12:59,500 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:12:59,500 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 402 [2023-01-28 06:12:59,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:13:00,235 INFO L130 PetriNetUnfolder]: 1283/2838 cut-off events. [2023-01-28 06:13:00,235 INFO L131 PetriNetUnfolder]: For 4916/4916 co-relation queries the response was YES. [2023-01-28 06:13:00,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9913 conditions, 2838 events. 1283/2838 cut-off events. For 4916/4916 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 9969 event pairs, 797 based on Foata normal form. 1/2815 useless extension candidates. Maximal degree in co-relation 9883. Up to 2813 conditions per place. [2023-01-28 06:13:00,259 INFO L137 encePairwiseOnDemand]: 395/402 looper letters, 93 selfloop transitions, 9 changer transitions 0/104 dead transitions. [2023-01-28 06:13:00,259 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 104 transitions, 1044 flow [2023-01-28 06:13:00,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 06:13:00,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 06:13:00,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1000 transitions. [2023-01-28 06:13:00,263 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41459369817578773 [2023-01-28 06:13:00,263 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1000 transitions. [2023-01-28 06:13:00,263 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1000 transitions. [2023-01-28 06:13:00,264 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:13:00,264 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1000 transitions. [2023-01-28 06:13:00,266 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 166.66666666666666) internal successors, (1000), 6 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:13:00,268 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 402.0) internal successors, (2814), 7 states have internal predecessors, (2814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:13:00,269 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 402.0) internal successors, (2814), 7 states have internal predecessors, (2814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:13:00,269 INFO L175 Difference]: Start difference. First operand has 105 places, 91 transitions, 780 flow. Second operand 6 states and 1000 transitions. [2023-01-28 06:13:00,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 104 transitions, 1044 flow [2023-01-28 06:13:00,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 104 transitions, 1008 flow, removed 0 selfloop flow, removed 9 redundant places. [2023-01-28 06:13:00,295 INFO L231 Difference]: Finished difference. Result has 105 places, 99 transitions, 827 flow [2023-01-28 06:13:00,295 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=402, PETRI_DIFFERENCE_MINUEND_FLOW=745, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=827, PETRI_PLACES=105, PETRI_TRANSITIONS=99} [2023-01-28 06:13:00,296 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 58 predicate places. [2023-01-28 06:13:00,296 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 99 transitions, 827 flow [2023-01-28 06:13:00,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 164.8) internal successors, (824), 5 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:13:00,297 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:13:00,297 INFO L208 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:13:00,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-28 06:13:00,297 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)] === [2023-01-28 06:13:00,298 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:13:00,298 INFO L85 PathProgramCache]: Analyzing trace with hash -49729782, now seen corresponding path program 3 times [2023-01-28 06:13:00,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:13:00,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602083423] [2023-01-28 06:13:00,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:13:00,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:13:00,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:13:03,482 INFO L134 CoverageAnalysis]: Checked inductivity of 1195 backedges. 613 proven. 53 refuted. 0 times theorem prover too weak. 529 trivial. 0 not checked. [2023-01-28 06:13:03,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:13:03,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602083423] [2023-01-28 06:13:03,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602083423] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 06:13:03,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1789256059] [2023-01-28 06:13:03,482 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-01-28 06:13:03,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 06:13:03,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 06:13:03,484 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) [2023-01-28 06:13:03,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-01-28 06:13:05,478 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-01-28 06:13:05,478 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 06:13:05,491 INFO L263 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 135 conjunts are in the unsatisfiable core [2023-01-28 06:13:05,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 06:13:05,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 06:13:05,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 06:13:05,567 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2023-01-28 06:13:05,612 INFO L321 Elim1Store]: treesize reduction 40, result has 45.2 percent of original size [2023-01-28 06:13:05,613 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 35 treesize of output 55 [2023-01-28 06:13:05,630 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 22 [2023-01-28 06:13:05,753 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2023-01-28 06:13:05,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 06:13:05,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 06:13:05,840 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2023-01-28 06:13:05,896 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2023-01-28 06:13:05,924 INFO L134 CoverageAnalysis]: Checked inductivity of 1195 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 1099 trivial. 0 not checked. [2023-01-28 06:13:05,924 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-01-28 06:13:05,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1789256059] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:13:05,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-01-28 06:13:05,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [12] total 17 [2023-01-28 06:13:05,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71920571] [2023-01-28 06:13:05,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:13:05,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 06:13:05,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:13:05,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 06:13:05,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2023-01-28 06:13:05,927 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 402 [2023-01-28 06:13:05,927 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 99 transitions, 827 flow. Second operand has 7 states, 7 states have (on average 157.85714285714286) internal successors, (1105), 7 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:13:05,928 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:13:05,928 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 402 [2023-01-28 06:13:05,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:13:06,629 INFO L130 PetriNetUnfolder]: 1289/2853 cut-off events. [2023-01-28 06:13:06,629 INFO L131 PetriNetUnfolder]: For 5300/5300 co-relation queries the response was YES. [2023-01-28 06:13:06,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10468 conditions, 2853 events. 1289/2853 cut-off events. For 5300/5300 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 10353 event pairs, 434 based on Foata normal form. 3/2832 useless extension candidates. Maximal degree in co-relation 10433. Up to 2777 conditions per place. [2023-01-28 06:13:06,658 INFO L137 encePairwiseOnDemand]: 395/402 looper letters, 103 selfloop transitions, 9 changer transitions 1/115 dead transitions. [2023-01-28 06:13:06,658 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 115 transitions, 1111 flow [2023-01-28 06:13:06,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 06:13:06,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 06:13:06,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 977 transitions. [2023-01-28 06:13:06,662 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4050580431177446 [2023-01-28 06:13:06,662 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 977 transitions. [2023-01-28 06:13:06,662 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 977 transitions. [2023-01-28 06:13:06,663 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:13:06,663 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 977 transitions. [2023-01-28 06:13:06,665 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 162.83333333333334) internal successors, (977), 6 states have internal predecessors, (977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:13:06,668 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 402.0) internal successors, (2814), 7 states have internal predecessors, (2814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:13:06,668 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 402.0) internal successors, (2814), 7 states have internal predecessors, (2814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:13:06,668 INFO L175 Difference]: Start difference. First operand has 105 places, 99 transitions, 827 flow. Second operand 6 states and 977 transitions. [2023-01-28 06:13:06,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 115 transitions, 1111 flow [2023-01-28 06:13:06,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 115 transitions, 1087 flow, removed 12 selfloop flow, removed 0 redundant places. [2023-01-28 06:13:06,693 INFO L231 Difference]: Finished difference. Result has 113 places, 103 transitions, 865 flow [2023-01-28 06:13:06,694 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=402, PETRI_DIFFERENCE_MINUEND_FLOW=807, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=865, PETRI_PLACES=113, PETRI_TRANSITIONS=103} [2023-01-28 06:13:06,695 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 66 predicate places. [2023-01-28 06:13:06,695 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 103 transitions, 865 flow [2023-01-28 06:13:06,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 157.85714285714286) internal successors, (1105), 7 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:13:06,696 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:13:06,696 INFO L208 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:13:06,711 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-01-28 06:13:06,905 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 [2023-01-28 06:13:06,905 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)] === [2023-01-28 06:13:06,906 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:13:06,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1311907394, now seen corresponding path program 4 times [2023-01-28 06:13:06,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:13:06,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455287920] [2023-01-28 06:13:06,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:13:06,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:13:06,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:13:09,386 INFO L134 CoverageAnalysis]: Checked inductivity of 1195 backedges. 407 proven. 15 refuted. 0 times theorem prover too weak. 773 trivial. 0 not checked. [2023-01-28 06:13:09,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:13:09,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455287920] [2023-01-28 06:13:09,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455287920] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 06:13:09,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1047136668] [2023-01-28 06:13:09,387 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-01-28 06:13:09,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 06:13:09,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 06:13:09,388 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) [2023-01-28 06:13:09,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-01-28 06:13:10,033 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-01-28 06:13:10,033 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 06:13:10,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 1197 conjuncts, 55 conjunts are in the unsatisfiable core [2023-01-28 06:13:10,049 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 06:13:10,312 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 11 treesize of output 7 [2023-01-28 06:13:10,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 06:13:10,337 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 14 treesize of output 16 [2023-01-28 06:13:10,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 06:13:10,391 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 21 treesize of output 20 [2023-01-28 06:13:10,441 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 19 treesize of output 18 [2023-01-28 06:13:10,504 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 19 treesize of output 11 [2023-01-28 06:13:10,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 06:13:10,529 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 14 treesize of output 16 [2023-01-28 06:13:10,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 06:13:10,571 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 21 treesize of output 20 [2023-01-28 06:13:10,597 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 19 treesize of output 18 [2023-01-28 06:13:10,604 INFO L134 CoverageAnalysis]: Checked inductivity of 1195 backedges. 665 proven. 35 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2023-01-28 06:13:10,605 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 06:13:10,695 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1844 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1842) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|) (not (= (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|) |c_~#queue~0.offset|) v_ArrVal_1844) .cse1) 20))))) is different from false [2023-01-28 06:13:10,708 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1844 Int)) (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|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_1842) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|) (not (= 20 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|) |c_~#queue~0.offset|) v_ArrVal_1844) .cse1)))))) is different from false [2023-01-28 06:13:10,721 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1844 Int)) (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 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1842) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= 20 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|) |c_~#queue~0.offset|) v_ArrVal_1844) .cse1))) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|)))) is different from false [2023-01-28 06:13:10,744 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| Int) (v_ArrVal_1838 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1844 Int)) (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 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1838) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1842) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|) (not (= (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|) |c_~#queue~0.offset|) v_ArrVal_1844) .cse1) 20))))) is different from false [2023-01-28 06:13:10,772 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1837 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| Int) (v_ArrVal_1838 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1844 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (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_1837)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1838) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1842) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|) (not (= (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|) |c_~#queue~0.offset|) v_ArrVal_1844) .cse1) 20))))) is different from false [2023-01-28 06:13:10,908 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 06:13:10,908 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 207 treesize of output 147 [2023-01-28 06:13:10,920 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 06:13:10,921 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 267 treesize of output 265 [2023-01-28 06:13:10,933 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 89 treesize of output 81 [2023-01-28 06:13:10,941 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 11 treesize of output 7 [2023-01-28 06:13:10,961 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 [2023-01-28 06:13:11,026 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 06:13:11,026 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 99 treesize of output 91 [2023-01-28 06:13:11,188 INFO L134 CoverageAnalysis]: Checked inductivity of 1195 backedges. 632 proven. 31 refuted. 0 times theorem prover too weak. 495 trivial. 37 not checked. [2023-01-28 06:13:11,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1047136668] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 06:13:11,189 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 06:13:11,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 13] total 33 [2023-01-28 06:13:11,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255770902] [2023-01-28 06:13:11,191 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 06:13:11,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-01-28 06:13:11,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:13:11,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-01-28 06:13:11,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=614, Unknown=7, NotChecked=290, Total=1122 [2023-01-28 06:13:11,196 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 402 [2023-01-28 06:13:11,199 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 103 transitions, 865 flow. Second operand has 34 states, 34 states have (on average 158.85294117647058) internal successors, (5401), 34 states have internal predecessors, (5401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:13:11,199 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:13:11,200 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 402 [2023-01-28 06:13:11,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:13:13,428 INFO L130 PetriNetUnfolder]: 2349/5332 cut-off events. [2023-01-28 06:13:13,429 INFO L131 PetriNetUnfolder]: For 11791/11791 co-relation queries the response was YES. [2023-01-28 06:13:13,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20435 conditions, 5332 events. 2349/5332 cut-off events. For 11791/11791 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 24570 event pairs, 161 based on Foata normal form. 137/5433 useless extension candidates. Maximal degree in co-relation 20396. Up to 1994 conditions per place. [2023-01-28 06:13:13,477 INFO L137 encePairwiseOnDemand]: 390/402 looper letters, 206 selfloop transitions, 52 changer transitions 1/261 dead transitions. [2023-01-28 06:13:13,477 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 261 transitions, 2606 flow [2023-01-28 06:13:13,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-01-28 06:13:13,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2023-01-28 06:13:13,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2943 transitions. [2023-01-28 06:13:13,484 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40671641791044777 [2023-01-28 06:13:13,484 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 2943 transitions. [2023-01-28 06:13:13,484 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 2943 transitions. [2023-01-28 06:13:13,485 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:13:13,486 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 2943 transitions. [2023-01-28 06:13:13,490 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 163.5) internal successors, (2943), 18 states have internal predecessors, (2943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:13:13,498 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 402.0) internal successors, (7638), 19 states have internal predecessors, (7638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:13:13,499 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 402.0) internal successors, (7638), 19 states have internal predecessors, (7638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:13:13,500 INFO L175 Difference]: Start difference. First operand has 113 places, 103 transitions, 865 flow. Second operand 18 states and 2943 transitions. [2023-01-28 06:13:13,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 261 transitions, 2606 flow [2023-01-28 06:13:13,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 261 transitions, 2588 flow, removed 5 selfloop flow, removed 2 redundant places. [2023-01-28 06:13:13,562 INFO L231 Difference]: Finished difference. Result has 134 places, 134 transitions, 1278 flow [2023-01-28 06:13:13,563 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=402, PETRI_DIFFERENCE_MINUEND_FLOW=852, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1278, PETRI_PLACES=134, PETRI_TRANSITIONS=134} [2023-01-28 06:13:13,563 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 87 predicate places. [2023-01-28 06:13:13,563 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 134 transitions, 1278 flow [2023-01-28 06:13:13,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 158.85294117647058) internal successors, (5401), 34 states have internal predecessors, (5401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:13:13,565 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:13:13,565 INFO L208 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 14, 14, 14, 14, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:13:13,576 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-01-28 06:13:13,774 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 [2023-01-28 06:13:13,774 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)] === [2023-01-28 06:13:13,774 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:13:13,775 INFO L85 PathProgramCache]: Analyzing trace with hash 259927122, now seen corresponding path program 5 times [2023-01-28 06:13:13,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:13:13,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294792458] [2023-01-28 06:13:13,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:13:13,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:13:13,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:13:17,636 INFO L134 CoverageAnalysis]: Checked inductivity of 1273 backedges. 678 proven. 60 refuted. 0 times theorem prover too weak. 535 trivial. 0 not checked. [2023-01-28 06:13:17,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:13:17,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294792458] [2023-01-28 06:13:17,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294792458] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 06:13:17,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [324764311] [2023-01-28 06:13:17,637 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-01-28 06:13:17,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 06:13:17,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 06:13:17,641 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) [2023-01-28 06:13:17,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-01-28 06:13:21,973 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2023-01-28 06:13:21,974 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 06:13:21,988 INFO L263 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 199 conjunts are in the unsatisfiable core [2023-01-28 06:13:21,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 06:13:22,041 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 23 treesize of output 13 [2023-01-28 06:13:22,072 INFO L321 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2023-01-28 06:13:22,072 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 1 case distinctions, treesize of input 25 treesize of output 38 [2023-01-28 06:13:22,218 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-28 06:13:22,229 INFO L321 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2023-01-28 06:13:22,229 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 59 treesize of output 62 [2023-01-28 06:13:22,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 06:13:22,321 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 48 treesize of output 47 [2023-01-28 06:13:22,462 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 66 treesize of output 44 [2023-01-28 06:13:22,527 INFO L321 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2023-01-28 06:13:22,527 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 1 case distinctions, treesize of input 60 treesize of output 67 [2023-01-28 06:13:22,655 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-28 06:13:22,665 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-01-28 06:13:22,666 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 56 treesize of output 58 [2023-01-28 06:13:22,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 06:13:22,752 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 48 treesize of output 47 [2023-01-28 06:13:22,888 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 66 treesize of output 44 [2023-01-28 06:13:22,952 INFO L321 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2023-01-28 06:13:22,953 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 1 case distinctions, treesize of input 60 treesize of output 67 [2023-01-28 06:13:23,113 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-28 06:13:23,123 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-01-28 06:13:23,124 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 56 treesize of output 58 [2023-01-28 06:13:23,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 06:13:23,216 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 48 treesize of output 47 [2023-01-28 06:13:23,372 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 66 treesize of output 44 [2023-01-28 06:13:23,440 INFO L321 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2023-01-28 06:13:23,441 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 1 case distinctions, treesize of input 60 treesize of output 67 [2023-01-28 06:13:23,595 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-28 06:13:23,606 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-01-28 06:13:23,606 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 56 treesize of output 58 [2023-01-28 06:13:23,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 06:13:23,725 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 48 treesize of output 47 [2023-01-28 06:13:23,797 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 23 treesize of output 13 [2023-01-28 06:13:23,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 06:13:23,832 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 25 treesize of output 24 [2023-01-28 06:13:23,931 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-28 06:13:23,938 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-01-28 06:13:23,938 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 [2023-01-28 06:13:24,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 06:13:24,007 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 [2023-01-28 06:13:24,104 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 34 treesize of output 18 [2023-01-28 06:13:24,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 06:13:24,150 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 25 treesize of output 24 [2023-01-28 06:13:24,257 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-28 06:13:24,264 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-01-28 06:13:24,264 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 [2023-01-28 06:13:24,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 06:13:24,332 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 [2023-01-28 06:13:24,419 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 34 treesize of output 18 [2023-01-28 06:13:24,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 06:13:24,466 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 25 treesize of output 24 [2023-01-28 06:13:24,583 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-28 06:13:24,593 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-01-28 06:13:24,593 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 [2023-01-28 06:13:24,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 06:13:24,675 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 [2023-01-28 06:13:24,761 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 34 treesize of output 18 [2023-01-28 06:13:24,827 INFO L321 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2023-01-28 06:13:24,827 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 1 case distinctions, treesize of input 31 treesize of output 30 [2023-01-28 06:13:24,880 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-28 06:13:24,887 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-01-28 06:13:24,887 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 [2023-01-28 06:13:24,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 06:13:24,933 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 [2023-01-28 06:13:24,943 INFO L134 CoverageAnalysis]: Checked inductivity of 1273 backedges. 905 proven. 112 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2023-01-28 06:13:24,943 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 06:14:09,079 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2293 Int) (v_ArrVal_2295 Int) (v_ArrVal_2298 Int) (v_ArrVal_2289 Int) (v_ArrVal_2299 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_119| Int) (v_ArrVal_2301 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_117| Int) (|v_t1Thread1of1ForFork0_~i~0#1_123| Int) (v_ArrVal_2291 Int)) (let ((.cse5 (let ((.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2289)))) (store .cse6 |c_~#stored_elements~0.base| (store (select .cse6 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) v_ArrVal_2291))))) (let ((.cse2 (select .cse5 |c_~#queue~0.base|))) (let ((.cse3 (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_119| 4) |c_~#queue~0.offset|) v_ArrVal_2293)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select (let ((.cse4 (store .cse5 |c_~#queue~0.base| (store (store .cse3 (+ 88 |c_~#queue~0.offset|) v_ArrVal_2295) .cse1 v_ArrVal_2298)))) (store .cse4 |c_~#stored_elements~0.base| (store (select .cse4 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_123| 4) |c_~#stored_elements~0.offset|) v_ArrVal_2299))) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_117|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_119|) (< (+ (select .cse3 .cse1) 1) v_ArrVal_2298) (< |v_t1Thread1of1ForFork0_~i~0#1_123| (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_2289) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_117| 4)) v_ArrVal_2301) .cse1) 20))))))) is different from false [2023-01-28 06:16:43,649 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_~i~0#1_124| Int) (v_ArrVal_2281 Int) (v_ArrVal_2291 Int) (v_ArrVal_2283 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_121| Int) (v_ArrVal_2293 Int) (v_ArrVal_2285 Int) (v_ArrVal_2295 Int) (v_ArrVal_2298 Int) (v_ArrVal_2289 Int) (v_ArrVal_2288 Int) (v_ArrVal_2299 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_119| Int) (v_ArrVal_2301 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_117| Int) (|v_t1Thread1of1ForFork0_~i~0#1_123| Int)) (let ((.cse10 (let ((.cse11 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2281)))) (store .cse11 |c_~#stored_elements~0.base| (store (select .cse11 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) v_ArrVal_2283))))) (let ((.cse5 (select .cse10 |c_~#queue~0.base|))) (let ((.cse4 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_121| 4) |c_~#queue~0.offset|) v_ArrVal_2285)) (.cse8 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse7 (let ((.cse9 (store .cse10 |c_~#queue~0.base| (store (store .cse4 .cse8 v_ArrVal_2288) .cse1 v_ArrVal_2289)))) (store .cse9 |c_~#stored_elements~0.base| (store (select .cse9 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_124| 4) |c_~#stored_elements~0.offset|) v_ArrVal_2291))))) (let ((.cse0 (select .cse7 |c_~#queue~0.base|))) (let ((.cse2 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_119| 4) |c_~#queue~0.offset|) v_ArrVal_2293))) (let ((.cse3 (select (let ((.cse6 (store .cse7 |c_~#queue~0.base| (store (store .cse2 .cse8 v_ArrVal_2295) .cse1 v_ArrVal_2298)))) (store .cse6 |c_~#stored_elements~0.base| (store (select .cse6 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_123| 4) |c_~#stored_elements~0.offset|) v_ArrVal_2299))) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_119|) (< (+ (select .cse2 .cse1) 1) v_ArrVal_2298) (< |v_t1Thread1of1ForFork0_~i~0#1_123| (+ |v_t1Thread1of1ForFork0_~i~0#1_124| 1)) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_117|) (< |v_t1Thread1of1ForFork0_~i~0#1_124| (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (< (+ (select .cse4 .cse1) 1) v_ArrVal_2289) (< (select (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_117| 4)) v_ArrVal_2301) .cse1) 20) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_2281) (< (select .cse5 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_121|)))))))))) is different from false [2023-01-28 06:18:20,003 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_~i~0#1_124| Int) (v_ArrVal_2281 Int) (v_ArrVal_2291 Int) (v_ArrVal_2283 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_121| Int) (v_ArrVal_2293 Int) (v_ArrVal_2285 Int) (v_ArrVal_2295 Int) (v_ArrVal_2298 Int) (v_ArrVal_2278 Int) (v_ArrVal_2289 Int) (v_ArrVal_2288 Int) (v_ArrVal_2299 Int) (v_ArrVal_2279 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_119| Int) (v_ArrVal_2301 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_117| Int) (|v_t1Thread1of1ForFork0_~i~0#1_123| Int)) (let ((.cse5 (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_2278)) (.cse6 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse12 (let ((.cse13 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse5 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2279) .cse6 v_ArrVal_2281)))) (store .cse13 |c_~#stored_elements~0.base| (store (select .cse13 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) v_ArrVal_2283))))) (let ((.cse2 (select .cse12 |c_~#queue~0.base|))) (let ((.cse4 (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_121| 4) |c_~#queue~0.offset|) v_ArrVal_2285)) (.cse10 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse9 (let ((.cse11 (store .cse12 |c_~#queue~0.base| (store (store .cse4 .cse10 v_ArrVal_2288) .cse1 v_ArrVal_2289)))) (store .cse11 |c_~#stored_elements~0.base| (store (select .cse11 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_124| 4) |c_~#stored_elements~0.offset|) v_ArrVal_2291))))) (let ((.cse0 (select .cse9 |c_~#queue~0.base|))) (let ((.cse7 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_119| 4) |c_~#queue~0.offset|) v_ArrVal_2293))) (let ((.cse3 (select (let ((.cse8 (store .cse9 |c_~#queue~0.base| (store (store .cse7 .cse10 v_ArrVal_2295) .cse1 v_ArrVal_2298)))) (store .cse8 |c_~#stored_elements~0.base| (store (select .cse8 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_123| 4) |c_~#stored_elements~0.offset|) v_ArrVal_2299))) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_119|) (< |v_t1Thread1of1ForFork0_~i~0#1_123| (+ |v_t1Thread1of1ForFork0_~i~0#1_124| 1)) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_121|) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_117|) (< |v_t1Thread1of1ForFork0_~i~0#1_124| (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (< (+ (select .cse4 .cse1) 1) v_ArrVal_2289) (< (+ (select .cse5 .cse6) 1) v_ArrVal_2281) (< (+ (select .cse7 .cse1) 1) v_ArrVal_2298) (< (select (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_117| 4)) v_ArrVal_2301) .cse1) 20))))))))))) is different from false [2023-01-28 06:23:53,547 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_~i~0#1_126| Int) (|v_t1Thread1of1ForFork0_~i~0#1_125| Int) (|v_t1Thread1of1ForFork0_~i~0#1_124| Int) (v_ArrVal_2291 Int) (v_ArrVal_2271 Int) (v_ArrVal_2293 Int) (v_ArrVal_2273 Int) (v_ArrVal_2295 Int) (v_ArrVal_2276 Int) (v_ArrVal_2298 Int) (v_ArrVal_2278 Int) (v_ArrVal_2299 Int) (v_ArrVal_2279 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_119| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_117| Int) (v_ArrVal_2281 Int) (v_ArrVal_2283 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_121| Int) (v_ArrVal_2285 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_123| Int) (v_ArrVal_2289 Int) (v_ArrVal_2288 Int) (v_ArrVal_2269 Int) (v_ArrVal_2268 Int) (v_ArrVal_2301 Int) (|v_t1Thread1of1ForFork0_~i~0#1_123| Int)) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse17 (store |c_#memory_int| |c_~#stored_elements~0.base| (store (select |c_#memory_int| |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) v_ArrVal_2268)))) (let ((.cse6 (let ((.cse18 (select .cse17 |c_~#queue~0.base|))) (store .cse18 (+ (* (select .cse18 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2269))) (.cse11 (+ 88 |c_~#queue~0.offset|))) (let ((.cse15 (let ((.cse16 (store .cse17 |c_~#queue~0.base| (store (store .cse6 .cse11 v_ArrVal_2271) .cse1 v_ArrVal_2273)))) (store .cse16 |c_~#stored_elements~0.base| (store (select .cse16 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_126| 4) |c_~#stored_elements~0.offset|) v_ArrVal_2276))))) (let ((.cse8 (select .cse15 |c_~#queue~0.base|))) (let ((.cse7 (store .cse8 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_123| 4) |c_~#queue~0.offset|) v_ArrVal_2278))) (let ((.cse13 (let ((.cse14 (store .cse15 |c_~#queue~0.base| (store (store .cse7 .cse11 v_ArrVal_2279) .cse1 v_ArrVal_2281)))) (store .cse14 |c_~#stored_elements~0.base| (store (select .cse14 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_125| 4) |c_~#stored_elements~0.offset|) v_ArrVal_2283))))) (let ((.cse3 (select .cse13 |c_~#queue~0.base|))) (let ((.cse5 (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_121| 4) |c_~#queue~0.offset|) v_ArrVal_2285))) (let ((.cse10 (let ((.cse12 (store .cse13 |c_~#queue~0.base| (store (store .cse5 .cse11 v_ArrVal_2288) .cse1 v_ArrVal_2289)))) (store .cse12 |c_~#stored_elements~0.base| (store (select .cse12 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_124| 4) |c_~#stored_elements~0.offset|) v_ArrVal_2291))))) (let ((.cse4 (select .cse10 |c_~#queue~0.base|))) (let ((.cse0 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_119| 4) |c_~#queue~0.offset|) v_ArrVal_2293))) (let ((.cse2 (select (let ((.cse9 (store .cse10 |c_~#queue~0.base| (store (store .cse0 .cse11 v_ArrVal_2295) .cse1 v_ArrVal_2298)))) (store .cse9 |c_~#stored_elements~0.base| (store (select .cse9 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_123| 4) |c_~#stored_elements~0.offset|) v_ArrVal_2299))) |c_~#queue~0.base|))) (or (< |v_t1Thread1of1ForFork0_~i~0#1_123| (+ |v_t1Thread1of1ForFork0_~i~0#1_124| 1)) (< (+ (select .cse0 .cse1) 1) v_ArrVal_2298) (< 1 v_ArrVal_2273) (< |v_t1Thread1of1ForFork0_~i~0#1_124| (+ |v_t1Thread1of1ForFork0_~i~0#1_125| 1)) (< (select (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_117| 4)) v_ArrVal_2301) .cse1) 20) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_121|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_117|) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_119|) (< (+ (select .cse5 .cse1) 1) v_ArrVal_2289) (not (= (select .cse6 .cse1) 20)) (< (+ (select .cse7 .cse1) 1) v_ArrVal_2281) (< (select .cse8 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_123|) (< |v_t1Thread1of1ForFork0_~i~0#1_126| (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (< |v_t1Thread1of1ForFork0_~i~0#1_125| (+ |v_t1Thread1of1ForFork0_~i~0#1_126| 1)))))))))))))))) is different from false [2023-01-28 06:23:59,339 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_~i~0#1_126| Int) (|v_t1Thread1of1ForFork0_~i~0#1_125| Int) (|v_t1Thread1of1ForFork0_~i~0#1_124| Int) (v_ArrVal_2291 Int) (v_ArrVal_2271 Int) (v_ArrVal_2293 Int) (v_ArrVal_2273 Int) (v_ArrVal_2295 Int) (v_ArrVal_2276 Int) (v_ArrVal_2298 Int) (v_ArrVal_2278 Int) (v_ArrVal_2299 Int) (v_ArrVal_2279 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_119| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_117| Int) (v_ArrVal_2281 Int) (v_ArrVal_2283 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_121| Int) (v_ArrVal_2285 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_123| Int) (v_ArrVal_2289 Int) (v_ArrVal_2288 Int) (v_ArrVal_2269 Int) (v_ArrVal_2268 Int) (v_ArrVal_2301 Int) (|v_t1Thread1of1ForFork0_~i~0#1_123| Int)) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse17 (let ((.cse19 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))))) (store .cse19 |c_~#stored_elements~0.base| (store (select .cse19 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) v_ArrVal_2268))))) (let ((.cse6 (let ((.cse18 (select .cse17 |c_~#queue~0.base|))) (store .cse18 (+ |c_~#queue~0.offset| (* (select .cse18 .cse1) 4)) v_ArrVal_2269))) (.cse11 (+ 88 |c_~#queue~0.offset|))) (let ((.cse15 (let ((.cse16 (store .cse17 |c_~#queue~0.base| (store (store .cse6 .cse11 v_ArrVal_2271) .cse1 v_ArrVal_2273)))) (store .cse16 |c_~#stored_elements~0.base| (store (select .cse16 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_126| 4) |c_~#stored_elements~0.offset|) v_ArrVal_2276))))) (let ((.cse8 (select .cse15 |c_~#queue~0.base|))) (let ((.cse0 (store .cse8 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_123| 4) |c_~#queue~0.offset|) v_ArrVal_2278))) (let ((.cse13 (let ((.cse14 (store .cse15 |c_~#queue~0.base| (store (store .cse0 .cse11 v_ArrVal_2279) .cse1 v_ArrVal_2281)))) (store .cse14 |c_~#stored_elements~0.base| (store (select .cse14 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_125| 4) |c_~#stored_elements~0.offset|) v_ArrVal_2283))))) (let ((.cse4 (select .cse13 |c_~#queue~0.base|))) (let ((.cse2 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_121| 4) |c_~#queue~0.offset|) v_ArrVal_2285))) (let ((.cse10 (let ((.cse12 (store .cse13 |c_~#queue~0.base| (store (store .cse2 .cse11 v_ArrVal_2288) .cse1 v_ArrVal_2289)))) (store .cse12 |c_~#stored_elements~0.base| (store (select .cse12 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_124| 4) |c_~#stored_elements~0.offset|) v_ArrVal_2291))))) (let ((.cse7 (select .cse10 |c_~#queue~0.base|))) (let ((.cse5 (store .cse7 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_119| 4) |c_~#queue~0.offset|) v_ArrVal_2293))) (let ((.cse3 (select (let ((.cse9 (store .cse10 |c_~#queue~0.base| (store (store .cse5 .cse11 v_ArrVal_2295) .cse1 v_ArrVal_2298)))) (store .cse9 |c_~#stored_elements~0.base| (store (select .cse9 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_123| 4) |c_~#stored_elements~0.offset|) v_ArrVal_2299))) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2281) (< (+ 1 (select .cse2 .cse1)) v_ArrVal_2289) (< (select (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_117| 4)) v_ArrVal_2301) .cse1) 20) (< |v_t1Thread1of1ForFork0_~i~0#1_123| (+ |v_t1Thread1of1ForFork0_~i~0#1_124| 1)) (< 1 v_ArrVal_2273) (< |v_t1Thread1of1ForFork0_~i~0#1_124| (+ |v_t1Thread1of1ForFork0_~i~0#1_125| 1)) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_121|) (< (+ (select .cse5 .cse1) 1) v_ArrVal_2298) (not (= 20 (select .cse6 .cse1))) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_117|) (< (select .cse7 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_119|) (< (select .cse8 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_123|) (< |v_t1Thread1of1ForFork0_~i~0#1_126| (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (< |v_t1Thread1of1ForFork0_~i~0#1_125| (+ |v_t1Thread1of1ForFork0_~i~0#1_126| 1)))))))))))))))) is different from false [2023-01-28 06:24:05,187 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_~i~0#1_126| Int) (|v_t1Thread1of1ForFork0_~i~0#1_125| Int) (|v_t1Thread1of1ForFork0_~i~0#1_124| Int) (v_ArrVal_2291 Int) (v_ArrVal_2271 Int) (v_ArrVal_2293 Int) (v_ArrVal_2273 Int) (v_ArrVal_2295 Int) (v_ArrVal_2276 Int) (v_ArrVal_2298 Int) (v_ArrVal_2278 Int) (v_ArrVal_2299 Int) (v_ArrVal_2279 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_119| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_117| Int) (v_ArrVal_2281 Int) (v_ArrVal_2283 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_121| Int) (v_ArrVal_2285 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_123| Int) (v_ArrVal_2289 Int) (v_ArrVal_2288 Int) (v_ArrVal_2269 Int) (v_ArrVal_2268 Int) (v_ArrVal_2301 Int) (|v_t1Thread1of1ForFork0_~i~0#1_123| Int)) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse17 (let ((.cse19 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse20 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse21 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse20 .cse21 (+ (select .cse20 .cse21) 1)))))) (store .cse19 |c_~#stored_elements~0.base| (store (select .cse19 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) v_ArrVal_2268))))) (let ((.cse3 (let ((.cse18 (select .cse17 |c_~#queue~0.base|))) (store .cse18 (+ |c_~#queue~0.offset| (* (select .cse18 .cse1) 4)) v_ArrVal_2269))) (.cse11 (+ 88 |c_~#queue~0.offset|))) (let ((.cse15 (let ((.cse16 (store .cse17 |c_~#queue~0.base| (store (store .cse3 .cse11 v_ArrVal_2271) .cse1 v_ArrVal_2273)))) (store .cse16 |c_~#stored_elements~0.base| (store (select .cse16 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_126| 4) |c_~#stored_elements~0.offset|) v_ArrVal_2276))))) (let ((.cse4 (select .cse15 |c_~#queue~0.base|))) (let ((.cse5 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_123| 4) |c_~#queue~0.offset|) v_ArrVal_2278))) (let ((.cse13 (let ((.cse14 (store .cse15 |c_~#queue~0.base| (store (store .cse5 .cse11 v_ArrVal_2279) .cse1 v_ArrVal_2281)))) (store .cse14 |c_~#stored_elements~0.base| (store (select .cse14 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_125| 4) |c_~#stored_elements~0.offset|) v_ArrVal_2283))))) (let ((.cse2 (select .cse13 |c_~#queue~0.base|))) (let ((.cse6 (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_121| 4) |c_~#queue~0.offset|) v_ArrVal_2285))) (let ((.cse10 (let ((.cse12 (store .cse13 |c_~#queue~0.base| (store (store .cse6 .cse11 v_ArrVal_2288) .cse1 v_ArrVal_2289)))) (store .cse12 |c_~#stored_elements~0.base| (store (select .cse12 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_124| 4) |c_~#stored_elements~0.offset|) v_ArrVal_2291))))) (let ((.cse7 (select .cse10 |c_~#queue~0.base|))) (let ((.cse8 (store .cse7 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_119| 4) |c_~#queue~0.offset|) v_ArrVal_2293))) (let ((.cse0 (select (let ((.cse9 (store .cse10 |c_~#queue~0.base| (store (store .cse8 .cse11 v_ArrVal_2295) .cse1 v_ArrVal_2298)))) (store .cse9 |c_~#stored_elements~0.base| (store (select .cse9 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_123| 4) |c_~#stored_elements~0.offset|) v_ArrVal_2299))) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_117| 4)) v_ArrVal_2301) .cse1) 20) (< |v_t1Thread1of1ForFork0_~i~0#1_123| (+ |v_t1Thread1of1ForFork0_~i~0#1_124| 1)) (< 1 v_ArrVal_2273) (< |v_t1Thread1of1ForFork0_~i~0#1_124| (+ |v_t1Thread1of1ForFork0_~i~0#1_125| 1)) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_121|) (not (= (select .cse3 .cse1) 20)) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_123|) (< (+ (select .cse5 .cse1) 1) v_ArrVal_2281) (< |v_t1Thread1of1ForFork0_~i~0#1_126| (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_117|) (< (+ (select .cse6 .cse1) 1) v_ArrVal_2289) (< |v_t1Thread1of1ForFork0_~i~0#1_125| (+ |v_t1Thread1of1ForFork0_~i~0#1_126| 1)) (< (select .cse7 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_119|) (< (+ (select .cse8 .cse1) 1) v_ArrVal_2298))))))))))))))) is different from false [2023-01-28 06:24:10,638 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse20 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse21 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse22 (select .cse20 .cse21))) (or (forall ((|v_t1Thread1of1ForFork0_~i~0#1_126| Int) (|v_t1Thread1of1ForFork0_~i~0#1_125| Int) (|v_t1Thread1of1ForFork0_~i~0#1_124| Int) (v_ArrVal_2291 Int) (v_ArrVal_2271 Int) (v_ArrVal_2293 Int) (v_ArrVal_2273 Int) (v_ArrVal_2295 Int) (v_ArrVal_2276 Int) (v_ArrVal_2298 Int) (v_ArrVal_2278 Int) (v_ArrVal_2299 Int) (v_ArrVal_2279 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_119| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_117| Int) (v_ArrVal_2281 Int) (v_ArrVal_2283 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_121| Int) (v_ArrVal_2285 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_123| Int) (v_ArrVal_2289 Int) (v_ArrVal_2288 Int) (v_ArrVal_2269 Int) (v_ArrVal_2268 Int) (v_ArrVal_2301 Int) (|v_t1Thread1of1ForFork0_~i~0#1_123| Int)) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse17 (let ((.cse19 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse20 .cse21 (+ .cse22 1))))) (store .cse19 |c_~#stored_elements~0.base| (store (select .cse19 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) v_ArrVal_2268))))) (let ((.cse3 (let ((.cse18 (select .cse17 |c_~#queue~0.base|))) (store .cse18 (+ |c_~#queue~0.offset| (* (select .cse18 .cse1) 4)) v_ArrVal_2269))) (.cse11 (+ 88 |c_~#queue~0.offset|))) (let ((.cse15 (let ((.cse16 (store .cse17 |c_~#queue~0.base| (store (store .cse3 .cse11 v_ArrVal_2271) .cse1 v_ArrVal_2273)))) (store .cse16 |c_~#stored_elements~0.base| (store (select .cse16 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_126| 4) |c_~#stored_elements~0.offset|) v_ArrVal_2276))))) (let ((.cse4 (select .cse15 |c_~#queue~0.base|))) (let ((.cse5 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_123| 4) |c_~#queue~0.offset|) v_ArrVal_2278))) (let ((.cse13 (let ((.cse14 (store .cse15 |c_~#queue~0.base| (store (store .cse5 .cse11 v_ArrVal_2279) .cse1 v_ArrVal_2281)))) (store .cse14 |c_~#stored_elements~0.base| (store (select .cse14 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_125| 4) |c_~#stored_elements~0.offset|) v_ArrVal_2283))))) (let ((.cse2 (select .cse13 |c_~#queue~0.base|))) (let ((.cse6 (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_121| 4) |c_~#queue~0.offset|) v_ArrVal_2285))) (let ((.cse10 (let ((.cse12 (store .cse13 |c_~#queue~0.base| (store (store .cse6 .cse11 v_ArrVal_2288) .cse1 v_ArrVal_2289)))) (store .cse12 |c_~#stored_elements~0.base| (store (select .cse12 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_124| 4) |c_~#stored_elements~0.offset|) v_ArrVal_2291))))) (let ((.cse7 (select .cse10 |c_~#queue~0.base|))) (let ((.cse8 (store .cse7 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_119| 4) |c_~#queue~0.offset|) v_ArrVal_2293))) (let ((.cse0 (select (let ((.cse9 (store .cse10 |c_~#queue~0.base| (store (store .cse8 .cse11 v_ArrVal_2295) .cse1 v_ArrVal_2298)))) (store .cse9 |c_~#stored_elements~0.base| (store (select .cse9 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_123| 4) |c_~#stored_elements~0.offset|) v_ArrVal_2299))) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_117| 4)) v_ArrVal_2301) .cse1) 20) (< |v_t1Thread1of1ForFork0_~i~0#1_123| (+ |v_t1Thread1of1ForFork0_~i~0#1_124| 1)) (< 1 v_ArrVal_2273) (< |v_t1Thread1of1ForFork0_~i~0#1_124| (+ |v_t1Thread1of1ForFork0_~i~0#1_125| 1)) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_121|) (not (= (select .cse3 .cse1) 20)) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_123|) (< (+ (select .cse5 .cse1) 1) v_ArrVal_2281) (< |v_t1Thread1of1ForFork0_~i~0#1_126| (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_117|) (< (+ (select .cse6 .cse1) 1) v_ArrVal_2289) (< |v_t1Thread1of1ForFork0_~i~0#1_125| (+ |v_t1Thread1of1ForFork0_~i~0#1_126| 1)) (< (select .cse7 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_119|) (< (+ (select .cse8 .cse1) 1) v_ArrVal_2298))))))))))))))) (= .cse22 20)))) is different from false [2023-01-28 06:24:26,768 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse20 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse21 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse22 (select .cse20 .cse21))) (or (forall ((|v_t1Thread1of1ForFork0_~i~0#1_126| Int) (|v_t1Thread1of1ForFork0_~i~0#1_125| Int) (|v_t1Thread1of1ForFork0_~i~0#1_124| Int) (v_ArrVal_2291 Int) (v_ArrVal_2271 Int) (v_ArrVal_2293 Int) (v_ArrVal_2273 Int) (v_ArrVal_2295 Int) (v_ArrVal_2276 Int) (v_ArrVal_2298 Int) (v_ArrVal_2278 Int) (v_ArrVal_2299 Int) (v_ArrVal_2279 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_119| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_117| Int) (v_ArrVal_2281 Int) (v_ArrVal_2283 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_121| Int) (v_ArrVal_2263 Int) (v_ArrVal_2285 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_123| Int) (v_ArrVal_2289 Int) (v_ArrVal_2288 Int) (v_ArrVal_2269 Int) (v_ArrVal_2268 Int) (v_ArrVal_2301 Int) (|v_t1Thread1of1ForFork0_~i~0#1_123| Int)) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse17 (let ((.cse19 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse20 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2263) .cse21 (+ .cse22 1))))) (store .cse19 |c_~#stored_elements~0.base| (store (select .cse19 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) v_ArrVal_2268))))) (let ((.cse6 (let ((.cse18 (select .cse17 |c_~#queue~0.base|))) (store .cse18 (+ (* 4 (select .cse18 .cse1)) |c_~#queue~0.offset|) v_ArrVal_2269))) (.cse11 (+ 88 |c_~#queue~0.offset|))) (let ((.cse15 (let ((.cse16 (store .cse17 |c_~#queue~0.base| (store (store .cse6 .cse11 v_ArrVal_2271) .cse1 v_ArrVal_2273)))) (store .cse16 |c_~#stored_elements~0.base| (store (select .cse16 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_126| 4) |c_~#stored_elements~0.offset|) v_ArrVal_2276))))) (let ((.cse4 (select .cse15 |c_~#queue~0.base|))) (let ((.cse7 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_123| 4) |c_~#queue~0.offset|) v_ArrVal_2278))) (let ((.cse13 (let ((.cse14 (store .cse15 |c_~#queue~0.base| (store (store .cse7 .cse11 v_ArrVal_2279) .cse1 v_ArrVal_2281)))) (store .cse14 |c_~#stored_elements~0.base| (store (select .cse14 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_125| 4) |c_~#stored_elements~0.offset|) v_ArrVal_2283))))) (let ((.cse5 (select .cse13 |c_~#queue~0.base|))) (let ((.cse8 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_121| 4) |c_~#queue~0.offset|) v_ArrVal_2285))) (let ((.cse10 (let ((.cse12 (store .cse13 |c_~#queue~0.base| (store (store .cse8 .cse11 v_ArrVal_2288) .cse1 v_ArrVal_2289)))) (store .cse12 |c_~#stored_elements~0.base| (store (select .cse12 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_124| 4) |c_~#stored_elements~0.offset|) v_ArrVal_2291))))) (let ((.cse0 (select .cse10 |c_~#queue~0.base|))) (let ((.cse3 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_119| 4) |c_~#queue~0.offset|) v_ArrVal_2293))) (let ((.cse2 (select (let ((.cse9 (store .cse10 |c_~#queue~0.base| (store (store .cse3 .cse11 v_ArrVal_2295) .cse1 v_ArrVal_2298)))) (store .cse9 |c_~#stored_elements~0.base| (store (select .cse9 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_123| 4) |c_~#stored_elements~0.offset|) v_ArrVal_2299))) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_119|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_117|) (< |v_t1Thread1of1ForFork0_~i~0#1_123| (+ |v_t1Thread1of1ForFork0_~i~0#1_124| 1)) (< (+ (select .cse3 .cse1) 1) v_ArrVal_2298) (< 1 v_ArrVal_2273) (< |v_t1Thread1of1ForFork0_~i~0#1_124| (+ |v_t1Thread1of1ForFork0_~i~0#1_125| 1)) (< (select (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_117| 4)) v_ArrVal_2301) .cse1) 20) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_123|) (< (select .cse5 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_121|) (not (= 20 (select .cse6 .cse1))) (< (+ (select .cse7 .cse1) 1) v_ArrVal_2281) (< (+ (select .cse8 .cse1) 1) v_ArrVal_2289) (< |v_t1Thread1of1ForFork0_~i~0#1_126| (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (< |v_t1Thread1of1ForFork0_~i~0#1_125| (+ |v_t1Thread1of1ForFork0_~i~0#1_126| 1)))))))))))))))) (= .cse22 20)))) is different from false [2023-01-28 06:25:19,739 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_~i~0#1_126| Int) (|v_t1Thread1of1ForFork0_~i~0#1_125| Int) (|v_t1Thread1of1ForFork0_~i~0#1_124| Int) (v_ArrVal_2291 Int) (v_ArrVal_2271 Int) (v_ArrVal_2293 Int) (v_ArrVal_2273 Int) (v_ArrVal_2295 Int) (v_ArrVal_2276 Int) (v_ArrVal_2298 Int) (v_ArrVal_2278 Int) (v_ArrVal_2299 Int) (v_ArrVal_2279 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_119| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_117| Int) (v_ArrVal_2281 Int) (v_ArrVal_2261 Int) (v_ArrVal_2283 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_121| Int) (v_ArrVal_2263 Int) (v_ArrVal_2285 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_123| Int) (v_ArrVal_2289 Int) (v_ArrVal_2288 Int) (v_ArrVal_2269 Int) (v_ArrVal_2268 Int) (v_ArrVal_2301 Int) (|v_t1Thread1of1ForFork0_~i~0#1_123| Int)) (let ((.cse21 (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_2261)) (.cse22 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse4 (select .cse21 .cse22))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse18 (let ((.cse20 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse21 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2263) .cse22 (+ .cse4 1))))) (store .cse20 |c_~#stored_elements~0.base| (store (select .cse20 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) v_ArrVal_2268))))) (let ((.cse6 (let ((.cse19 (select .cse18 |c_~#queue~0.base|))) (store .cse19 (+ (* (select .cse19 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2269))) (.cse12 (+ 88 |c_~#queue~0.offset|))) (let ((.cse16 (let ((.cse17 (store .cse18 |c_~#queue~0.base| (store (store .cse6 .cse12 v_ArrVal_2271) .cse1 v_ArrVal_2273)))) (store .cse17 |c_~#stored_elements~0.base| (store (select .cse17 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_126| 4) |c_~#stored_elements~0.offset|) v_ArrVal_2276))))) (let ((.cse9 (select .cse16 |c_~#queue~0.base|))) (let ((.cse2 (store .cse9 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_123| 4) |c_~#queue~0.offset|) v_ArrVal_2278))) (let ((.cse14 (let ((.cse15 (store .cse16 |c_~#queue~0.base| (store (store .cse2 .cse12 v_ArrVal_2279) .cse1 v_ArrVal_2281)))) (store .cse15 |c_~#stored_elements~0.base| (store (select .cse15 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_125| 4) |c_~#stored_elements~0.offset|) v_ArrVal_2283))))) (let ((.cse7 (select .cse14 |c_~#queue~0.base|))) (let ((.cse5 (store .cse7 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_121| 4) |c_~#queue~0.offset|) v_ArrVal_2285))) (let ((.cse11 (let ((.cse13 (store .cse14 |c_~#queue~0.base| (store (store .cse5 .cse12 v_ArrVal_2288) .cse1 v_ArrVal_2289)))) (store .cse13 |c_~#stored_elements~0.base| (store (select .cse13 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_124| 4) |c_~#stored_elements~0.offset|) v_ArrVal_2291))))) (let ((.cse3 (select .cse11 |c_~#queue~0.base|))) (let ((.cse8 (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_119| 4) |c_~#queue~0.offset|) v_ArrVal_2293))) (let ((.cse0 (select (let ((.cse10 (store .cse11 |c_~#queue~0.base| (store (store .cse8 .cse12 v_ArrVal_2295) .cse1 v_ArrVal_2298)))) (store .cse10 |c_~#stored_elements~0.base| (store (select .cse10 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_123| 4) |c_~#stored_elements~0.offset|) v_ArrVal_2299))) |c_~#queue~0.base|))) (or (< |v_t1Thread1of1ForFork0_~i~0#1_123| (+ |v_t1Thread1of1ForFork0_~i~0#1_124| 1)) (< 1 v_ArrVal_2273) (< |v_t1Thread1of1ForFork0_~i~0#1_124| (+ |v_t1Thread1of1ForFork0_~i~0#1_125| 1)) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_117|) (< (+ (select .cse2 .cse1) 1) v_ArrVal_2281) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_119|) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_117| 4)) v_ArrVal_2301) .cse1) 20) (= .cse4 20) (< (+ (select .cse5 .cse1) 1) v_ArrVal_2289) (not (= (select .cse6 .cse1) 20)) (< (select .cse7 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_121|) (< (+ (select .cse8 .cse1) 1) v_ArrVal_2298) (< (select .cse9 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_123|) (< |v_t1Thread1of1ForFork0_~i~0#1_126| (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (< |v_t1Thread1of1ForFork0_~i~0#1_125| (+ |v_t1Thread1of1ForFork0_~i~0#1_126| 1)))))))))))))))))) is different from false [2023-01-28 06:26:06,625 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_~i~0#1_126| Int) (|v_t1Thread1of1ForFork0_~i~0#1_125| Int) (|v_t1Thread1of1ForFork0_~i~0#1_124| Int) (v_ArrVal_2291 Int) (v_ArrVal_2271 Int) (v_ArrVal_2293 Int) (v_ArrVal_2273 Int) (v_ArrVal_2295 Int) (v_ArrVal_2276 Int) (v_ArrVal_2298 Int) (v_ArrVal_2278 Int) (v_ArrVal_2299 Int) (v_ArrVal_2279 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_119| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_117| Int) (v_ArrVal_2281 Int) (v_ArrVal_2261 Int) (v_ArrVal_2283 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_121| Int) (v_ArrVal_2263 Int) (v_ArrVal_2285 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_123| Int) (v_ArrVal_2289 Int) (v_ArrVal_2288 Int) (v_ArrVal_2269 Int) (v_ArrVal_2268 Int) (v_ArrVal_2301 Int) (|v_t1Thread1of1ForFork0_~i~0#1_123| Int)) (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse21 (let ((.cse22 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse22 (+ (* (select .cse22 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2261)))) (let ((.cse12 (+ 88 |c_~#queue~0.offset|)) (.cse8 (select .cse21 .cse1))) (let ((.cse18 (let ((.cse20 (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse21 .cse12 v_ArrVal_2263) .cse1 (+ .cse8 1))))) (store .cse20 |c_~#stored_elements~0.base| (store (select .cse20 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) v_ArrVal_2268))))) (let ((.cse9 (let ((.cse19 (select .cse18 |c_~#queue~0.base|))) (store .cse19 (+ (* (select .cse19 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2269)))) (let ((.cse16 (let ((.cse17 (store .cse18 |c_~#queue~0.base| (store (store .cse9 .cse12 v_ArrVal_2271) .cse1 v_ArrVal_2273)))) (store .cse17 |c_~#stored_elements~0.base| (store (select .cse17 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_126| 4) |c_~#stored_elements~0.offset|) v_ArrVal_2276))))) (let ((.cse5 (select .cse16 |c_~#queue~0.base|))) (let ((.cse4 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_123| 4) |c_~#queue~0.offset|) v_ArrVal_2278))) (let ((.cse14 (let ((.cse15 (store .cse16 |c_~#queue~0.base| (store (store .cse4 .cse12 v_ArrVal_2279) .cse1 v_ArrVal_2281)))) (store .cse15 |c_~#stored_elements~0.base| (store (select .cse15 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_125| 4) |c_~#stored_elements~0.offset|) v_ArrVal_2283))))) (let ((.cse6 (select .cse14 |c_~#queue~0.base|))) (let ((.cse2 (store .cse6 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_121| 4) |c_~#queue~0.offset|) v_ArrVal_2285))) (let ((.cse11 (let ((.cse13 (store .cse14 |c_~#queue~0.base| (store (store .cse2 .cse12 v_ArrVal_2288) .cse1 v_ArrVal_2289)))) (store .cse13 |c_~#stored_elements~0.base| (store (select .cse13 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_124| 4) |c_~#stored_elements~0.offset|) v_ArrVal_2291))))) (let ((.cse3 (select .cse11 |c_~#queue~0.base|))) (let ((.cse0 (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_119| 4) |c_~#queue~0.offset|) v_ArrVal_2293))) (let ((.cse7 (select (let ((.cse10 (store .cse11 |c_~#queue~0.base| (store (store .cse0 .cse12 v_ArrVal_2295) .cse1 v_ArrVal_2298)))) (store .cse10 |c_~#stored_elements~0.base| (store (select .cse10 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_123| 4) |c_~#stored_elements~0.offset|) v_ArrVal_2299))) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2298) (< (+ (select .cse2 .cse1) 1) v_ArrVal_2289) (< |v_t1Thread1of1ForFork0_~i~0#1_123| (+ |v_t1Thread1of1ForFork0_~i~0#1_124| 1)) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_119|) (< 1 v_ArrVal_2273) (< |v_t1Thread1of1ForFork0_~i~0#1_124| (+ |v_t1Thread1of1ForFork0_~i~0#1_125| 1)) (< (+ (select .cse4 .cse1) 1) v_ArrVal_2281) (< (select .cse5 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_123|) (< (select .cse6 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_121|) (< (select (store .cse7 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_117| 4)) v_ArrVal_2301) .cse1) 20) (= .cse8 20) (< |v_t1Thread1of1ForFork0_~i~0#1_126| (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (not (= (select .cse9 .cse1) 20)) (< |v_t1Thread1of1ForFork0_~i~0#1_125| (+ |v_t1Thread1of1ForFork0_~i~0#1_126| 1)) (< (select .cse7 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_117|)))))))))))))))))) is different from false Received shutdown request... [2023-01-28 06:26:57,755 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-01-28 06:26:57,755 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-01-28 06:26:58,769 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-01-28 06:26:58,966 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2023-01-28 06:26:59,048 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 [2023-01-28 06:26:59,050 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-01-28 06:26:59,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-01-28 06:26:59,051 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was analyzing trace of length 175 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while executing Executor. [2023-01-28 06:26:59,052 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-01-28 06:26:59,052 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2023-01-28 06:26:59,052 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2023-01-28 06:26:59,052 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-01-28 06:26:59,052 INFO L445 BasicCegarLoop]: Path program histogram: [5, 3, 1, 1, 1, 1] [2023-01-28 06:26:59,056 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-28 06:26:59,056 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-28 06:26:59,058 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 06:26:59 BasicIcfg [2023-01-28 06:26:59,058 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-28 06:26:59,058 INFO L158 Benchmark]: Toolchain (without parser) took 856842.51ms. Allocated memory was 371.2MB in the beginning and 1.2GB in the end (delta: 794.8MB). Free memory was 316.3MB in the beginning and 738.7MB in the end (delta: -422.4MB). Peak memory consumption was 375.2MB. Max. memory is 16.0GB. [2023-01-28 06:26:59,058 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 255.9MB. Free memory is still 213.6MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-28 06:26:59,059 INFO L158 Benchmark]: CACSL2BoogieTranslator took 580.90ms. Allocated memory is still 371.2MB. Free memory was 316.1MB in the beginning and 333.2MB in the end (delta: -17.1MB). Peak memory consumption was 22.0MB. Max. memory is 16.0GB. [2023-01-28 06:26:59,059 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.56ms. Allocated memory is still 371.2MB. Free memory was 332.6MB in the beginning and 329.9MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 06:26:59,059 INFO L158 Benchmark]: Boogie Preprocessor took 34.91ms. Allocated memory is still 371.2MB. Free memory was 329.9MB in the beginning and 327.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 06:26:59,059 INFO L158 Benchmark]: RCFGBuilder took 539.62ms. Allocated memory is still 371.2MB. Free memory was 327.8MB in the beginning and 306.8MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. [2023-01-28 06:26:59,060 INFO L158 Benchmark]: TraceAbstraction took 855633.82ms. Allocated memory was 371.2MB in the beginning and 1.2GB in the end (delta: 794.8MB). Free memory was 306.0MB in the beginning and 738.7MB in the end (delta: -432.7MB). Peak memory consumption was 361.7MB. Max. memory is 16.0GB. [2023-01-28 06:26:59,061 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 255.9MB. Free memory is still 213.6MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 580.90ms. Allocated memory is still 371.2MB. Free memory was 316.1MB in the beginning and 333.2MB in the end (delta: -17.1MB). Peak memory consumption was 22.0MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 48.56ms. Allocated memory is still 371.2MB. Free memory was 332.6MB in the beginning and 329.9MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 34.91ms. Allocated memory is still 371.2MB. Free memory was 329.9MB in the beginning and 327.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 539.62ms. Allocated memory is still 371.2MB. Free memory was 327.8MB in the beginning and 306.8MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. * TraceAbstraction took 855633.82ms. Allocated memory was 371.2MB in the beginning and 1.2GB in the end (delta: 794.8MB). Free memory was 306.0MB in the beginning and 738.7MB in the end (delta: -432.7MB). Peak memory consumption was 361.7MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.2s, 199 PlacesBefore, 47 PlacesAfterwards, 205 TransitionsBefore, 47 TransitionsAfterwards, 9984 CoEnabledTransitionPairs, 7 FixpointIterations, 58 TrivialSequentialCompositions, 99 ConcurrentSequentialCompositions, 7 TrivialYvCompositions, 16 ConcurrentYvCompositions, 6 ChoiceCompositions, 186 TotalNumberOfCompositions, 19772 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 9519, independent: 9080, independent conditional: 0, independent unconditional: 9080, dependent: 439, dependent conditional: 0, dependent unconditional: 439, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 5401, independent: 5319, independent conditional: 0, independent unconditional: 5319, dependent: 82, dependent conditional: 0, dependent unconditional: 82, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 9519, independent: 3761, independent conditional: 0, independent unconditional: 3761, dependent: 357, dependent conditional: 0, dependent unconditional: 357, unknown: 5401, unknown conditional: 0, unknown unconditional: 5401] , Statistics on independence cache: Total cache size (in pairs): 268, Positive cache size: 233, Positive conditional cache size: 0, Positive unconditional cache size: 233, Negative cache size: 35, Negative conditional cache size: 0, Negative unconditional cache size: 35, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: 1033]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was analyzing trace of length 175 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while executing Executor. - TimeoutResultAtElement [Line: 1049]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was analyzing trace of length 175 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while executing Executor. - TimeoutResultAtElement [Line: 1052]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was analyzing trace of length 175 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while executing Executor. - TimeoutResultAtElement [Line: 1053]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was analyzing trace of length 175 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 327 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 855.5s, OverallIterations: 12, TraceHistogramMax: 20, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 6.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 877 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 877 mSDsluCounter, 1 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 734 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 101 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2276 IncrementalHoareTripleChecker+Invalid, 3111 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 101 mSolverCounterUnsat, 1 mSDtfsCounter, 2276 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1044 GetRequests, 909 SyntacticMatches, 13 SemanticMatches, 122 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 851 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1278occurred in iteration=11, InterpolantAutomatonStates: 87, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 3.6s SatisfiabilityAnalysisTime, 11.4s InterpolantComputationTime, 1428 NumberOfCodeBlocks, 1266 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 1746 ConstructedInterpolants, 11 QuantifiedInterpolants, 7463 SizeOfPredicates, 36 NumberOfNonLiveVariables, 3519 ConjunctsInSsa, 281 ConjunctsInUnsatCore, 21 InterpolantComputations, 7 PerfectInterpolantSequences, 7318/8804 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown